CN105430708B - Wireless sensor method for routing based on routing table node energy - Google Patents
Wireless sensor method for routing based on routing table node energy Download PDFInfo
- Publication number
- CN105430708B CN105430708B CN201510747431.9A CN201510747431A CN105430708B CN 105430708 B CN105430708 B CN 105430708B CN 201510747431 A CN201510747431 A CN 201510747431A CN 105430708 B CN105430708 B CN 105430708B
- Authority
- CN
- China
- Prior art keywords
- node
- broadcast message
- message packet
- energy
- hop count
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of wireless sensor network routing method of node energy based on routing table, establishes during routing broadcast and calculate least energy on the way and using the node of time and the energy of the node use the time；The timing pass-through mode provided, reduces hop count, and enables a node to the routing iinformation of having time convergence surroundings nodes；Repeatedly forwarding broadcast packet, establishes node to destination multipath information；The present invention also proposes a kind of calculating heat source rank method that time and distance are used according to the least energy.The present invention comprehensively considers that hop count, least residue energy uses the nodal information of time in path, finds out optimal path, Route Selection is more reasonable, improves the life cycle of entire wireless sensor network.
Description
Technical field
The present invention relates to a kind of wireless sensor network routing method, especially a kind of node energy based on routing table
Wireless sensor network routing method belongs to technical field of data transmission.
Background technique
Method for routing is the emphasis of wireless sensor network (WSN) research, and main target is to find and establish energy height
The path of effect and sensor node form Routing Protocol, thus protecting to the safe and reliable data transmission method of receiving node
Extend the life cycle of whole network under the premise of card data safety is reliable to greatest extent.
The Routing Protocol of wireless sensor network can be divided into priori formula (Proactive) Routing Protocol and reaction equation
(Reactive) Routing Protocol.Proactive routing protocols are also known as table-driven routing agreement, and each node maintenance one opens packet
Routing table containing the routing iinformation for reaching other nodes receives update message when detecting that network topology structure changes
Node will update oneself routing table, to safeguard accurate routing iinformation.Source node will once send message, can obtain immediately
The routing of destination node must be reached, therefore the time delay of this Routing Protocol is smaller.Reactive routing protocols are also known as on-demand routing
Agreement, is a kind of routing algorithm that routing is just searched when needing to send data, and node does not need maintaining routing information.Work as needs
When sending message to destination node, source node just initiates route querying process in a network, and the time delay of datagram transmission is larger.
The AODVEA (AODV Energy Aware) and AODVM (AOMDV that Reactive routing protocols have AODV developed
Modified), source node is broadcasted to destination node, and broadcast packet is transmitted to destination node by mulitpath, is had recorded in path most
The value of small dump energy.After destination node receives all information, it will determine an optimal path and by this best road
Diameter sends RREP packet to source node by way of unicast.This continuous route finding process, can slowly by those energy
Insufficient node excludes in the entire network.
Reactive routing protocols, often will by complicated negotiations process, establish one or several fixed paths, nothing
There are many line sensor network sending node, these processes need to consume a large amount of energy.Reactive routing protocols are suitable for network
There are many node motion situations.Big multiple-sensor network main node position is fixed, and is periodically transmitted to fixed target (base station)
Information, the Wireless Sensor Network Routing Protocol based on routing table are more suitable for such case, and disposably set up all sections
Point arrives the routing of base station, can simplify data transmission route by process, save energy.
A kind of " wireless sensor network routing based on routing table is disclosed within 2008 on 10th phase computer application magazine
Agreement ", the SPBT Routing Protocol of proposition simplify data transmission procedure using routing table and save energy, and Backtracking Strategy makes node
In the case where subnetwork damage, optionally aggregation node is passed in path.But the agreement is forwarded from sending node to destination node
In, it can only judge the least residue energy of next-hop node, subsequent node energy situation is unknown.
The academic dissertation " the routing algorithm for wireless sensor research based on routing table " of Central China Normal University discloses
" Wireless Sensor Network Routing Protocol based on routing table ", the relationship between average energy consumption and node, the average energy consumption of node
With the relationship between wheel number, in network lifecycle first node of the number of movable joint point and network lifecycle it is dead when
Between four aspects better than basic Flooding, DD algorithm, but the case where its agreement can only also consider next-hop.
Network congestion factor is merged into routing table and considers as a whole by researcher also, but the frequency that network congestion occurs
Height causes routing table frequently to change, and is unfavorable for the management of routing table, should usually lead on the basis of metastable routing table
It crosses congestion situation and temporarily corrects the selection in path, and routing table cannot be made frequently to change with it.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of wireless sensor networks of node energy based on routing table
Method for routing.
The present invention adopts the following technical solutions:
A kind of wireless sensor network routing method of the node energy based on routing table establishes the routing for leading to base station,
The following steps are included:
Step 1: setting node forwards the maximum times T of broadcast message packet, T >=2, the maximum of the forwarding broadcast message packet
Preceding T-1 minor node, which is taken, in number intersects broadcast mode and propagates, and takes for the T time and to transmit broadcast mode and forward broadcast message forward
Packet；Forward delay time dt is set；The forward delay time dt is received the broadcast message of surroundings nodes forwarding by the node
The time of packet determines, including the processing signal collision time；
Step 2: base station sends broadcast message packet into network: broadcast message packet including destination node ID, type m,
Hop count L, forward node D, upper forward node D1, least energy time t, least energy timing node mD, sequence number Q；It is described
Destination node is set as base station in broadcast message packet, and the type for the packet that broadcasts the message is set as T, and hop count L is set as 1, and a upper forward node is set
For sky, forward node is set as base station, and sequence number is set as the number that base station is established and rebuilds routing；
Step 3: the routing table of each node includes following column compositions: destination node ID, hop count N, next-hop node
ND, least energy time t, least energy timing node mD, priority level P and sequence number Q；It is initialized as sky；Judge the section
Point whether be base station adjacent 1 hop node, that is, receive broadcast message packet hop count whether be 1, if so, turn to step 4；Such as
Fruit is no, turns to step 5；
Step 4: 1 hop node of adjacent base station forwards the broadcast message packet, comprising the following specific steps
Step 4-1: judge whether the sequence number in the broadcast message packet is greater than or equal in the routing table of the node
The sequence number of route record identical with the destination node in the broadcast message packet；If so, turning to step 4-2；If not,
Terminate；
Step 4-2: delete that destination node in the routing table is destination node in the broadcast message packet and hop count is big
In 1 route record item；Turn to step 4-3；
Step 4-3: the route record item that destination node is the destination node in the broadcast message packet, the routing are established
Hop count is 1 in entry, and next-hop node is the destination node in the broadcast message packet；
Step 4-4: the broadcast message packet to be forwarded is written into the dump energy time of the ID of the node and the node
Least energy timing node and least energy time t, the hop count of the broadcast message packet is added 1, broadcast message Packet type m is
The maximum times T of node forwarding broadcast message；The broadcast message is forwarded to wrap；
The dump energy time is the time that the node energy is able to maintain that its operation；The broadcast message packet class
Type, intersecting broadcast message Packet type m value is 1 to T-1, and transmitting broadcast message Packet type is T, and routing table maintenance Packet type is
0；；
Step 5: non-adjacent 1 hop node of base station receives the broadcast message and wraps and broadcast message is forwarded to wrap, including following tool
Body step:
Step 5-1: judgement receives whether broadcast message packet will forward；Including step in detail below；
Step 5-1-1: whether the type m for receiving broadcast message packet is equal to T, if so, turning to step 5-1-2；If
It is no, terminate；
Step 5-1-2: whether the sequence number that judgement receives in broadcast message packet is less than mesh in the routing table of the node
Mark the maximum sequence number in the identical entry of node；If not, turning to step 5-1-3；If so, terminating；
Step 5-1-3: the most jete that destination node in the broadcast message packet is reached in the routing table of the node is calculated
Number minN；Minimum hop count minN is destination node and destination node phase in broadcast message packet in the routing table in routing table
The minimum value of hop count in same entry；
Step 5-1-4: judge whether the hop count in the broadcast message packet meets and wrapped greater than in routing table with broadcast message
Minimum hop count in the identical entry of middle destination node subtracts 1 again plus the maximum times of node forwarding broadcast message packet, if
It is to terminate；If not, turning to step 5-1-5；
Step 5-1-5: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if
It is to terminate；If not, turning to step 5-1-6；
Step 5-1-6: judge whether the upper forward node in the broadcast message packet is equal to target in the routing table
Next-hop node in node all entries identical with the destination node in the broadcast message packet, if so, terminating；Such as
Fruit is no, turns to step 5-2；
Step 5-2: timer starts timing；Enable hop count Li=1；The hop count Li value be from 1 to T just
Integer；
Step 5-3: it determines whether to receive broadcast message packet；
Step 5-3-1: if hop count Li et al. is in 1, whether the type m that judgement receives broadcast message packet is equal to T, if
It is to turn to step 5-3-3；If not, turning to step 5-5；
Step 5-3-2: if hop count Li is not equal to 1, whether the type m that judgement receives broadcast message packet is equal to forwarding
Number Li subtracts 1；If so, turning to step 5-3-3；If not, turning to step 5-5；
Step 5-3-3: whether the sequence number that judgement receives in broadcast message packet is less than mesh in the routing table of the node
Mark the maximum sequence number in the identical entry of node；If not, turning to step 5-3-4；If so, turning to step 5-5；
Step 5-3-4: the most jete that destination node in the broadcast message packet is reached in the routing table of the node is calculated
Number minN；
Step 5-3-5: judging whether the hop count in the broadcast message packet is less than minimum hop count minN, if not, turning to
Step 5-3-6；If so, minimum hop count is enabled to be equal to the hop count in the broadcast message, delete in the routing table with it is described wide
It broadcasts hop count in the identical entry of destination node in message package and is greater than minimum hop count plus the maximum of node forwarding broadcast message packet
The route record item that number T subtracts 1 again turns to step 5-3-6；
Step 5-3-6: judge whether the hop count in the broadcast message packet is greater than in routing table and mesh in broadcast message packet
Minimum hop count in the identical entry of mark node subtracts 1 again plus the maximum times T of node forwarding broadcast message packet, if so,
Turn to step 5-5；If not, turning to step 5-3-7；
Step 5-3-7: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if
It is to turn to step 5-5；If not, turning to step 5-3-8；
Step 5-3-8: judge whether the upper forward node in the broadcast message packet is equal to target in the routing table
Next-hop node in node all entries identical with the destination node in the broadcast message packet, if so, turning to step
Rapid 5-5；If not, turning to step 5-4；
Step 5-4: entry is added with destination node, next-hop node, Serial No. unique key in the routing table
Or modification record item, destination node, hop count, next-hop node, least energy time, least energy timing node and sequence number
Destination node, hop count, forward node, least energy time, least energy timing node in the respectively described broadcast message packet
And sequence number；Turn to step 5-5；
Step 5-5: judging whether timer reaches the hop count times of forward delay time, that is, reaches Li × dt, if
It is to turn to step 5-6；If not, turning to step 5-3 when next broadcast message packet being waited to reach；
Step 5-6: the priority level of each entry of destination node described in the routing table is calculated；Turn to step 5-7；
Step 5-7: modification it is described broadcast message packet type be hop count, i.e. m=Li, hop count, forward node, on
One forward node, sequence number are respectively that the hop count of priority level tidemark item in the routing table adds 1, present node, next
Hop node, sequence number, if the dump energy time of the node is less than the priority level tidemark item in the routing table
The least energy time, it is described broadcast message packet the least energy time and least energy timing node be respectively the node
Dump energy time and the node, otherwise the least energy time of the broadcast message packet and least energy timing node are distinguished
For the least energy time of priority level tidemark item and least energy timing node in the routing table；Turn to step 5-8；
Step 5-8: the broadcast message packet is sent, step 5-9 is turned to；
Step 5-9: enabling hop count add 1, Li=Li+1, if hop count is greater than T, terminates, otherwise turns to step 5-
3。
The priority level P value of each entry of certain destination node is the positive integer since 1 in the routing table, and P is equal to 1
When priority level highest, priority level P calculation method is made of step in detail below:
Step a: the identical least energy time average respectively recorded of destination node in the node route list is calculated；
Step b: selection the first and second time points, first time point be greater than the least energy time average, second
Time point is less than the least energy time average；
Step c: assuming that the record that the least energy time in the record is greater than first time point has P1It is a, it presses wherein most
The small big minispread of energy time, the maximum P=1, successively P=2, until P=P1；
Step d: assuming that the least energy time in the record is less than first time point and is greater than the note at the second time point
Record has P2It is a, it arranges by the hop count in the record, is arranged from big to small if hop count is identical by the least energy time from small to large,
Least energy time maximum item P=P in the smallest record of hop count1+ 1, the least energy time is minimum in the maximum record of hop count
Item P=P1+P2；
Step e: assuming that there is P in the least energy time respectively recorded less than the record at the second time point3It is a, by its minimum
The big minispread of energy time, least energy time maximum item P=P1+P2+ 1, least energy time the smallest item P=P1+P2+
P3。
The least energy time is by surveillance of the nodes energy level or passes through the energy content of battery, every time communication consumption energy and unit
The conversion of time number of communications.
Least energy time=remaining power energy/(communication consumption energy × unit time number of communications every time).
The beneficial effects of adopting the technical scheme are that
1, the present invention has recorded the node and residual energy that least residue energy in entire path uses the time in the routing table
Amount uses time, more different path numerical value, then comprehensively considers hop count, finds out optimal path, makes the information of transmission according to routing
Along the path transmission, it improves the life of entire wireless sensor network while saving sensor energy as far as possible for the guide of table
Cycle of deposit.
2, the invention proposes a kind of timing pass-through modes, before waiting the arrival of subsequent broadcast message packet to forward every time
Postpone the dt time；The time for the broadcast message packet that time interval dt receives surroundings nodes forwarding by network node determines, including place
Manage the signal collision time.Timing pass-through mode enables a node to the routing iinformation of having time convergence surroundings nodes, to select
One optimal path.
3, node of the present invention needs T forwarding to broadcast the message in establishing routing procedure, and preceding T-1 minor node takes intersection wide
Broadcast mode is propagated, and the routing iinformation of surroundings nodes is exchanged, and referred to as intersects broadcast；The T times then forwarding broadcast message is wrapped forward, referred to as
Transmitting broadcast.Usual T is set as 2 or 3.
T forwarding broadcast message packet is so that node route list establishes minimum hop count minN to the path of minN+T-1 hop count
Information can easily bypass the node when certain node-node transmission difficulty on path.
Compared with traditional broadcast reaches forwarding broadcasting method immediately, practical hop count reduces instead, and routes
It is more reasonable to select.
4, the invention proposes a kind of priority levels of routing table Path selection to determine method, this method calculate node first
Identical " least energy time " average value respectively recorded of destination node in routing table, accordingly by the least energy time of each record
Three sections are divided into, the relationship for comprehensively considering energy and hop count determines heat source rank.
Detailed description of the invention
Fig. 1 is that 1 hop node of non-adjacent base station of the invention receives and forwards routing broadcast message package flow chart；
Fig. 2 is the distribution situation of the base station of the embodiment of the present invention and its dump energy of node；
Fig. 3 is the node communication overlay figure of the embodiment of the present invention；
Fig. 4 is the routing of the embodiment of the present invention.
Specific embodiment
The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.
A kind of wireless sensor network routing method of the node energy based on routing table establishes the routing for leading to base station,
The following steps are included:
Step 1: setting node forwards the maximum times T of broadcast message packet, T >=2, the maximum of the forwarding broadcast message packet
Preceding T-1 minor node, which is taken, in number intersects broadcast mode and propagates, and takes for the T time and to transmit broadcast mode and forward broadcast message forward
Packet；Forward delay time dt is set；The forward delay time dt is received the broadcast message of surroundings nodes forwarding by the node
The time of packet determines, including the processing signal collision time；
Step 2: base station sends broadcast message packet into network: broadcast message packet including destination node ID, type m,
Hop count L, forward node D, upper forward node D1, least energy time t, least energy timing node mD, sequence number Q；It is described
Broadcast message structure is shown in Table 1；Destination node is set as base station in the broadcast message packet, and the type for the packet that broadcasts the message is set as T, hop count
L is set as 1, and a upper forward node is set as empty, and forward node is set as base station, and sequence number is set as time that routing was established and rebuild in base station
Number；
Step 3: the routing table of each node includes following column compositions: destination node ID, hop count N, next-hop node
ND, least energy time t, least energy timing node mD, priority level P and sequence number Q；The router-table structure of each node
2 are shown in Table, sky is initialized as；Judge the node whether be base station adjacent 1 hop node, that is, receive broadcast message packet hop count
It whether is 1, if so, turning to step 4；If not, turning to step 5；
Step 4: 1 hop node of adjacent base station forwards the broadcast message packet, comprising the following specific steps
Step 4-1: judge whether the sequence number in the broadcast message packet is greater than or equal in the routing table of the node
The sequence number of route record identical with the destination node in the broadcast message packet；If so, turning to step 4-2；If not,
Terminate；
Step 4-2: delete that destination node in the routing table is destination node in the broadcast message packet and hop count is big
In 1 route record item；Turn to step 4-3；
Step 4-3: the route record item that destination node is the destination node in the broadcast message packet, the routing are established
Hop count is 1 in entry, and next-hop node is the destination node in the broadcast message packet；
Step 4-4: the broadcast message packet that the write-in of the dump energy time of the node ID and the node to be forwarded
The hop count of the broadcast message packet is added 1 by least energy timing node and least energy time t, and broadcast message Packet type m is section
The maximum times T of point forwarding broadcast message packet；The broadcast message is forwarded to wrap；
The dump energy time is the time that the node energy is able to maintain that its operation；The broadcast message packet class
Type, intersecting broadcast message Packet type m value is 1 to T-1, and transmitting broadcast message Packet type is T, and routing table maintenance Packet type is 0；
Step 5: non-adjacent 1 hop node of base station receives the broadcast message and wraps and broadcast message is forwarded to wrap, including following tool
Body step:
Step 5-1: judgement receives whether broadcast message packet will forward；Including step in detail below；
Step 5-1-1: whether the type m for receiving broadcast message packet is equal to T, if so, turning to step 5-1-2；If
It is no, terminate；
Step 5-1-2: whether the sequence number that judgement receives in broadcast message packet is less than mesh in the routing table of the node
Mark the maximum sequence number in the identical entry of node；If not, turning to step 5-1-3；If so, terminating；
Step 5-1-3: the most jete that destination node in the broadcast message packet is reached in the routing table of the node is calculated
Number minN；Minimum hop count minN is destination node and destination node phase in broadcast message packet in the routing table in routing table
The minimum value of hop count in same entry；
Step 5-1-4: judge whether the hop count in the broadcast message packet meets and wrapped greater than in routing table with broadcast message
Minimum hop count in the identical entry of middle destination node subtracts 1 again plus the maximum times of node forwarding broadcast message packet, if
It is to terminate；If not, turning to step 5-1-5；
Step 5-1-5: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if
It is to terminate；If not, turning to step 5-1-6；
Step 5-1-6: judge whether the upper forward node in the broadcast message packet is equal to target in the routing table
Next-hop node in node all entries identical with the destination node in the broadcast message packet, if so, terminating；Such as
Fruit is no, turns to step 5-2；
Step 5-2: timer starts timing；Enable hop count Li=1；The hop count Li value be from 1 to T just
Integer；
Step 5-3: it determines whether to receive broadcast message packet；
Step 5-3-1: if hop count Li et al. is in 1, whether the type m that judgement receives broadcast message packet is equal to T, if
It is to turn to step 5-3-3；If not, turning to step 5-5；
Step 5-3-2: if hop count Li is not equal to 1, whether the type m that judgement receives broadcast message packet is equal to forwarding
Number Li subtracts 1；If so, turning to step 5-3-3；If not, turning to step 5-5；
Step 5-3-3: whether the sequence number that judgement receives in broadcast message packet is less than mesh in the routing table of the node
Mark the maximum sequence number in the identical entry of node；If not, turning to step 5-3-4；If so, turning to step 5-5；
Step 5-3-4: the most jete that destination node in the broadcast message packet is reached in the routing table of the node is calculated
Number minN；
Step 5-3-5: judging whether the hop count in the broadcast message packet is less than minimum hop count minN, if not, turning to
Step 5-3-6；If so, enable minimum hop count be equal to it is described broadcast message packet in hop count, delete in the routing table with it is described
Hop count adds node greater than minimum hop count and forwards broadcast message packet most in the identical entry of destination node in broadcast message packet
The route record item that big number T subtracts 1 again, turns to step 5-3-6；
Step 5-3-6: judge whether the hop count in the broadcast message packet is greater than in routing table and mesh in broadcast message packet
Minimum hop count in the identical entry of mark node subtracts 1 again plus the maximum times T of node forwarding broadcast message packet, if so,
Turn to step 5-5；If not, turning to step 5-3-7；
Step 5-3-7: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if
It is to turn to step 5-5；If not, turning to step 5-3-8；
Step 5-3-8: judge whether the upper forward node in the broadcast message packet is equal to target in the routing table
Next-hop node in node all entries identical with the destination node in the broadcast message packet, if so, turning to step
Rapid 5-5；If not, turning to step 5-4；
Step 5-4: entry is added with destination node, next-hop node, Serial No. unique key in the routing table
Or modification record item, destination node, hop count, next-hop node, least energy time, least energy timing node and sequence number
Destination node, hop count, forward node, least energy time, least energy timing node in the respectively described broadcast message packet
And sequence number；Turn to step 5-5；
Step 5-5: judging whether timer reaches the hop count times of forward delay time, that is, reaches Li × dt, if
It is to turn to step 5-6；If not, turning to step 5-3 when next broadcast message packet being waited to reach；
Step 5-6: the priority level of each entry of destination node described in the routing table is calculated；Turn to step 5-7；
Step 5-7: modify the broadcast message packet type be hop count, i.e. m=Li, hop count, forward node, on
One forward node, sequence number are respectively that the hop count of priority level tidemark item in the routing table adds 1, present node, next
Hop node, sequence number, if the dump energy time of the node is less than the priority level tidemark item in the routing table
The least energy time, it is described broadcast message packet the least energy time and least energy timing node be respectively the node
Dump energy time and the node, otherwise the least energy time of the broadcast message packet and least energy timing node are distinguished
For the least energy time of priority level tidemark item and least energy timing node in the routing table；Turn to step 5-8；
Step 5-8: the broadcast message packet is sent, step 5-9 is turned to；
Step 5-9: enabling hop count add 1, Li=Li+1, if hop count is greater than T, terminates, otherwise turns to step 5-
3。
The priority level P calculation method of each entry of certain destination node is made of step in detail below in the routing table:
The priority level P value is the positive integer since 1, priority level highest when P is equal to 1.
Step a: the identical least energy time average respectively recorded of destination node in the node route list is calculated；
Step b: selection the first and second time points, first time point be greater than the least energy time average, second
Time point is less than the least energy time average；
Step c: assuming that the record that the least energy time in the record is greater than first time point has P1It is a, it presses wherein most
The small big minispread of energy time, the maximum P=1, successively P=2, until P=P1；
Step d: assuming that the least energy time in the record is less than first time point and is greater than the note at the second time point
Record has P2It is a, it arranges by the hop count in the record, is arranged from big to small if hop count is identical by the least energy time from small to large,
Least energy time maximum item P=P in the smallest record of hop count1+ 1, the least energy time is minimum in the maximum record of hop count
Item P=P1+P2；
Step e: assuming that there is P in the least energy time respectively recorded less than the record at the second time point3It is a, by its minimum
The big minispread of energy time, least energy time maximum item P=P1+P2+ 1, least energy time the smallest item P=P1+P2+
P3。
The least energy time is by surveillance of the nodes energy level or passes through the energy content of battery, every time communication consumption energy and unit
The conversion of time number of communications.
Least energy time=remaining power energy/(communication consumption energy × unit time number of communications every time).
Node preferentially selects priority level high, i.e. the small path of priority level parameter carries out data transmission.Selection is first first
Level parameters are 1 path, if this path is obstructed, selecting first level parameters is 2 paths, and so on, until transferring data to mesh
Mark node.
The present invention exists more on the basis of finding transmission path as much as possible, in the node route list that can each transmit
The selectable transmission path of item, it is preferential to select a wherein highest-ranking paths, it is had recorded in entire path most in routing table
The node of small dump energy and use the time.It will appreciate that the transmission state in entire path, the time that can be transmitted estimated, according to most
The numerical value of small dump energy updates the time of entire routing table to determine, is capable of handling node energy variation and whole network is opened up
Variation issue is flutterred, to accurately be converted to data transfer path, guarantees that data are reliably transmitted, invention is being saved as far as possible
While sensor energy, the life cycle of entire wireless sensor network is improved.
The present invention, which establishes in routing procedure, intersects broadcast message packet and transmitting broadcast message packet using forwarding, with traditional broadcast
Method is compared, and conventional broadcast methods node often receives a broadcast report, will consider whether to forward, practical hop count is more
It is more.First calculates path-level before sending transmitting broadcast message packet, optimal path is forwarded, therefore is needed etc. it is to be received intersect it is wide
Transmitting broadcast message packet is retransmited after broadcasting message package.
The distribution situation of certain example base station and its dump energy of node is as shown in Fig. 2, a, the characters such as b, c are node in figure
Identifier, number are, according to inter-node communication radius, to obtain such as Fig. 3 using base station as destination node the dump energy time of node
Shown in node communication overlay figure.
Select T equal to 2, first time point 0.9, the second time point 1.1,
Firstly, the broadcast message packet that base station transmitting type is 2 arrives all 1 hop neighbor node a within the scope of its communication radius,
B, c node, 1 hop neighbor node a, b, c node establish entry in the routing table.Node a, it is 2 transmitting that b, c, which forward type,
Broadcast message packet.
Second node layer d, e, f establishes routing.Node a, b, c, d, e, f, which is received, transmits broadcast message packet, interior joint
A, b, c are not dealt with, and node d, e, f establish entry in the routing table.Node d receives the transmitting broadcast of node a and b transmission
Message package, addition or modification routing table entry；The transmitting that node e receiving node b is sent, which broadcasts the message, wraps, addition routing table note
Record item；The transmitting that node f receiving node b and c are sent, which broadcasts the message, wraps, addition or modification routing table entry；.
When dt is arrived in oneself each comfortable timing of node d, e, f, heat source rank is calculated, the intersection broadcast that transmission types are 1
Message package.
Node a, b, c, d, e, f, g, h, i, the intersection that j reception type is 1, which broadcasts the message, wraps, node a, b, c, g, h, i, j
It does not deal with.The broadcast message packet that the type that node d receiving node e is sent is 1, the type that node e receiving node d, f are sent are
1 broadcast message packet, the broadcast message packet that the type that node f receiving node e is sent is 1.When each comfortable timing of d, e, f is to 2dt,
Calculate heat source rank, the broadcast message packet that forwarding type is 2.
Third node layer g, h, i, j, which is established, to be routed.Node a, b, c, d, e, f, g, h, i, j receive the transmitting that type is 2
Broadcast message packet, node a, b, c, d, e, f are not dealt with, and the node g type that receiving node d is forwarded within (0, the dt) time is 2
Broadcast message packet, node h within (0, the dt) time receiving point e, f send type be 2 broadcast message packet, node i (0,
Dt) the broadcast message packet that the type that receiving node e is sent in the time is 2, node i receiving node e within (0, the dt) time are sent
Type be 2 transmitting broadcast message packet, node j within (0, the dt) time receiving node e, f send type be 2 broadcast message
Packet.When dt is arrived in each comfortable timing of node g, h, i, j, heat source rank is calculated, the intersection broadcast message that transmission types are 1 is wrapped.
Node d, e, f, g, h, i, j, k, l receive the broadcast message packet that type is 1.Node d, e, f, k, l do not deal with, save
The intersection that point g receiving node h is sent, which broadcasts the message, wraps, the broadcast message packet that the type that node h receiving node g, i are sent is 1, section
The broadcast message packet that the type that point i receiving node h, j are sent is 1, the broadcast message that the type that node g receiving node i is sent is 1
Packet.Each comfortable timing of g, h, i and j calculates heat source rank to 2dt, the transmitting broadcast message packet that forwarding type is 2.
4th node layer establishes routing.Node d, e, f, g, h, i, j, k, l receive the broadcast message packet that type is 2, section
Point d, e, f, g, h, i, j are not dealt with, the broadcast message that the node k type that receiving node h, i is sent within (0, the dt) time is 2
Packet, node l broadcast the message in the transmitting that the type that (0, dt) time interior reception node i, j are sent is 2 and wrap.Each leisure of node k, l
When oneself timing is to dt, heat source rank is calculated, the intersection that transmission types are 1 broadcasts the message packet.
Node h, i, j, k, l receive the broadcast message packet that type is 1.Node h, i, j are not dealt with, node k receiving node l
The broadcast message packet that the type of transmission is 1, the broadcast message packet that the type that node l receiving node k is sent is 1；K, each comfortable meter of l
When to 2dt when calculate heat source rank, the broadcast message packet that forwarding type is 2.
The routing iinformation for establishing selectable next-hop neighbor node according to each node of routing table rule is as shown in table 3.
After node collects the information of monitoring, information can be passed to distance objective node from the remote node of distance objective node
Close node.After node k is monitored or received data, it can be transferred data to according to path shown in Fig. 4 according to route messages
Base station.
As shown in figure 3, node k can select to transfer data to priority level in routing table for 1 next-hop node h, together
Reason forms k → h → d → a → base station transmission path.
Each node in wireless sensor network can store routing table, and node selects forwarding data line according to routing table
Road, comprehensively considers hop count in this way, and the least residue energy information in entire path selects transmission path, the energy of the balanced whole network of meeting
Amount extends the life cycle of whole network to greatest extent.
Table 1
Table 2
Table 3
Claims (3)
1. a kind of wireless sensor network routing method of the node energy based on routing table establishes the routing for leading to base station,
It is characterized in that: the following steps are included:
Step 1: setting node forwards the maximum times T of broadcast message packet, T >=2, the maximum times of the forwarding broadcast message packet
In preceding T-1 minor node take and intersect broadcast mode and propagate, take for the T time transmitting broadcast mode forward the packet that broadcasts the message forward；If
Set forward delay time dt；The forward delay time dt by the node receive surroundings nodes forwarding broadcast message packet when
Between determine, including processing the signal collision time；
Step 2: base station sends broadcast message packet into network: the broadcast message packet includes destination node ID, type m, hop count
L, forward node D, upper forward node D1, least energy time t, least energy timing node mD, sequence number Q；The broadcast
Destination node is set as base station in message package, and the type for the packet that broadcasts the message is set as T, and hop count L is set as 1, and a upper forward node is set as empty,
Forward node is set as base station, and sequence number is set as the number that base station is established and rebuilds routing；
Step 3: the routing table of each node includes following column composition: destination node ID, hop count N, next-hop node ND, most
Small energy time t, least energy timing node mD, priority level P and sequence number Q, are initialized as sky；Whether judge the node
For adjacent 1 hop node of base station, that is, whether the hop count for receiving broadcast message packet is 1, if so, turning to step 4；If not,
Turn to step 5；
Step 4: 1 hop node of adjacent base station forwards the broadcast message packet, comprising the following specific steps
Step 4-1: judge whether the sequence number in the broadcast message packet is greater than or equal in the routing table of the node and institute
State the sequence number of the identical route record of destination node in broadcast message packet；If so, turning to step 4-2；If not, knot
Beam；
Step 4-2: deleting destination node in the routing table is that the destination node and hop count in the broadcast message packet are greater than 1
Route record item；Turn to step 4-3；
Step 4-3: the route record item that destination node is the destination node in the broadcast message packet, the route record are established
Hop count is 1 in, and next-hop node is the destination node in the broadcast message packet；
Step 4-4: most by the dump energy time of the ID of the node and the node write-in broadcast message to be forwarded packet
The hop count of the broadcast message packet is added 1, broadcast message Packet type m to be node by small energy time node and least energy time t
The maximum times T of forwarding broadcast message packet；The broadcast message is forwarded to wrap；
The dump energy time is the time that the node energy is able to maintain that its operation；The broadcast message Packet type is handed over
Fork broadcast message Packet type m value is 1 to T-1, and transmitting broadcast message Packet type is T, and routing table maintenance Packet type is 0；
Step 5: non-adjacent 1 hop node of base station receives the broadcast message and wraps and broadcast message is forwarded to wrap, including walks in detail below
It is rapid:
Step 5-1: judgement receives whether broadcast message packet will forward；Including step in detail below；
Step 5-1-1: whether the type m for receiving broadcast message packet is equal to T, if so, turning to step 5-1-2；If not, knot
Beam；
Step 5-1-2: whether the sequence number that judgement receives in broadcast message packet is less than target section in the routing table of the node
Maximum sequence number in the identical entry of point；If not, turning to step 5-1-3；If so, terminating；
Step 5-1-3: the minimum hop count that destination node in the broadcast message packet is reached in the routing table of the node is calculated
minN；Minimum hop count minN is that destination node is identical as destination node in broadcast message packet in the routing table in routing table
Entry in hop count minimum value；
Step 5-1-4: judge whether the hop count in the broadcast message packet meets greater than mesh in wrapping in routing table with broadcast message
Minimum hop count in the identical entry of mark node subtracts 1 again plus the maximum times of node forwarding broadcast message packet, if so, knot
Beam；If not, turning to step 5-1-5；
Step 5-1-5: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if so, knot
Beam；If not, turning to step 5-1-6；
Step 5-1-6: judge whether the upper forward node in the broadcast message packet is equal to destination node in the routing table
Next-hop node in all entries identical with the destination node in the broadcast message packet, if so, terminating；If
It is no, turn to step 5-2；
Step 5-2: timer starts timing；Enable hop count Li=1；The hop count Li value is just whole from 1 to T
Number；
Step 5-3: it determines whether to receive broadcast message packet；
Step 5-3-1: if hop count Li et al. is in 1, whether the type m that judgement receives broadcast message packet is equal to T, if so,
Turn to step 5-3-3；If not, turning to step 5-5；
Step 5-3-2: if hop count Li is not equal to 1, whether the type m that judgement receives broadcast message packet is equal to hop count
Li subtracts 1；If so, turning to step 5-3-3；If not, turning to step 5-5；
Step 5-3-3: whether the sequence number that judgement receives in broadcast message packet is less than target section in the routing table of the node
Maximum sequence number in the identical entry of point；If not, turning to step 5-3-4；If so, turning to step 5-5；
Step 5-3-4: the minimum hop count that destination node in the broadcast message packet is reached in the routing table of the node is calculated
minN；
Step 5-3-5: judging whether the hop count in the broadcast message packet is less than minimum hop count minN, if not, turning to step
5-3-6；If so, enable minimum hop count be equal to it is described broadcast message packet in hop count, delete in the routing table with the broadcast
Hop count is greater than minimum hop count plus the maximum time of node forwarding broadcast message packet in the identical entry of destination node in message package
The route record item that number T subtracts 1 again, turns to step 5-3-6；
Step 5-3-6: judge whether the hop count in the broadcast message packet is greater than in routing table and target section in broadcast message packet
Minimum hop count in the identical entry of point subtracts 1 again plus the maximum times T of node forwarding broadcast message packet, if so, turning to
Step 5-5；If not, turning to step 5-3-7；
Step 5-3-7: judge it is described broadcast message packet in a upper forward node and the node it is whether identical, if so, turn
To step 5-5；If not, turning to step 5-3-8；
Step 5-3-8: judge whether the upper forward node in the broadcast message packet is equal to destination node in the routing table
Next-hop node in all entries identical with the destination node in the broadcast message packet, if so, turning to step 5-
5；If not, turning to step 5-4；
Step 5-4: entry is added with destination node, next-hop node, Serial No. unique key in the routing table or is repaired
Change entry, destination node, hop count, next-hop node, least energy time, least energy timing node and sequence number difference
For destination node, hop count, forward node, least energy time, least energy timing node and the sequence in the broadcast message packet
Row number；Turn to step 5-5；
Step 5-5: judging whether timer reaches the hop count times of forward delay time, that is, reaches Li × dt, if so, turning
To step 5-6；If not, turning to step 5-3 when next broadcast message packet being waited to reach；
Step 5-6: the priority level of each entry of destination node described in the routing table is calculated；Turn to step 5-7；
Step 5-7: the type for modifying the broadcast message packet is hop count, i.e. m=Li, hop count, forward node, one turn upper
Hair node, sequence number are respectively that the hop count of priority level tidemark item in the routing table adds 1, present node, next-hop section
Point, sequence number, if the dump energy time of the node is less than the priority level tidemark item in the routing table most
Small energy time, the least energy time of the broadcast message packet and least energy timing node are respectively the residue of the node
Energy time and the node, otherwise the least energy time of the broadcast message packet and least energy timing node are respectively institute
State the least energy time of priority level tidemark item and least energy timing node in routing table；Turn to step 5-8；
Step 5-8: the broadcast message packet is sent, step 5-9 is turned to；
Step 5-9: enabling hop count add 1, Li=Li+1, if hop count is greater than T, terminates, otherwise turns to step 5-3.
2. the wireless sensor network routing method of the node energy according to claim 1 based on routing table, feature
Be: the priority level P value of each entry of certain destination node is the positive integer since 1 in the routing table, when P is equal to 1
Priority level highest, priority level P calculation method are made of step in detail below:
Step a: the identical least energy time average respectively recorded of destination node in the node route list is calculated；
Step b: the first and second time points of selection, first time point are greater than the least energy time average, the second time
Point is less than the least energy time average；
Step c: assuming that the record that the least energy time in record described in step a is greater than first time point has P1It is a, it presses wherein most
The small big minispread of energy time, the maximum P=1, successively P=2, until P=P1；
Step d: assuming that the least energy time in the record is less than first time point and the record for being greater than for the second time point has P2
It is a, it arranges, is arranged from big to small if hop count is identical by the least energy time, hop count is most from small to large by the hop count in the record
Least energy time maximum item P=P in small record1+ 1, least energy time the smallest item P=in the maximum record of hop count
P1+P2；
Step e: assuming that there is P in the least energy time respectively recorded less than the record at the second time point3It is a, by its least energy
Time big minispread, least energy time maximum item P=P1+P2+ 1, least energy time the smallest item P=P1+P2+P3。
3. the wireless sensor network routing method of the node energy according to claim 1 based on routing table, feature
It is: when the least energy time communicates consumption energy and unit by surveillance of the nodes energy level or by the energy content of battery, every time
Between number of communications convert；
Least energy time=remaining power energy/(communication consumption energy × unit time number of communications every time).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510747431.9A CN105430708B (en) | 2015-11-05 | 2015-11-05 | Wireless sensor method for routing based on routing table node energy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510747431.9A CN105430708B (en) | 2015-11-05 | 2015-11-05 | Wireless sensor method for routing based on routing table node energy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105430708A CN105430708A (en) | 2016-03-23 |
| CN105430708B true CN105430708B (en) | 2019-02-22 |
Family
ID=55508573
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510747431.9A Active CN105430708B (en) | 2015-11-05 | 2015-11-05 | Wireless sensor method for routing based on routing table node energy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105430708B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106888493B (en) * | 2017-02-13 | 2020-10-16 | 深圳市联骋科技有限公司 | Routing method and device of wireless MESH MESH network |
| CN108881014B (en) * | 2017-05-12 | 2021-10-01 | 北京猎户星空科技有限公司 | Data sending system and method |
| CN109981486B (en) * | 2017-12-27 | 2023-04-18 | 北京华为数字技术有限公司 | Message forwarding method and forwarding device |
| CN108307345B (en) * | 2018-01-31 | 2020-08-21 | 鲁东大学 | Node in wireless sensor network |
| US10498555B2 (en) * | 2018-03-13 | 2019-12-03 | Ambit Microsystems (Shanghai) Ltd. | System for combining wireless sensor networks and method thereof |
| CN110446185B (en) * | 2019-07-22 | 2021-01-19 | 西安交通大学 | Routing method for communication between vehicles based on node familiarity model |
| CN110650087A (en) * | 2019-10-09 | 2020-01-03 | 四川灵通电讯有限公司 | Grid network and data forwarding type reliable transmission method applying grid network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562861A (en) * | 2009-05-15 | 2009-10-21 | 重庆邮电大学 | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network |
| CN104333883A (en) * | 2014-10-16 | 2015-02-04 | 南京邮电大学 | Improved wireless sensor network energy multi-path routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070211681A1 (en) * | 2006-03-09 | 2007-09-13 | Spinwave Systems, Inc. | Method and System for Frequency Agility in a Wireless Sensor Network |
-
2015
- 2015-11-05 CN CN201510747431.9A patent/CN105430708B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101562861A (en) * | 2009-05-15 | 2009-10-21 | 重庆邮电大学 | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network |
| CN104333883A (en) * | 2014-10-16 | 2015-02-04 | 南京邮电大学 | Improved wireless sensor network energy multi-path routing method |
Non-Patent Citations (2)
| Title |
|---|
| EBRP:Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks;Fengyuan Ren;《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》;20111231;全文 |
| 一种基于路由表的无线传感器网络路由协议;田丰;《计算机应用》;20081031;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105430708A (en) | 2016-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105430708B (en) | Wireless sensor method for routing based on routing table node energy | |
| CN102223683B (en) | Data transmission method, node and system in wireless sensor network | |
| CN101568164B (en) | Opportunistic routing algorithm of Ad hoc network | |
| CN110139319A (en) | High dynamic time-delay network propagation delay time minimizes method for routing | |
| US20070233835A1 (en) | Methodology for scheduling data transfers from nodes using path information | |
| CN103415056B (en) | A kind of mobile ad-hoc network routing method on demand based on link-quality | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN106304229A (en) | A kind of software definition wireless Mesh netword based on content storage | |
| JP2012217164A5 (en) | ||
| CN102802230A (en) | Energy-efficient wireless sensor network routing algorithm | |
| CN102857989B (en) | Self-adaptive routing method oriented to mobile sensor network | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN101951656A (en) | Method for designing wireless network routing protocol with energy efficiency and coding perception | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| Kumar et al. | An efficient gateway discovery in ad hoc networks for internet connectivity | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| CN102916876B (en) | Routing method for one-way link environment of principal and subordinative construction network | |
| CN110650511A (en) | Improved AODV routing protocol based on energy consumption and load | |
| Ferdous et al. | Randomized energy-based AODV protocol for wireless ad-Hoc network | |
| Zhai et al. | A reliable and adaptive AODV protocol based on cognitive routing for Ad hoc networks | |
| Peng et al. | An energy-aware random multi-path routing protocol for MANETs | |
| CN114390631A (en) | Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction | |
| Sharma et al. | Study of Routing Protocols in MANET-A Review | |
| CN103002536A (en) | Energy efficient wireless multi-hop network routing mechanism based on random walks | |
| CN104735712A (en) | Ad Hoc network route maintenance method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |