CN101420445B - Fast routing protocol of wireless sensor network - Google Patents
Fast routing protocol of wireless sensor network Download PDFInfo
- Publication number
- CN101420445B CN101420445B CN2007100097219A CN200710009721A CN101420445B CN 101420445 B CN101420445 B CN 101420445B CN 2007100097219 A CN2007100097219 A CN 2007100097219A CN 200710009721 A CN200710009721 A CN 200710009721A CN 101420445 B CN101420445 B CN 101420445B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- branch
- nodes
- network
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 claims description 50
- 230000008569 process Effects 0.000 claims description 40
- 230000006855 networking Effects 0.000 claims description 25
- 230000004044 response Effects 0.000 claims description 23
- 230000008439 repair process Effects 0.000 claims description 18
- 230000007246 mechanism Effects 0.000 claims description 16
- 230000008263 repair mechanism Effects 0.000 claims description 13
- 230000008859 change Effects 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 claims description 5
- 230000008531 maintenance mechanism Effects 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000000737 periodic effect Effects 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 11
- 238000011144 upstream manufacturing Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000000605 extraction Methods 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 238000000205 computational method Methods 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 239000012467 final product Substances 0.000 description 2
- 230000001052 transient effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004134 energy conservation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明涉及一种无线传感器网络的快速路由协议，源节点在路由建立之前，先通过目的节点的物理地址来查找对应的逻辑地址；当节点收到数据包时，检查该数据包的目的地址是否属于自身所拥有的地址段；如果超出自身的地址段，则转发给自身的父节点；如果目的地址属于自身所拥有的地址段，继续中继，直到找到目的地址；节点结合ART表以及周期性更新的关联节点表进行快速路由的选择与建立，任意两个通过网格连接起来的节点相互地把对方节点看作自身的子节点，反之亦然；由于本发明在节点接入网络的过程中主动选择父节点，并且在几个备份父节点中多次尝试入网，避免错过其他尚有足够接入能力的预期父节点，从而避免过多地进行簇分裂、造成网络拓扑结构的不均衡。
The invention relates to a fast routing protocol for a wireless sensor network. Before routing is established, a source node searches for a corresponding logical address through the physical address of a destination node; when a node receives a data packet, it checks whether the destination address of the data packet is It belongs to the address segment owned by itself; if it exceeds its own address segment, it will be forwarded to its parent node; if the destination address belongs to its own address segment, it will continue to relay until the destination address is found; the node combines ART table and periodic The updated associated node table carries out the selection and establishment of fast routing, and any two nodes connected through the grid mutually regard each other's nodes as their own child nodes, and vice versa; Actively select the parent node, and try to connect to the network multiple times among several backup parent nodes, so as to avoid missing other expected parent nodes that still have sufficient access capabilities, so as to avoid excessive cluster splits and unbalanced network topology.
Description
Technical field
The present invention relates to a kind of fast path protocol of wireless sensor network.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) be by being deployed in the surveyed area a large amount of cheap microsensor nodes that are integrated with transducer, flush bonding processor and communication module, the network system of the self-organizing of the multi-hop that the mode by radio communication forms.It is by means of various informative transducer built-in in the sensor node, measure heat, infrared ray, sonar, radar and seismic signal in the surrounding enviroment of place, thereby survey the interested material phenomenons of numerous mankind such as size, speed and direction that comprise temperature, humidity, noise, luminous intensity, pressure, soil constituent, mobile physics.
The typical sensor network configuration is made up of sensor node (sensor node), convergence node (sink node), junction network and telemanagement node usually.A large amount of sensor nodes be deployed at random monitored area (sensor field) inner or near, can constitute network by the self-organizing mode.The sensor node data monitored is transmitted along other sensor node hop-by-hop ground, and Monitoring Data may be routed to the convergence node through behind the multi-hop by a plurality of node processing in transmission course, arrives management node by the Internet or satellite at last.The user is configured and manages sensor network by management node, issue monitoring task and collection Monitoring Data.Fig. 1 has provided and has practised the description that sensor network architecture general type is arranged.
As shown in Figure 2, practise the sensor network protocol stack that has and comprise physical layer, data link layer, network layer, transport layer and application layer, corresponding with five layer protocols of Internet protocol stack.In addition, protocol stack also comprises energy management platform, mobile management platform and task management platform.These management platforms make sensor node to transmit data in the sensor network of node motion according to the mode collaborative work of high efficiency of energy, and support multitask and resource-sharing.
Designed a kind of wireless sensor network among the IEEE802.15.4 based on layering bunch tree topology structure, this topological structure be convenient to the expansion and route simple relatively.Adopt bunch tree structure can simplify and being connected of Internet simultaneously, only need in root node, to add a gateway and get final product.Address allocation scheme and Routing Protocol based on layering bunch tree topology structure in the IEEE802.15.4 agreement are briefly described below;
1, the network address is divided
Address assignment agreement regulation in the IEEE802.15.4 agreement based on layering bunch tree topology structure, each node distributes 16bits network address, wherein 8bit be called a bunch ID (clusteridentification, CID), in addition 8bit be called node ID (nodeidentification, NID).Whole network configuration as shown in Figure 3.The root node of the whole network of the numerical value of CID from 0 to 255,0 expression, be also referred to as appointment equipment (DesignatedDevice, DD), CID 255 just represents that broadcast message is used for all bunches, other numerical value are used for distinguishing different bunches.All nodes in bunch head (CH) of the numerical value of NID from 0 to 255,0 expression bunch, 255 expression broadcast messages are used for bunch, other numerical value are used to distinguish the different nodes with under the cluster.
As shown in Figure 3, the CID of root node DD and NID just are defined as 0, as these many bunches of network root DD, and the network node its computing capability (as memory capacity and processor speed) is better than usually.Bunch tree network among the figure is a kind of multihop network, and when node added network, the network node of communicating by letter with it in the association process was defined as the father node of node; Adding ingress itself becomes the child node of father node.Node 3 in bunch 0 is father nodes of node 10 and node 22; Node 10 and node 22 are child nodes of node 3.
2, the address assignment in the networking process
All nodes in the layering bunch tree topology structural network regularly send beacon, comprise node CID and NID etc. in the beacon.Before networking, new node is periodically intercepted these beacons, in case receive a beacon, new node just sends request and connects (CONNECTION REQUEST) control messages application networking.If received beacon from a plurality of nodes, new node just select to send the earliest beacon node make response.This moment, new node just became both candidate nodes, and the request of receiving of the father node of expection connects after the control messages to refer to bunch hair at its place bunch asks node ID (NODE ID REQUEST) message, this message can by bunch in intermediate node be routed to a bunch head.
If can accepting this both candidate nodes, bunch head networks, the node ID that it agrees loopback is relayed to both candidate nodes after responding (NODE ID RESPONSE) message and being converted into connection response (CONNECTIONRESPONSE) message, to the NID in this bunch of both candidate nodes distribution.Network if bunch head can not be accepted this both candidate nodes, it can send request CID request (CLUSTER ID REQUEST) message and give DD, and request is set up one new bunch.Root node DD can send CID response (CLUSTER ID RESPONSE) message response request, and distributing a new CID and one for both candidate nodes is 0 NID number.After receiving this response message, bunch head can send NID response (NODE ID RESPONSE) message to both candidate nodes.After obtaining confirming, just formally become network members begins to send beacon to both candidate nodes.
3, Routing Protocol
Each network node is all preserved a routing table, only preserves the CID and the NID of other nodes that the CID of neighbor node and NID and this node can listen to during beginning in the table, and the relevant information of father node also is stored in this routing table.Root node DD preserves the information of whole network node.
Root node DD regularly all leaf nodes in bunch tree sends hyperlink request state (LINKSTATE REQUEST) message.After receiving this message, a linking status response of leaf node response (LINK STATE RESPONSE) message, it can listen to the CID that wherein comprises self and NID and all and the CID of the node that the CID value is different with self.This message is addressed in the process of bunch head, via node meeting " eavesdropping " message content, with determine outside the node coverage downstream node and bunch, these downstream nodes and bunch be added in their routing table, and the node that the linking status response message is provided classified as first via node in the route.Then, via node adds self information in the node listing of message, continues upstream the direction of bunch head again and transmits this message.Bunch head adds the information in the linking status response message in the routing table of self, carries out fusion treatment, produce a new linking status response message again upstream direction transmit.After receiving the all-links status response message, root node DD will have gained some understanding to network configuration.
In routing procedure, if the CID of destination node is with different with the CID of via node, via node is the routing table of search oneself just, searches corresponding C ID.If found the route table items that contains this CID, it just is routed to this message the via node of this CID correspondence in the table; If can not find, it just is routed to this message the father node of oneself.
If the CID of the CID of destination node and via node is identical, via node is the routing table of search oneself just, the item that table look-up CID and NID mate, if find that destination node is the neighbor node of oneself, it just directly sends to this neighbor node to message.If destination node adds routing table entry when " eavesdropping " Link State response message, it just gives the downstream node that sends link-state message nearest (single-hop) to it with this forwards; If can not find this destination node in routing table, the father node (upstream) that it just gives forwards oneself continues to seek route by its father node.
The address assignment that a key character of above-mentioned 802.15.4 agreement is exactly a network is networking limit, a limit assign logical addresses, and network is a tree.The network of tree has a common weakness, and the robustness that is exactly network is poor, in case via node breaks down, can cause the branches and leaves node to be reconstructed, and then cause network topology to change, and has consumed node energy.At the network of tree, appropriate address distribution and routing mechanism will be accelerated network organizing and reconstruct, save the energy of network node, increase the robustness of network.
Summary of the invention
The present invention proposes a kind of simple efficient, to be suitable for wireless sensor network node energy-conservation, and based on the fast path protocol of realizing the address allocation scheme that node address is related with network topological information.
A kind of fast path protocol of wireless sensor network comprises following content:
(1) during enabling communication between nodes, source node is before route is set up, physical address PhyID by destination node searches corresponding logical address LogID earlier, before not finding corresponding destination node logical address LogID or receiving destination node logical address LogID response message, source node is searched the associated nodes table of oneself successively according to the physical address PhyID of destination node; The information of searching to father node, child node and neighbor node broadcasting destination node logical address LogID, behind the response message of receiving destination node logical address LogID, just stop search procedure, then do not replace source node to repeat above step if also receive corresponding message, till the logical address LogID that finds destination node by its father node; If finding the node of destination node logical address LogID is source node itself, then logical address LogID search procedure finishes, and enters route and sets up process; If its parent node is then passed to oneself child node, up to source node to the next stage level;
(2) when node is received a packet, check whether the destination address of this packet belongs to the address field that self has; If exceed the address field of self, then this packet is transmitted to the father node of self; If destination address belongs to the address field that self has, check the address field that belongs to which branch, continue relaying, up to finding destination address.
(3) on the basis of tree-shaped Route Selection, node can in conjunction with ART table and the associated nodes table that periodically updates carry out the through street by selection and foundation, from each viewpoint of node independently, network still can be considered as tree-shaped, any two nodes that couple together by grid are reciprocally regarded the other side's node as the child node of self, and vice versa.
Also comprise route maintenance and repair mechanism: the reparation state that enters behind the node failure is divided into two parts, a part be father node find own certain child node lost efficacy cause this child node with whole branch road when losing efficacy, the network reparation that father node carries out; Another part is a child node can't communicate by letter with the father node of oneself again the time, network self-healing and reparation that this child node need be carried out;
(1) the route repair mechanism of father node:
Certain child node of finding oneself when father node lost efficacy, cause this child node with whole branch road all can't communicate by letter with father node again the time, initiate route repair by father node, the ART at its all superior nodes of deletion inefficacy branch road, the record in the associated nodes list item;
When a certain node application of inefficacy Zhi Luxiang networked, this node promptly as the target father node of inefficacy branch road, need be repaired this branch road, enables re-accessing network;
Actual reservation number of addresses (Pre_Multiple-1) * Branch_Node according in the whole reservation address field (LogID)～(Pre_Last_ID) of the node number Invalid_Node on this inefficacy branch road, target father node self reservation number of addresses Pre_Multiple-1 and target father node divides different situations to handle.
1) when the node number of target father node self reservation number of addresses greater than the inefficacy branch road, the target father node is directly reserved whole nodes that the address is distributed to the inefficacy branch road successively with self, and the upstream nodes transmission step by step of the branch road information after will repairing, receive this information up to root node, upgrade network topology;
2) when not enough distribution of the reservation address field of destination node self and the total number of addresses of its reservation of whole when enough distributing to whole node of inefficacy branch road, the target father node reports relative address information, adjust network topology table by root node, inefficacy branch road in the list item is added the target father node is with in the former branch road, and recomputate reservation multiple New_Pre_Multiple for the new branch road after merging:
New_Pre_Multiple＝Pre_Multiple×Branch_Node÷(Branch_Node+Invalide_Node)
Root node is according to new reservation multiple New_Pre_Multiple, give this new branch road deallocation according to the address allocation scheme in the networking process, upgrading former Pre_Multiple simultaneously is New_Pre_Multiple, the new branch road that the target father node is led receives new network topology table, obtains new address field information;
3) when the target father node with whole reservation address fields of branch road still less than the node number of inefficacy branch road, then the target father node step by step upstream nodes send this information, up to root node; Root node should the inefficacy branch road from the network topology table table section of former branch road place, be changed to new target father node in the network topology table with branch road, and the one-level node branch under the one-level node branch under the comparison object father node is number former with failure node number is divided into two kinds of situations processing:
A., if the two branch number links to each other, then root node root node under the situation that does not change former Pre_Multiple is given this two associated branch deallocations according to the address allocation scheme in the networking process, and the network topology table content after will repairing at last sends to the branch road of renewal respectively.Each interdependent node obtains address information mechanism according to the node in the networking process, upgrades self information.
B, if the two branch number links to each other, root node with the reservation address field of one-level node under the comparison object node whether greater than the total sum of the node of total node number this one-level node under and inefficacy branch road.Distribute inadequately if reserve address field, then root node gives out information and notifies inefficacy branch node access failure.Otherwise, root node recomputate this one-level node with the reservation address multiple New_Pre_Multiple of branch road, computational methods are with situation 2), then according to the address allocation scheme in the networking process, give the branch road deallocation after merging, the network topology table content after will repairing at last sends to the branch road of renewal respectively; Each interdependent node obtains address information mechanism according to the node in the networking process, upgrades self information;
(2) the route repair mechanism of child node:
When node can't be communicated by letter with the father node of oneself again, notify descendants's node to enter network and repair state;
The selection of father node, backup and access; Receive the topology renewal that root node sends over, extract address information;
The renewal of network topology table at this moment, the process that node obtains address information are only limited to the branch road that needs reparation; When all descendants's nodes of repairing on the branch road all are re-assigned to LogID, and all parent nodes of this branch road have upgraded also that own ART shows and during the associated nodes table, the network reparation is finished; If access network is unsuccessful, the temporary transient access network again of this child node then, this node will be notified the next stage child node of oneself, lead the branch road of oneself to enter the repair process of child node respectively by the next stage child node; Enter again after the child node of access network then need wait for a period of time again and go into net state at random.
The present invention is an on-demand routing protocol with route backup, and it can calculate routing iinformation according to business demand from topology information, when being not enough to calculate whole route in the topology information, sets up route more as required.
In the present invention, in order to find route towards destination node, source node is at first checked LogID number that self whether has preserved destination node, if the LogID of known destination node, owing to comprised certain topology information among the LogID, so can be used to calculate route, otherwise, source node will (each coordinator node all may play the effect of topology server to topology server, coordinating its node according to this, to be in position in the tree network different and topology information amount that comprised is different) inquire about the LogID of this destination node, then, source node can (comprise father node in this table according to the LogID of destination node and the associated nodes table of self, descendants's node, neighbor node, the information of node interested) judge whether destination node is on the branch road of certain associated nodes of oneself, if, then directly set up the route of source node, give destination node by this associated nodes relaying to this associated nodes; If destination node is not on the branch road of any associated nodes, source node is issued the father node of oneself with data, is searched the associated nodes table of self by father node and carries out above-mentioned judgement and processing.In addition, the inefficacy of node may cause original route unavailable, and at this situation, Routing Protocol of the present invention has two kinds of processing modes: topology is upgraded and route repair.
Because each node has no idea to know the corresponding situation of the physical address PhyID and the addresses distributed LogID of all nodes of the whole network.Each coordinator node in the wireless sensor network that the present invention relates to all keeps the own information that comprises the PhyID and the LogID of child node, and each node all keeps these information of neighbor node and the information of (once communicating by letter) interested node, then can comparatively fast obtain the LogID of destination node, carry out quick route calculation again.
Description of drawings
Fig. 1 practises the wireless sensor network architectural schematic that has;
Fig. 2 practises the wireless sensor network protocols stack that has;
Fig. 3 practises bunch tree schematic network structure that has;
Fig. 4 is that coordinator node of the present invention (left side) is received the network topology table workflow diagram with ordinary node;
Fig. 5 is that the route in the inter-node communication of the present invention is set up schematic diagram;
Fig. 6 is that through street in the inter-node communication of the present invention is by setting up schematic diagram;
Fig. 7 is former father node of inefficacy branch road among the present invention and superior node reparation schematic flow sheet thereof.
Embodiment
The network using tree topology structure that present embodiment relates to, the whole network only have a Centroid as root node.256 nodes of network heap(ed) capacity do not limit every grade of maximum node number of network sum of series, and root node is made as 0 grade, and the every of other adds one-level through a branch.All nodes all are sensor nodes in this network, and the root node unique to the whole network sends the data that collect; It between node two-way link; The initial energy value of each node equates, and at the network lifecycle initial stage, each node all has enough energy to communicate by letter with root node or coordinator node; Each node all adopts omnidirectional antenna.
The whole network divides three category nodes: root node, coordinator node, ordinary node.
Root node: being responsible for the initiation work of netinit, is the promoter of networking commands, generally bears network topology server, gateway, webmaster and Applied layer interface services.
Coordinator node: the non-frontier node of tree topology all is called coordinator node, bears work such as address assignment, data relaying.
Ordinary node: the frontier node of tree topology all is called ordinary node, can be exchanged into coordinator node according to actual needs.
The wireless sensor network that the present invention relates to adopts the mechanism of address assignment after the first networking: after a tree network is set up, at first begin upwards to carry out node counts and topology information collection by ordinary node, begin the one-level level by root node again and distribute the address downwards, the network topology table that issue has been set up.
One, the network topology table of sensor network is set up flow process and node counts flow process
In the process of application networking, the node that application networks can be learnt the progression Level of self by the markers frame of father node, and the physical address PhyID of node is pre-set in the cloth network process.
(1), when the tree network group well after, the ordinary node that is in the branch road tip is at first initiated the node counts flow process, ordinary node carries out initialization to the branch node counter, if the initial value of branch node number is 1, be Branch_Node[branch]=1, and physical address PhyID, progression Level and the branch node of self node counted Branch_Node[branch] be saved in the network topology table of oneself, send to father node;
(2), the node of non-branch road tip is a coordinator node, after it waits for all child node network topology table of collecting oneself, at first set up the network topology table of oneself, all branch nodes in the topology table of collecting are counted Branch_Node[branch] count value adds up, add 1 again, final count value is saved in the network topology table of oneself.Meanwhile, coordinator node is compiled top set number with the network topology table of all child nodes and is joined in the self networks topology table, and other unknown values still keep initial value, for example:
| Branch_No. | Level | PhyID | ?LogID | Pre_Multiple | B Branch_Node[branch] |
| 2 | 310 | 3 | |||
| 1 | 3 | 405 | 1 | ||
| 2 | 3 | 407 | 1 |
Wherein the LogID item need be waited for after each branch road information all is aggregated into root node and being distributed unitedly by root node, and Pre_Multiple is for reserving the address multiple, the maximum son node number that the decision node can insert.
(3), no matter be ordinary node or coordinator node, self network topology table set up finish after, be about to it and send to the father node of oneself, up to root node.
Two, root node distributes addressing mechanism
After root node is received the network topology table of all child nodes,, finish the extraction of full mesh topology information, calculating, the distribution of LogID and the task of complete network topology table of reservation address field according to the information that from network topology table, is obtained.
Step 1: root node improves the branch number and node number in the network topology table
Root node can calculate the whole network node and count Branch_Node[0 according to the network topology table of receiving from child node].First information that information is exactly 1 grade of child node of each network topology table that root node is received, and the number Child_Node[0 of 1 grade of child node] equal the number that root node is received network topology table.Root node is the 1st grade of node distribution branch Branch_No=[1,2,3 ..., Child_Node[0]], and the Branch_No of branch of distributing inserted relevant position in each network topology table.Like this, branch in the all-network topology table number and branch node number are all perfect;
Root node can obtain the whole network topology information from network topology table after the network topology table of receiving all 1 grade of child nodes.Because during the structure of network topology table, it is nested to carry out one-level level ground, and therefore in network topology table, the nodal information between the identical node of progression is all descendants's nodal informations of previous node.
Root node will carry out the operation of following steps:
Suppose that root node receives the child node PhyID=101 from oneself, 102, No. 103 nodes, these three nodes are 1 grade of node;
Network topology table with the PhyID=101 node is example (seeing the following form), root node the PhyID=101 node with branch number be 1, from this network topology table, obtain its descendants's nodal information then;
Wherein, PhyID=104 node, its progression are 2, and branch number is 1, thereby the PhyID=104 node is the 1-1 branch road in the whole network as can be known;
PhyID=203 node, its progression are 3, and branch number is 1, thereby the PhyID=203 node is the 1-1-1 branch road in the whole network as can be known;
PhyID=204 node, its progression are 3, and branch number is 2, thereby the PhyID=204 node is the 1-1-2 branch road in the whole network as can be known;
By that analogy.According to the nested mode in this network topology table, root node can directly obtain tree topology information.
| Branch_No. | ?Level | PhyID | ?LogID | | Branch_Node | [branch] |
| 1 | ?1 | 101 | 10 | |||
| 1 | ?2 | 104 | 4 | |||
| 1 | ?3 | 203 | 1 |
| 2 | 3 | 204 | 1 | ||
| 3 | 3 | 301 | 1 | ||
| 2 | 2 | 201 | 2 | ||
| 1 | 3 | 302 | 1 | ||
| 3 | 2 | 202 | 3 | ||
| 1 | 3 | 303 | 1 | ||
| 2 | 3 | 304 | 1 |
After root node obtains network topological information, it has just had whole understanding to whole network topology, progression Level, each one-level node branch k (k=0,1,2 of comprising each node in the network, Child_Node[0]) and the branch node of leading sum Branch_Node[k], sequence number i (i=0,1,2 of child node under one-level node topology table,, Branch_Node[k]) etc.Root node will be according to as above information and the initial address multiple Pre_Multiple that reserves calculate the logical address LogID of each node of the whole network and the reservation address field of node.
Root node is expressed as the logical address allocation algorithm of all nodes of the whole network:
Pre_Multiple is for reserving the address multiple, the maximum son node number that the decision node can insert.
In the networking process, each node all has been assigned with a continuous address, and the length of address field has promptly been reserved a sector address section greater than the actual node number on the branch road.This has just allowed the back to add new branch again, also can more effectively repair tree simultaneously.
Finally, root node replenishes LogID in the whole network all-network topology table and initial p re_Multiple complete.After root node is distributed the address, with the LogID of distributing to each child node that sends a notice.Be that root node transmits network topology table to the next stage level,
Three, node obtains address field information
After each coordinator node is received the network topology table of passing to oneself, need finish following task successively: the address information LogID that from table, obtains self in first; Calculate the reservation address field of self
(LogID)～(Pre_Last_ID)=(LogID)～(LogID+Pre_Multiple * Branch_Node-1); Information extraction makes up ART table (Adaptive Robust Tree) and associated nodes table (containing father node information, descendants's nodal information, information of neighbor nodes and node interested (node of communicating by letter in the recent period) information); According to next stage child node number n network topology table being splitted into subordinate's child node is the child node network topology table of first n child node, and issue corresponding subordinate's child node by the order of branch number, this process can be considered as the inverse process that network topology table is set up process.
Node on coordinator node and the ordinary node obtains the address field process as shown in Figure 4.
Ordinary node for the branch road tip then only needs to extract the reservation address field of self networks address LogID, computing node and extract the associated nodes table.
Four, Route Selection and creating a mechanism
Because the network address of node has topology information, therefore simplified the network routing mechanism greatly, and routing procedure made full use of grid type tree network structure set up the through street by, thereby shorten the path, further cut down the consumption of energy.
1, network address LogID searches
During enabling communication between nodes, source node need be searched corresponding logical address LogID by the physical address PhyID of destination node before route is set up, and rule is:
Before not finding corresponding destination node logical address LogID or receiving destination node logical address LogID response message, source node is searched the associated nodes table of oneself successively according to the physical address PhyID of destination node; The information of searching to father node, child node and neighbor node broadcasting destination node logical address LogID, behind the response message of receiving destination node logical address LogID, just stop search procedure, then do not replace source node to repeat above step if also receive corresponding message, till the logical address LogID that finds destination node by its father node; If finding the node of destination node logical address LogID is source node itself, then logical address LogID search procedure finishes, and enters route and sets up process; If its parent node is then passed to oneself child node, up to source node to the next stage level.
2, Route Selection and creating a mechanism
Because node address itself just has certain routing iinformation, when node is received a packet, checks whether the destination address of this packet belongs to the address field that self has; If exceed the address field of self, then this packet is transmitted to the father node of self; If destination address belongs to the address field that self has, check the address field that belongs to which branch, continue relaying, up to finding destination address.
The route that Figure 5 shows that an inter-node communication is set up example, sends node F to when node I has packets need, Source=0x0071, and Destination=0x0041, data transfer procedure is as follows:
∈ [0x0071,0x0080], I sends this packet to father node H;
∈ [0x0061,0x0080], H sends this packet to father node B;
3, the through street by selection with create a mechanism
On the basis of tree-shaped Route Selection, node can in conjunction with ART table and the associated nodes table that periodically updates carry out the through street by selection and foundation, thereby shorten communication path, further reduce system power dissipation.As Fig. 6 be in inter-node communication the through street by example, solid line is represented original tree-shaped connection, dotted line connects adjacent node, makes the tree that is connected to become grid type of network.In the grid type tree, from each viewpoint of node independently, network still can be considered as tree-shaped, and any two nodes that couple together by grid are reciprocally regarded the other side's node as the child node of self.For example, the node K among Fig. 6 is considered as oneself child node to H, and vice versa.
Lift a simple example, the packet among Fig. 6 from M to I can directly transmit, and this is the child node that M is considered as I self.Source node M has packet to issue destination node I, and M finds the neighbor node that I is oneself earlier in the associated nodes table of oneself preserving, and just directly sets up the path of M-I.If do not have the through street by, then common path is M-L-K-J-A-B-H-I.
Five, route maintenance and repair mechanism
Network changes communications status over to after finishing the tasks such as distribution that networking is an address information.Under communications status, allow the adding of new node and because of node failure or the link small-scale network topology change that reason causes such as make mistakes.Reserve the address because each node all is assigned, cause small-scale network topology change can not contradict with the logical address LogID allocation rule of the whole network so the present invention can guarantee route maintenance and repair mechanism.
Concrete route maintenance and repair mechanism are as follows: the reparation state that enters behind the node failure is divided into two parts, a part be father node find own certain child node lost efficacy cause this child node with whole branch road when losing efficacy, the network reparation that father node carries out; Another part is a child node can't communicate by letter with the father node of oneself again the time, network self-healing and reparation that this child node need be carried out.
1. the route repair mechanism of father node:
Certain child node of finding oneself when father node lost efficacy, cause this child node with whole branch road all can't communicate by letter with father node again the time, initiate route repair by father node, the task that route repair need be finished mainly is the ART at its all superior nodes of deletion inefficacy branch road, the record in the associated nodes list item, avoids expired or invalid list item to cause Route Selection to make mistakes.Concrete steps as shown in Figure 7.
When a certain node application of inefficacy Zhi Luxiang networked, this node promptly as the target father node of inefficacy branch road, need be repaired this branch road, enables re-accessing network.Actual reservation number of addresses (Pre_Multiple-1) * Branch_Node according in the whole reservation address field (LogID)～(Pre_Last_ID) of the node number Invalid_Node on this inefficacy branch road, target father node self reservation number of addresses Pre_Multiple-1 and target father node divides different situations to handle.
1)Invalid_Node≤Pre_Multiple-1
Promptly when the node number of target father node self reservation number of addresses greater than the inefficacy branch road, the target father node is directly reserved whole nodes that the address is distributed to the inefficacy branch road successively with self, and the upstream nodes transmission step by step of the branch road information after will repairing, receive this information up to root node, upgrade network topology.
2)Pre_Multiple-1＜Invalid_Node≤(Pre_Multiple-1)×Branch_Node
Promptly when not enough distribution of the reservation address field of destination node self and the total number of addresses of its reservation of whole when enough distributing to whole node of inefficacy branch road, the target father node reports relative address information, adjust network topology table by root node, inefficacy branch road in the list item is added the target father node be with in the former branch road, and recomputate the reservation multiple for the new branch road after merging
New_Pre_Multiple。
New_Pre_Multiple＝Pre_Multiple×Branch_Node÷(Branch_Node+Invalide_Node)
Root node is according to new reservation multiple New_Pre_Multiple, give this new branch road deallocation according to the address allocation scheme in the networking process, upgrading former Pre_Multiple simultaneously is New_Pre_Multiple, the new branch road that the target father node is led receives new network topology table, obtains new address field information according to the method for preamble narration.
3)(Pre_Multiple-1)*Branch_Node＜Invalid_Node
Be the target father node with whole reservation address fields of branch road still less than the node number of inefficacy branch road, then the target father node step by step upstream nodes send this information, up to root node; Root node should the inefficacy branch road from the network topology table table section of former branch road place, be changed to new target father node in the network topology table with branch road, and the one-level node branch under the one-level node branch under the comparison object father node is number former with failure node number is divided into two kinds of situations processing:
A., if the two branch number links to each other, then root node root node under the situation that does not change former Pre_Multiple is given this two associated branch deallocations according to the address allocation scheme in the networking process, and the network topology table content after will repairing at last sends to the branch road of renewal respectively.Each interdependent node obtains address information mechanism according to the node in the networking process, upgrades self information.
B, if the two branch number links to each other, root node with the reservation address field of one-level node under the comparison object node whether greater than the total sum of the node of total node number this one-level node under and inefficacy branch road.Distribute inadequately if reserve address field, then root node gives out information and notifies inefficacy branch node access failure.Otherwise, root node recomputate this one-level node with the reservation address multiple New_Pre_Multiple of branch road, computational methods are with situation 2), then according to the address allocation scheme in the networking process, give the branch road deallocation after merging, the network topology table content after will repairing at last sends to the branch road of renewal respectively; Each interdependent node obtains address information mechanism according to the node in the networking process, upgrades self information;
2. the route repair mechanism of child node: when node can't be communicated by letter with the father node of oneself again, this child node need be carried out the self-healing and the reparation of network.
The route repair of child node is corresponding related with the route repair of father node, and the route repair mechanism of father node has solved the assignment problem of the logical address LogID of new access leg, and the route repair mechanism of child node considers mainly that then following task object gets final product:
Notify descendants's node to enter network and repair state;
The selection of father node, backup and access;
Receive the topology renewal that root node sends over, extract address information.
Different with the networking process is, renewal, the process that node obtains address information of network topology table were only limited to and needed the branch road repaired this moment, and other uncorrelated nodes do not carry out.When all descendants's nodes of repairing on the branch road all are re-assigned to LogID, and all parent nodes of this branch road have upgraded also that own ART shows and during the associated nodes table, the network reparation is finished.
If access network is unsuccessful, the temporary transient access network again of this child node then, this node will be notified the next stage child node of oneself, lead the branch road of oneself to enter the repair process of child node respectively by the next stage child node; Enter after the child node of access network then need wait for a period of time again again and go into net state at random, because after waiting for a period of time, after the child node self-healing success of own subordinate, this node is hopeful access network again.
It should be noted that, because the present invention initiatively selects father node in the process of node access network, and in several backup father nodes, repeatedly attempt networking, avoid missing the expection father node that other still have enough access capabilities, thereby avoid carrying out too much bunch division, cause the unbalanced of network topology structure.
Claims (2)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100097219A CN101420445B (en) | 2007-10-25 | 2007-10-25 | Fast routing protocol of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100097219A CN101420445B (en) | 2007-10-25 | 2007-10-25 | Fast routing protocol of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101420445A CN101420445A (en) | 2009-04-29 |
| CN101420445B true CN101420445B (en) | 2011-12-28 |
Family
ID=40631049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100097219A Expired - Fee Related CN101420445B (en) | 2007-10-25 | 2007-10-25 | Fast routing protocol of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101420445B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107659497A (en) * | 2017-11-03 | 2018-02-02 | 深圳天珑无线科技有限公司 | Method for repairing route and device |
Families Citing this family (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959218B (en) * | 2009-10-25 | 2013-04-17 | 苏州大学 | Method for detecting event region based on splay tree |
| CN101867920B (en) * | 2010-02-09 | 2013-02-13 | 利尔达科技有限公司 | Grading type wireless sensor networking method |
| CN101815287B (en) * | 2010-03-11 | 2013-05-15 | 北京交通大学 | Routing method and routing system for wireless sensor network based on tree network |
| CN102281134A (en) * | 2010-06-11 | 2011-12-14 | 中国移动通信集团公司 | Deployment method of logic nodes with subsequent backup relation and equipment thereof |
| CN101895957B (en) * | 2010-07-23 | 2012-11-21 | 浙江大学 | Random routing method facing matrix type wireless sensor network distribution weighing |
| CN102006607A (en) * | 2010-11-24 | 2011-04-06 | 中国科学技术大学苏州研究院 | Statistical method of group mobile nodes in wireless sensor network |
| CN102740390B (en) * | 2011-04-12 | 2015-01-28 | 中兴通讯股份有限公司 | Machine-to-machine/man (M2M) system and communication method thereof, M2M platform and terminal |
| CN102209033B (en) * | 2011-05-24 | 2013-08-28 | 哈尔滨工程大学 | Cluster-based routing method for wireless sensor networks |
| CN102404876B (en) * | 2011-12-23 | 2015-03-04 | 中国科学院微电子研究所 | Method and system for realizing wireless sensor network topological structure |
| CN102448138B (en) * | 2011-12-31 | 2014-04-09 | 重庆邮电大学 | Method for clustering hierarchical routing protocols of wireless sensor network |
| CN102595553A (en) * | 2012-02-27 | 2012-07-18 | 杭州星纬物联技术有限公司 | Management method of routing table of graded wireless sensor network |
| CN102647707B (en) * | 2012-03-29 | 2014-11-05 | 西安理工大学 | Cluster-based dynamic address distribution method |
| CN102647807A (en) * | 2012-05-03 | 2012-08-22 | 杭州云蝶科技有限公司 | Wireless sensor network based on hierarchical structure |
| CN102833333B (en) * | 2012-08-23 | 2015-01-28 | 华南理工大学 | Scalable network server group frame system |
| WO2014049762A1 (en) * | 2012-09-26 | 2014-04-03 | 富士通株式会社 | Communication apparatus, communication system and communication method |
| CN103974310B (en) * | 2014-05-08 | 2017-06-06 | 江苏中科羿链通信技术有限公司 | The tree topology construction method of radio communication multihop network equipment, device and system |
| CN104104746B (en) * | 2014-07-16 | 2017-11-10 | 苏州博联科技有限公司 | A kind of segmented address distribution method of wireless self-networking |
| CN105827488A (en) * | 2015-01-04 | 2016-08-03 | 济宁智城中科信息技术有限公司 | MESH network system applicable to smart home, networking method and communication method |
| CN105430735B (en) * | 2015-10-27 | 2019-08-13 | 中国船舶重工集团公司第七二二研究所 | A kind of acquisition methods and device of the information of wireless sensor acquisition |
| CN105721296A (en) * | 2016-02-23 | 2016-06-29 | 重庆邮电大学 | Method for improving stability of chain structure ZigBee network |
| CN106571967A (en) * | 2016-11-09 | 2017-04-19 | 上海斐讯数据通信技术有限公司 | Multi-level network topology management method and device |
| CN106535285A (en) * | 2016-12-09 | 2017-03-22 | 国网冀北电力有限公司电力科学研究院 | Communication method and device based on centralized wireless sensor network |
| CN108449274B (en) * | 2018-03-21 | 2019-11-05 | 常熟理工学院 | A kind of data-centered future network implementation method |
| CN109062074B (en) * | 2018-09-26 | 2019-10-18 | 宁波智轩物联网科技有限公司 | Smart home environment real-time management system |
| CN109474714A (en) * | 2018-11-16 | 2019-03-15 | 重庆邮电大学 | A Fast Query Method for Sensor Identification |
| CN110037005B (en) * | 2019-05-23 | 2023-10-31 | 北京中电慧声科技有限公司 | Bird repelling and attracting system and method based on MESH networking |
| CN112887116A (en) * | 2019-11-29 | 2021-06-01 | 伊姆西Ip控股有限责任公司 | Method, apparatus and article of manufacture for managing application nodes in a distributed application system |
| CN113518405B (en) * | 2020-04-09 | 2023-03-07 | 瑞昱半导体股份有限公司 | mesh network system |
| CN113747473B (en) * | 2021-09-01 | 2025-01-28 | 苏州佩林软件技术有限公司 | A self-organizing network method and self-organizing network system |
| CN113965506B (en) * | 2021-11-01 | 2023-02-28 | 南京熊猫汉达科技有限公司 | Gateway backup method and system |
| CN114465944B (en) * | 2022-02-16 | 2023-06-16 | 北京升哲科技有限公司 | Method, device, equipment and storage medium for updating node information |
| CN115174653B (en) * | 2022-07-07 | 2024-01-30 | 苏州磐联集成电路科技股份有限公司 | Node pairing method |
| CN115277435A (en) * | 2022-07-14 | 2022-11-01 | 曹蕤 | Multi-path network topology structure and routing method |
| CN117560737A (en) * | 2022-08-04 | 2024-02-13 | 华为技术有限公司 | Communication method and communication device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1659905A (en) * | 2002-06-06 | 2005-08-24 | 摩托罗拉公司(在特拉华州注册的公司) | Protocol and structure for mobile nodes in a self-organizing communication network |
-
2007
- 2007-10-25 CN CN2007100097219A patent/CN101420445B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1659905A (en) * | 2002-06-06 | 2005-08-24 | 摩托罗拉公司(在特拉华州注册的公司) | Protocol and structure for mobile nodes in a self-organizing communication network |
Non-Patent Citations (2)
| Title |
|---|
| Jienan Zhou et al..A Scalable Routing Protocol for Low Energy Wireless Sensor Networks.《Wireless,Mobile and Multimedia Networks,2006 IET International Conference》.2006,1-4. * |
| 王庆华 等.无线传感器开发系统的设计与实现.《电子技术应用》.2006,37-40. * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107659497A (en) * | 2017-11-03 | 2018-02-02 | 深圳天珑无线科技有限公司 | Method for repairing route and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101420445A (en) | 2009-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101420445B (en) | Fast routing protocol of wireless sensor network | |
| CN101420463B (en) | Wireless sensor network address allocation mechanism | |
| Yektaparast et al. | An improvement on LEACH protocol (Cell-LEACH) | |
| Lee et al. | Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree | |
| CN103415054B (en) | Hierarchical Routing Method Based on Distributed Wireless Convergence Network | |
| CN101652959A (en) | Device and method related to network management | |
| CN101119372B (en) | Cooperation energy-saving routing chart constructing method for mobile wireless sensor network | |
| CN102158812B (en) | Wireless Mesh network multicasting communication method of AC-AP (Access Controller-Access Point) framework | |
| CN102971988A (en) | Alternate down paths for directed acyclic graph (DAG) routing | |
| CN102469553B (en) | The cut-in method of a kind of wireless sensor network and system | |
| WO2008091725A1 (en) | Path optimization for mesh access points in a wireless mesh network | |
| CN102185749A (en) | Method for avoiding routing loop by adopting tree topology relationship | |
| CN102148756A (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN105557028A (en) | Dominating set identification for path computation based on directed acyclic graph membership | |
| CN103582065A (en) | Efficient ad hoc network routing method for wireless sensor network | |
| CN104283789A (en) | Routing convergence method and system | |
| CN101867920B (en) | Grading type wireless sensor networking method | |
| CN103068002A (en) | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network | |
| CN102685786B (en) | Method and system for accessing wireless sensor network (WSN) to telecommunication network | |
| Jan et al. | Dependability and reliability analysis of intra cluster routing technique | |
| CN110178410A (en) | A kind of communication path determines method and the network equipment | |
| CN108541039A (en) | A kind of power consumption wireless sensor network static node-routing method | |
| CN101651658A (en) | Method, device and system for cross-layer joint optimization in wireless Mesh network | |
| CN105992301A (en) | Ad hoc network system based on static formation clustering | |
| CN102404719A (en) | Automatic address configuration method for heterogeneous wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111228 Termination date: 20211025 |