CN108541039A - A kind of power consumption wireless sensor network static node-routing method - Google Patents
A kind of power consumption wireless sensor network static node-routing method Download PDFInfo
- Publication number
- CN108541039A CN108541039A CN201810371113.0A CN201810371113A CN108541039A CN 108541039 A CN108541039 A CN 108541039A CN 201810371113 A CN201810371113 A CN 201810371113A CN 108541039 A CN108541039 A CN 108541039A
- Authority
- CN
- China
- Prior art keywords
- node
- sensor node
- base station
- sensor
- path
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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
Abstract
The present invention refers to a kind of power consumption wireless sensor network static node-routing method, including：Wireless sensor network initializing set；Obtain topology information；Optimal path of the calculation base station to all the sensors node；It selects an operating path and sends it to all the sensors node on the path；The data and dump energy that the home sensor node occurred on operating path perceives itself, the next-hop sensor node being transmitted to along optimal path on path；Next-hop sensor node merges the perception data and dump energy of itself, relays to next next-hop sensor node, and so on, until base station receives all the sensors node data on path；The dump energy of topology information interior joint is updated, calculating does not receive the sensor node of data to the optimal path of base station；Abovementioned steps are repeated, until all node datas all collect completion.The present invention can realize saving energy, extend network life.
Description
Technical field
The present invention relates to wireless sensor network route technology fields, belong to a kind of power consumption wireless sensor network static
Node-routing method.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) is a kind of distributed sensor, is made
For the core technology of Internet of Things and big data, in recent years, by the extensive concern of industrial quarters and academia.Wireless sensor network
It is formed by being deployed in a large amount of static or mobile microsensor node in monitoring region, the data of sensor node monitoring
Along other sensors node, hop-by-hop is transmitted through wireless communication, and in transmission process monitoring data may
By multiple node processings, it is routed to aggregation node after multi-hop, collaboratively perceives, acquire, processing and transmission network cover ground
The information for being perceived object in region is managed, these information are sent to finally by internet or satellite the manager of network.Its
Structure is as shown in Figure 1.
Important composition element of the sensor node as wireless sensor network, in addition to carrying out at local information collection and data
Reason is outer, also to forward the data come to be stored, managed and merged other nodes.And the processing of these sensor nodes itself
Ability, storage capacity and communication capacity are relatively weak, and the power supply capacity of battery is limited.Energy consumption how is saved, Web vector graphic is extended
Service life is a hot research problem of wireless sensor network.
Power consumption wireless sensor network static node-routing, the sensor node position suitable for entire sensor network
Fixed scene.Sensor node is ensureing network connectivty by the topology information of acquisition wireless sensor network
In the case of, base station (or gateway) generates sensor node to the optimal routed path of base station (or gateway), saves to the greatest extent
Network energy consumes, and reduces node interference, extends network life.
Currently, there are mainly three types of modes for wireless sensor network method for routing：Routing based on plane, the routing based on level
With location-based routing.
Routing based on plane is each sensor that is, in wireless sensor network for the opposite routing based on level
Node is all reciprocity, without level or master-slave.Each sensor node in network both knows about other nodes to base station
The path of cost minimization, plane road is by being exactly to select best routed path using certain graph-theoretical algorithm.(Gulista
Khan,Gaurav Bathla and Wajid Ali.Minimum Spanning Tree based Routing Strategy
for Homogeneous WSN.International Journal on Cloud Computing:Services and
Architecture,Vol.1,No.2,August 2011)
Routing based on level is according to certain regular partition by the node in wireless sensor network into several clusters,
Leader cluster node is served as there are one node in each cluster, perception data is sent to leader cluster node by the node in cluster, and leader cluster node comes
The fusion of data is completed, and is transmitted to base station or gateway (Zhou R, Chen M, Feng G, et al.Genetic
clustering route algorithm in WSN[C].Sixth International Conference on
Natural Computation.IEEE,2010:4023-4026.).It is different according to the level depth of cluster, whole network can be drawn
It is divided into two-layer structure, three-decker or even four-layer structure (Fawzy A E, Amer A, Shokair M, et al.Four-
layer routing protocol with Location based Topology Control of active nodes
in WSN[C].International Conference on Computer Engineering&Systems.IEEE,
2017.)。
Location-based routing is that wireless sensor network is divided into several regions according to geographical location information, then sharp
Routing function is realized with the routing algorithm (such as DSR or AODV) of existing traditional network.(Jeong Y,Lee S.Location-
based Routing(LBR)Algorithm to Improve Efficiency in the Wireless Sensor
Network[J].Journal of Korean Institute of Communications&Information
Sciences,2007,32.)。
Invention content
It is an object of the invention to the roads for wireless sensor network under sensor node energy resource limited circumstances
A kind of power consumption wireless sensor network static node-routing method is provided by problem, can realize saving energy, extends network
Service life.
In order to achieve the above objectives, the present invention provides the following technical solutions：
A kind of power consumption wireless sensor network static node-routing method, the wireless sensor network include at least one
A sensor node, the described method comprises the following steps：
S101：Wireless sensor network described in initializing set, wherein include at least and specified uniquely for sensor node
id；
S102：Topology information is sent to and the nothing by the topology information for obtaining the wireless sensor network
The corresponding base station of line sensor network；
S103：Based on the topology information, the base station is calculated to the optimal path of all the sensors node,
Constitute an optimal path set；
S104：According to the screening rule of setting using select the wherein optimal path in the optimal path set as
Operating path, all the sensors node information of operating path being sent on the operating path；
S105：The data and dump energy that the home sensor node occurred on operating path perceives itself, along work
The next-hop sensor node being transmitted to as path on operating path；Next-hop sensor node merge the perception data of itself and
Dump energy relays to next next-hop sensor node, and so on, until base station receives the institute on operating path
There is sensor node data；
S106：The perception data and dump energy of all the sensors node on operating path are received in response to base station, are updated
The dump energy of respective sensor node in topology information possessed by base station；
S107：Based on updated topology information, recalculates and be not collected the sensor nodes of data to base station
Optimal path, update optimal path set；
S108：S104 to S107 is repeated, until collecting the perception data and dump energy for completing all the sensors node.
In further embodiment, in step S101, wireless sensor network described in initializing set further includes：Setting passes
The primary power of sensor node, the data transmission maximal bit digit K that sensor node is set.
In further embodiment, in step S104, according to the screening rule of setting to select the optimal path set
In a wherein optimal path refer to as operating path,
Select to meet path terminal note data are not collected and route jumping figure is most optimal path as operating path.
In further embodiment, in step S102, the topology information of the wireless sensor network is obtained, will be opened up
The method that structural information is sent to base station corresponding with the wireless sensor network is flutterred to include the following steps：
S201：In the broadcast HELLO message time sections of a setting, each sensor in the wireless sensor network
Node periodically broadcasts a HELLO message informations, the HELLO message informations include sensor node itself id and
" HELLO " text；
S202：The sensor node for receiving other sensors node HELLO message informations feeds back to a back message RESP
Information, back message RESP information include the id and location information of the sensor node itself；
S203：Terminate in response to broadcast HELLO message time sections, the one of each each self-generating of sensor node oneself jumps neighbour
Connect table, a jump adjacency list include its all neighbor node id, with neighbor node distance d；
S204：All the sensors node jumps adjacency list by oneself one and dump energy information is sent to base station；
S205：All jump adjacency lists received are merged in base station, obtain the topology of entire wireless sensor network
Structural information generates network topological diagram.
In further embodiment, the network topological diagram be a weighted-graph, be defined as TG=(V, E,
W).Wherein, V is the set of node in figure,It is side collection in figure, W is the weight set on side.
In further embodiment, the format of the weighted-graph is shown in Table 1：
The format for the network topological diagram that 1. base station of table generates
Wherein, v(i)Indicate sensor node number, e(i)Indicate sensor node v(i)Dump energy, "-" indicate topology
It is acyclic to scheme itself, d(ij)Indicate sensor node v(i)And v(j)The distance between, w(ij)Indicate sensor node v(i)And v(j)Between
Constitute the weight on side, i=1,2 ... n, j=1,2 ... n.
In further embodiment, according to sensor node v(i)And v(j)Location information, using Euclidean distance formula with
D is calculated(ij)。
In further embodiment, in step S103, the base station is calculated to the optimal road of all the sensors node
The method of diameter includes the following steps：
S301：Initialize calculation process：Base station number is set to v(0), initial season S={ V(0), in T={ V-S }, T
The side right weight values that sensor node is constituted meet the following conditions：
If v(0)And v(i)It is adjacent side, w(0i)It is data from base station v(0)It is transferred to sensor node v(i)Energy expenditure
Value, if energy consumption numerical value is more than the dump energy of the node, w(0i)For infinity；
If v(0)And v(i)It is not adjacent side, w(0i)For infinity；
S302：The sensor node v of a weights minimum is chosen from T(min)It is added in S, and updates all transfers
Sensor node dump energy；
S303：The weighted value of remaining sensor node in T is updated：If adding v(min)After making intermediate node, from v(0)
To v(i)Side right weight values reduce, then change its side right weight values；
S304：Above-mentioned S302 to S303 is repeated, stops this when in S including all sensor nodes, i.e. V=S
Calculation process.
In further embodiment, the side right weight in the network topological diagram is calculated according to following formula：
Wherein, EstartFor the energy expenditure of home sensor node, EohtersFor the sensing in addition to home sensor node
The energy expenditure of device node, ER(k) it is the energy expenditure for receiving data, ET(k) it is the energy expenditure of transmission data.
In further embodiment, according to following formula to calculate the ER(k) and ET(k)：
ER(k)=Eelec*k
ET(k)=Eelec*k+eamp*k*d2
Wherein, EeleC=50nJ/bit, eapm=100pJ/bit/m2, k is the bit numbers of data transmission, and d is sensor section
Distance between point.
The beneficial effects of the present invention are：
(1) plane road is based on by topological structure is simple, and management service is convenient.
(2) concentrated route algorithm avoids the conflict of sensor node data transmission.
(3) method for routing has considered residue energy of node and euclidean distance between node pair information, improves the energy of routed path
Measure the accuracy of consumption calculations.
(4) routing algorithm chooses the minimum path of energy expenditure and carries out data transfer, saves the energy consumption of whole network, extends
Network lifecycle.
Above description is only the general introduction of technical solution of the present invention, in order to better understand the technical means of the present invention,
And can be implemented in accordance with the contents of the specification, below with presently preferred embodiments of the present invention and after coordinating attached drawing to be described in detail such as.
Description of the drawings
Fig. 1 is the flow chart of the power consumption wireless sensor network static node-routing method of the present invention.
Fig. 2 is the structural schematic diagram of the wireless sensor network of the present invention.
Fig. 3 is the flow chart of the embodiment of the present invention one.
Fig. 4 is the network topological diagram generated according to topology information.
Specific implementation mode
With reference to the accompanying drawings and examples, the specific implementation mode of the present invention is described in further detail.Implement below
Example is not limited to the scope of the present invention for illustrating the present invention.
The present invention refers to a kind of power consumption wireless sensor network static node-routing method.
Embodiment one
In conjunction with Fig. 2, the wireless sensor network includes at least one sensor node, is provided with base correspondingly
It stands, network, server etc., by this structure to realize that server receives the collected data of sensor node institute, into
And realize server to all the sensors node collected data application and management.
On the basis of the wireless sensor network that Fig. 2 is proposed, in conjunction with Fig. 1, Fig. 3, the power consumption wireless sensor
Network static node-routing method includes the following steps：
(1) wireless sensor network described in initializing set
S101：Wireless sensor network described in initializing set, wherein include at least and specified uniquely for sensor node
Id, for example, sensor node set number v(i)、viOr Vi etc. is used as its unique id, wherein i=1,2 ... n are selected assorted
The number of type is determined by user.
Preferably, in step S101, wireless sensor network described in initializing set further includes：Sensor node is set
Primary power, the data transmission maximal bit digit K that sensor node is arranged, the optimal path for subsequently selected data transmission are done
Place mat.
(2) topology information of the wireless sensor network is obtained
S102：Topology information is sent to and the nothing by the topology information for obtaining the wireless sensor network
The corresponding base station of line sensor network, base station can be expressed as base or selection one can be even closer right with sensor node
The number answered is as its id, such as v(0)、v0Or V0 etc..
Base station receives topology information, it is organized into network topological diagram, and in order to subsequently use, Fig. 4 is that basis is opened up
The one of which example of the network topological diagram of structural information generation is flutterred, in this example embodiment, the network topological diagram includes 5 sensings
Device node V1-V5, V0 are base station, and V2, V4, V5 and base station V0 are abutted, and can be directly realized by data transmission, and V1, V3 are then respectively required for
To pass through V2, V4 or V5 transfer could realize data transmission with base station V0.
The present invention further mentions a kind of method generating the network topological diagram as mentioned in Fig. 4, and this method includes following step
Suddenly：
S201：In the broadcast HELLO message time sections of a setting, each sensor in the wireless sensor network
Node periodically broadcasts a HELLO message informations, the HELLO message informations include sensor node itself id and
" HELLO " text.
S202：The sensor node for receiving other sensors node HELLO message informations feeds back to a back message RESP
Information, back message RESP information include the id and location information of the sensor node itself.
S203：Terminate in response to broadcast HELLO message time sections, the one of each each self-generating of sensor node oneself jumps neighbour
Connect table, a jump adjacency list include its all neighbor node id, with neighbor node distance d.
S204：All the sensors node jumps adjacency list by oneself one and dump energy information is sent to base station；
S205：All jump adjacency lists received are merged in base station, obtain the topology of entire wireless sensor network
Structural information generates network topological diagram.
By the above method generate network topological diagram can be simple and clear expression node and node between relationship, away from
From relationship, distance between node and base station, for the power consumption wireless sensor network static node-routing mentioned by the present invention
The next step of method is prepared.
(3) base station is calculated to the optimal path of all the sensors node, generates optimal path set
S103：Based on the topology information, the base station is calculated to the optimal path of all the sensors node,
Constitute an optimal path set.
For the ease of using, optimal path set is denoted as Path by the present inventionopt={ P1,P2,P3,…,Pn}。
The base station is calculated to the optimal path of all the sensors node, needing will be at network topological diagram further quantization
Reason, the present invention propose one of which quantification manner.
In a base station, the network topological diagram is a weighted-graph, is defined as TG=(V, E, W).Wherein, V
It is the set of node in figure,It is side collection in figure, W is the weight set on side.
The format of the weighted-graph is shown in Table 1：
The format for the network topological diagram that 1. base station of table generates
Wherein, v(i)Indicate sensor node number, e(i)Indicate sensor node v(i)Dump energy, "-" indicate topology
It is acyclic to scheme itself, d(ij)Indicate sensor node v(i)And v(j)The distance between, w(ij)Indicate sensor node v(i)And v(j)Between
Constitute the weight on side, i=1,2 ... n, j=1,2 ... n.
According to sensor node v(i)And v(j)Location information, d can be calculated using Euclidean distance formula(ij)。
As for the side right weight in network topological diagram, it is assumed that P={ v1→v2→v3→…→vm→ base } it is sensor node
v1One to base station jumps path, using the energy expenditure of data transmission as the weight on side, in addition to node v1It only needs to receive primary
Except data of transmission, other nodes v2,v3,…,vmIt is required for receiving data twice and sends data twice.
Therefore, the side right weight in network topological diagram can be calculated by following formula：
Wherein, EstartFor the energy expenditure of home sensor node, EohtersFor the sensing in addition to home sensor node
The energy expenditure of device node, ER(k) it is the energy expenditure for receiving data, ET(k) it is the energy expenditure of transmission data.
According to following formula to calculate ER(k) and ET(k)：
ER(k)=Eelec*k
ET(k)=Eelec*k+eamp*k*d2
Wherein, Eelec=50nJ/bit, eapm=100pJ/bit/m2, k is the bit numbers of data transmission, and d is sensor node
Between distance
On this basis, the method that the base station is calculated to the optimal path of all the sensors node includes following step
Suddenly：
S301：Initialize calculation process：Base station number is set to v(0), initial season S={ V(0), in T={ V-S }, T
The side right weight values that sensor node is constituted meet the following conditions：
If v(0)And v(i)It is adjacent side, w(0i)It is data from base station v(0)It is transferred to sensor node v(i)Energy expenditure
Value, if energy consumption numerical value is more than the dump energy of the node, w(0i)For infinity.
If v(0)And v(i)It is not adjacent side, w(0i)For infinity.
S302：The sensor node v of a weights minimum is chosen from T(min)It is added in S, and updates all transfers
Sensor node dump energy.
S303：The weighted value of remaining sensor node in T is updated：If adding v(min)After making intermediate node, from v(0)
To v(i)Side right weight values reduce, then change its side right weight values.
S304：Above-mentioned S302 to S303 is repeated, stops this when in S including all sensor nodes, i.e. V=S
Calculation process.
(4) operating path, all the sensors node information of operating path being sent on the operating path are selected
S104：According to the screening rule of setting using select the wherein optimal path in the optimal path set as
Operating path, all the sensors node information of operating path being sent on the operating path.
Which optimal path in optimal path set is selected to be determined by actual demand as operating path, wherein needing comprehensive
It closes and considers that sensor node quantity included in operating path, the dump energy of sensor node, sensor node data are adopted
Collect priority etc. various factors.
In some instances, we select to meet the optimal path that path terminal note data are not collected and route jumping figure is most
As operating path, the sensor node data of most quantity is once obtained with this.
(5) all the sensors node data on collecting work path
S105：The data and dump energy that the home sensor node occurred on operating path perceives itself, along work
The next-hop sensor node being transmitted to as path on operating path；Next-hop sensor node merge the perception data of itself and
Dump energy relays to next next-hop sensor node, and so on, until base station receives the institute on operating path
There is sensor node data.
Assuming that the operating path in step S104 is
Popt={ v(1)→v(2)→v(3)→…→v(m)→base}
By operating path PoptInformation be sent to all the sensors node on the operating path, i.e. v(1),v(2),
v(3),…,v(m), the home sensor node v that occurs on path(1)By data and dump energy that itself is perceived, along optimal road
Diameter is transmitted to the next-hop sensor node v on path(2)；Next-hop sensor node v(2)It merges the perception data of itself and remains
Complementary energy relays to next next-hop sensor node v(3), and so on, until base station receives operating path Popt
On all the sensors node data.
(6) dump energy of respective sensor node in topology information possessed by base station is updated
S106：The perception data and dump energy of all the sensors node on operating path are received in response to base station, are updated
The dump energy of respective sensor node in topology information possessed by base station.
(7) abovementioned steps (three) are referred to and complete other sensor node datas not being collected to step (6) to collect
S107：Based on updated topology information, recalculates and be not collected the sensor nodes of data to base station
Optimal path, update optimal path set.
S108：S104 to S107 is repeated, until collecting the perception data and dump energy for completing all the sensors node.
Embodiment two
In order to more clearly from illustrate the implementation process of the present invention, with smaller network size come to aforementioned in the present embodiment
Explanation is further elaborated in method.By taking the wireless sensor network in Fig. 4 as an example, that is, have 1 in wireless sensor network
Base station, 5 sensor nodes.
The first step carries out wireless sensor network initialization.If base station number is 0, id points of other 5 sensor nodes
It is not 1,2,3,4,5, the primary power of sensor node is 150 μ J, data transmission maximal bit digit K=100bit.According to
Energy consumption formulas in claim 5 can obtain, and receive the energy consumption E of dataR=5 μ J, the energy consumption E of transmission dataT=5+
d2/100μJ。
Second step, in certain period of time, each sensor node is periodically broadcasted in wireless sensor network
HELLO message informations, the HELLO message informations include the id and " HELLO " text of sensor node itself；Receive other sensings
The sensor node of device node HELLO message informations gives back message RESP, and back message RESP information includes sensor section
The point id and location information (x, y) of itself；After broadcasting the HELLO message stages, each sensor node can obtain oneself
One jump adjacency list, adjacency list information include its all neighbor node id, with neighbor node distance d；For example it is with node 3
Example, adjacency list information are (2,40), (4,50), (5,20).Later, all the sensors node is by oneself adjacency list and residual energy
Amount sends base station to；The all of its neighbor table received is merged in base station, and finally obtained entire wireless sensor network is opened up
Structural information is flutterred, as shown in the table, the network topological diagram of generation is shown in Fig. 4.
Third walks, the topology information based on second step, optimal path of the calculation base station to all the sensors node.Base
Tiny node number is V0, remaining sensor node is V1-V5 successively.Since base station is powered by cable power, base station
Energy is considered unlimited.In order to facilitate calculating, it is assumed that the dump energy of all the sensors node starts to be 100 μ J.
4th step, base station select one and meet the optimal path that path terminal note data are not collected and route jumping figure is most,
That is { 0,2,1 }.
The path V0, V2, V1 is sent to node V2 and V1 by the 5th step, base station, V1 along this path inverse path { 1-2-0 }
Oneself data of perception and the dump energy of V1 are sent to node V2, V2 again by the dump energy of the data and V2 of oneself perception
Together with the data of V1, base station is sent jointly to.The data of sensor node V1 and V2 just acquire and terminate in this way.
Next 6th step updates the dump energy of each sensor node in topology information, since first time is selected
There was only node V1 and V2 in the optimal path selected, so other nodes do not consume energy, therefore the dump energy of V3, V4 and V5
Remain as 100.Dump energy update carries out second of optimal path computation after completing.
Since the last dump energies of sensor node V2 are negative, therefore { 0,2,1 } path can not succeed.Sensor node again
The data of V1 and V2 are acquired, therefore it is second of optimal path to select { 0,5,3 } path.Base station sends the path V0, V5, V3
Node V5 and V3, V3 is given to be sent to the dump energy of data and V3 that oneself is perceived along the inverse path { 3-5-0 } in this path
Node V5, V5 send jointly to base station again by the data of oneself perception and the dump energy of V5 together with the data of V3.It senses in this way
The data of device node V5 and V3, which just acquire, to be terminated.Next the residual energy of each sensor node in topology information is updated
Amount, due to only node V5 and V3 in the optimal path of second selection, so other nodes do not consume energy, therefore V1,
The dump energy of V2 is still the dump energy of first time, and the dump energy of V4 remains as 100.After dump energy update is completed
Carry out third time optimal path computation.
Data due to being only left sensor node V4 sums do not acquire, therefore after first pass selects V4, algorithm just terminates,
{ 0,4 } path is third time optimal path.The path V0, V4 is sent to the inverse path { 4- of node V4, V4 along this path by base station
0 } oneself data of perception and the dump energy of V4 are sent to base station V0.Next each sensing in update topology information
The dump energy of device node, due to only node V4 in the optimal path of third time selection, so there is no consume for other nodes
Energy, therefore the dump energy of V1, V2 are still the dump energy of first time, the dump energy of V3, V5 are still secondary surplus
Complementary energy, the dump energy of V4 are the dump energy of third time.After dump energy update is completed, all the sensors in network
Node is just collected and is finished, and the routing procedure of the second wheel is then can be carried out.Above-mentioned algorithmic procedure is repeated to continue.
After terminating through wheel sensor node data acquisition, the energy expenditure of each sensor node and whole network is such as
Under：
Due to the selection of routed path be with the minimum selection criteria of energy consumption, therefore the path obtained according to the method for the present invention into
Row data transmission, the energy of consumption must be minimum, and then also service life of extended network.
Each technical characteristic of embodiment described above can be combined arbitrarily, to keep description succinct, not to above-mentioned reality
It applies all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, it is all considered to be the range of this specification record.
Several embodiments of the invention above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the protection of the present invention
Range.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (10)
1. a kind of power consumption wireless sensor network static node-routing method, which is characterized in that the wireless sensor network
Including at least one sensor node, the described method comprises the following steps：
S101：Wireless sensor network described in initializing set, wherein specify unique id including at least for sensor node；
S102：Topology information is sent to and the wireless biography by the topology information for obtaining the wireless sensor network
The corresponding base station of sensor network；
S103：Based on the topology information, the base station is calculated to the optimal path of all the sensors node, constitutes
One optimal path set；
S104：According to the screening rule of setting to select the wherein optimal path in the optimal path set as work
Path, all the sensors node information of operating path being sent on the operating path；
S105：The data and dump energy that the home sensor node occurred on operating path perceives itself, along working ways
Diameter is transmitted to the next-hop sensor node on operating path；Next-hop sensor node merges the perception data and residue of itself
Energy relays to next next-hop sensor node, and so on, until base station receives all biographies on operating path
Sensor node data；
S106：The perception data and dump energy of all the sensors node on operating path are received in response to base station, update base station
The dump energy of respective sensor node in possessed topology information；
S107：Based on updated topology information, the sensor node for not being collected data is recalculated to base station most
Shortest path updates optimal path set；
S108：S104 to S107 is repeated, until collecting the perception data and dump energy for completing all the sensors node.
2. power consumption wireless sensor network static node-routing method according to claim 1, which is characterized in that step
In S101, wireless sensor network described in initializing set further includes：Primary power, the setting sensor of sensor node are set
The data transmission maximal bit digit K of node.
3. power consumption wireless sensor network static node-routing method according to claim 1, which is characterized in that step
In S104, according to the screening rule of setting to select the wherein optimal path in the optimal path set as working ways
Diameter refers to,
Select to meet path terminal note data are not collected and route jumping figure is most optimal path as operating path.
4. the power consumption wireless sensor network static node-routing method according to any one of claim 1-3,
It is characterized in that, in step S102, obtains the topology information of the wireless sensor network, topology information is sent to
The method of base station corresponding with the wireless sensor network includes the following steps：
S201：In the broadcast HELLO message time sections of a setting, each sensor node in the wireless sensor network
A HELLO message informations are periodically broadcasted, which includes the id and " HELLO " text of sensor node itself
This；
S202：The sensor node for receiving other sensors node HELLO message informations feeds back to a back message RESP information,
Back message RESP information includes the id and location information of the sensor node itself；
S203：Terminate in response to broadcast HELLO message time sections, the one of each each self-generating of sensor node oneself jumps adjoining
Table, one jump adjacency list include its all neighbor node id, with neighbor node distance d；
S204：All the sensors node jumps adjacency list by oneself one and dump energy information is sent to base station；
S205：All jump adjacency lists received are merged in base station, obtain the topological structure of entire wireless sensor network
Information generates network topological diagram.
5. power consumption wireless sensor network static node-routing method according to claim 4, which is characterized in that described
Network topological diagram is a weighted-graph, is defined as TG=(V, E, W).Wherein, V is the set of node in figure,It is side collection in figure, W is the weight set on side.
6. power consumption wireless sensor network static node-routing method according to claim 5, which is characterized in that described
The format of weighted-graph is shown in Table 1：
The format for the network topological diagram that 1. base station of table generates
Wherein, v(i)Indicate sensor node number, e(i)Indicate sensor node v(i)Dump energy, "-" indicate topological diagram from
Body is acyclic, d(ij)Indicate sensor node v(i)And v(j)The distance between, w(ij)Indicate sensor node v(i)And v(j)Between constitute
The weight on side, i=1,2 ... n, j=1,2 ... n.
7. power consumption wireless sensor network static node-routing method according to claim 6, which is characterized in that according to
Sensor node v(i)And v(j)Location information, using Euclidean distance formula d is calculated(ij)。
8. power consumption wireless sensor network static node-routing method according to claim 6, which is characterized in that step
In S103, the method that the base station is calculated to the optimal path of all the sensors node includes the following steps：
S301：Initialize calculation process：Base station number is set to v(0), initial season S={ V(0), it senses in T={ V-S }, T
The side right weight values that device node is constituted meet the following conditions：
If v(0)And v(i)It is adjacent side, w(0i)It is data from base station v(0)It is transferred to sensor node v(i)Energy consumption values, if energy
The dump energy that numerical value is more than the node is consumed, then w(0i)For infinity；
If v(0)And v(i)It is not adjacent side, w(0i)For infinity；
S302：The sensor node v of a weights minimum is chosen from T(min)It is added in S, and updates the biography of all transfers
The dump energy of sensor node；
S303：The weighted value of remaining sensor node in T is updated：If adding v(min)After making intermediate node, from v(0)It arrives
v(i)Side right weight values reduce, then change its side right weight values；
S304：Above-mentioned S302 to S303 is repeated, stops this calculating when in S including all sensor nodes, i.e. V=S
Flow.
9. power consumption wireless sensor network static node-routing method according to claim 5, which is characterized in that according to
Following formula calculate the side right weight in the network topological diagram：
Wherein, EstartFor the energy expenditure of home sensor node, EohtersFor the sensor section in addition to home sensor node
The energy expenditure of point, ER(k) it is the energy expenditure for receiving data, ET(k) it is the energy expenditure of transmission data.
10. power consumption wireless sensor network static node-routing method according to claim 9, which is characterized in that root
According to following formula to calculate ER(k) and ET(k)：
ER(k)=Eelec*k
ET(k)=Eelec*k+eamp*k*d2
Wherein, Eelec=50nJ/bit, eapm=100pJ/bit/m2, k is the bit numbers of data transmission, and d is between sensor node
Distance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810371113.0A CN108541039B (en) | 2018-04-24 | 2018-04-24 | Low-power-consumption wireless sensor network static node routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810371113.0A CN108541039B (en) | 2018-04-24 | 2018-04-24 | Low-power-consumption wireless sensor network static node routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108541039A true CN108541039A (en) | 2018-09-14 |
| CN108541039B CN108541039B (en) | 2021-10-22 |
Family
ID=63479320
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810371113.0A Active CN108541039B (en) | 2018-04-24 | 2018-04-24 | Low-power-consumption wireless sensor network static node routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108541039B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111601355A (en) * | 2020-04-09 | 2020-08-28 | 西安理工大学 | Optimal path selection method in formation maintenance topology of wireless ultraviolet light cooperation unmanned aerial vehicle |
| CN112383892A (en) * | 2020-10-16 | 2021-02-19 | 国网山东省电力公司鱼台县供电公司 | Transformer substation electric energy quality monitoring system and method |
| CN113038409A (en) * | 2019-12-24 | 2021-06-25 | 中移(苏州)软件技术有限公司 | Data transmission method, network node, sensor and wireless sensor network |
| CN115866692A (en) * | 2023-02-28 | 2023-03-28 | 国网信息通信产业集团有限公司 | Load balancing routing method, operation method and system for wireless sensor network |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1835668A1 (en) * | 2006-03-13 | 2007-09-19 | NTT DoCoMo, Inc. | Method and apparatus for controlling transmission of data from a plurality of sensor nodes |
| US20080253327A1 (en) * | 2004-12-22 | 2008-10-16 | Mikko Kohvakka | Energy Efficient Wireless Sensor Network, Node Devices for the Same and a Method for Arranging Communications in a Wireless Sensor Network |
| CN101350635A (en) * | 2008-09-05 | 2009-01-21 | 清华大学 | Method for self-locating sensor network node within sparseness measuring set base on shortest path |
| US20100260071A1 (en) * | 2009-04-14 | 2010-10-14 | Lai Jun-Yu | Routing method and routing path recovery mechanism in wireless sensor network environment |
| CN102291791A (en) * | 2011-09-08 | 2011-12-21 | 上海大学 | Self-adaptive router soft switching method for wireless sensor network |
| US8107397B1 (en) * | 2006-06-05 | 2012-01-31 | Purdue Research Foundation | Protocol for secure and energy-efficient reprogramming of wireless multi-hop sensor networks |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
| EP2683199A1 (en) * | 2012-07-05 | 2014-01-08 | ABB Research Ltd. | Determination of communication routes in a wireless communcation network |
| CN103813408A (en) * | 2014-02-25 | 2014-05-21 | 宁波中科集成电路设计中心有限公司 | Routing method of wireless sensor network |
| CN104486807A (en) * | 2014-11-28 | 2015-04-01 | 华中科技大学 | Routing method of small-scale wireless sensor network |
-
2018
- 2018-04-24 CN CN201810371113.0A patent/CN108541039B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080253327A1 (en) * | 2004-12-22 | 2008-10-16 | Mikko Kohvakka | Energy Efficient Wireless Sensor Network, Node Devices for the Same and a Method for Arranging Communications in a Wireless Sensor Network |
| EP1835668A1 (en) * | 2006-03-13 | 2007-09-19 | NTT DoCoMo, Inc. | Method and apparatus for controlling transmission of data from a plurality of sensor nodes |
| US8107397B1 (en) * | 2006-06-05 | 2012-01-31 | Purdue Research Foundation | Protocol for secure and energy-efficient reprogramming of wireless multi-hop sensor networks |
| CN101350635A (en) * | 2008-09-05 | 2009-01-21 | 清华大学 | Method for self-locating sensor network node within sparseness measuring set base on shortest path |
| US20100260071A1 (en) * | 2009-04-14 | 2010-10-14 | Lai Jun-Yu | Routing method and routing path recovery mechanism in wireless sensor network environment |
| CN102291791A (en) * | 2011-09-08 | 2011-12-21 | 上海大学 | Self-adaptive router soft switching method for wireless sensor network |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
| EP2683199A1 (en) * | 2012-07-05 | 2014-01-08 | ABB Research Ltd. | Determination of communication routes in a wireless communcation network |
| CN103813408A (en) * | 2014-02-25 | 2014-05-21 | 宁波中科集成电路设计中心有限公司 | Routing method of wireless sensor network |
| CN104486807A (en) * | 2014-11-28 | 2015-04-01 | 华中科技大学 | Routing method of small-scale wireless sensor network |
Non-Patent Citations (8)
| Title |
|---|
| AMIR EHSANI ZONOUZ 等: "Reliability-Oriented Single-Path Routing Protocols in Wireless Sensor Networks", 《IEEE SENSORS JOURNAL》 * |
| SANA MESSOUS 等: "Hop-based routing protocol based on energy efficient Minimum Spanning Tree for wireless sensor network", 《2018 INTERNATIONAL CONFERENCE ON ADVANCED SYSTEMS AND ELECTRIC TECHNOLOGIES》 * |
| 刘静 等: "无线传感器网络混合路由算法研究", 《制造业自动化》 * |
| 向毅: "无线传感器网络能量平衡的拓扑控制研究", 《中国博士学位论文全文数据库信息科技辑》 * |
| 周俊青 等: "：基于区域划分的WSN数据汇聚路由算法", 《合肥工业大学学报》 * |
| 唐朝伟 等: "无线传感器网络最优路由算法研究", 《计算机工程》 * |
| 臧哲 等: "基于智能算法的层次型多链WSN路由协议", 《传感技术学报》 * |
| 范松博 等: "无线传感器网络中分簇路由优化算法", 《计算机测量与控制》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113038409A (en) * | 2019-12-24 | 2021-06-25 | 中移(苏州)软件技术有限公司 | Data transmission method, network node, sensor and wireless sensor network |
| CN113038409B (en) * | 2019-12-24 | 2022-06-28 | 中移(苏州)软件技术有限公司 | Data transmission method, network node, sensor and wireless sensor network |
| CN111601355A (en) * | 2020-04-09 | 2020-08-28 | 西安理工大学 | Optimal path selection method in formation maintenance topology of wireless ultraviolet light cooperation unmanned aerial vehicle |
| CN111601355B (en) * | 2020-04-09 | 2024-01-19 | 绍兴市上虞区舜兴电力有限公司 | Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology |
| CN112383892A (en) * | 2020-10-16 | 2021-02-19 | 国网山东省电力公司鱼台县供电公司 | Transformer substation electric energy quality monitoring system and method |
| CN115866692A (en) * | 2023-02-28 | 2023-03-28 | 国网信息通信产业集团有限公司 | Load balancing routing method, operation method and system for wireless sensor network |
| CN115866692B (en) * | 2023-02-28 | 2023-06-02 | 国网信息通信产业集团有限公司 | Wireless sensor network load balancing routing method, operation method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108541039B (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108541039A (en) | A kind of power consumption wireless sensor network static node-routing method | |
| Blazevic et al. | A location-based routing method for mobile ad hoc networks | |
| De Rango et al. | Link-stability and energy aware routing protocol in distributed wireless networks | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN101095317A (en) | Obtaining routing information | |
| CN103260264B (en) | Based on the wireless sensor network data fusion method of two aggregators ant group optimization | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| Tsai et al. | A path-connected-cluster wireless sensor network and its formation, addressing, and routing protocols | |
| CN107846719B (en) | A kind of wireless sensor network routing method based on improvement gam algorithm | |
| CN106714263A (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| Wang et al. | Energy-efficient localized routing in random multihop wireless networks | |
| CN102264114A (en) | ZigBee sensor network tree route low-expense optimization method | |
| CN104853398A (en) | Route optimization method for tree shape wireless sensor network | |
| CN108112050A (en) | Energy balance and deep-controlled Routing Protocol based on underwater wireless sensing network | |
| CN108366093A (en) | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " | |
| CN106604344A (en) | Power utilization information system based on RPL and networking and communication method thereof | |
| CN104581817A (en) | Dynamic shortest path weighting routing method in mobile ad-hoc network | |
| CN108200628A (en) | A kind of linear topology structure wireless ad hoc network network-building method | |
| CN107579758A (en) | A kind of two-way alternate communication method based on G3 PLC | |
| Liu et al. | Reinforcement learning based routing for energy sensitive wireless mesh IoT networks | |
| Merabtine et al. | Balanced clustering approach with energy prediction and round-time adaptation in wireless sensor networks | |
| CN112311827A (en) | Intelligent ammeter management system and method | |
| CN106879044A (en) | The underwater sensor network method for routing that cavity perceives | |
| Leu et al. | Adaptive power-aware clustering and multicasting protocol for mobile ad hoc networks | |
| AlSawafi et al. | Hybrid RPL-based sensing and routing protocol for smart city |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |