CN103813408A - Routing method of wireless sensor network - Google Patents
Routing method of wireless sensor network Download PDFInfo
- Publication number
- CN103813408A CN103813408A CN201410063335.8A CN201410063335A CN103813408A CN 103813408 A CN103813408 A CN 103813408A CN 201410063335 A CN201410063335 A CN 201410063335A CN 103813408 A CN103813408 A CN 103813408A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- gateway
- network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000008569 process Effects 0.000 claims abstract description 17
- 238000012423 maintenance Methods 0.000 claims abstract description 11
- 230000006855 networking Effects 0.000 claims description 48
- 230000008859 change Effects 0.000 claims description 7
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000009467 reduction Effects 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 4
- 238000005265 energy consumption Methods 0.000 abstract description 3
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000008447 perception Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 210000000697 sensory organ Anatomy 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a routing method of a wireless sensor network. The method comprises that newly-powered-on sensor nodes obtain network addresses, up routing paths and down routing paths and become access nodes; every access nodes obtains the residual power capacity to perform network maintenance; the access nodes become powered-off nodes when powered off to a standby mode to perform network reconstruction. During the process that new nodes join in the network and the network reconstruction, due to the fact that every node does not need to storage the relevant information of the neighboring access nodes, a gateway takes charge of associating every node and the neighboring access nodes, and by means of path weight parameters, the gateway can evaluate the connecting quality of every path more easily, further, when the network changes, the gateway can generate optional paths, by comparing the path weight parameters, rapidly select out the optimal path which can balance flow distribution and energy consumption and timely issue the transmission path to a requested node for usage, the reliable operation of the network can be guaranteed and the service life of the network can be prolonged.
Description
Technical field
The present invention relates to a kind of wireless sensor network technology, especially relate to a kind of method for routing of wireless sensor network.
Background technology
In the middle of the process of supporter networking exploitation, concentrated-distributed information gathering, communication and the information processing technology play an important role in the wireless sensor network (WSNs, Wireless Sensor Networks) of one.In huge wireless sensor network, on the one hand, transducer is machine perception intramundane " sense organ ", can perceive heat, the signal such as power, optical, electrical, sound, displacement is network system processing, transmission, analysis and feedback provide the most original information; On the other hand, along with traditional transducer is progressively realized microminiaturization, intellectuality, informationization and networking, wireless sensor network is just with its low cost, microminiaturization, low-power consumption with the advantage such as networking mode, paving mode and applicable moving target is in widespread attention flexibly.Internet of Things, just by the wireless sensor network that spreads over the panoramic transducer on each corner and object and be made up of them, is finally realized whole intramundane " perception ".
Node in wireless sensor network is all to adopt battery powered mode conventionally.In wireless sensor network, if part of nodes has exhausted electric weight prematurely, not only change battery labor intensive, increase maintenance cost, and can bring certain impact to the communication of other interdependent nodes in wireless sensor network.If can realize the equilibrium consumption of energy in wireless sensor network, just can effectively utilize Internet resources, extend and predict the useful life of network entirety.
At present, most method for routing is all the principle minimum based on jumping figure and generate shortest path, and part of nodes will be because of the core route position in transfer of data thus, and becomes bottleneck, and a large amount of transfer of data need to be passed through these node-routings.And these nodes will run out of electric weight quickly than other nodes, final deviated from network, causes subnetwork paralysis.Because energy consumption can not get equilibrium, although therefore those nodes that are connected with core route also remain a lot of electric weight, cannot again communication be arrived to destination, thereby also cause the waste of energy.
Summary of the invention
Technical problem to be solved by this invention is to provide the method for routing consuming with energy that can balancing flow distributes in a kind of wireless sensor network.
The present invention solves the problems of the technologies described above adopted technical scheme: a kind of method for routing of wireless sensor network, it is characterized in that comprising three parts: the sensor node newly powering on obtains the network address and up routed path and the downstream routing path of self, becomes network access node; Each network access node obtains the dump energy of self, carries out network operation; Any one network access node power-off becomes lower electrical nodes while leaving wireless sensor network, then carries out network reconstruction;
Wherein, the detailed process of Part I is:
The route discovery message of a1, local unique address that newly sensor node that powers on comprises self take T1 as periodic broadcasting;
A2, receive route discovery message each networking neighbor node respond packet containing the hop count of self and the route Reference News of the network address of self;
At this, networking neighbor node is gateway and/or the sensor node that can receive the route discovery message of the sensor node broadcasts newly powering on;
A3, newly the sensor node that powers on is being received after the route Reference News of each networking neighbor node response, will in the local unique address of self, self data, send the hop count of cycle, the dump energy coefficient of self, each networking neighbor node and the network address to form new network registration message;
A4, in the time there is gateway in all networking neighbor nodes, new network registration message is sent to gateway by the sensor node newly powering on;
In the time there is not gateway in all networking neighbor nodes, the sensor node newly powering on selects a networking neighbor node of hop count minimum as the up interim route intermediate node of the sensor node newly powering on from all networking neighbor nodes, then new network registration message is sent to up interim route intermediate node by the sensor node newly powering on, up interim route intermediate node, receiving that after new network registration message, the up routed path by self forwards, is finally transmitted to gateway;
A5, gateway are being received after new network registration message, create the route weight table of the sensor node that newly powers on, this route weight table comprises send cycle and dump energy coefficient, the newly quantity of potential father node of the sensor node that powers on and the index of each potential father node, the newly quantity of child node and the index of each child node of the sensor node that powers on the local unique address, the network address, data of the sensor node newly powering on;
At this, the potential father node of the sensor node newly powering on is the upper hop node of the sensor node newly powering on that existed;
A6, in the time only there is gateway in wireless sensor network, gateway is distributed to the network address sensor node newly powering on, the sensor node so far newly powering on has added wireless sensor network to become network access node;
In the time there are other nodes in wireless sensor network except gateway, gateway travels through all potential father node of the sensor node newly powering on, and obtains all possible paths between gateway and the sensor node that newly powers on; Then gateway calculates the route weight parameter of the each route intermediate node in every possible path; Follow for any possible path the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path; Possible path corresponding to the path weight value parameter of gateway selected value maximum be as up routed path and the downstream routing path of the sensor node newly powering on afterwards, and upgrade the route weight table of the each route intermediate node in the up routed path of the sensor node newly powering on; The path allocation message in the up routed path that comprises the sensor node newly powering on and downstream routing path is sent to the sensor node newly powering on by last gateway, and the network address is distributed to the sensor node newly powering on, the sensor node so far newly powering on has added wireless sensor network to become network access node;
At this, route intermediate node is the node in possible path and at gateway and between the sensor node newly powering on; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow;
The detailed process of Part II is:
B1, each network access node obtain the dump energy of self take T2 as the cycle; Then for any one network access node, in the time that the dump energy variable quantity of this network access node has exceeded the electric quantity change decision threshold of setting, this network access node sends to gateway by the route maintenance message of the dump energy coefficient that comprises self by the up routed path of this network access node;
B2, gateway receiving after route maintenance message, upgrades the dump energy coefficient in the route weight table of the network access node that sends this route maintenance message, realizes network operation;
The detailed process of Part III is:
C1, for any one network access node, in the time that wireless sensor network is left in this network access node power-off, become lower electrical nodes, this at present the child node of electrical nodes on electrical nodes, send data downwards;
Each child node of c2, lower electrical nodes determining after its father node power-off, broadcast for show its up routed path cannot on send the path failed message of data;
C3, the path failed message of broadcasting for any one child node, receive that each networking neighbor node respond packet of this path failed message is containing the hop count of self and the route Reference News of the network address of self; At this, networking neighbor node is gateway and/or the sensor node that can receive the path failed message of the child node broadcast of lower electrical nodes;
In the time there is gateway in all networking neighbor nodes of receiving this path failed message, the routing update message of the network address that comprises lower electrical nodes is sent to gateway by the child node of broadcasting this path failed message;
In the time there is not gateway in all networking neighbor nodes of receiving this path failed message, the child node of broadcasting this path failed message selects a networking neighbor node of hop count minimum as the up interim routing node of the child node of this path failed message of broadcast from receive all networking neighbor nodes of this path failed message, then the routing update message of the network address that comprises lower electrical nodes is sent to up interim routing node, up interim routing node is receiving that after routing update message, the up routed path by self forwards, finally be transmitted to gateway,
C4, gateway are being received after routing update message, delete route weight table and the index of lower electrical nodes in the route weight table of other network access nodes of lower electrical nodes;
C5, for any one child node of lower electrical nodes, gateway travels through all potential father node of this child node, obtain all possible paths between gateway and this child node, gateway calculates the route weight parameter of the each route intermediate node in every possible path, for any possible path, the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path, possible path corresponding to the path weight value parameter of gateway selected value maximum is as the uplink and downlink routed path of this child node, and upgrade the route weight table of the each route intermediate node in the up routed path of this child node,
At this, the potential father node of this child node is the upper hop node of this child node of having existed; Route intermediate node is the node in possible path and between gateway and this child node; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow;
The path allocation message in the up routed path that comprises each child node self and downstream routing path is sent to corresponding child node by c6, gateway, each child node is being received after path allocation message, the up routed path comprising in storing path assignment messages and downstream routing path, and according to sending data on the up routed path of preserving, so far complete network and rebuild.
In described step a1, the span of T1 is [100ms, 1000ms].
In described step a6, the acquisition process of the route weight parameter of route intermediate node is: for any one the route intermediate node in any possible path, the route weight parameter of this route intermediate node is designated as to R,
wherein, E represents the dump energy coefficient of this route intermediate node, and F represents the flow coefficient of this route intermediate node,
n represents the quantity of the child node of this route intermediate node, T
irepresent to send the cycle in the data of i child node of this route intermediate node, k is weight proportion coefficient.
In described step b1, getting T2 is 24 hours, the compare reduction of dump energy of this network access node of preserving on gateway of the dump energy that the dump energy variable quantity of this network access node obtained for this this cycle of network access node, the electric quantity change decision threshold value of setting is 1%.
Compared with prior art, the invention has the advantages that: the inventive method comprises three parts, the sensor node newly powering on obtains the network address and up routed path and the downstream routing path of self, becomes network access node, each network access node obtains the dump energy of self, carries out network operation, any one network access node power-off becomes lower electrical nodes while leaving wireless sensor network, carry out again network reconstruction, add in the process of network and network reconstruction at new node, the relevant information that does not need to preserve networking neighbor node due to each node, be responsible for interrelated between each node and networking neighbor node by gateway, and utilize path weight value parameter to make gateway also more easily assess the quality of connection of every paths, therefore in the time that network changes (while having the sensor node that newly powers on or certain network access node to become lower electrical nodes), gateway can generate feasible path, and select rapidly under current network and can balancing flow distribution consume optimum transmission path with energy by comparing path weight value parameter, and the node that in time this transmission path is handed down to request uses, guarantee the reliability service of network, extend the useful life of overall network.
Accompanying drawing explanation
Fig. 1 is the network address and up routed path and the downstream routing path that the sensor node that newly powers on obtains self, becomes the idiographic flow block diagram of network access node;
Fig. 2 is the composition schematic diagram of route weight table;
Fig. 3 is the dump energy that each network access node obtains self, carries out the idiographic flow block diagram of network operation;
Fig. 4 becomes lower electrical nodes while leaving wireless sensor network for any one network access node power-off, then carries out the idiographic flow block diagram of network reconstruction.
Embodiment
Below in conjunction with accompanying drawing, embodiment is described in further detail the present invention.
The method for routing of a kind of wireless sensor network that the present invention proposes, it comprises three parts: the sensor node newly powering on obtains the network address and up routed path and the downstream routing path of self, becomes network access node; Each network access node obtains the dump energy of self, carries out network operation; Any one network access node power-off becomes lower electrical nodes while leaving wireless sensor network, then carries out network reconstruction.
Wherein, as shown in Figure 1, the detailed process of Part I is:
The route discovery message of a1, local unique address that newly sensor node that powers on comprises self take T1 as periodic broadcasting.
At this, T1 can be decided in its sole discretion by user, if generally T1 is shorter, can affect the useful life of sensor node, if T1 is longer, can extend the joining day of follow-up sensor node to be powered on, span that therefore can T1 in specific implementation process is set to 100ms≤T1≤1000ms.
A2, receive route discovery message each networking neighbor node respond packet containing the hop count of self and the route Reference News of the network address of self.
At this, networking neighbor node is gateway and/or the sensor node that can receive the route discovery message of the sensor node broadcasts newly powering on; The route discovery message of the sensor node broadcasts newly powering on may only be received by gateway, or only received by one or more sensor nodes, or received by gateway and sensor node, therefore the neighbor node that networks may be only that gateway is (when the sensor node newly powering on is the 1st upper electrical nodes, networking neighbor node is gateway), may be only sensor node, may be gateway and sensor node.
In wireless sensor network, the hop count of gateway is always 0, and the network address of gateway is always 0.
A3, newly the sensor node that powers on is being received after the route Reference News of each networking neighbor node response, will in the local unique address of self, self data, send the hop count of cycle, the dump energy coefficient of self, each networking neighbor node and the network address to form new network registration message.
A4, in the time there is gateway in all networking neighbor nodes, new network registration message is sent to gateway by the sensor node newly powering on.
In the time there is not gateway in all networking neighbor nodes, the sensor node newly powering on selects a networking neighbor node of hop count minimum as the up interim route intermediate node of the sensor node newly powering on from all networking neighbor nodes, then new network registration message is sent to up interim route intermediate node by the sensor node newly powering on, up interim route intermediate node, receiving that after new network registration message, the up routed path by self forwards, is finally transmitted to gateway.
A5, gateway are being received after new network registration message, create the route weight table (as shown in Figure 2) of the sensor node that newly powers on, this route weight table comprises send cycle and dump energy coefficient, the newly quantity of potential father node of the sensor node that powers on and the index of each potential father node, the newly quantity of child node and the index of each child node of the sensor node that powers on the local unique address, the network address, data of the sensor node newly powering on.
At this, the potential father node of the sensor node newly powering on is the upper hop node (sensor node newly powering on and upper hop node not necessarily connect) of the sensor node newly powering on that existed, and the child node of the sensor node newly powering on is the next-hop node connecting with the sensor node newly powering on.
At this, in the local unique address of the sensor node newly powering on, data, send cycle and dump energy coefficient known, but the network address is also unallocated.
A6, in the time only there is gateway in wireless sensor network (sensor node newly powering on can directly connect with gateway), gateway is distributed to the network address sensor node newly powering on, and the sensor node so far newly powering on has added wireless sensor network to become network access node;
In the time there are other nodes in wireless sensor network except gateway, gateway travels through all potential father node of the sensor node newly powering on, and obtains all possible paths between gateway and the sensor node that newly powers on; Then gateway calculates the route weight parameter of the each route intermediate node in every possible path; Then for any possible path, the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path, consider can to cause in every possible path flow or route intermediate node that can throughput bottleneck obtaining of this path weight value parameter, be convenient to gateway every possible path is assessed; Possible path corresponding to the path weight value parameter of gateway selected value maximum be as up routed path and the downstream routing path of the sensor node newly powering on afterwards, and upgrade the route weight table of the each route intermediate node in the up routed path of the sensor node newly powering on; The path allocation message in the up routed path that comprises the sensor node newly powering on and downstream routing path is sent to the sensor node newly powering on by last gateway, and the network address is distributed to the sensor node newly powering on, the sensor node so far newly powering on has added wireless sensor network to become network access node.
At this, route intermediate node is the node in possible path and at gateway and between the sensor node newly powering on; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow.
In this specific embodiment, in step a6, the acquisition process of the route weight parameter of route intermediate node is: for any one the route intermediate node in any possible path, the route weight parameter of this route intermediate node is designated as to R,
wherein, E represents the dump energy coefficient of this route intermediate node, and F represents the flow coefficient of this route intermediate node,
n represents the quantity of the child node of this route intermediate node, T
irepresent to send the cycle in the data of i child node of this route intermediate node, k is weight proportion coefficient, the concrete value of k can regulate according to actual conditions, generally can be in the scope of 0.5≤k≤1.5 value, if stress E, can be in the scope of 1<k≤1.5 value, if stress F, can be within the scope of 0.5≤k<1 value, in the time getting k=1 balance the weight relationship of E and F.
At this, in the process of route weight parameter of calculating route intermediate node, consider this factor of influence of flow coefficient of route intermediate node, make the route weight parameter that calculates more reasonable, guarantee the balanced of assignment of traffic and energy consumption.
As shown in Figure 3, the detailed process of Part II is:
B1, each network access node obtain the dump energy of self take T2 as the cycle; Then for any one network access node, in the time that the dump energy variable quantity of this network access node has exceeded the electric quantity change decision threshold of setting, this network access node sends to gateway by the route maintenance message of the dump energy coefficient that comprises self by the up routed path of this network access node.
At this, the value of T2 can be set voluntarily by user, generally can be set to every day, within 24 hours, is one-period; The compare reduction of dump energy of this network access node of preserving on gateway of the dump energy that the dump energy variable quantity of this network access node obtained for this this cycle of network access node; The electric quantity change decision threshold value of setting is 1%.
B2, gateway receiving after route maintenance message, upgrades the dump energy coefficient in the route weight table of the network access node that sends this route maintenance message, realizes network operation.
As shown in Figure 4, the detailed process of Part III is:
C1, for any one network access node, in the time that leaving wireless sensor network, this network access node power-off becomes lower electrical nodes, this at present the child node of electrical nodes on electrical nodes, send data downwards, at this, the child node of lower electrical nodes is the next-hop node connecting with lower electrical nodes.
Each child node of c2, lower electrical nodes determining after its father node power-off, broadcast for show its up routed path cannot on send the path failed message of data.
C3, the path failed message of broadcasting for any one child node, receive that each networking neighbor node respond packet of this path failed message is containing the hop count of self and the route Reference News of the network address of self; At this, networking neighbor node is gateway and/or the sensor node that can receive the path failed message of the child node broadcast of lower electrical nodes.
In the time there is gateway in all networking neighbor nodes of receiving this path failed message, the routing update message of the network address that comprises lower electrical nodes is sent to gateway by the child node of broadcasting this path failed message.
In the time there is not gateway in all networking neighbor nodes of receiving this path failed message, the child node of broadcasting this path failed message selects a networking neighbor node of hop count minimum as the up interim routing node of the child node of this path failed message of broadcast from receive all networking neighbor nodes of this path failed message, then the routing update message of the network address that comprises lower electrical nodes is sent to up interim routing node, up interim routing node is receiving that after routing update message, the up routed path by self forwards, finally be transmitted to gateway.
C4, gateway are being received after routing update message, delete route weight table and the index of lower electrical nodes in the route weight table of other network access nodes of lower electrical nodes.
C5, for any one child node of lower electrical nodes, gateway travels through all potential father node of this child node, obtain all possible paths between gateway and this child node, gateway calculates the route weight parameter of the each route intermediate node in every possible path, for any possible path, the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path, possible path corresponding to the path weight value parameter of gateway selected value maximum is as the uplink and downlink routed path of this child node, and upgrade the route weight table of the each route intermediate node in the up routed path of this child node.
At this, the potential father node of this child node is the upper hop node (this child node and upper hop node not necessarily connect) of this child node of having existed; Route intermediate node is the node in possible path and between gateway and this child node; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow.
The path allocation message in the up routed path that comprises each child node self and downstream routing path is sent to corresponding child node by c6, gateway, each child node is being received after path allocation message, the up routed path comprising in storing path assignment messages and downstream routing path, and according to sending data on the up routed path of preserving, so far complete network and rebuild.
Claims (4)
1. a method for routing for wireless sensor network, is characterized in that comprising three parts: the sensor node newly powering on obtains the network address and up routed path and the downstream routing path of self, becomes network access node; Each network access node obtains the dump energy of self, carries out network operation; Any one network access node power-off becomes lower electrical nodes while leaving wireless sensor network, then carries out network reconstruction;
Wherein, the detailed process of Part I is:
The route discovery message of a1, local unique address that newly sensor node that powers on comprises self take T1 as periodic broadcasting;
A2, receive route discovery message each networking neighbor node respond packet containing the hop count of self and the route Reference News of the network address of self;
At this, networking neighbor node is gateway and/or the sensor node that can receive the route discovery message of the sensor node broadcasts newly powering on;
A3, newly the sensor node that powers on is being received after the route Reference News of each networking neighbor node response, will in the local unique address of self, self data, send the hop count of cycle, the dump energy coefficient of self, each networking neighbor node and the network address to form new network registration message;
A4, in the time there is gateway in all networking neighbor nodes, new network registration message is sent to gateway by the sensor node newly powering on;
In the time there is not gateway in all networking neighbor nodes, the sensor node newly powering on selects a networking neighbor node of hop count minimum as the up interim route intermediate node of the sensor node newly powering on from all networking neighbor nodes, then new network registration message is sent to up interim route intermediate node by the sensor node newly powering on, up interim route intermediate node, receiving that after new network registration message, the up routed path by self forwards, is finally transmitted to gateway;
A5, gateway are being received after new network registration message, create the route weight table of the sensor node that newly powers on, this route weight table comprises send cycle and dump energy coefficient, the newly quantity of potential father node of the sensor node that powers on and the index of each potential father node, the newly quantity of child node and the index of each child node of the sensor node that powers on the local unique address, the network address, data of the sensor node newly powering on;
At this, the potential father node of the sensor node newly powering on is the upper hop node of the sensor node newly powering on that existed;
A6, in the time only there is gateway in wireless sensor network, gateway is distributed to the network address sensor node newly powering on, the sensor node so far newly powering on has added wireless sensor network to become network access node;
In the time there are other nodes in wireless sensor network except gateway, gateway travels through all potential father node of the sensor node newly powering on, and obtains all possible paths between gateway and the sensor node that newly powers on; Then gateway calculates the route weight parameter of the each route intermediate node in every possible path; Follow for any possible path the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path; Possible path corresponding to the path weight value parameter of gateway selected value maximum be as up routed path and the downstream routing path of the sensor node newly powering on afterwards, and upgrade the route weight table of the each route intermediate node in the up routed path of the sensor node newly powering on; The path allocation message in the up routed path that comprises the sensor node newly powering on and downstream routing path is sent to the sensor node newly powering on by last gateway, and the network address is distributed to the sensor node newly powering on, the sensor node so far newly powering on has added wireless sensor network to become network access node;
At this, route intermediate node is the node in possible path and at gateway and between the sensor node newly powering on; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow;
The detailed process of Part II is:
B1, each network access node obtain the dump energy of self take T2 as the cycle; Then for any one network access node, in the time that the dump energy variable quantity of this network access node has exceeded the electric quantity change decision threshold of setting, this network access node sends to gateway by the route maintenance message of the dump energy coefficient that comprises self by the up routed path of this network access node;
B2, gateway receiving after route maintenance message, upgrades the dump energy coefficient in the route weight table of the network access node that sends this route maintenance message, realizes network operation;
The detailed process of Part III is:
C1, for any one network access node, in the time that wireless sensor network is left in this network access node power-off, become lower electrical nodes, this at present the child node of electrical nodes on electrical nodes, send data downwards;
Each child node of c2, lower electrical nodes determining after its father node power-off, broadcast for show its up routed path cannot on send the path failed message of data;
C3, the path failed message of broadcasting for any one child node, receive that each networking neighbor node respond packet of this path failed message is containing the hop count of self and the route Reference News of the network address of self; At this, networking neighbor node is gateway and/or the sensor node that can receive the path failed message of the child node broadcast of lower electrical nodes;
In the time there is gateway in all networking neighbor nodes of receiving this path failed message, the routing update message of the network address that comprises lower electrical nodes is sent to gateway by the child node of broadcasting this path failed message;
In the time there is not gateway in all networking neighbor nodes of receiving this path failed message, the child node of broadcasting this path failed message selects a networking neighbor node of hop count minimum as the up interim routing node of the child node of this path failed message of broadcast from receive all networking neighbor nodes of this path failed message, then the routing update message of the network address that comprises lower electrical nodes is sent to up interim routing node, up interim routing node is receiving that after routing update message, the up routed path by self forwards, finally be transmitted to gateway,
C4, gateway are being received after routing update message, delete route weight table and the index of lower electrical nodes in the route weight table of other network access nodes of lower electrical nodes;
C5, for any one child node of lower electrical nodes, gateway travels through all potential father node of this child node, obtain all possible paths between gateway and this child node, gateway calculates the route weight parameter of the each route intermediate node in every possible path, for any possible path, the path weight value parameter of gateway using the minimum value in the route weight parameter of all route intermediate nodes in this possible path as this possible path, possible path corresponding to the path weight value parameter of gateway selected value maximum is as the uplink and downlink routed path of this child node, and upgrade the route weight table of the each route intermediate node in the up routed path of this child node,
At this, the potential father node of this child node is the upper hop node of this child node of having existed; Route intermediate node is the node in possible path and between gateway and this child node; The possible path corresponding to path weight value parameter of the value maximum that gateway is chosen is to distribute the optimal path consuming with energy by balancing flow;
The path allocation message in the up routed path that comprises each child node self and downstream routing path is sent to corresponding child node by c6, gateway, each child node is being received after path allocation message, the up routed path comprising in storing path assignment messages and downstream routing path, and according to sending data on the up routed path of preserving, so far complete network and rebuild.
2. the method for routing of a kind of wireless sensor network according to claim 1, the span that it is characterized in that T1 in described step a1 is [100ms, 1000ms].
3. the method for routing of a kind of wireless sensor network according to claim 1 and 2, the acquisition process that it is characterized in that the route weight parameter of route intermediate node in described step a6 is: for any one the route intermediate node in any possible path, the route weight parameter of this route intermediate node is designated as to R
wherein, E represents the dump energy coefficient of this route intermediate node, and F represents the flow coefficient of this route intermediate node,
n represents the quantity of the child node of this route intermediate node, T
irepresent to send the cycle in the data of i child node of this route intermediate node, k is weight proportion coefficient.
4. the method for routing of a kind of wireless sensor network according to claim 3, it is characterized in that in described step b1, getting T2 is 24 hours, the compare reduction of dump energy of this network access node of preserving on gateway of the dump energy that the dump energy variable quantity of this network access node obtained for this this cycle of network access node, the electric quantity change decision threshold value of setting is 1%.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410063335.8A CN103813408B (en) | 2014-02-25 | 2014-02-25 | Routing method of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410063335.8A CN103813408B (en) | 2014-02-25 | 2014-02-25 | Routing method of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103813408A true CN103813408A (en) | 2014-05-21 |
| CN103813408B CN103813408B (en) | 2017-01-25 |
Family
ID=50709487
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410063335.8A Active CN103813408B (en) | 2014-02-25 | 2014-02-25 | Routing method of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103813408B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105282770A (en) * | 2015-07-16 | 2016-01-27 | 北京中科瑞峰科技有限公司 | Wireless self-healing networking optimization and self-inspection method |
| CN106162781A (en) * | 2015-03-31 | 2016-11-23 | 富士通株式会社 | The changing method of routing node, device and wireless sensor network |
| CN106341250A (en) * | 2015-07-10 | 2017-01-18 | 南宁富桂精密工业有限公司 | Network device and network address initialization allocation method |
| CN106796511A (en) * | 2014-02-28 | 2017-05-31 | 泰科消防及安全有限公司 | For the distributed rule engine of healthy and strong sensor network |
| CN107959612A (en) * | 2016-10-18 | 2018-04-24 | 中兴通讯股份有限公司 | A kind of method and device that adaptively adjusts of service tunnel under network transition |
| CN108541039A (en) * | 2018-04-24 | 2018-09-14 | 苏州市职业大学 | A kind of power consumption wireless sensor network static node-routing method |
| WO2018223649A1 (en) * | 2017-06-07 | 2018-12-13 | 海信集团有限公司 | Method for re-establishing route in ultra-dense network (udn), and micro base station |
| CN113133127A (en) * | 2021-04-16 | 2021-07-16 | 易斌 | Wireless ad hoc network link rapid network access method based on random sniffing |
| US11747430B2 (en) | 2014-02-28 | 2023-09-05 | Tyco Fire & Security Gmbh | Correlation of sensory inputs to identify unauthorized persons |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101610562A (en) * | 2009-07-14 | 2009-12-23 | 中控科技集团有限公司 | The method for routing of wireless sensor network, wireless sensor node and system |
| US20120218926A1 (en) * | 2011-02-24 | 2012-08-30 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
| US8279810B1 (en) * | 2011-04-13 | 2012-10-02 | Renesas Mobile Corporation | Sensor network information collection via mobile gateway |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
-
2014
- 2014-02-25 CN CN201410063335.8A patent/CN103813408B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101610562A (en) * | 2009-07-14 | 2009-12-23 | 中控科技集团有限公司 | The method for routing of wireless sensor network, wireless sensor node and system |
| US20120218926A1 (en) * | 2011-02-24 | 2012-08-30 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
| US8279810B1 (en) * | 2011-04-13 | 2012-10-02 | Renesas Mobile Corporation | Sensor network information collection via mobile gateway |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106796511A (en) * | 2014-02-28 | 2017-05-31 | 泰科消防及安全有限公司 | For the distributed rule engine of healthy and strong sensor network |
| US11747430B2 (en) | 2014-02-28 | 2023-09-05 | Tyco Fire & Security Gmbh | Correlation of sensory inputs to identify unauthorized persons |
| CN106162781A (en) * | 2015-03-31 | 2016-11-23 | 富士通株式会社 | The changing method of routing node, device and wireless sensor network |
| CN106341250A (en) * | 2015-07-10 | 2017-01-18 | 南宁富桂精密工业有限公司 | Network device and network address initialization allocation method |
| CN106341250B (en) * | 2015-07-10 | 2019-11-22 | 南宁富桂精密工业有限公司 | Network equipment and network address initialize distribution method |
| CN105282770A (en) * | 2015-07-16 | 2016-01-27 | 北京中科瑞峰科技有限公司 | Wireless self-healing networking optimization and self-inspection method |
| CN107959612A (en) * | 2016-10-18 | 2018-04-24 | 中兴通讯股份有限公司 | A kind of method and device that adaptively adjusts of service tunnel under network transition |
| CN107959612B (en) * | 2016-10-18 | 2022-04-15 | 中兴通讯股份有限公司 | Method and device for self-adaptive adjustment of service tunnel under network transition |
| WO2018223649A1 (en) * | 2017-06-07 | 2018-12-13 | 海信集团有限公司 | Method for re-establishing route in ultra-dense network (udn), and micro base station |
| CN108541039A (en) * | 2018-04-24 | 2018-09-14 | 苏州市职业大学 | A kind of power consumption wireless sensor network static node-routing method |
| CN113133127A (en) * | 2021-04-16 | 2021-07-16 | 易斌 | Wireless ad hoc network link rapid network access method based on random sniffing |
| CN113133127B (en) * | 2021-04-16 | 2023-12-12 | 成都易明半导体有限公司 | Wireless ad hoc network link quick network access method based on random sniffing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103813408B (en) | 2017-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103813408A (en) | Routing method of wireless sensor network | |
| CN101562861B (en) | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network | |
| CN103986648B (en) | One kind is based on link stability and Energy-aware Internet of Things method for repairing route | |
| CN106714263B (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| CN102084689B (en) | Selective priori reactive routing | |
| JP2018533884A (en) | Resource Aware Multitasking Routing in Multi-Hop Heterogeneous Wireless Networks | |
| CN103039042A (en) | Communication available transport network bandwidth to L2 Ethernet nodes | |
| CN103037455B (en) | Method for joint optimization of MLB and MRO in LTE network | |
| CN104053175A (en) | Internet of Things sensing layer topology control method | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| TWI426811B (en) | Mobile ad hoc network and method for establishing routing thereof | |
| CN103338495A (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| CN103402234A (en) | Data aggregation method of wireless sensor network | |
| EP3298826A1 (en) | Connectivity management mechanism for multi-hop capillary networks | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| KR101212122B1 (en) | Routing Method using Broadcasting message of Sink node in Wireless Sensor Networks | |
| US20180332443A1 (en) | Handling of Devices based on Group Membership | |
| CN106255167B (en) | Wireless sensor network based on low-power consumption lossy network routing protocol | |
| CN104918294A (en) | Wireless sensing network power consumption intelligence distribution method and wireless sensing network | |
| CN115190559B (en) | Networking and control method of multi-scene-oriented Internet of things equipment | |
| JP6265689B2 (en) | COMMUNICATION DEVICE, RADIO NETWORK SYSTEM, RADIO NETWORK CONTROL METHOD, AND RADIO NETWORK CONTROL PROGRAM | |
| Rajeswari et al. | He-SERIeS: An inventive communication model for data offloading in MANET | |
| Acharya et al. | Energy-aware virtual backbone tree for efficient routing in wireless sensor networks | |
| CN104936131B (en) | A kind of data assemblage method for wireless sensor network | |
| JPWO2014132446A1 (en) | Wireless terminal device, wireless mesh network, and communication method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240118 Address after: Room 606, 607, 608, 609, Fulton Building, No. 18 Huijin Road, Luotuo Street, Zhenhai District, Ningbo City, Zhejiang Province, 315202 Patentee after: Ningbo Zhijia Intelligent Technology Co.,Ltd. Address before: 601, Chuangye Building, No. 66 Yuanshi Road, High tech Zone, Ningbo City, Zhejiang Province, 315040 Patentee before: Ningbo Zhongke Integrated Circuit Design Center Co.,Ltd. |
|
| TR01 | Transfer of patent right |