CN101005422A - Method for establishing radio sensor network rout ebased on route neighbour list - Google Patents
Method for establishing radio sensor network rout ebased on route neighbour list Download PDFInfo
- Publication number
- CN101005422A CN101005422A CNA2006101648765A CN200610164876A CN101005422A CN 101005422 A CN101005422 A CN 101005422A CN A2006101648765 A CNA2006101648765 A CN A2006101648765A CN 200610164876 A CN200610164876 A CN 200610164876A CN 101005422 A CN101005422 A CN 101005422A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- routing
- neighbor
- route
- 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.)
- Granted
Links
Images
Abstract
The method comprises: a) after receiving the routing maintenances packet, the node maintains and updates its own routing neighbor list, and selects the neighbor nodes whose gradient value are less than its own gradient value and which have link symmetry from the updated routing neighbor list; the node compares the out-going degrees of the selected neighbor nodes, and takes the neighbor node with maximal out-going degree as the optimal next jump node; c) the node establishes the route between itself and the optimal next jump node.
Description
Technical field
The present invention relates to embedded system and wireless sensor network technology field, relate in particular to a kind of method of setting up the wireless sensor network route based on the routing neighbor table.
Background technology
Wireless sensor network (wireless sensor network) is by being deployed in the network system that cheap microsensor nodes a large amount of in certain zone constitutes.These sensor nodes its objective is perception collaboratively, collection and handle the interior target information of network's coverage area, and control or send to the observer by the network system of the self-organizing of an oriented mission of communication formation.
Wireless sensor network now has been regarded as the next developing direction in fields such as environmental monitoring, building monitoring, public utilities, Industry Control, family, boats and ships and transportation system's automation.The basic element of wireless sensor network is a sensor node.General wireless sensor node uses cheap low-power-consumption embedded chip, and the hardware resource of these chips is extremely limited, no matter is disposal ability, and bandwidth still is that memory capacity all is subjected to great restriction.These factors have all determined the routing algorithm of a large amount of calculating of the sort of needs or a large amount of memory spaces all to be not suitable for wireless sensor network.
Traditional wireless senser method for routing mainly contains following two kinds:
1, based on the method for flooded broadcast.Method based on flooded broadcast does not have tangible route maintenance procedure, and each node sends packet by the mode of broadcasting, and all nodes in its broadcast domain all can be received this packet, and adopts the mode of broadcasting to transmit this packet.This method for routing can only be used for small-scale network system, and for large-scale network, this method for routing can cause broadcast storm, causes network paralysis, and the flooded broadcast method is not high to bandwidth utilization, and the waste node energy.
2, based on the method for routing of routing table.In each node, all preserve the fullpath information of this node based on the method for routing of routing table to the sink node, and regular renewal routing table.This method needs a large amount of memory spaces to preserve these routing informations, and a large amount of information need be handled and exchange to maintaining routing list, and this is a white elephant to band-limited wireless sensor network.If certain node failure causes some path fracture, the node in the network is adjusted routing table automatically needs the long time.So for the mobile network, the support that this method can not provide.
Summary of the invention
(1) technical problem that will solve
In view of this, main purpose of the present invention is to provide a kind of and sets up the method for wireless sensor network route based on the routing neighbor table, and traditional wireless sensor network routing method expense is excessive, support node does not move and only support the problem of small scale network to solve.
(2) technical scheme
For achieving the above object, technical scheme of the present invention is achieved in that
A kind ofly set up the method for wireless sensor network route based on the routing neighbor table, this method comprises:
A, node receive the routing neighbor table of safeguarding and upgrade self behind the route maintenance bag, select Grad than neighbor node own little and that link is symmetrical in the routing neighbor table after renewal;
The out-degree of the neighbor node of B, the more described selection of node is with the neighbor node of the out-degree value maximum next-hop node as optimum;
C, node are set up the route between the next-hop node of self and described optimum.
Node described in the steps A receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and comprises: after node receives the route maintenance bag, check the neighbor node ID territory in self routing neighbor table, be included in the described neighbor node ID territory if send ID number of node of this route maintenance bag, then upgrade link quality information, territory between local node in self routing neighbor table and the neighbor node; Otherwise, carry out log-on operation, ID number of node that sends this route maintenance bag is recorded in the empty list item in self routing neighbor table neighbor node ID territory, and upgrades link quality information territory between local node in self routing neighbor table and the neighbor node.
The link quality information territory comprises between local node in described renewal self the routing neighbor table and the neighbor node: node is checked the routing neighbor table of the node of the transmission route maintenance bag that carries in the route maintenance bag, if be included in for the ID of node self number in the neighbor table of node of described transmission route maintenance bag, then the Radio Link between the node of this node and transmission route maintenance bag is symmetrical, is symmetry with link quality information domain identifier between local node in the corresponding list item and the neighbor node; Otherwise, be designated the information field of link-quality between local node and the neighbor node asymmetric.
Described node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises: the node gradient information that node carries the route maintenance bag records in the gradient field of neighbor node, and whether the node that judge to send the route maintenance bag is symmetrical with self, and judge that whether self Grad and the gradient difference that sends route maintenance packet node Grad are greater than 1, if satisfy above-mentioned two conditions simultaneously, the Grad of new node self more then is updated to self Grad and sends route maintenance packet node Grad and add 1.
Described node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises: the node that receives the route maintenance bag obtains the out-degree of sending node from the sending node out-degree information of the route maintenance bag that receives, and the out-degree of the sending node that obtains is recorded in the neighbor node out-degree territory of routing neighbor table.
If the route that node is set up is interrupted, then this method further comprises after step C: the node that monitors link down adopts broadcast mode to transmit packet, and the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives.
Described the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives and comprises: the 3rd node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet.
Described the 3rd node is at first selected optimum next-hop node according to the routing neighbor table when transmitting this packet, if also failed at this routing algorithm, then the 3rd node will adopt the mode of broadcasting to transmit this packet once more.
The mode of described employing broadcasting is transmitted packet and is further comprised:
The node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet; And/or
The packet that node will receive writes down, if receive same packet once more, then interception is fallen, and does not transmit; And/or
After node sent a packet, if the packet that should send is identical with certain packet in this nodal cache formation, then this node abandoned in self buffer queue and the identical packet of described transmission packet.
(3) beneficial effect
From technique scheme as can be seen, the present invention has following beneficial effect:
1, utilize the present invention, owing to adopted the method for local optimum, do not need to safeguard the network topological information of the overall situation, routing cost is smaller, has solved the excessive problem of routing cost in traditional routing algorithm.
2, utilize the present invention, owing to adopted node regularly to send the method for route maintenance bag, node can be real-time the network topological change information of acquisition part, routing algorithm by local optimum, adjustment route that can be real-time, therefore the scene that can support node moves has at a slow speed solved the not problem that moves of support node of existing wireless sensor network routing algorithm.
3, utilize the present invention, owing to used gradient, data adopt the mode of multi-hop to be sent to sink by the guide of gradient, and the scale of network can be very big, it is bad to have solved present stage wireless sensor network Routing Protocol extensibility, only supports the problem of small scale network.
4, utilize the present invention,, improved the reliability of network, solved the low problem of reliability in the wireless network sensor network owing in data packet transmission, used the ACK mechanism of MAC layer and the broadcast mechanism of route layer.
5, utilize the present invention, owing in route calculation, considered the characteristics of wireless channel, added the inspection of link symmetry, and the notion that has added the node out-degree obtains some network topological informations in the double bounce scope, improve the stability of the problem of routing link, solved the problem of the high and unstable properties of the route instability causes in the wireless senser networking packet loss.
6, utilize the present invention, owing to adopted wireless mode, avoided the inconvenience of adopting wired mode to bring, reduced cost, improved flexibility and convenience.
7, utilize the present invention, can use embedded cheaply micro-system to realize a wireless sensor network, this network can be used for environmental monitoring, automatic alarm system, application scenarios such as Smart Home.
Description of drawings
Fig. 1 is the schematic diagram that physical link asymmetry provided by the invention is described;
Fig. 2 is the schematic diagram that gradient network provided by the invention is described;
The schematic diagram of the flooded broadcast trunking method that Fig. 3 takes when rupturing for routed path provided by the invention;
Fig. 4 is a method flow diagram of setting up the wireless sensor network route based on the routing neighbor table provided by the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Core concept of the present invention is: preserve the topology information and the link information of network part by using the routing neighbor table, thought based on greedy algorithm, by separating of the information calculations local optimum in the routing neighbor table, obtain the optimum routed path of the overall situation by locally optimal solution.
Described routing neighbor table is the form of a minute book ground node information of neighbor nodes, the corresponding neighbor node of each list item, it mainly comprises four territories: link quality information, the gradient of neighbor node and the out-degree of neighbor node between neighbor node ID number, local node and the neighbor node.
Each node in the described network can periodically be broadcasted the route maintenance bag, and these route maintenance bags mainly comprise following information:
Each receives the node (comprising the sink node) of this route maintenance bag, at first check the neighbor node ID territory of each list item in oneself the routing neighbor table, if the ID that preserves in certain list item number and send the ID coupling of the node of this route maintenance bag, node that expression sends the route maintenance bag had been registered at local node.Need in this case the list item of coupling is carried out renewal work, local node is checked in the route maintenance bag neighbor node ID information of sending node incidentally, if the ID of local node number in the neighbor table of the node that sends the route maintenance bag, expression sends the node of route maintenance bag and received the route maintenance bag that local node sends, Radio Link between the node of this expression local node and transmission route maintenance bag is symmetrical, can be symmetry with " link quality information between local node and the neighbor node " domain identifier in the corresponding list item; If the ID of local node number is asymmetric with " information of link-quality between local node and the neighbor node " domain identifier then not in the neighbor table of the node that sends the route maintenance bag.
When list item that the ID that can not find and send the node of this route maintenance bag in the routing neighbor table of the node of receiving this route maintenance bag at oneself is complementary, need carry out log-on operation, local node finds the list item of a sky in the routing neighbor table of oneself in this case, ID number of node that sends this route maintenance bag is recorded in " neighbor node ID number " territory of this list item, the calculating in " link quality information between local node and the neighbor node " territory is adopted and top the same method.
The method of the value in aforementioned calculation " link quality information between local node and the neighbor node " territory is called the inspection of link symmetry.This inspection is very necessary, and wireless channel and wire message way are very different, and that is exactly an asymmetry.As shown in Figure 1, Fig. 1 is the schematic diagram that physical link asymmetry provided by the invention is described.The A node is in the communication range of B node, but the B node is not in the communication range of A node.Causing the reason of this asymmetry a lot, may be the problem on the hardware, different such as both sensitivity of antenna; May be the problem of energy, the node communication scope that electric weight is many wants big; Also might be the reason of position, same node be placed on communication distance on the desk certainly than being placed on big on the floor.No matter be the sort of reason, in Radio Link, the asymmetry of link is a very general phenomenon in a word, needs to consider clear in Project Realization.The symmetry of link can be improved the stability of route as a parameter of routing algorithm, strengthen the reliability of network.
" neighbor node ID number " territory and the maintenance process in " link quality information between local node and the neighbor node " territory, the next maintenance process in introduction " gradient of neighbor node " territory and its effect in the routing neighbor table have been introduced above.Gradient described here is the jumping figure of sensor node to the sink node in essence, and as shown in Figure 2, Fig. 2 is the schematic diagram that gradient network provided by the invention is described.The gradient of the sink node in the network remains 0, and gradient was set to infinity (can replace with a very big integer) when other sensor node was initial, and expression can not be directly and the sink node communication.
Each route maintenance bag is the gradient information of sending node incidentally all, the node that receives the route maintenance bag is at first by the link quality information between link symmetry inspection acquisition local node and the sending node, and safeguard in " neighbor node ID number " territory and " link quality information between local node and the neighbor node " territory to corresponding neighbor entry, simultaneously route maintenance bag node gradient information is incidentally recorded in " gradient of neighbor node " territory.
Just finished the maintenance work of simple neighbor node gradient to this, also needed to use the route maintenance bag of receiving further to calculate, to upgrade the Grad of local node.If it is littler than the Grad of local node to send the node Grad of route maintenance bag, and difference is greater than 1, and both links also are symmetrical simultaneously, and gradient of that expression local node need recomputate.Such as when network just brings into operation, node around the sink has been received the route maintenance bag of sink, and this moment, the gradient of local node was infinitely great, and the gradient that sends the node of route maintenance bag is 0, if both links are symmetrical, local node can change the gradient of oneself into 1 so.Receive once more and the route maintenance bag of sink node even link at this moment between the two is symmetrical, also do not carry out the renewal of gradient, if gradient is 1 node because the difference of gradient is not more than 1.If arrived in the jumping scope of sink but gradient is 2 node motion, after it received the route maintenance bag of sink, if check and find that link is symmetrical, it just changed the gradient of oneself into 1 so.Basic computing formula is:
if?Degree
receiver-Degree
sender＞1?then?Degree
receiver＝Degree
sender+1
The condition that above-mentioned formula is set up is that the node of transmission (sender) route maintenance bag and the link between reception (receiver) node are symmetrical, Degree
ReceiverThe gradient of expression receiving node (being local node), Degree
SenderExpression sends the gradient of the node of route maintenance bag.
If to send the node of (sender) route maintenance bag and the link between reception (receiver) node be asymmetric or do not satisfy gradient difference greater than 1 condition, so just do not carry out the gradient updating work of local node.
What introduce above is that node in the network is safeguarded the method for the gradient in network of oneself by receiving the route maintenance bag.Gradient is a parameter the most basic of network enabled operation in the routing algorithm that proposes of the present invention, and data spread to the sink node from high to low according to gradient.All carrying out in the life cycle that is maintained in whole network of gradient, owing to the reasons such as inefficacy of instability, channel disturbance and the node of wireless channel can cause the change of network topology, these can cause the change of node gradient.The problem on opportunity of the gradient after the employing that a problem that needs discussion now is a node is upgraded.Because the route maintenance bag is to send in the cycle, if receiving node is just revised the Grad of node after receiving each route bag, what neighbor node was preserved so is exactly the expired Grad of this node, and more appropriate way is the Grad enable renewal simultaneously in the routing iinformation of node broadcasts oneself after.
Introduce " out-degree of the neighbor node " territory of how to safeguard in the routing neighbor table below, the parameter value in " out-degree of neighbor node " territory directly obtains in " the sending node out-degree information " from the route maintenance bag.The notion of the out-degree of node is described here, and the out-degree of so-called node is the notion of using in the network graph theory, shows the ability of this node for data forwarding with the bar numerical table of the ejaculation line of node in the directed graph.
Each node all has next redirect that one or more neighbor nodes can be used as packet and sends out node, this node is many more, it is many more to be expressed as the lines of drawing from this node in directed graph, and this represents that this node out-degree is big more, and the data forwarding ability of node is strong more.When a node sends the route maintenance bag, it can search the routing neighbor table, those gradient ratios oneself are little, and and own between wireless link condition can be used as its next redirect for the node of symmetry and send out node, such node has severally what are with regard to the out-degree of representing this node, and these data are placed in the route maintenance bag as " sending node out-degree information ".Here the out-degree information of node also is an important parameter, can assess the link circuit condition of two scopes by its each node, and only use gradient and link symmetric information can only assess the link circuit condition of a jumping scope, so also can improve the stability of routing algorithm.
Top part has been introduced the structure of routing neighbor table, and how to set up and to safeguard the routing neighbor table by the route maintenance bag, introduces the algorithm that the data of using in the routing neighbor table are set up route below.The routing neighbor table can provide 4 information of all neighbor nodes around the node: neighbor node ID number; Link quality information between local node and the neighbor node; The gradient of neighbor node; The out-degree of neighbor node, routing algorithm use next redirect of the best of a node of this 4 data computation to send out the ID of node.Each node at first carries out the maintenance work of routing neighbor table after receiving the route maintenance bag that neighbor node sends, and safeguards that next redirect that can start calculating optimum the routing neighbor table of routing algorithm after upgrading after finishing sends out node ID, and computational process is as follows:
1), " gradient of neighbor node " territory and " link quality information between ground node and the neighbor node " territory in the routing neighbor table of local node inquiry oneself, those Grad are littler than oneself, and link be the symmetry neighbor node as potential next-hop node;
2), the node out-degree (can obtain) of these potential via nodes relatively by " out-degree of the neighbor node " territory of searching the routing neighbor table, with which node of node out-degree maximum next-hop node as optimum.
Certainly this selects the algorithm sink node of optimum next jumping not need operation.When node need be transmitted data, it will choose the next destination of optimum next-hop node as packet, and adopt the mode of clean culture that packet is transmitted to this optimum next-hop node, adopt the ACK handshake to guarantee that data transmit reliably simultaneously.Because all the gradient than local node is little for the gradient of optimum next-hop node, data will flow to low gradient node from the high gradient node, finally converge to the sink node.This process is a process of tabling look-up and comparing basically, and amount of calculation is very little, is well suited for the characteristics of wireless sensor network.
Owing to the reasons such as unsteadiness, node motion and node failure of wireless channel, the routed path that above-described routing algorithm is set up may interrupt.The schematic diagram of the flooded broadcast trunking method of taking when as shown in Figure 3, Fig. 3 ruptures for routed path provided by the invention.A is a data source, A calculates the best next-hop node of B for oneself according to the routing neighbor table of oneself, same B is by calculating the node of C for next jumping of the best of oneself, and after packet arrived C, the best next-hop node that possible C calculates oneself was D.But this moment, the district was full such as the D nodal cache owing to some reasons, can not receive data or because the influence of some barriers causes the link from C to D little logical, the link at C node place has just interrupted so.
In this case, traditional method has two kinds: the C node abandons these data or these data of C nodal cache and knows and find next suitable bar node.Before a kind of method can cause bigger packet loss, a kind of method in back can influence the response speed of network to emergency data, this is not the requirement of efficient, the reliable and real-time that will reach with the present invention.
What adopt among the present invention is other a kind of method.This method is noticed in the time of network generation link down, although can not find next bar reliably by routing algorithm based on the routing neighbor table, but do not represent this node just and the sink node isolated, can allow and the node of own same gradient or gradient ratio oneself is low but the asymmetric node of link mutually is transmitted this packet, can get around like this zone that link ruptures takes place.
When node adopts this pass-through mode, adopt broadcast mode, the node that does not need under this mode to receive sends the ACK handshake, is a kind of unwarranted data forwarding mode.This processing method has been done a compromise in reliability with above the response time, and because broadcasting adopts is the mode of one-to-many, reliability can guarantee to some extent.
This method at the broadcasting relaying that takes place to adopt when routing algorithm lost efficacy is very important replenishing to the route algorithm.Receive the node of the data of transmitting with broadcast mode, at first check and oneself whether meet the condition that receives this packet (require its gradient can not greater than the gradient of the node that sends this packet), if just do not meet directly with data packet discarding, if meet just this packet of needs forwarding, node is at first selected optimum next-hop node according to the routing neighbor table when transmitting, if also failed at this routing algorithm, this node will adopt the mode of broadcasting to transmit this packet once more so.The method of broadcasting relaying is very important the assisting of of routing algorithm, is an important guarantee that realizes reliability, stability and the real-time of network.
Adopting the shortcoming of a maximum of broadcasting relaying is exactly to bring the redundancy of mass data bag, this is especially severe in unstable networks, and a large amount of redundant data packets can cause broadcast storm in network, further reduce the performance of network, taked 3 kinds of methods to eliminate of the influence of these adverse factors in this invention network:
1), use gradient to reduce the number of forward node;
After node adopted the mode of broadcasting to send data, the node of receiving this packet will check that earlier the gradient whether gradient of the node of giving out a contract for a project is not less than oneself refers to, if receive this packet and forwarding so, otherwise abandon this packet.
2), use the forwarding registration form to avoid transmitting same packet;
The packet that each node will receive writes down, if receive same packet once more, can tackle, and does not transmit.
3), adopt corresponding strategies to abandon the forwarding packet of buffer memory.
Because radio communication channel, each node is when sending data, and the node in its broadcast domain all can be received this packet, has opened up a special channel at the mac layer, can receive all packets of node transmission on every side by this passage.If there is a node to send a packet, and this packet is identical with certain packet in the local node buffer queue, and local node is with this data packet discarding in the buffer queue so.
By above-mentioned these 3 kinds of mechanism, can well reduce broadcast data packet, effectively avoid broadcast storm.
The method for routing that the present invention proposes is the method for routing of a mixed type, comprise the broadcasting trunking method of using the routing neighbor table to set up optimal path and when fracture takes place the routed path that takes place to be set up by the former, take, the method for routing of this mixed type can finely be applied in the large-scale network, and can be good at guaranteeing reliability and real-time, simultaneously can support node move.Whole invention is divided into two parts:
1), sets up optimal path based on the routing neighbor table.Setting up optimal path based on the routing neighbor table is core of the present invention, and it adopts greedy algorithm to select optimum next-hop node as standby relay station for each node based on the thought of local optimum.Can realize the transmission of packet from the source to sink by the path that the routing neighbor table is set up, be used the ACK mechanism of MAC layer simultaneously, realize the reliable transmission of packet.Because the regular transmission route maintenance bag of node, node can the tracking network topology change, therefore the routing algorithm of the present invention's proposition is applicable to the sensor network that node low speed moves, and owing to adopted the method for local optimum, the overall situation topology that does not need maintaining network, reduce the expense of a large amount of routes, reduced power consumption.When node need send data, can find next jumping relaying forward node reliably at once, need not to seek the stage of route, improve the real time response speed of network.The routing algorithm that the present invention proposes can adapt to the network of any scale, and unique restriction is space, address of node and bandwidth.
2), the householder method of broadcasting relaying.The broadcasting relaying is 1) one auxiliary, when 1) the method failure after, node can automatically be enabled the method for broadcasting relaying, can reach low delay like this, the purpose of high reliability.This is auxiliary to be necessary, is an important guarantee of network reliability.
Based on the realization principle of the invention described above, be described in further detail this method of setting up the wireless sensor network route based on the routing neighbor table provided by the invention below in conjunction with concrete method flow diagram.
As shown in Figure 4, Fig. 4 sets up the method flow diagram of wireless sensor network route for provided by the invention based on the routing neighbor table, and this method may further comprise the steps:
Step 401: node receives the routing neighbor table of safeguarding and upgrade self behind the route maintenance bag, selects Grad than neighbor node own little and that link is symmetrical in the routing neighbor table after renewal;
Step 402: the out-degree of the neighbor node of the more described selection of node, with the neighbor node of out-degree value maximum next-hop node as optimum;
Step 403: node is set up the route between the next-hop node of self and described optimum.
Node described in the above-mentioned steps 401 receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and comprises: after node receives the route maintenance bag, check the neighbor node ID territory in self routing neighbor table, be included in the described neighbor node ID territory if send ID number of node of this route maintenance bag, then upgrade link quality information territory between local node in self routing neighbor table and the neighbor node; Otherwise, carry out log-on operation, ID number of node that sends this route maintenance bag is recorded in the empty list item in self routing neighbor table neighbor node ID territory, and upgrades link quality information territory between local node in self routing neighbor table and the neighbor node.
The link quality information territory comprises between local node in above-mentioned renewal self the routing neighbor table and the neighbor node: node is checked the routing neighbor table of the node of the transmission route maintenance bag that carries in the route maintenance bag, if be included in for the ID of node self number in the neighbor table of node of described transmission route maintenance bag, then the Radio Link between the node of this node and transmission route maintenance bag is symmetrical, is symmetry with link quality information domain identifier between local node in the corresponding list item and the neighbor node; Otherwise, be designated the information field of link-quality between local node and the neighbor node asymmetric.
Above-mentioned node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises: the node gradient information that node carries the route maintenance bag records in the gradient field of neighbor node, and whether the node that judge to send the route maintenance bag is symmetrical with self, and judge that whether self Grad and the gradient difference that sends route maintenance packet node Grad are greater than 1, if satisfy above-mentioned two conditions simultaneously, the Grad of new node self more then is updated to self Grad and sends route maintenance packet node Grad and add 1.
Above-mentioned node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises: the node that receives the route maintenance bag obtains the out-degree of sending node from the sending node out-degree information of the route maintenance bag that receives, and the out-degree of the sending node that obtains is recorded in the neighbor node out-degree territory of routing neighbor table.
If the route that node is set up is interrupted, then this method further comprises after step 403: the node that monitors link down adopts broadcast mode to transmit packet, and the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives.
Above-mentioned the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives and comprises: the 3rd node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet.
Above-mentioned the 3rd node is at first selected optimum next-hop node according to the routing neighbor table when transmitting this packet, if also failed at this routing algorithm, then the 3rd node will adopt the mode of broadcasting to transmit this packet once more.
The mode of above-mentioned employing broadcasting is transmitted packet and further comprised: the node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet; And/or
The packet that node will receive writes down, if receive same packet once more, then interception is fallen, and does not transmit; And/or
After node sent a packet, if the packet that should send is identical with certain packet in this nodal cache formation, then this node abandoned in self buffer queue and the identical packet of described transmission packet.
Set up the method flow diagram of wireless sensor network route based on Fig. 4 is described based on the routing neighbor table, set up the method for wireless sensor network route and further describe the present invention is based on the routing neighbor table below in conjunction with specific embodiment.
Embodiment
The present invention is to provide and a kind ofly set up the method for wireless sensor network route based on the routing neighbor table, only the node of this agreement of operation need be spilt at random cloth in the zone of being concerned about, node i.e. the view of operation power automatically, sets up network.
It should be noted that these ID numbers of spilling the node of cloth in a zone can not be identical, will guarantee that simultaneously the amount of information of network can not surpass the effective bandwidth that node is supported, this can realize by the restriction interstitial content.After finishing, these work just can receive the data of each node at the sink node.
In the present embodiment, the network of forming with 8 nodes describing among Fig. 2 is introduced the running of network route method in detail:
1,8 all nodes is opened, the sink node is placed on appointed positions (generally being the user control room), other 7 nodes at random spill cloth around sink, final result as shown in Figure 2, A, B are in the communication range of sink, and C is in the communication range of A, and D is in the communication range of B, E is in the communication range of C, and F, G are in the communication range of D.
2, these 8 nodes periodically send the route maintenance bag separately, receive that the principle that the node of route bag was said according to the front carries out the maintenance of routing neighbor table, receive the route maintenance bag of A for the first time such as sink after A is registered in the routing neighbor table of oneself, received the route maintenance bag of sink after this as A, link check judges that back affirmation link is symmetrical, A just is made as 1 with the gradient of oneself so, and B also is made as 1 through same process with oneself gradient.A receives after the route maintenance bag of C for the first time, also C is registered in the routing neighbor table of oneself, and after this, after C received that the route bag of A is safeguarded bag, link check judged that back affirmation link is symmetrical, and C just is made as 2 with the gradient of oneself so.Same process finally can be set up network as shown in Figure 2, and the gradient of node and routing neighbor table are also just set up.
3, use information in the routing neighbor table, the operation routing algorithm obtains optimum next and jumps, packet according to after calculating to next-hop node transmit well.
Above-described specific embodiment; purpose of the present invention, technical scheme and beneficial effect are further described; institute is understood that; the above only is specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any modification of being made, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1, a kind ofly set up the method for wireless sensor network route, it is characterized in that this method comprises based on the routing neighbor table:
A, node receive the routing neighbor table of safeguarding and upgrade self behind the route maintenance bag, select Grad than neighbor node own little and that link is symmetrical in the routing neighbor table after renewal;
The out-degree of the neighbor node of B, the more described selection of node is with the neighbor node of the out-degree value maximum next-hop node as optimum;
C, node are set up the route between the next-hop node of self and described optimum.
2, according to claim 1ly set up the method for wireless sensor network route based on the routing neighbor table, it is characterized in that, node described in the steps A receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and comprises:
After node receives the route maintenance bag, check the neighbor node ID territory in self routing neighbor table, be included in the described neighbor node ID territory if send ID number of node of this route maintenance bag, then upgrade link quality information territory between local node in self routing neighbor table and the neighbor node; Otherwise, carry out log-on operation, ID number of node that sends this route maintenance bag is recorded in the empty list item in self routing neighbor table neighbor node ID territory, and upgrades link quality information territory between local node in self routing neighbor table and the neighbor node.
3, according to claim 2ly set up the method for wireless sensor network route, it is characterized in that the link quality information territory comprises between local node in described renewal self the routing neighbor table and the neighbor node based on the routing neighbor table:
Node is checked the routing neighbor table of the node of the transmission route maintenance bag that carries in the route maintenance bag, if be included in for the ID of node self number in the neighbor table of node of described transmission route maintenance bag, then the Radio Link between the node of this node and transmission route maintenance bag is symmetrical, is symmetry with link quality information domain identifier between local node in the corresponding list item and the neighbor node; Otherwise, be designated the information field of link-quality between local node and the neighbor node asymmetric.
4, according to claim 2ly set up the method for wireless sensor network route based on the routing neighbor table, it is characterized in that, described node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises:
The node gradient information that node carries the route maintenance bag records in the gradient field of neighbor node, and whether the node that judge to send the route maintenance bag is symmetrical with self, and judge that whether self Grad and the gradient difference that sends route maintenance packet node Grad are greater than 1, if satisfy above-mentioned two conditions simultaneously, the Grad of new node self more then is updated to self Grad and sends route maintenance packet node Grad and add 1.
5, describedly set up the method for wireless sensor network route based on the routing neighbor table according to claim 2 or 4, it is characterized in that, described node receives the routing neighbor table of safeguarding behind the route maintenance bag and upgrading self and further comprises:
The node that receives the route maintenance bag obtains the out-degree of sending node from the sending node out-degree information of the route maintenance bag that receives, the out-degree of the sending node that obtains is recorded in the neighbor node out-degree territory of routing neighbor table.
6, base according to claim 1 is set up the method for wireless sensor network route based on the routing neighbor table, it is characterized in that, if the route that node is set up is interrupted, then this method further comprises after step C:
The node that monitors link down adopts broadcast mode to transmit packet, and the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives.
7, according to claim 6ly set up the method for wireless sensor network route, it is characterized in that described the 3rd node that receives the packet of transmitting with broadcast mode continues to transmit the packet that receives and comprises based on the routing neighbor table:
The 3rd node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet.
8, the method for setting up the wireless sensor network route based on the routing neighbor table according to claim 7, it is characterized in that, described the 3rd node is when transmitting this packet, at first select optimum next-hop node according to the routing neighbor table, if also failed at this routing algorithm, then the 3rd node will adopt the mode of broadcasting to transmit this packet once more.
9, describedly set up the method for wireless sensor network route according to claim 6 or 8, it is characterized in that the mode of described employing broadcasting is transmitted packet and further comprised based on the routing neighbor table:
The node that receives the packet of transmitting with broadcast mode checks that self Grad is whether smaller or equal to the Grad of the node that sends this packet, if then transmit this packet; Otherwise, abandon this packet; And/or
The packet that node will receive writes down, if receive same packet once more, then interception is fallen, and does not transmit; And/or
After node sent a packet, if the packet that should send is identical with certain packet in this nodal cache formation, then this node abandoned in self buffer queue and the identical packet of described transmission packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101648765A CN100446496C (en) | 2006-12-07 | 2006-12-07 | Method for establishing radio sensor network rout ebased on route neighbour list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101648765A CN100446496C (en) | 2006-12-07 | 2006-12-07 | Method for establishing radio sensor network rout ebased on route neighbour list |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101005422A true CN101005422A (en) | 2007-07-25 |
| CN100446496C CN100446496C (en) | 2008-12-24 |
Family
ID=38704302
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101648765A Active CN100446496C (en) | 2006-12-07 | 2006-12-07 | Method for establishing radio sensor network rout ebased on route neighbour list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100446496C (en) |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010043086A1 (en) * | 2008-10-17 | 2010-04-22 | 智格网信息科技(成都)有限公司 | Routing method for supporting fast network topology change and low protocol cost |
| CN101170500B (en) * | 2007-10-31 | 2010-07-28 | 北京航空航天大学 | Hierarchical routing method based on different power network card |
| CN101296180B (en) * | 2008-06-19 | 2010-11-10 | 上海交通大学 | Wireless Mesh network self-adapting routing method based on throughput performance |
| CN101902795A (en) * | 2010-06-21 | 2010-12-01 | 利尔达科技有限公司 | Wireless sensor network diffusion routing algorithm based on connection |
| CN101917752A (en) * | 2010-08-06 | 2010-12-15 | 东华大学 | Convergent routing method of wireless sensor network based on Pareto optimum paths |
| CN102036334A (en) * | 2009-09-30 | 2011-04-27 | 北京中能普瑞技术有限公司 | Routing control method of radio sensor network for mine |
| CN102036173A (en) * | 2009-09-28 | 2011-04-27 | 华为技术有限公司 | Method and device for wireless network data transmission |
| CN101483591B (en) * | 2009-02-19 | 2011-07-27 | 中国人民解放军信息工程大学 | Route implementing method and route generating apparatus |
| CN101471864B (en) * | 2007-12-28 | 2011-10-05 | 中国科学院软件研究所 | Data forwarding method based on receiver route in wireless self-organizing network |
| CN101645829B (en) * | 2008-08-07 | 2011-11-16 | 中国科学院计算技术研究所 | Method and system for forwarding network data by wireless sensor |
| CN101282353B (en) * | 2008-04-11 | 2012-04-04 | 中山大学 | Method for implementing efficiency route protocol for wireless sensor network based on cost function |
| CN101860981B (en) * | 2010-02-05 | 2012-07-04 | 深圳先进技术研究院 | Routing method and system of wireless sensor network |
| CN102595392A (en) * | 2011-11-15 | 2012-07-18 | 吴晓平 | Information processing method based on environmental benefit monitoring sensing network and system and device adopting same |
| CN102612110A (en) * | 2012-03-02 | 2012-07-25 | 浙江大学 | Distributive self-organized routing method in electric carrier wave illumination control system |
| CN102970233A (en) * | 2012-11-22 | 2013-03-13 | 华为技术有限公司 | Method, apparatus and device for acquiring route, concentrator and system |
| CN103037435A (en) * | 2012-12-21 | 2013-04-10 | 南京邮电大学 | Wireless sensor network route protocol |
| US8462650B2 (en) | 2008-10-17 | 2013-06-11 | Skyphy Networks Limited | Methods for supporting rapid network topology changes with low overhead costs and devices of the same |
| CN104009927A (en) * | 2014-03-07 | 2014-08-27 | 浙江工商大学 | Cooperative broadcasting method based on distance in mobile Ad Hoc network |
| CN104869603A (en) * | 2015-05-08 | 2015-08-26 | 中山大学 | ZigBee routing method suitable for wireless monitoring and controlling network |
| CN105553841A (en) * | 2015-12-11 | 2016-05-04 | 武汉兴图新科电子股份有限公司 | High-efficiency distributed intelligent routing method capable of effectively preventing signaling storm |
| WO2017049513A1 (en) * | 2015-09-23 | 2017-03-30 | 华为技术有限公司 | Packet processing method, network device, and system |
| CN106792257A (en) * | 2016-11-22 | 2017-05-31 | 北京大米科技有限公司 | Method and device, method for routing and device for Streaming Media forwarding |
| CN107872806A (en) * | 2016-09-23 | 2018-04-03 | 富士通株式会社 | Routing node position selecting method, device and terminal device |
| CN105516000B (en) * | 2015-12-03 | 2018-09-25 | 南京邮电大学 | A kind of stability and high efficiency adaptive routing method in wireless mobile Mesh network |
| CN108777871A (en) * | 2018-08-13 | 2018-11-09 | 常熟理工学院 | A kind of implementation method of next generation's sensor network communication system |
| CN109673033A (en) * | 2019-02-22 | 2019-04-23 | 浙江树人学院（浙江树人大学） | The data routing method of the mobile sparse wireless sense network of three-dimensional |
| CN109862077A (en) * | 2019-01-03 | 2019-06-07 | 南京海兴电网技术有限公司 | Based on Internet of Things communication with container technique with electrical equipment management method |
| WO2019128905A1 (en) * | 2017-12-29 | 2019-07-04 | 阿里巴巴集团控股有限公司 | Network communication method and device |
| CN110167097A (en) * | 2019-04-22 | 2019-08-23 | 北京邮电大学 | Mobile robot transistroute scheme based on weighted metric forwarding and path planning |
| CN111277304A (en) * | 2020-01-20 | 2020-06-12 | 大唐联诚信息系统技术有限公司 | Unicast transmission method and system based on multi-relay cooperation |
| CN113923803A (en) * | 2021-10-13 | 2022-01-11 | 吉林大学 | Directional escape routing method based on node address book difference set operation |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7006453B1 (en) * | 2000-03-14 | 2006-02-28 | Lucent Technologies Inc. | Location based routing for mobile ad-hoc networks |
| US7035207B2 (en) * | 2002-06-05 | 2006-04-25 | Eka Systems, Inc | System and method for forming, maintaining and dynamic reconfigurable routing in an ad-hoc network |
| EP1499075A1 (en) * | 2003-07-14 | 2005-01-19 | Samsung Electronics Co., Ltd. | Route update protocol for a wireless sensor network |
| KR20060006583A (en) * | 2004-07-16 | 2006-01-19 | 아주대학교산학협력단 | Directional flooding method in wireless sensor networks |
| US7519034B2 (en) * | 2004-09-28 | 2009-04-14 | Motorola, Inc. | Method and apparatus for channel assignment within ad-hoc communication system |
-
2006
- 2006-12-07 CN CNB2006101648765A patent/CN100446496C/en active Active
Cited By (47)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170500B (en) * | 2007-10-31 | 2010-07-28 | 北京航空航天大学 | Hierarchical routing method based on different power network card |
| CN101471864B (en) * | 2007-12-28 | 2011-10-05 | 中国科学院软件研究所 | Data forwarding method based on receiver route in wireless self-organizing network |
| CN101282353B (en) * | 2008-04-11 | 2012-04-04 | 中山大学 | Method for implementing efficiency route protocol for wireless sensor network based on cost function |
| CN101296180B (en) * | 2008-06-19 | 2010-11-10 | 上海交通大学 | Wireless Mesh network self-adapting routing method based on throughput performance |
| CN101645829B (en) * | 2008-08-07 | 2011-11-16 | 中国科学院计算技术研究所 | Method and system for forwarding network data by wireless sensor |
| US8462650B2 (en) | 2008-10-17 | 2013-06-11 | Skyphy Networks Limited | Methods for supporting rapid network topology changes with low overhead costs and devices of the same |
| WO2010043086A1 (en) * | 2008-10-17 | 2010-04-22 | 智格网信息科技(成都)有限公司 | Routing method for supporting fast network topology change and low protocol cost |
| CN101483591B (en) * | 2009-02-19 | 2011-07-27 | 中国人民解放军信息工程大学 | Route implementing method and route generating apparatus |
| CN102036173B (en) * | 2009-09-28 | 2013-06-12 | 华为技术有限公司 | Method and device for wireless network data transmission |
| CN102036173A (en) * | 2009-09-28 | 2011-04-27 | 华为技术有限公司 | Method and device for wireless network data transmission |
| CN102036334A (en) * | 2009-09-30 | 2011-04-27 | 北京中能普瑞技术有限公司 | Routing control method of radio sensor network for mine |
| CN101860981B (en) * | 2010-02-05 | 2012-07-04 | 深圳先进技术研究院 | Routing method and system of wireless sensor network |
| CN101902795B (en) * | 2010-06-21 | 2012-10-03 | 利尔达科技有限公司 | Wireless sensor network diffusion routing algorithm based on connection |
| CN101902795A (en) * | 2010-06-21 | 2010-12-01 | 利尔达科技有限公司 | Wireless sensor network diffusion routing algorithm based on connection |
| CN101917752A (en) * | 2010-08-06 | 2010-12-15 | 东华大学 | Convergent routing method of wireless sensor network based on Pareto optimum paths |
| CN101917752B (en) * | 2010-08-06 | 2013-11-13 | 东华大学 | Convergent routing method of wireless sensor network based on Pareto optimum paths |
| CN102595392A (en) * | 2011-11-15 | 2012-07-18 | 吴晓平 | Information processing method based on environmental benefit monitoring sensing network and system and device adopting same |
| CN102612110A (en) * | 2012-03-02 | 2012-07-25 | 浙江大学 | Distributive self-organized routing method in electric carrier wave illumination control system |
| CN102612110B (en) * | 2012-03-02 | 2014-11-05 | 浙江大学 | Distributive self-organized routing method in electric carrier wave illumination control system |
| CN102970233A (en) * | 2012-11-22 | 2013-03-13 | 华为技术有限公司 | Method, apparatus and device for acquiring route, concentrator and system |
| CN103037435B (en) * | 2012-12-21 | 2015-01-28 | 南京邮电大学 | Wireless sensor network route protocol |
| CN103037435A (en) * | 2012-12-21 | 2013-04-10 | 南京邮电大学 | Wireless sensor network route protocol |
| CN104009927A (en) * | 2014-03-07 | 2014-08-27 | 浙江工商大学 | Cooperative broadcasting method based on distance in mobile Ad Hoc network |
| CN104009927B (en) * | 2014-03-07 | 2017-02-22 | 浙江工商大学 | Cooperative broadcasting method based on distance in mobile Ad Hoc network |
| CN104869603A (en) * | 2015-05-08 | 2015-08-26 | 中山大学 | ZigBee routing method suitable for wireless monitoring and controlling network |
| CN104869603B (en) * | 2015-05-08 | 2018-08-14 | 中山大学 | A kind of ZigBee method for routing suitable for wireless monitor control network |
| WO2017049513A1 (en) * | 2015-09-23 | 2017-03-30 | 华为技术有限公司 | Packet processing method, network device, and system |
| US10931590B2 (en) | 2015-09-23 | 2021-02-23 | Huawei Technologies Co., Ltd. | Packet processing method and system, and network device |
| US11757784B2 (en) | 2015-09-23 | 2023-09-12 | Huawei Technologies Co., Ltd. | Packet processing method and system, and network device |
| CN105516000B (en) * | 2015-12-03 | 2018-09-25 | 南京邮电大学 | A kind of stability and high efficiency adaptive routing method in wireless mobile Mesh network |
| CN105553841B (en) * | 2015-12-11 | 2019-08-02 | 武汉兴图新科电子股份有限公司 | A kind of efficient distributed intelligence method for routing can effectively prevent signaling storm |
| CN105553841A (en) * | 2015-12-11 | 2016-05-04 | 武汉兴图新科电子股份有限公司 | High-efficiency distributed intelligent routing method capable of effectively preventing signaling storm |
| CN107872806A (en) * | 2016-09-23 | 2018-04-03 | 富士通株式会社 | Routing node position selecting method, device and terminal device |
| CN107872806B (en) * | 2016-09-23 | 2021-07-09 | 富士通株式会社 | Routing node position selection method and device and terminal equipment |
| CN106792257A (en) * | 2016-11-22 | 2017-05-31 | 北京大米科技有限公司 | Method and device, method for routing and device for Streaming Media forwarding |
| CN106792257B (en) * | 2016-11-22 | 2019-12-10 | 北京大米科技有限公司 | method and device for forwarding streaming media and routing method and device |
| WO2019128905A1 (en) * | 2017-12-29 | 2019-07-04 | 阿里巴巴集团控股有限公司 | Network communication method and device |
| CN108777871B (en) * | 2018-08-13 | 2021-01-08 | 常熟理工学院 | Method for realizing next generation sensor network communication system |
| CN108777871A (en) * | 2018-08-13 | 2018-11-09 | 常熟理工学院 | A kind of implementation method of next generation's sensor network communication system |
| CN109862077A (en) * | 2019-01-03 | 2019-06-07 | 南京海兴电网技术有限公司 | Based on Internet of Things communication with container technique with electrical equipment management method |
| CN109673033B (en) * | 2019-02-22 | 2020-10-16 | 浙江树人学院（浙江树人大学） | Data routing method of three-dimensional mobile sparse wireless sensor network |
| CN109673033A (en) * | 2019-02-22 | 2019-04-23 | 浙江树人学院（浙江树人大学） | The data routing method of the mobile sparse wireless sense network of three-dimensional |
| CN110167097A (en) * | 2019-04-22 | 2019-08-23 | 北京邮电大学 | Mobile robot transistroute scheme based on weighted metric forwarding and path planning |
| CN110167097B (en) * | 2019-04-22 | 2024-02-20 | 北京邮电大学 | Mobile robot relay routing method based on weighted metric forwarding and path planning |
| CN111277304A (en) * | 2020-01-20 | 2020-06-12 | 大唐联诚信息系统技术有限公司 | Unicast transmission method and system based on multi-relay cooperation |
| CN111277304B (en) * | 2020-01-20 | 2022-07-19 | 大唐联诚信息系统技术有限公司 | Unicast transmission method and system based on multi-relay cooperation |
| CN113923803A (en) * | 2021-10-13 | 2022-01-11 | 吉林大学 | Directional escape routing method based on node address book difference set operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100446496C (en) | 2008-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100446496C (en) | Method for establishing radio sensor network rout ebased on route neighbour list | |
| CN101711048B (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| US8861398B2 (en) | Method for discovering multiple routes in sensor networks | |
| Iqbal et al. | Survey of network coding-aware routing protocols in wireless networks | |
| CN101883048B (en) | Routing method of multi-dimensional network | |
| Dhanaraj et al. | Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks | |
| CN105163349B (en) | A kind of multiple gateway Wireless Mesh network implementation method based on IEEE802.11s | |
| CN106100720B (en) | The fast route convergence optimization method of LEO/MEO satellite network | |
| CN103118412B (en) | Trust-based on-demand multipath vector routing algorithm of Ad Hoc network | |
| JP5812917B2 (en) | Method for discovering multiple routes in a multi-hop network and node for searching for multiple routes | |
| CN102984781B (en) | Neighbor node judgment method for wireless ad hoc network route | |
| Chen et al. | Routing for cognitive radio networks consisting of opportunistic links | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| Chikh et al. | Multipath routing protocols for wireless multimedia sensor networks: a survey | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| CN101686521A (en) | Network coding based method for searching route of wireless Ad hoc network | |
| CN101867973A (en) | Multidimensional network and data transmission method thereof | |
| CN105007570A (en) | Mobile ad-hoc network congestion control method based on OLSR protocol | |
| CN105634964B (en) | A kind of mobile ad-hoc network and its multicast route method | |
| Denko | The use of mobile agents for clustering in mobile ad hoc networks | |
| CN103037436B (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| Chennakesavula et al. | Real-time routing protocols for wireless sensor networks: A survey | |
| CN103945483A (en) | Opportunity-network full-coverage low-time-delay routing method based on message ferry | |
| Natarajan et al. | An improvement of communication stability on underwater sensor network using balanced energy efficient joining distance matrix |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Xiaowei Inventor after: Xu Yongjun Inventor after: Jiang Wenfeng Inventor after: Xia Peng Inventor after: Sun Lu Inventor before: Jiang Wenfeng Inventor before: Xia Peng Inventor before: Sun Lu Inventor before: Xu Yongjun Inventor before: Li Xiaowei |
|
| CB03 | Change of inventor or designer information |