CN102711209B - Dynamic self-organizing hierarchical routing method applied to wireless sensor network - Google Patents
Dynamic self-organizing hierarchical routing method applied to wireless sensor network Download PDFInfo
- Publication number
- CN102711209B CN102711209B CN201210178328.3A CN201210178328A CN102711209B CN 102711209 B CN102711209 B CN 102711209B CN 201210178328 A CN201210178328 A CN 201210178328A CN 102711209 B CN102711209 B CN 102711209B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- routing
- data
- broadcast
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a dynamic self-organizing hierarchical routing method. The method is applied to the tree topology structure of a wireless sensor network, the problems of path failure and data transmission incapability due to node mobility or failure are solved, and the topology structure of the network can be dynamically regulated. The network is established by adopting a multi-branch-tree-based topology structure, and each node maintains a routing table of one level, and records a sub-tree topology structure taking the node as a root. The routing table is effectively updated by inserting a sequence number during node access application, so that the problems of repeated node numbers in the routing table of upper-level nodes are solved. Only when data cannot be transmitted, the routing tables reorganize the topology structures, and timely maintain the topology structures in the network, so that energy overhead, computing overhead and data transmission real-time performance are combined, the reliable transmission of the data is ensured, the overhead is reduced, and the advantages of a routing protocol and a routed protocol are utilized.
Description
Technical field
The present invention relates to a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network.The method can overcome wireless sensor network interior joint and to lose efficacy the impact caused transfer of data, realizes the dynamic conditioning of network topology structure.The invention belongs to wireless sensor network technology field.
Background technology
Wireless sensor network (Wireless Sensor Network) is a kind of fully-distributed system of non-stop layer node.A large amount of sensor node by dense deployment in guarded region.These sensor nodes are integrated with transducer, data processing unit and communication module, and they are connected by wireless channel, and self-organizing ground forms network system.Microsensor technology and internodal wireless communication ability are that wireless sensor network imparts wide application prospect.As a kind of ubiquitous cognition technology, wireless sensor network is widely used in military affairs, environment, medical treatment, family and other commercial, industrial circles; In space exploration and the special field such as anti-terrorism, the disaster relief, it also has advantageous technical advantage.
Wireless sensor network is operated in certain physical environment, be subject to interfering with each other between wireless channel, wireless communication link off and on, accident cause network task load variations, equipment fault, the composite factor such as landform and weather impact, the network topology formed by wireless channel between sensor node may be changed at any time, and change mode and speed be all difficult to prediction.These changes often have a strong impact on the function of system, and this just requires that sensor node in time can adjust the communication work state of self along with the change of environment.
The tree topology agreement that wireless sensor network extensively adopts cannot effectively solve above-mentioned variation issue when running into node motion or losing efficacy, directly cause path failure, the situation that data cannot transmit, and part of nodes energy consumption can be caused excessive, the problems such as the useful life of influential system.For overall network, the accuracy of network monitor information, integrality and ageingly all will to be greatly affected.
Data-centered wireless sensor network, using the effective use of the energy as primary design object, is absorbed in and obtains effective information from the external world.The dynamic adjustment function of network topology structure of the present invention, effectively can reduce wireless sensor network interior joint and to lose efficacy the impact caused transfer of data.
Application number is 200710172037.2, and the applying date is that the domestic patent of invention on December 6th, 2007 discloses a kind of wireless self-networking for supervisory control system formation tree routing method.This method for routing can for mobile node communication provides the Routing Protocol of Route establishment and Dynamic Maintenance fast in wireless multi-hop network environment.This patent adopts the management of concentrated route table and stores, and be not suitable for the Sensor Network of single node limited ability, and the present invention adopts distributed routing table maintenance mechanism to make the application of this route on extensive Sensor Network become possibility.Compare this patent, the present invention, when father node is selected, abandons the minimum priority algorithm of simple way, and selects based on QoS network multi objective combination priority algorithm, can improve network communication quality.In addition, we have employed and are different from conventional active method for routing according to setting interval employing inquiry mode renewal routing table, also the method that traditional passive type route often needs to carry out route discovery is different from, just path is re-established when namely only there is mistake in a certain transmission link, and in order to reduce expense as far as possible, just there is the link that data cannot be transmitted, just re-establishing link, making data can continue to be able to normal transmission.And above-mentioned patent only sets forth the algorithm of Route establishment, do not set forth the solution of data when route transmission.
Application number is 201010265626.7, and the applying date is that the domestic application for a patent for invention on August 27th, 2010 discloses a kind of multipath routing protocols being applicable to wireless sensing network.This Routing Protocol adopts to alleviate the problems such as sensor network protocol time delay is large, network reliability is poor based on tree-shaped multipath routing protocols, adopts netted tree topology, improve the robustness of network.Process described by the method repairs routing table by multipath for subsequent use, is not suitable for the Sensor Network of single node limited ability, and the present invention selects based on QoS network multi objective combination priority algorithm, can further improve network communication quality.
Application number is 201110033643.2, and the applying date is that the domestic application for a patent for invention on January 31st, 2011 discloses a kind of method for routing based on tree-like wireless sensor network and device and sensor device.This method for routing is position in level residing in tree network according to each sensor node in advance and layer, is that sensor node distributes short address, improves with this route transmission efficiency that sensor node carries out in message repeating process.Be different from the present invention, the process need described by the method carries out data retransmission by the tree routing table preset, and does not relate to the repair function of routing table.
Summary of the invention
The technical problem to be solved in the present invention is, wireless sensor network interior joint move or lost efficacy and caused path failure data to transmit situation time, for network provides the method for a set of reorganization topological structure, effective reduction is above-mentioned common in wireless sensor network, make system data transmit affected problem, realize the dynamic conditioning of network topology structure.
In order to solve the problem, the technical solution used in the present invention is as follows:
The network that the present invention sets up is a kind of topological structure tree-shaped based on multi-fork.At the beginning of network is set up, all nodes in whole region are all without any the information of adjacent node.Now some specified nodes, can think aggregation node in sensor network, will initiate the broadcast of setting up network.The adjacent node receiving this broadcast will send the node of this broadcast as potential father node, and the request becoming its child node is sent to father node, represent and add successfully after feedback receiving father node, downward for continuation one deck is sent networking broadcast, search next node layer, by that analogy, until all nodes in region are all capped.
Each node i in whole network safeguards a routing table, routing table records with node i the topological structure of the subtree being root, and the topology of tree structure is being mapped as one-dimensional linear list according to the preorder traversal of multiway tree, so that is calculating and administering and maintaining in the limited node of storage capacity.Each node newly adding network, receiving after father node confirms its access network, will upwards report the information of new access node from level to level by clean culture, the node receiving this message is by the whole tree-like subnet that is root according to the location updating of this node access point with it.Thus set up hierarchy routing table.
In the network of reality, there is inter-node communication apart from factors such as not reciprocity and external interference, may cause occurring in network some problems, such as, father node can receive the access network application of new child node, but child node cannot receive the access pass signal that father node sends.In this case, in order to ensure two-way effective transmission of data, child node is by the broadcast by accepting other nodes or initiatively sending the information of seeking access network to set up set membership with other node.In this case, can produce two kinds may, does not but receive confirmation of receipt ACK as child node sends application to father node, then send request the application of access network to other node, and in fact father node have received application request; For another example after child node submits access network application to father node, father node feedback confirmation Response also thinks that child node receives, and in fact child node does not receive the confirmation message Response, and think that application is unsuccessful, then seek other access points.In above two kinds of situations, father node all using this child node as applying for successfully processing, and can report the routing table upgrading upper strata to upper layer node.And in fact this node have passed other nodes and carrys out access network, so just causes in the routing table of upper layer node and occurs the problem that node serial number repeats, and cause cannot be correct the suitable path of selection to transmit data.
We effectively upgrade routing table by inserting sequence number in the access application of node.As long as each node sends the application once accessed, the sequence number of its inside will add up.When connecting after node layer receives the information upgrading routing table, will judge to need the sequence number of node of renewal whether than the renewal in former routing table.If the subtree in former routing table headed by this node is then deleted in new path, refresh routing table according to the information upgraded.
Simultaneously, building topology structure dynamics organization mechanism of the present invention solves, in the wireless network running of reality, because a variety of causes causes the problem of data transmission fails, exceed transmission range after the node motion of such as down hop, node is abnormal and cause restarting or cause because of depleted of energy to lose efficacy.In order to ensure the transmitting of data, topological structure needs to reorganize.In order to take into account the real-time of energy and computing cost and transfer of data, the present invention adopts and is different from conventional active method for routing according to setting interval employing inquiry mode renewal routing table, also the method that traditional passive type route often needs to carry out route discovery is different from, the present invention just re-establishes path when only there is mistake in a certain transmission link, and in order to reduce expense as far as possible, just there is the link that data cannot be transmitted, just re-establish link, make data can continue to be able to normal transmission.
When data cannot be transmitted, topology restructuring is divided into two kinds of situations, and one is uplink, and one is downlink transfer.
The situation of transmitting uplink data comprises the data of collection to aggregation node (it is generally acknowledged the root node into whole tree) transmission, and when point-to-point transmission transmits data in a network, information not in the subtree being root with this node, and is sent to its father node etc. by destination node.In transmitting uplink data, the bust this of appearance has two kinds.The first is that next-hop node (namely father node) shifts out transmission range or inefficacy, thus causes data to transmit.Now, if bust this number of times has exceeded the threshold value of setting, then new father node has been found by broadcast, re-accessing network.The second is next-hop node owing to restart or other reasons lost routing iinformation, and cannot carry out data transmission.Then can upper hop node feeding back Error information when receiving data needs and forwarding.Now, the upper hop node receiving Error information also will look for new father node by broadcast.If each node in upstream transmission line does not all find the path arriving destination node in its routing table safeguarded, then the final packet forwarded will arrive at aggregation node, and produces abnormal information.
The situation of downlink data transmission comprises aggregation node and sends control information to other nodes in network, and when point-to-point transmission transmits data in a network, the subtree that it is root that destination node is arranged in this node, information will send to corresponding child node.The situation of two kinds of bust thiss is there will be equally in downlink data transmission.The first is that data cannot allow next-hop node (a certain child node of this node) receive.Now, as long as the number of times of bust this exceedes the threshold value of setting, then initiation broadcast is found by this node, will respond as long as store the node arriving destination node path, this node will select level at a distance of nearest node as child node, thus has repaired the path of having lost efficacy.If next-hop node is exactly destination node, and now destination node is lost, and cannot transmit data, then abnormal information be beamed back aggregation node.The second is that next-hop node (non-destination node) occurs abnormal and lost routing information equally.Then now will feed back Error information, then this node will find next-hop node by broadcast after receiving Error information, repair downlink path.
New node access network.In the network of a dynamic organization, the situation that the node failure not only in appearance script network exits also has the situation that new node supplements into.For one for sending sensing data to aggregation node and not yet adding network, there is not the node of any routing iinformation.First, this node searches the access point of adjacent node as network using by broadcast.After the reply obtaining adjacent node, select a certain node as access point, and set up set membership.The father node having new child node to access will be reported the information of new child node to upper strata and upwards upgrade successively.
The present invention utilizes the dynamic self-organization method for routing by different level of wireless sensor network, and the beneficial effect that can reach is as follows:
Occur in the tree topology that this method for routing extensively adopts mainly for the Routing Protocol of current wireless sensor network, node motion or inefficacy and the situation causing path failure data to transmit provide the method for a set of reorganization topological structure.This method for routing not only ensure that data more reliably can beam back aggregation node from sensor node, also achieve the mutual communication between arbitrary node in similar wireless self-organization network (Ad-Hoc Networks), and do not need all to forward through aggregation node, thus the energy hotspot alleviated near aggregation node consumes too fast problem.Simultaneously, due to the effective maintenance to routing table in network, make this method for routing can give full play to Active Routing Protocol in Active (Proactive Protocol) transmission delay short, the advantage that burst transfers of data rate is high, and routed protocol (Reactive Protocol) dynamic can be played to a certain extent by force by carrying out dynamic organization to topological structure, be not subject to the advantage of routing node failure effect.
Accompanying drawing explanation
Below in conjunction with drawings and Examples, the present invention is further described.
Fig. 1 is networking broadcast schematic diagram;
Node access network schematic diagram when Fig. 2 is networking;
Fig. 3 is node success access network schematic diagram;
Fig. 4 is the mutual communication scheme in subtree between member;
Fig. 5 is the chaotic schematic diagram of Route Selection;
Fig. 6 is routing table maintenance schematic diagram;
Fig. 7 is situation one schematic diagram of uplink failure;
Fig. 8 is situation two schematic diagram of uplink failure;
Fig. 9 is situation one schematic diagram of downlink transfer failure;
Figure 10 is situation two schematic diagram of downlink transfer failure;
The renewal schematic diagram of routing table when Figure 11 is new node access network.
Embodiment
Below in conjunction with accompanying drawing, the concrete example implemented is utilized to be described further.
Set up with different levels network topology structure and to set up the idiographic flow of routing table as follows:
Step 1: be first commonly referred to be aggregation node by the root node Node 1(set) initiate networking broadcast BroadForNet, see Fig. 1.The ID of root node is mainly comprised in broadcast packet, and number of plies level.
Step 2: receive BroadForNet message and the node not yet adding network using sending the node ID of this information as potential father node, and send JoinIn message to it, request becomes its child node to add network.If the method is applied to wireless sensor network, consider that sensor node restricts by energy, disposal ability is quite limited, process in shorter one section of time slot multiple child node to add application more difficult, especially when node density is larger.At this, each node after receiving BroadForNet by setting a period of time within the scope of random delay a period of time, then send JoinIn request, to avoid the situation of the intensive access of multiple node.
Step 3: the father node receiving child node application JoinIn message will beam back the feedback message of ReJoinIn, informs that whether the child node application of filing an application is successful.Can add some at this to judge, such as whether having exceeded the number of the child node that father node can be supported, is guaranteed qos, advises that this child node accesses other father node; Or the lqi quality received is too poor, lower than a certain threshold value etc., these can as the alternative condition whether setting up link.Sent the situation that the both sides' communication distance under actual conditions can be avoided not reciprocity by the bipartite information of this father and son's node, as long as ensure that set membership can be set up, both sides just can receive and send messages mutually.If child node application success, then the node sending NodeReport to upper layer node is reported message by this father node, receive the upper layer node of this information by the ID according to the newly added node comprised in NodeReport message, corresponding number of plies level, and the ID(parentID of its father node) upgrade the route sublist self safeguarded, until the root node of the superiors completes the renewal of routing table.As shown in Figure 2, node 5 just have received the successful message of application that node 3 is beamed back, and has accessed network.Node 3, after transmission ReJoinIn message, will upgrade the routing table of self, and sends NodeReport message to its father node (node 1).With posterior nodal point 1, according to this message node 3 in the routing table, that inserts the information of the node 5 of new access below.
Step 4: child node just enters the stage waiting for that father node is responded after sending JoinIn message.If the successful feedback information of the application receiving father node, it is reliably two-way for describing connection simultaneously, and add successfully, so node using this potential father node as the father node in up path and will forward BroadForNet broadcast to search for other neighbouring nodes.If do not receive the feedback (or have received the information adding failure) of potential father node, then node returns step 2, continues to enter the state waiting for access network.The JoinIn message that node 6 sends as can see from Figure 2 cannot allow node 3 receive, and therefore node 6 state to be accessed such as will to get back to, and has successfully accessed network after the BroadForNet broadcast receiving node 4, sees Fig. 3.
As can see from Figure 4, have recorded in each node with all members of its subtree being root node and topology information, the intercommunication mutually in subtree between all members can be realized.The routing table that lower level node is safeguarded is the subset of the table that upper layer node is safeguarded.Such as, node 5 will realize the communication between node 7, then first node 5 will search for the route subtree self safeguarded, do not find node 7, the packet including destination node ID is then sent to its father node, now namely carry out uplink, until arrive node 1, destination node 7 has appeared in the routing tree of node 1 maintenance, then start to carry out downlink transfer, to apart from node 4 forwarding data comprising destination node in the subtree in next level, final data bag is sent to destination node 7 by node 4.
The maintenance of routing table when node accesses again:
In actual networking process, situation shown in Fig. 5 may be there is, namely due to some uncertain factors, data are being sent as external environment condition or the while of having multiple node, cause data packet collision, reduce the impact of transmission range etc., the message causing node 3 to have received node 6 adding network, and node 6 cannot receive the return messages ReJoinIn of node 3.Now by continuing, node 6 waits for that the broadcast of other nodes is with access network, and node 3 thinks that node 6 has received and successfully added network, and the Ack provided in this explanation TinyOs is also unreliable.With posterior nodal point 3 by send to upper layer network NodeReport message report new node add situation.And in fact, after node 4 sends BroadForNet broadcast, just successfully passing through again node 4 at waiting node 6 and accessing network, and node 4 reports the situation of child node to upper layer node.The node 6 now will duplicated in node 1, can cause causing confusion during Route Selection like this.
The generation of this problem in actual conditions can be avoided well by introducing Seq mechanism.As shown in Figure 6, node 6 is being attempted using node 3 after his father's node failure, and inner Seq will increase, and report its Seq when setting up set membership with node 4, and the Seq of the node 6 newly added also reports by node 4 simultaneously.When there is the situation of duplicate node ID like this in the routing table of node 1, the size according to Seq has been upgraded routing table by node, whole the route subtree that to delete with original node 6 in table be root node, inserts node 6 in new position.Node 6 one records are only had to need to delete in this example.Then the message sending NodeDelete to all upper layer node (only having node 3 in this example) on old node 6 up path (in order to avoid multiple upper layer node repeats to send NodeDelete message, only has that node undermost in the node simultaneously comprising duplicate node 6 in subtree just to send this message downwards.Be node 1 in this example.If node 1 upper strata also has other nodes, although also will comprise the node 6 of repetition in these nodes simultaneously, they will only upgrade the routing table of self, and can not send downwards NodeDelete message.NodeDelete message will send downwards always, the route record of the node that each knot removal receiving this message is corresponding, and forwards until send to the father node of node 6 downwards), upgrade the record deleting its routing table interior joint 6.Because the transmission delay in network and people are for time delay is to avoid the situations such as message transition collision, upper layer node judges the newness degree in path according to the time order and function order receiving NodeReport and unreliable, namely node 6 may be slower than reaching the time by node 4 to the NodeReport message that node 1 sends to the NodeReport message that node 1 sends by node 3, therefore, the effective maintenance of routing table when node accesses again of Seq mechanism is introduced.
The dynamic organization of topological structure and the renewal of routing table when bust this:
Uplink:
As shown in Figure 7 (a), node 8 will transmit data to node 1, has occurred the situation (number of retransmissions exceedes setting threshold) of bust this in the uplink of data, then node 6 thinks that node 4 may beyond transmission range or lost efficacy.Now node 6 is by initiating the broadcast of BroadForParent, searches new access point.This broadcasting area covers 3 as we can see from the figure, 4,5,7,8 five nodes, and its interior joint 4 may lose efficacy and cannot communication, was not considered.By the ID with node in BroadForParent broadcast packet, the information such as the ID of its father node and the Level of node.Node 7, owing to finding that node 6 has common node of graph with it, does not therefore send the response of ReBroadForPa.And node 8 finds that node 6 is for its father node, does not therefore also respond.Can see that the node in another subtree outside node 4 meets the demands, and make feedback.For node 6, the feedback that it will receive from each node in one section of time slot, the node that prioritizing selection Level number is less, to reduce the jumping figure arriving aggregation node.Node 6 also will judge whether this application access node is in the subtree of oneself, in order to avoid there is the mistake that datacycle sends simultaneously.Can see that node 6 have received the feedback of node 3 and node 5 in this instance, and take the lead in attempting from node 3 re-accessing network, but node 3 cannot receive the solicitation message that it sends.Then node 6 reattempts access node 5, and applies for successfully.Now for node 5, it needs to judge self whether to also have enough memory spaces to hold the subtree of node 6, if conditions permit, then and the successful message of feedback application, and the routing table of the information updating upper layer node of NodeReport is sent to upper strata, join the path of node 6.And meanwhile, node 6 by together for sending the message of NodeUpdate in the subtree of root, with the Level information of more new node 8.Can see that the Level of now node 8 has become Level 4 from original Level 3.In addition, node 6 also will send the message of NodeReport to its father node (node 5), with the topology information of its subtree safeguarded of accusing, and upgraded successively to more top node by node 5.After node 1 receives the NodeReport message that node 6 accesses again, now delete to the information of the subtree headed by node 6 in original routing table and upgrade, the original father node (node 4) of the node 6 finally by NodeDelete message announcement deletes expired routing iinformation.Thus, the process of up path transmission interior joint topology restructuring is completed.Topological structure after restructuring as shown in Figure 7 (b) shows.
As shown in Figure 8 (a), if node 8 wants the transmitting uplink data being implemented to node 1 equally, but due to the appearance of node 4 unexpected, (now node 4 does not add network at all to lost all routing iinformations, do not know the information of its father node and all child nodes), and cannot data be transmitted.At this moment the node 6 of coming to transmission data is returned the error message of RouteTableError by node 4.Now node 6 is broadcasted with the BroadForParent that sends described in the example in Fig. 7, to be again connected into network.Same node 6 have received the feedback information from node 3 and node 5, and has successfully accessed node 3(because less compared with node 5 Level).Because node 6 accesses later again, Level is constant, so also do not need the information sending NodeUpdate, upgrades its Level information.Topological structure after restructuring as shown in Figure 8 (b) shows.Can predict, because node 4 lost routing information, so when its remaining child node, as node 7 need transmission data time, also will can receive the feedback information of the RouteTableError of node 4, thus by other node re-accessing network.
Downlink transfer:
As shown in Fig. 9 (a), node 5 will transmit data to node 8, but has occurred bust this in the transmitting procedure of node 1 to node 4.Now, node 1 thinks that node 4 cannot carry out communication, and delete the subtree being root with node 4, and send the broadcast of BroadForChild, find other and may know the node arriving node 8 path, in this example, namely node 6(node 6 may enter because of shift in position in the Radio transmission range of node 1).Now, each node receives the node of this broadcast will its routing table safeguarded of search, and the message that the information comprising node 6 in its routing table just can send SubtreeJoinIn is replied.And owing to being now descending propagation, only have Level to be greater than the node of node 1 just likely corresponding, if node 1 also exists father node, this father node can not make the response of SubtreeJoinIn.Node 1 will send the acknowledge message of a ReSubJoinIn after the whole stalk headed by it is set the message added by the request receiving node 6.The ID(that node 6 just changes its father node after receiving this acknowledge message by node 1 as its father node) and send NodeReport message to it, upgrade the routing table of upper layer node.Subsequently by sending the message of NodeUpdate to its child node, upgrade its Level information.Like this, along with the access again of node 6, repaired originally disconnect because node 4 goes wrong from node 5 to the data transmission path of node 8, new network topology structure is as shown in Figure 9 (b).
Lost because of fortuitous event the situation that there is information on road if there is node 4.Node 4 will return a RouteTableError information after receiving Data transmission request.Now node 1 is by the same for situation as previously mentioned, sends BroadForChild broadcast, repairs downlink path.See Figure 10.
The renewal of routing table during new node access network:
It is similar that new node adds the treatment mechanism after going wrong in the situation of network and uplink.As shown in figure 11, new node 9 needs access network under having the data-triggered needing to transmit.Now node 9 will initiate the broadcast of BroadForParent with the access point of finding nearby.If there is multiple node to respond, then the node choosing Level lower accesses, and have selected the node 7 that Level is 2, and send JoinIn message in this example, request access.After receiving the ReJoinIn message of node 7, become a full member of network, and start to transmit data.Upper layer node, after receiving NodeReport message, with the addition of the routing iinformation of new node 9 in its routing table.
Claims (8)
1. one kind is applicable to the dynamic self-organization method for routing by different level of wireless sensor network, it is characterized in that: based on wireless sensor network, the tree-shaped network topology structure by different level of multi-fork is adopted to carry out networking, each node in whole network safeguards a routing table, in order to record with the topological structure of this node subtree that is root, and the topology of tree structure is mapped as one-dimensional linear list according to the preorder traversal of multiway tree, so that calculating and administering and maintaining in the limited node of storage capacity, by inserting sequence number, routing table is effectively upgraded in the access application of node, only when there is the link that data cannot be transmitted, just carrying out topology restructuring by re-establishing link, when being included in transmitting uplink data failure, being set by frequency of failure threshold value, judge whether again to find father node, or feedback Error information is to aggregation node prompting abnormal information, when being included in downlink data transmission failure, set by frequency of failure threshold value, judge whether that broadcast is found, and repair failing path, or feedback Error information repairs downlink path, when new node supplements access network, search adjacent node by broadcast, select father node to set up set membership as after the access point of network, and lastest imformation is reported to upper strata.
2. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: based on wireless sensor network, adopt the tree-shaped network topology structure by different level of multi-fork, in a network node motion or inefficacy and the situation causing path failure data to transmit time, for network provides the method for a set of reorganization topological structure, realize the dynamic conditioning of network topology structure.
3. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 2, it is characterized in that: at the beginning of network is set up, the broadcast of setting up network is initiated by some specified nodes, the adjacent node receiving this broadcast will send time node of broadcast as potential father node, and the request becoming its child node is sent to father node, represent and add successfully after feedback receiving father node, continuation is sent networking broadcast to lower floor, search next node layer, by that analogy, until all nodes in region are all capped, complete networking.
4. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: each node newly adding network is receiving after father node confirms its access network, to upwards be reported the information of new access node from level to level by clean culture, the node receiving this message is by the whole tree-like subnet that is root according to the location updating of this node access point with it.
5. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: in the access application of node, insert sequence number routing table is effectively upgraded, namely sequence number is utilized to carry out maintaining routing list, as long as each node sends the application once accessed, the sequence number of its inside will add up; When connecting after node layer receives the information upgrading routing table, will judge to need the sequence number of node of renewal whether than the renewal in former routing table; If the subtree in former routing table headed by this node is then deleted in new path, refresh routing table according to the information upgraded.
6. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: during transmitting uplink data failure topology restructuring, if failure cause is next-hop node and father node, shift out transmission range or inefficacy, thus cause data to transmit, if then bust this number of times has exceeded the threshold value of setting, then find new father node by broadcast, re-accessing network; If failure cause is next-hop node owing to restart or other reasons lost routing iinformation, and data transmission cannot be carried out, then can upper hop node feeding back Error information when receiving data and needing to forward, now, the upper hop node receiving Error information also will look for new father node by broadcast, if each node in upstream transmission line does not all find the path arriving destination node in its routing table safeguarded, then the final packet forwarded will arrive at aggregation node, and produces abnormal information.
7. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: during downlink data transmission failure topology restructuring, if failure cause is that data cannot allow the next-hop node i.e. a certain child node of this node receive, now, as long as the number of times of bust this exceedes the threshold value of setting, then initiation broadcast is found by this node, as long as store the node arriving destination node path will respond, this node will select level at a distance of nearest node as child node, thus repaired the path of having lost efficacy, if next-hop node is exactly destination node, and now destination node is lost, data cannot be transmitted, then abnormal information is beamed back aggregation node, if failure cause is that next-hop node and the appearance of non-destination node lost routing information extremely, then now will feed back Error information, then this node will find next-hop node by broadcast after receiving Error information, repair downlink path.
8. a kind of dynamic self-organization method for routing being by different level applicable to wireless sensor network according to claim 1, it is characterized in that: for sending sensing data to aggregation node and not yet adding network, the new node that there is not any routing iinformation searches the access point of adjacent node as network by broadcast, after the reply obtaining adjacent node, select a certain node as access point, and set up set membership, the father node having new child node to access will be reported the information of new child node to upper strata and upwards upgrade successively, complete new node and supplement access network process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210178328.3A CN102711209B (en) | 2012-06-01 | 2012-06-01 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210178328.3A CN102711209B (en) | 2012-06-01 | 2012-06-01 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102711209A CN102711209A (en) | 2012-10-03 |
| CN102711209B true CN102711209B (en) | 2015-02-11 |
Family
ID=46903724
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210178328.3A Active CN102711209B (en) | 2012-06-01 | 2012-06-01 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102711209B (en) |
Families Citing this family (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984715B (en) * | 2012-12-11 | 2015-08-19 | 武汉邮电科学研究院 | The network-building method of wireless sensor network |
| CN103415053A (en) * | 2013-08-26 | 2013-11-27 | 招商局重庆交通科研设计院有限公司 | Wireless sensor network routing method used for side slope monitoring |
| CN104426733B (en) * | 2013-08-26 | 2019-04-23 | 中国科学院声学研究所 | A kind of networking of more Buoy networks and abnormality eliminating method under water |
| CN103763172A (en) * | 2013-12-31 | 2014-04-30 | 江苏宁克传感器科技有限公司 | Network topology building method |
| CN105282777A (en) * | 2014-07-14 | 2016-01-27 | 中兴通讯股份有限公司 | Mobile ad hoc network, center node dynamic selection method and center node |
| CN105634943B (en) * | 2014-11-04 | 2019-09-24 | 南京中兴软件有限责任公司 | Route computing method and device |
| CN105072663B (en) * | 2015-08-21 | 2018-09-25 | 北京岩与科技有限公司 | A kind of ad hoc network method based on low rate wireless network |
| CN105391794A (en) * | 2015-11-30 | 2016-03-09 | 国网江西省电力公司信息通信分公司 | Data storage method based on segmented memory |
| CN107633668B (en) * | 2016-07-19 | 2021-04-09 | 重庆无线绿洲通信技术有限公司 | Infrared communication method and device for battery management in Internet of vehicles |
| US20180062975A1 (en) * | 2016-08-23 | 2018-03-01 | Quantek, Inc. | Method of Packet Transmission in a Mesh Network |
| TWI604744B (en) | 2016-11-02 | 2017-11-01 | 財團法人工業技術研究院 | Routing method and wireless node for wireless mesh network |
| CN106789632A (en) * | 2017-02-25 | 2017-05-31 | 郑州云海信息技术有限公司 | A kind of method of the node-routing of large-scale distributed storage system |
| EP3721602B1 (en) * | 2018-01-04 | 2023-11-29 | Nanogrid Limited | Transport method in hierarchical data network |
| CN108541039B (en) * | 2018-04-24 | 2021-10-22 | 苏州市职业大学 | Low-power-consumption wireless sensor network static node routing method |
| CN109495384B (en) * | 2018-11-06 | 2021-03-02 | 中国联合网络通信集团有限公司 | Method and device for improving reliability of network routing |
| CN110062400B (en) * | 2019-04-25 | 2022-03-25 | 湖北经济学院 | Node linearization method with constraint on arbitrary two-dimensional and three-dimensional sensor network topology |
| CN110392408B (en) * | 2019-07-04 | 2021-02-26 | 东南大学 | Time-varying network topology control method and system based on node role and adjustable parameters |
| CN110493716B (en) * | 2019-08-21 | 2020-12-11 | 科航（苏州）信息科技有限公司 | Automatic deployment method and device for communication nodes |
| CN110839213B (en) * | 2019-10-25 | 2022-06-21 | 南京英锐祺科技有限公司 | Broadcasting method and system |
| CN112751890B (en) * | 2019-10-29 | 2023-05-05 | 贵州白山云科技股份有限公司 | Data transmission control method and device |
| CN110958323B (en) * | 2019-12-11 | 2023-08-29 | 厦门大洋通信有限公司 | Internet of things road device communication method |
| CN112055393B (en) * | 2020-08-03 | 2023-03-17 | 博流智能科技（南京）有限公司 | Zigbee large-scale routing method and system based on AI optimization |
| CN112134743B (en) * | 2020-10-19 | 2022-09-02 | 中国联合网络通信集团有限公司 | Parameter configuration method and device |
| CN113179509B (en) * | 2021-04-13 | 2023-08-29 | 珠海泰芯半导体有限公司 | Ad hoc network method and device based on WiFi, storage medium and wireless node |
| CN113596768A (en) * | 2021-06-16 | 2021-11-02 | 中国船舶重工集团公司第七一五研究所 | Unmanned cluster networking communication method |
| CN114125996A (en) * | 2021-11-25 | 2022-03-01 | 新华三技术有限公司成都分公司 | Network topology structure discovery method applied to 5G small station and electronic equipment |
| CN114430391A (en) * | 2021-12-23 | 2022-05-03 | 东莞市李群自动化技术有限公司 | Method, network system, device and storage medium for creating network domain |
| CN114205175A (en) * | 2022-02-19 | 2022-03-18 | 深圳市三江电气有限公司 | Self-checking modification system in multi-sensor sensing data transmission process |
| CN114726895B (en) * | 2022-04-02 | 2022-12-16 | 广西自贸区见炬科技有限公司 | Distributed thermoelectric conversion transmission optimization system of intelligent network connection |
| CN115550238B (en) * | 2022-08-30 | 2024-01-05 | 中盈优创资讯科技有限公司 | Topology realization method, device and equipment based on wireless network and IPV6 |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1625119A (en) * | 2004-12-09 | 2005-06-08 | 中国科学院软件研究所 | Routing method of pub/sub system on structural P2P network |
| CN101478836A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院计算技术研究所 | Adaptive route constructing method for wireless Ad Hoc network |
| CN101674631A (en) * | 2009-10-14 | 2010-03-17 | 南京邮电大学 | Multi-channel routing method based on minimum channel switching in self-organizing network |
| CN101841885A (en) * | 2009-03-19 | 2010-09-22 | 曹英晖 | Method for constructing wireless sensor network for periodical data transmission |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9083552B2 (en) * | 2007-05-28 | 2015-07-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Mobility plane architecture for telecommunications system |
-
2012
- 2012-06-01 CN CN201210178328.3A patent/CN102711209B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1625119A (en) * | 2004-12-09 | 2005-06-08 | 中国科学院软件研究所 | Routing method of pub/sub system on structural P2P network |
| CN101478836A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院计算技术研究所 | Adaptive route constructing method for wireless Ad Hoc network |
| CN101841885A (en) * | 2009-03-19 | 2010-09-22 | 曹英晖 | Method for constructing wireless sensor network for periodical data transmission |
| CN101674631A (en) * | 2009-10-14 | 2010-03-17 | 南京邮电大学 | Multi-channel routing method based on minimum channel switching in self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102711209A (en) | 2012-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102711209B (en) | Dynamic self-organizing hierarchical routing method applied to wireless sensor network | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| CN100442786C (en) | Tree structure based routing method | |
| CN101815287B (en) | Wireless sensor network routing method and system based on tree network | |
| CN106686659A (en) | AOMDV-based energy aware node-disjoint multipath routing algorithm | |
| CN102624621A (en) | Heterogeneous network adaptive data communication method and sensor network multi-protocol gateway | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN101374108A (en) | Routing method suitable for static state self-grouping formation | |
| CN105828404A (en) | Clustering routing method based on channel access heterogeneous wireless sensor network | |
| CN103037436B (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| CN114374721A (en) | Power line and wireless communication fusion method and system for power internet of things | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN110996266B (en) | Multicast group data transmission method of ad hoc network system | |
| KR100755709B1 (en) | Method for multicast routing using MPR set information | |
| CN102695192A (en) | Routing scheme for IPv6 wireless sensor network | |
| CN109309944B (en) | A kind of wireless multi-hop network topology discovery method | |
| CN110167095A (en) | A kind of mobile Ad-Hoc algorithm network routing based on Fermat point | |
| Kouvatsos et al. | Broadcasting methods in mobile ad hoc networks: an overview | |
| Gupta et al. | Cored-based tree with forwarding regions (cbt-fr); a protocol for reliable multicasting in mobile ad hoc networks | |
| Rabarijaona et al. | Hierarchical mesh routing implementation for indoor data collection | |
| Sun et al. | A distributed energy efficient and reliable routing protocol for wireless sensor networks | |
| Lipman et al. | Optimized flooding algorithms for ad hoc networks | |
| CN102573001B (en) | Routing protocol applicable to central type underwater acoustic multi-hop network | |
| Jun et al. | RLABP: A Receiver-deciding Location-Aided Broadcast Protocol for Mobile Ad Hoc Networks | |
| Adam | Performance enhancement of AODV over DSR on demand routing protocols-Aspect of packet salvaging in AODV |
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 |