CN103813408B - Routing method of wireless sensor network - Google Patents
Routing method of wireless sensor network Download PDFInfo
- Publication number
- CN103813408B CN103813408B CN201410063335.8A CN201410063335A CN103813408B CN 103813408 B CN103813408 B CN 103813408B CN 201410063335 A CN201410063335 A CN 201410063335A CN 103813408 B CN103813408 B CN 103813408B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- gateway
- network
- electricity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000008569 process Effects 0.000 claims abstract description 16
- 238000012423 maintenance Methods 0.000 claims abstract description 11
- 230000005611 electricity Effects 0.000 claims description 86
- 230000006855 networking Effects 0.000 claims description 48
- 230000004044 response Effects 0.000 claims description 9
- 230000008859 change Effects 0.000 claims description 8
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 4
- 238000005265 energy consumption Methods 0.000 abstract 1
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000009191 jumping Effects 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 210000000697 sensory organ Anatomy 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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 route side of wireless sensor network
Method.
Background technology
Support Internet of Things exploitation process in the middle of, concentrated-distributed information gathering, information transfer and the information processing technology in
The wireless sensor network (wsns, wireless sensor networks) of one plays an important role.Huge
In wireless sensor network, on the one hand, sensor be machine perceive intramundane " sensory organ ", can perceive heat, power,
The signals such as light, electricity, sound, displacement are the process of network system, transmission, analysis and feedback provide the information of most original；On the other hand,
Miniaturization, intellectuality, information-based and networking are done step-by-step with traditional sensor, wireless sensor network is just low with it
The advantages such as cost, miniaturization, low-power consumption and flexible networking mode, paving mode and suitable mobile target are extensively weighed
Depending on.Internet of Things be exactly based on the panoramic sensor spreading on each corner and object and by they form wireless
Sensor network, finally to realize to entirely intramundane " perception ".
Node in wireless sensor network is all generally using battery powered mode.In wireless sensor network
In, if part of nodes prematurely run out of electricity, not only change battery labor intensive, increase maintenance cost, and can be right
The communication of other interdependent nodes in wireless sensor network brings certain impact.If being capable of wireless sensor network
The equilibrium consumption of middle energy, then just can effectively utilize Internet resources, extends and predict the overall service life of network.
At present, most method for routing is all based on the minimum principle of jumping figure and generates shortest path, thus portion
Partial node because of the core route location being in data transfer, and will become bottleneck, and substantial amounts of data transfer needs through this
A little node-routings.And these nodes will quickly run out of electricity than other nodes, eventually off network, lead to subnetwork
Paralysis.Because energy expenditure cannot equalize, although the node that therefore those are connected with core route there remains a lot of electricity,
But destination cannot be transferred information to again, thus also create the waste of energy.
Content of the invention
The technical problem to be solved is to provide can distribute balancing flow in a kind of wireless sensor network
Method for routing with energy expenditure.
The technical scheme that present invention solution above-mentioned technical problem is adopted is: a kind of route side of wireless sensor network
Method is it is characterised in that include three parts: newly go up electricity sensor node obtain itself the network address and up routed path with
Downstream routing path, becomes network access node；Each network access node obtains the dump energy of itself, carries out network operation；Any one
Individual network access node power-off is left and is become lower electrical nodes during wireless sensor network, then carries out network reconnection；
Wherein, the detailed process of Part I is:
A1, the route discovery of the sensor node locally-unique address that comprises itself for periodic broadcasting with t1 newly going up electricity disappear
Breath；
A2, each the networking neighbor node response bag receiving routediscovery messages contain itself hop count and the net of itself
The route Reference News of network address；
Here, networking neighbor node is the gateway that can receive the routediscovery messages of sensor node broadcasts newly going up electricity
And/or sensor node；
A3, newly go up the sensor node of electricity after the route Reference News receiving the response of each networking neighbor node, will be from
Cycle, the dump energy coefficient of itself, the route of each networking neighbor node are sent on the locally-unique address of body, the data of itself
Jumping figure and the network address form new network registration message；
A4, when there is gateway in all networking neighbor nodes, the sensor node newly going up electricity is by new network registration message
It is sent to gateway；
When there is not gateway in all networking neighbor nodes, the sensor node newly going up electricity is from all networking neighbor nodes
In the middle of the up interim route as the sensor node newly going up electricity for the minimum networking neighbor node of middle selection hop count
Node, new network registration message is sent to up interim route intermediate node by the sensor node then newly going up electricity, up faces
When route intermediate node pass through the up routed path of itself after receiving new network registration message and forward, be finally transmitted to net
Close；
A5, gateway, after receiving new network registration message, create the routing weights table of the sensor node newly going up electricity, this road
Include newly going up the locally-unique address of the sensor node of electricity, the network address by weight table, send cycle and dump energy in data
Coefficient, newly go up the quantity of potential father node of sensor node of electricity and the index of each potential father node, newly go up electric sensing
The quantity of the child node of device node and the index of each child node；
Here, the potential father node newly going up the sensor node of electricity be existed newly go up the upper of electric sensor node
One hop node；
A6, when only existing gateway in wireless sensor network, gateway the network address is distributed to newly go up electricity sensor
Node, the sensor node so far newly going up electricity has added wireless sensor network to become network access node；
When there are other nodes in wireless sensor network in addition to gateway, gateway traversal newly goes up the sensor node of electricity
All potential father nodes, obtain all possible paths between gateway and the sensor node newly going up electricity；Then gateway calculates often
The routing weights parameter of each the route intermediate node in bar possible path；Sequentially for any one possible path, gateway will
The minima in the routing weights parameter of all route intermediate nodes in this possible path is as the road of this possible path
Footpath weight parameter；The maximum corresponding possible path of path weight value parameter of gateway selected value is as the sensor section newly going up electricity afterwards
The up routed path of point and downstream routing path, and update each in the up routed path of sensor node newly going up electricity
The routing weights table of route intermediate node；Last gateway will comprise newly go up the up routed path of electric sensor node and descending
The path allocation message of routed path is sent to the sensor node newly going up electricity, and the network address is distributed to the sensing newly going up electricity
Device node, the sensor node so far newly going up electricity has added wireless sensor network to become network access node；
Here, route intermediate node is in possible path and to be located at the section between gateway and the sensor node newly going up electricity
Point；The corresponding possible path of path weight value parameter of the value maximum that gateway is chosen is being capable of balancing flow distribution and energy expenditure
Optimal path；
The detailed process of Part II is:
B1, each network access node obtain the dump energy of itself with t2 for the cycle；Sequentially for any one network access node,
When the dump energy variable quantity of this network access node has exceeded the electric quantity change decision threshold of setting, this network access node will comprise certainly
The route maintenance message of the dump energy coefficient of body is sent to gateway by the up routed path of this network access node；
B2, gateway, after receiving route maintenance message, update the route power of the network access node sending this route maintenance message
Dump energy coefficient in weight table, realizes network operation；
The detailed process of Part III is:
C1, for any one network access node, become lower electricity when wireless sensor network is left in this network access node power-off
Node, the child node of this electrical nodes at present cannot send data on electrical nodes downwards；
C2, lower electrical nodes each child node determine its father node power-off after, broadcast and be used for showing that walking along the street is by road thereon
Footpath cannot on send the path failed message of data；
C3, the path failed message for the broadcast of any one child node, receive each networking of this path failed message
Neighbor node response bag contains the route Reference News of the hop count of itself and the network address of itself；Here, networking neighbours section
Point is the gateway of path failed message of child node broadcast and/or the sensor node that can receive lower electrical nodes；
When there is gateway in all networking neighbor nodes receiving this path failed message, broadcast this path failed message
Child node the routing update message of the network address comprising lower electrical nodes is sent to gateway；
When there is not gateway in all networking neighbor nodes receiving this path failed message, broadcasting this path and unsuccessfully disappearing
The child node of breath selects a minimum networking of hop count from all networking neighbor nodes receiving this path failed message
Neighbor node, as the up interim routing node of the child node broadcasting this path failed message, then will comprise lower electrical nodes
The routing update message of the network address is sent to up interim routing node, and up interim routing node disappears receiving routing update
Pass through the up routed path of itself after breath to forward, be finally transmitted to gateway；
, after receiving routing update message, under deleting, the routing weights table of electrical nodes and lower electrical nodes are at it for c4, gateway
Index in the routing weights table of his network access node；
C5, any one child node for lower electrical nodes, gateway travels through all potential father node of this child node, obtains
All possible paths between gateway and this child node, gateway calculates the road of each the route intermediate node in every possible path
By weight parameter, for any one possible path, gateway is by the route of all route intermediate nodes in this possible path
Minima in weight parameter is as the path weight value parameter of this possible path, the maximum path weight value parameter of gateway selected value
Corresponding possible path is as the uplink and downlink routed path of this child node, and updates in the up routed path of this child node
Each route intermediate node routing weights table；
Here, the potential father node of this child node is the upper hop node of this child node having existed；Route middle node
Point is in possible path and positioned at the node between gateway and this child node；The path weight value parameter pair of the value maximum that gateway is chosen
The possible path answered is can to distribute the optimal path with energy expenditure by balancing flow；
C6, gateway will comprise the up routed path of each child node itself and the path allocation message in downstream routing path
It is sent to corresponding child node, after receiving path allocation message, comprise in storing path assignment messages is upper for each child node
Row routed path and downstream routing path, and send data according on the up routed path preserving, so far complete network reconnection.
In described step a1, the span of t1 is [100ms, 1000ms].
The acquisition process routeing the routing weights parameter of intermediate node in described step a6 is: for any one possibility
Any one in path route intermediate node, and the routing weights parameter of this route intermediate node is designated as r,Its
In, e represents the dump energy coefficient of this route intermediate node, and f represents the discharge coefficient of this route intermediate node,n
Represent the quantity of the child node of this route intermediate node, tiRepresent and send in the data of i-th child node of this route intermediate node
In the cycle, k is weight proportion coefficient.
T2 is taken to be 24 hours in described step b1, the dump energy variable quantity of this network access node is for this network access node originally
The dump energy that cycle obtains compares the decrement of the dump energy of this network access node being preserved on gateway, the electricity of setting
Change decision threshold value is 1%.
Compared with prior art, it is an advantage of the current invention that: the inventive method includes three parts, newly go up electricity sensor
Node obtains the network address and up routed path and the downstream routing path of itself, becomes network access node；Each network access node
Obtain the dump energy of itself, carry out network operation；Any one network access node power-off is left and is become during wireless sensor network
Lower electrical nodes, then carry out network reconnection, during new node adds network and network reconnection, because each node is not required to
Preserve the relevant information of networking neighbor node, by gateway be responsible for will be interrelated between each node and networking neighbor node
Come, and make gateway be also easier to assess the quality of connection of every paths using path weight value parameter, therefore when network occurs
During change (when having the sensor node newly going up electricity or certain network access node to be changed into lower electrical nodes), gateway can generate optional path,
And be rapidly selected out under current network and can distribute and energy expenditure optimum balancing flow by comparing path weight value parameter
Transmission path, and in time this transmission path is handed down to the node of request using it is ensured that the reliability service of network, extend whole
The service life of volume grid.
Brief description
Fig. 1 is that the sensor node newly going up electricity obtains the network address and up routed path and the downstream routing road of itself
Footpath, becomes the idiographic flow block diagram of network access node；
Fig. 2 is the composition schematic diagram of routing weights table；
Fig. 3 is that each network access node obtains the dump energy of itself, carries out the idiographic flow block diagram of network operation；
Fig. 4 leaves for any one network access node power-off becomes lower electrical nodes during wireless sensor network, then carries out network
The idiographic flow block diagram rebuild.
Specific embodiment
Below in conjunction with accompanying drawing embodiment, the present invention is described in further detail.
A kind of method for routing of wireless sensor network proposed by the present invention, it includes three parts: newly goes up the sensor of electricity
Node obtains the network address and up routed path and the downstream routing path of itself, becomes network access node；Each network access node
Obtain the dump energy of itself, carry out network operation；Any one network access node power-off is left and is become during wireless sensor network
Lower electrical nodes, then carry out network reconnection.
Wherein, as shown in figure 1, the detailed process of Part I is:
A1, the route discovery of the sensor node locally-unique address that comprises itself for periodic broadcasting with t1 newly going up electricity disappear
Breath.
Here, t1 can be decided in its sole discretion by user, the use of sensor node if generally t1 is shorter, can be affected
In the life-span, the joining day of the sensor node subsequently treating electricity if t1 is longer, can be extended, therefore in specific implementation process
The span of t1 can be set to 100ms≤t1≤1000ms.
A2, each the networking neighbor node response bag receiving routediscovery messages contain itself hop count and the net of itself
The route Reference News of network address.
Here, networking neighbor node is the gateway that can receive the routediscovery messages of sensor node broadcasts newly going up electricity
And/or sensor node；The routediscovery messages newly going up the sensor node broadcasts of electricity may only be received by gateway, or only by 1
Individual or multiple sensor nodes receive, or are received by gateway and sensor node, and therefore networking neighbor node may be only gateway
(when the sensor node newly going up electricity is for the 1st upper electrical nodes, networking neighbor node is gateway), may be only sensor node,
It is probably 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 go up the sensor node of electricity after the route Reference News receiving the response of each networking neighbor node, will be from
Cycle, the dump energy coefficient of itself, the route of each networking neighbor node are sent on the locally-unique address of body, the data of itself
Jumping figure and the network address form new network registration message.
A4, when there is gateway in all networking neighbor nodes, the sensor node newly going up electricity is by new network registration message
It is sent to gateway.
When there is not gateway in all networking neighbor nodes, the sensor node newly going up electricity is from all networking neighbor nodes
In the middle of the up interim route as the sensor node newly going up electricity for the minimum networking neighbor node of middle selection hop count
Node, new network registration message is sent to up interim route intermediate node by the sensor node then newly going up electricity, up faces
When route intermediate node pass through the up routed path of itself after receiving new network registration message and forward, be finally transmitted to net
Close.
, after receiving new network registration message, the routing weights table creating the sensor node newly going up electricity is (as schemed for a5, gateway
Shown in 2), this routing weights table includes newly going up the locally-unique address of sensor node of electricity, the network address, send the cycle in data
With the index of dump energy coefficient, the quantity of potential father node of the sensor node newly going up electricity and each potential father node, new
The quantity of the child node of sensor node of upper electricity and the index of each child node.
Here, the potential father node newly going up the sensor node of electricity be existed newly go up the upper of electric sensor node
One hop node (is newly gone up electric sensor node and is not necessarily set up with upper hop node and be connected), newly goes up the son of the sensor node of electricity
Node is the next-hop node being connected with the sensor node foundation newly going up electricity.
Here, newly go up the locally-unique address of sensor node of electricity, send cycle and dump energy coefficient in data it is known that
But the network address is also unallocated.
A6, when only existing gateway in wireless sensor network (newly go up electricity sensor node directly can set up with gateway
Connect), the sensor node newly going up electricity is distributed in the network address by gateway, and the sensor node so far newly going up electricity has added wirelessly
Sensor network becomes network access node；
When there are other nodes in wireless sensor network in addition to gateway, gateway traversal newly goes up the sensor node of electricity
All potential father nodes, obtain all possible paths between gateway and the sensor node newly going up electricity；Then gateway calculates often
The routing weights parameter of each the route intermediate node in bar possible path；Sequentially for any one possible path, gateway will
The minima in the routing weights parameter of all route intermediate nodes in this possible path is as the road of this possible path
Footpath weight parameter, considers, in the acquisition of this path weight value parameter, the road that can cause flow or energy throughput bottleneck in every possible path
By intermediate node, it is easy to gateway and every possible path is estimated；The maximum path weight value parameter pair of gateway selected value afterwards
The possible path answered as the up routed path of sensor node newly going up electricity and downstream routing path, and update newly go up electric
The routing weights table of each the route intermediate node in the up routed path of sensor node；Last gateway will comprise newly to go up electricity
The up routed path of sensor node and the path allocation message in downstream routing path be sent to newly go up electricity sensor section
Point, and the network address is distributed to the sensor node newly going up electricity, the sensor node so far newly going up electricity has added wireless sensing
Device network becomes network access node.
Here, route intermediate node is in possible path and to be located at the section between gateway and the sensor node newly going up electricity
Point；The corresponding possible path of path weight value parameter of the value maximum that gateway is chosen is being capable of balancing flow distribution and energy expenditure
Optimal path.
In this particular embodiment, the acquisition process routeing the routing weights parameter of intermediate node in step a6 is: for
Any one in any one possible path route intermediate node, and the routing weights parameter of this route intermediate node is designated as r,Wherein, e represents the dump energy coefficient of this route intermediate node, and f represents the flow system of this route intermediate node
Number,N represents the quantity of the child node of this route intermediate node, tiRepresent i-th son section of this route intermediate node
The cycle is sent, k is weight proportion coefficient, the concrete value of k can be adjusted according to practical situation, typically can be 0.5 in the data of point
Value in the range of≤k≤1.5, if stressing e, can 1 < value in the range of k≤1.5, if stressing f, can 0.5≤k <
Value in the range of 1, balances the weight relationship of e and f when taking k=1.
Here, it is contemplated that routeing the stream of intermediate node during the routing weights parameter calculating route intermediate node
This factor of influence of coefficient of discharge is so that calculated routing weights parameter is more rationally it is ensured that assignment of traffic is disappeared with energy
The equilibrium of consumption.
As shown in figure 3, the detailed process of Part II is:
B1, each network access node obtain the dump energy of itself with t2 for the cycle；Sequentially for any one network access node,
When the dump energy variable quantity of this network access node has exceeded the electric quantity change decision threshold of setting, this network access node will comprise certainly
The route maintenance message of the dump energy coefficient of body is sent to gateway by the up routed path of this network access node.
Here, the value of t2 generally can may be configured as daily by user's sets itself, that is, 24 hours are a week
Phase；The dump energy that the dump energy variable quantity of this network access node obtained by this this cycle of network access node compares and is protected on gateway
The decrement of the dump energy of this network access node deposited；The electric quantity change decision threshold value setting is as 1%.
B2, gateway, after receiving route maintenance message, update the route power of the network access node sending this route maintenance message
Dump energy coefficient in weight table, realizes network operation.
As shown in figure 4, the detailed process of Part III is:
C1, for any one network access node, become lower electricity when wireless sensor network is left in this network access node power-off
Node, the child node of this electrical nodes at present cannot send data on electrical nodes downwards, here, the child node of lower electrical nodes be with
Lower electrical nodes set up the next-hop node connecting.
C2, lower electrical nodes each child node determine its father node power-off after, broadcast and be used for showing that walking along the street is by road thereon
Footpath cannot on send the path failed message of data.
C3, the path failed message for the broadcast of any one child node, receive each networking of this path failed message
Neighbor node response bag contains the route Reference News of the hop count of itself and the network address of itself；Here, networking neighbours section
Point is the gateway of path failed message of child node broadcast and/or the sensor node that can receive lower electrical nodes.
When there is gateway in all networking neighbor nodes receiving this path failed message, broadcast this path failed message
Child node the routing update message of the network address comprising lower electrical nodes is sent to gateway.
When there is not gateway in all networking neighbor nodes receiving this path failed message, broadcasting this path and unsuccessfully disappearing
The child node of breath selects a minimum networking of hop count from all networking neighbor nodes receiving this path failed message
Neighbor node, as the up interim routing node of the child node broadcasting this path failed message, then will comprise lower electrical nodes
The routing update message of the network address is sent to up interim routing node, and up interim routing node disappears receiving routing update
Pass through the up routed path of itself after breath to forward, be finally transmitted to gateway.
, after receiving routing update message, under deleting, the routing weights table of electrical nodes and lower electrical nodes are at it for c4, gateway
Index in the routing weights table of his network access node.
C5, any one child node for lower electrical nodes, gateway travels through all potential father node of this child node, obtains
All possible paths between gateway and this child node, gateway calculates the road of each the route intermediate node in every possible path
By weight parameter, for any one possible path, gateway is by the route of all route intermediate nodes in this possible path
Minima in weight parameter is as the path weight value parameter of this possible path, the maximum path weight value parameter of gateway selected value
Corresponding possible path is as the uplink and downlink routed path of this child node, and updates in the up routed path of this child node
Each route intermediate node routing weights table.
Here, the potential father node of this child node be this child node having existed upper hop node (this child node with
Upper hop node not necessarily sets up connection)；Route intermediate node is in possible path and to be located between gateway and this child node
Node；The corresponding possible path of path weight value parameter of the value maximum that gateway is chosen is being capable of balancing flow distribution and energy expenditure
Optimal path.
C6, gateway will comprise the up routed path of each child node itself and the path allocation message in downstream routing path
It is sent to corresponding child node, after receiving path allocation message, comprise in storing path assignment messages is upper for each child node
Row routed path and downstream routing path, and send data according on the up routed path preserving, so far complete network reconnection.
Claims (3)
1. a kind of method for routing of wireless sensor network is it is characterised in that include three parts: the sensor node newly going up electricity obtains
Take from the network address and up routed path and the downstream routing path of body, become network access node；Each network access node is obtained from
The dump energy of body, carries out network operation；Any one network access node power-off is left becomes lower electricity section during wireless sensor network
Point, then carry out network reconnection；
Wherein, the detailed process of Part I is:
A1, newly go up electricity sensor node locally-unique address that itself is comprised for periodic broadcasting with t1 routediscovery messages；
A2, each the networking neighbor node response bag receiving routediscovery messages contain itself hop count and the network of itself ground
The route Reference News of location；
Here, networking neighbor node be can receive newly go up electricity the gateway of the routediscovery messages of sensor node broadcasts and/
Or sensor node；
A3, newly go up electricity sensor node receive each networking neighbor node response route Reference News after, by itself
Cycle, the dump energy coefficient of itself, the hop count of each networking neighbor node are sent on locally-unique address, the data of itself
Form new network registration message with the network address；
A4, when there is gateway in all networking neighbor nodes, newly go up electricity sensor node new network registration message is sent
To gateway；
When there is not gateway in all networking neighbor nodes, the sensor node newly going up electricity selects from all networking neighbor nodes
Select a minimum networking neighbor node of hop count as the up interim route intermediate node of the sensor node newly going up electricity,
New network registration message is sent to up interim route intermediate node, up interim route by the sensor node then newly going up electricity
Intermediate node passes through the up routed path of itself after receiving new network registration message and forwards, and is finally transmitted to gateway；
A5, gateway, after receiving new network registration message, create the routing weights table of the sensor node newly going up electricity, and this route is weighed
Weight table include newly go up the electric locally-unique address of sensor node, the network address, send in data cycle and dump energy coefficient,
Newly go up the quantity of potential father node of sensor node of electricity and the index of each potential father node, newly go up electric sensor node
The quantity of child node and each child node index；
Here, the potential father node newly going up the sensor node of electricity is the upper hop of the sensor node newly going up electricity having existed
Node；
A6, when only existing gateway in wireless sensor network, gateway the network address is distributed to newly go up electricity sensor node,
So far the sensor node newly going up electricity has added wireless sensor network to become network access node；
When there are other nodes in wireless sensor network in addition to gateway, gateway traversal newly goes up all of the sensor node of electricity
Potential father node, obtains all possible paths between gateway and the sensor node newly going up electricity；Then gateway calculate every can
The routing weights parameter of each the route intermediate node in energy path；Sequentially for any one possible path, gateway by this
The minima in the routing weights parameter of all route intermediate nodes in possible path is weighed as the path of this possible path
Weight parameter；The maximum corresponding possible path of path weight value parameter of gateway selected value is as the sensor node newly going up electricity afterwards
Up routed path and downstream routing path, and update each route in the up routed path of sensor node newly going up electricity
The routing weights table of intermediate node；Last gateway will comprise up routed path and the downstream routing of the sensor node newly going up electricity
The path allocation message in path is sent to the sensor node newly going up electricity, and the network address is distributed to the sensor section newly going up electricity
Point, the sensor node so far newly going up electricity has added wireless sensor network to become network access node；
Here, route intermediate node is in possible path and to be located at the node between gateway and the sensor node newly going up electricity；Net
Closing the maximum corresponding possible path of path weight value parameter of the value chosen is can to distribute the optimum with energy expenditure by balancing flow
Path；
The acquisition process routeing the routing weights parameter of intermediate node in described step a6 is: for any one possible path
In any one route intermediate node, the routing weights parameter of this route intermediate node is designated as r,Wherein, e
Represent the dump energy coefficient of this route intermediate node, f represents the discharge coefficient of this route intermediate node,N represents
The quantity of the child node of this route intermediate node, tiRepresent and send the cycle in the data of i-th child node of this route intermediate node,
K is weight proportion coefficient；
The detailed process of Part II is:
B1, each network access node obtain the dump energy of itself with t2 for the cycle；Sequentially for any one network access node, when this
When the dump energy variable quantity of network access node has exceeded the electric quantity change decision threshold of setting, this network access node will comprise itself
The route maintenance message of dump energy coefficient is sent to gateway by the up routed path of this network access node；
B2, gateway, after receiving route maintenance message, update the routing weights table of the network access node sending this route maintenance message
In dump energy coefficient, realize network operation；
The detailed process of Part III is:
C1, for any one network access node, become lower electrical nodes when wireless sensor network is left in this network access node power-off,
The child node of this electrical nodes at present cannot send data on electrical nodes downwards；
C2, lower electrical nodes each child node determine its father node power-off after, broadcast and be used for showing that row routed path is no thereon
The path failed message of data is sent on method；
C3, the path failed message for the broadcast of any one child node, receive each networking neighbours of this path failed message
Node response bag contains the route Reference News of the hop count of itself and the network address of itself；Here, networking neighbor node is
The gateway of path failed message of child node broadcast and/or the sensor node of lower electrical nodes can be received；
When there is gateway in all networking neighbor nodes receiving this path failed message, broadcast the son of this path failed message
The routing update message of the network address comprising lower electrical nodes is sent to gateway by node；
When there is not gateway in all networking neighbor nodes receiving this path failed message, broadcast this path failed message
Child node selects minimum networking neighbours of hop count from all networking neighbor nodes receiving this path failed message
Node, as the up interim routing node of the child node broadcasting this path failed message, then will comprise the network of lower electrical nodes
The routing update message of address is sent to up interim routing node, and up interim routing node is after receiving routing update message
Forwarded by the up routed path of itself, be finally transmitted to gateway；
C4, gateway, after receiving routing update message, are deleted the routing weights table of lower electrical nodes and lower electrical nodes are entered at other
Index in the routing weights table of net node；
C5, any one child node for lower electrical nodes, gateway travels through all potential father node of this child node, obtains gateway
All possible paths and this child node between, gateway calculates the route power of each the route intermediate node in every possible path
Weight parameter, for any one possible path, gateway is by the routing weights of all route intermediate nodes in this possible path
Minima in parameter corresponds to as the path weight value parameter of this possible path, the maximum path weight value parameter of gateway selected value
Possible path as the uplink and downlink routed path of this child node, and update every in the up routed path of this child node
The routing weights table of individual route intermediate node；
Here, the potential father node of this child node is the upper hop node of this child node having existed；Routeing intermediate node is
In possible path and positioned at the node between gateway and this child node；The path weight value parameter of the value maximum that gateway is chosen is corresponding
Possible path is can to distribute the optimal path with energy expenditure by balancing flow；
The path allocation message of the up routed path comprising each child node itself and downstream routing path is sent by c6, gateway
To corresponding child node, each child node after receiving path allocation message, the upper walking along the street that comprises in storing path assignment messages
By path and downstream routing path, and send data according on the up routed path preserving, so far complete network reconnection.
2. a kind of method for routing of wireless sensor network according to claim 1 is it is characterised in that described step a1
The span of middle t1 is [100ms, 1000ms].
3. a kind of method for routing of wireless sensor network according to claim 1 is it is characterised in that described step b1
In take t2 to be 24 hours, the dump energy variable quantity of this network access node is the dump energy phase that this this cycle of network access node obtains
The decrement of the dump energy of this network access node relatively being preserved on gateway, the electric quantity change decision threshold value setting as
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 CN103813408A (en) | 2014-05-21 |
| CN103813408B true 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) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9792129B2 (en) * | 2014-02-28 | 2017-10-17 | Tyco Fire & Security Gmbh | Network range extender with multi-RF radio support for plurality of network interfaces |
| US9316720B2 (en) | 2014-02-28 | 2016-04-19 | Tyco Fire & Security Gmbh | Context specific management in wireless sensor network |
| CN106162781A (en) * | 2015-03-31 | 2016-11-23 | 富士通株式会社 | The changing method of routing node, device and wireless sensor network |
| 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 |
| CN107959612B (en) * | 2016-10-18 | 2022-04-15 | 中兴通讯股份有限公司 | Method and device for self-adaptive adjustment of service tunnel under network transition |
| CN107360608A (en) * | 2017-06-07 | 2017-11-17 | 海信集团有限公司 | The method and device of rerouting in super-intensive network UDN |
| CN108541039B (en) * | 2018-04-24 | 2021-10-22 | 苏州市职业大学 | Low-power-consumption wireless sensor network static node routing method |
| CN113133127B (en) * | 2021-04-16 | 2023-12-12 | 成都易明半导体有限公司 | Wireless ad hoc network link quick network access method based on random sniffing |
Citations (3)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8630222B2 (en) * | 2011-02-24 | 2014-01-14 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
-
2014
- 2014-02-25 CN CN201410063335.8A patent/CN103813408B/en active Active
Patent Citations (3)
| 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 |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103813408A (en) | 2014-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103813408B (en) | Routing method of wireless sensor network | |
| TWI384824B (en) | Method for providing routing protocols in a frequency hopping spread spectrum network | |
| CN104768201B (en) | Data transmission method, system in Internet of Things, internet of things equipment, terminal | |
| TWI222296B (en) | Monitoring link quality in a mobile ad hoc network | |
| CN106714263B (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| TW200913576A (en) | Method and system for providing network and routing protocols for utility services | |
| CN103986648B (en) | One kind is based on link stability and Energy-aware Internet of Things method for repairing route | |
| CN102664784B (en) | A kind of mapping method of virtual network of node link pressure weight adaptive equalization | |
| CN104734372A (en) | Energy adaptive charging method combined with geographical location routing in WRSNs | |
| CN104756539A (en) | Methods and apparatuses for congestion management in wireless networks with mobile HTTP adaptive streaming | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| CN102595505A (en) | Distributed routing method based on node load balancing for wireless sensor network | |
| CN103338495A (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| TWI426811B (en) | Mobile ad hoc network and method for establishing routing thereof | |
| TW201138508A (en) | Registration of a new node to a meter reading wireless mesh network and associated system | |
| US20150139185A1 (en) | Peer-to-peer traffic localization | |
| Valerio et al. | Cellular traffic offloading via opportunistic networking with reinforcement learning | |
| CN108471628A (en) | A kind of path control deivce having optimization network load | |
| CN108848030A (en) | Data transmission method and system | |
| CN102036335B (en) | Route cognizing protocol for wireless network | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| US10362616B2 (en) | Selection of capillary network gateway to a cellular network | |
| CN106488502A (en) | A kind of method of the raising network service quality suitable for radio sensing network | |
| EP2891285B1 (en) | Mesh network nodes configured to alleviate congestion in cellular network | |
| CN101867993B (en) | Multi-path routing method based on route correlation degree |
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 |