CN109547965A - A kind of wireless sensor network paths planning method based on service priority - Google Patents
A kind of wireless sensor network paths planning method based on service priority Download PDFInfo
- Publication number
- CN109547965A CN109547965A CN201811608589.8A CN201811608589A CN109547965A CN 109547965 A CN109547965 A CN 109547965A CN 201811608589 A CN201811608589 A CN 201811608589A CN 109547965 A CN109547965 A CN 109547965A
- Authority
- CN
- China
- Prior art keywords
- node
- vertex
- business
- network
- distance
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000005540 biological transmission Effects 0.000 claims abstract description 28
- 238000005457 optimization Methods 0.000 claims abstract description 6
- 230000003321 amplification Effects 0.000 claims description 8
- 238000003199 nucleic acid amplification method Methods 0.000 claims description 8
- 238000005265 energy consumption Methods 0.000 claims description 7
- 230000004083 survival effect Effects 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 4
- 241000854291 Dianthus carthusianorum Species 0.000 description 23
- 230000005611 electricity Effects 0.000 description 14
- 238000004891 communication Methods 0.000 description 10
- 230000002776 aggregation Effects 0.000 description 9
- 238000004220 aggregation Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 4
- 230000004927 fusion Effects 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 230000005484 gravity Effects 0.000 description 2
- 230000009191 jumping Effects 0.000 description 2
- 239000003016 pheromone Substances 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000006641 stabilisation Effects 0.000 description 2
- 238000011105 stabilization Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000033228 biological regulation Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012876 topography Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- 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/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/126—Shortest path evaluation minimising geographical or physical path length
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of wireless sensor network paths planning method based on service priority, wireless sensor network based on layering, multiple set are set based on shortest path first in planning path to collect different paths, leader cluster node is when carrying out data forwarding, it is transmitted in the different path of different service selections, leader cluster node is selected to be relayed according to service priority, to form the end-to-end routing of optimization.The method of the present invention improves the flexibility of data transmission, it is constrained by setting load balancing, optimizes the reasonability of leader cluster node data forwarding, be finally reached data forwarding and meet service delay requirement, the purpose of balance network load again, effectively extends Network morals.
Description
Technical field
The invention belongs to technical field of wireless, are related to the route planning of transmission line of electricity sensor network, for one kind
Wireless sensor network paths planning method based on service priority.
Background technique
The wide regional characteristic in China determines that transmission line of electricity has the characteristics that have a very wide distribution and transmission line of electricity length, such as
In " transferring electricity from the west to the east " engineering, not only locating topography and geomorphology is very complicated for transmission line of electricity, and the weather conditions of some areas also compare
It is relatively severe.Most of transmission line of electricity is usually operated under hyperbaric environment, and route is once damaged, and service personnel must arrive at once
Up to scene, it is repaired or is replaced.However transmission line of electricity is generally maked somebody a mere figurehead in field locations, this gives staff's repair line
Road causes very big difficulty.How the fortune of transmission line of electricity surrounding environment change and route is recognized in time using sensor network
Market condition is most important to the safe and reliable operation of Logistics networks.
For the state of development for understanding the prior art, retrieval has been carried out to the prior art, has compared and analyzes, filter out as follows with
The relatively high technical information of the degree of correlation of the present invention:
Technical solution 1: " the collaborative clustering routing communication means divided in a kind of WSN based on hierarchical region ", patent is public
The number of opening CN106304235A is related to a kind of clustering routing communication means divided based on hierarchical region, the committed step of this method
It is as follows: first, hierarchical region divides.By WSN monitoring region centered on aggregation node, with n*R (n=l, 2 ...) for radius,
It is divided into multiple and different annular sections, and the sensor node of same annular section is demarcated as same grade；Second, it determines
Optimal number of clusters.After WSN monitors region progress hierarchical region division, 1st hierarchical region nearest from aggregation node is used first
Region cluster head chooses probability and total power consumption minimization principle calculates optimal sub-clustering number, is then disappeared according to interregional gross energy
Consumption balancing principle determines the optimal number of clusters of other hierarchical regions；Third determines cluster domain.The optimal cluster of each hierarchical region in WSN
After number determines, need that improved LEACH and PEGASIS algorithm is combined to form specific cluster domain；4th, data acquire and fusion.Often
It can be member node distribution in cluster according to TDMA mode after the leader cluster node in each cluster in a hierarchical region is formed in cluster domain
Time slot, member node is in dormant state in cluster when beginning, and when the time slot of node arrives, node can be activated, non-chain type
Member node acquisition data and single-hop are sent to cluster head in the cluster of structure, and need edge after the cluster interior nodes of chain structure acquisition data
Chain is transmitted to cluster head, and cluster head merges the data received later, and transmits fused data to aggregation node；The
Five, data transmission.Data transmission in WSN, also referred to as routing communication, i.e., the cluster head in addition to the 1st hierarchical region, in other regions
The data of node fusion need to be forwarded to aggregation node by optimal routed path ecto-entad, wherein the choosing of optimal routed path
It takes and is carried out using the multihop routing communication means of collaborative transmission technology, and the data of the leader cluster node of the 1st hierarchical region fusion
Aggregation node is directly transferred to using single-hop routing, one duty cycle of every completions, need return step three continue downwards repeatedly into
Row operation, so far completes the collaborative clustering routing communication means divided in a kind of WSN based on hierarchical region.
Technical solution 2: " a kind of wireless sensor network routing method of energy efficient ", patent announcement number
CN101360051B is related to a kind of layer routing method of energy efficient, and the committed step of this method is as follows: first, at the beginning of agreement
Beginningization.By way of flooding, so that Sink node obtains each residue energy of node information in network topology and network, sensing
Device node obtains oneself hop count and information of neighbor nodes apart from Sink node, and after protocol initializing, Sink node can
Calculate the total surplus energy and network average energy of network；Each sensor node knows the information of neighbor nodes and each of oneself
A neighbor node creates conditions to the hop count of Sink node for cluster foundation；Second, the foundation of cluster.According to preset cluster head
Number marks off sensor network cluster using split plot design is repeated, guarantees that dump energy is higher than the sensor node of network average energy
As cluster head, cluster work is completed, and keeps leader cluster node location distribution uniform, each cluster interior nodes number is essentially identical with equal
The network node that weighs loads；Third, cluster-level routing.Cluster-level routing is carried out using ant group algorithm, the routing including forming leader cluster node
Table calculates link information element concentration and selection information transmission link.
A kind of technical solution 3: " low power consumption adaptive clustering and multi-hop wireless sensor network topology control based on fuzzy decision
Method processed ", patent publication No. CN104394566A is related to a kind of layering route planning method based on LEACH agreement, this method
Committed step it is as follows: first, election of cluster head uses the strategy for randomly selecting cluster head the same in LEACH agreement, initialization
When, each sensor node N generates 0 to 1 number at random, if random number be lower than threshold T (N), the sensor node just when
It is selected as cluster head.Second, cluster, after each area has chosen cluster head, each sensor node is selected according to signal strength or weakness is received
Which cluster is added, if existed without cluster head, if the sensor node directly and base station communication, the otherwise sensor section of non-cluster head
The behavior of point is generally all within the scope of cluster.Third, cluster-level routing selection will after the structure and cluster head of cluster are selected
The communication path for leading to base station for each cluster head and is directly selected with the sensor node of base station communication, introduces mould here
The theory of paste set and fuzzy decision, the thought of algorithm is as follows: 1) all cluster heads and directly with the sensor section of base station communication
Point is divided into three set, measures the degree of membership of these sensor nodes with different membership functions respectively；2) differentiation handle is carried out
The sensor node that degree of membership is 0 directly removes, and takes the range of intersection reduction candidate sensor node；3) fuzzy decision is utilized
Theory, scoring addition carried out to remaining sensor node, acquirement divides relay node of the soprano as next-hop.
The above-mentioned prior art is analyzed, is had the following deficiencies:
Technical solution 1 is divided by carrying out hierarchical region to WSN to realize distributed Uneven Cluster, and in each region
It is middle that adaptive sub-clustering is carried out using improved LEACH algorithm, make from Sink node farther out in combination with improved PEGASIS algorithm
The cluster interior nodes of the discrete cluster in region form chain structure, and data transmission is considered as multihop routing and association between cluster after the completion of sub-clustering
Make the progress of formula transmission technology.This method uses multihop routing in cluster-level routing communication and collaborative transmission technology has saved cluster
Head node consumed energy when transmitting data to aggregation node, but which does not carry out area to transmission services data
Point, all business datums are all transmitted by highest priority sequence, and the flexibility of leader cluster node transmission data is reduced.
Technical solution 2 realizes sensor network road using ant group algorithm for the Sensor Networks Architecture of layering
By agreement, determine whether node has the qualification of election contest cluster head according to dump energy；According to node geo-location, repetition point is utilized
It cuts method and carries out cluster division, guarantee each cluster geographical location uniformly and cluster internal segment points are close；The side that bunch member node passes through single-hop
Formula transmits information to cluster head；Using ant group algorithm, routing link is selected according to the pheromone concentration of each chain road, carries out cluster
Between route, by the data transmission of each cluster to Sink node；With the operation of network, the pheromones for periodically calculating link are dense
Degree, and according to this information update node route list, maintaining routing information.This method uses ant group algorithm on cluster-level routing can
To guarantee the reasonability of selection link.But ant group algorithm convergence time is too long, is not suitable for large-scale sensor network scene
Using.
Technical solution 3 is a circulation by a wheel, and each round includes establishment stage and stabilization sub stage；The establishment stage
Including election of cluster head, cluster, cluster-level routing selects three steps；The step of described election of cluster head, uses in LEACH agreement one
The strategy for randomly selecting cluster head of sample；The stabilization sub stage includes the steps that data are transmitted.This method in data transfer phase,
Leader cluster node selects next-hop relay node using fuzzy decision, and which optimizes the choosing of next-hop node in data transmission
It selects, keeps dump energy more, be more likely to become relay node apart from the closer next-hop node of aggregation node.But which does not have
Have and business datum is distinguished, low QoS business and high QoS business all select shorter path to transmit, and excess energy is caused to consume
And network congestion.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art and transmission line of electricity goes out the reality of sensor network
Demand researchs and proposes a kind of route planning method for transmission line of electricity wireless sensor network, and the present invention is based on the nothings of layering
Line sensor network, leader cluster node when carrying out data forwarding, can be selected according to service priority suitable leader cluster node into
Row relaying realizes load balancing to form the end-to-end routing of optimization, extends network lifecycle.
The technical solution of the present invention is as follows: a kind of wireless sensor network paths planning method based on service priority, base
In the wireless sensor network of layering, multiple set are set based on shortest path first in planning path to collect different roads
Diameter, leader cluster node when carrying out data forwarding, transmitted by the different path of different service selections, is selected according to service priority
It selects leader cluster node to be relayed, to form the end-to-end routing of optimization.
It is preferred that if network has N number of leader cluster node, two kinds of business A business and B business, the delay requirement ratio B of A
Height, i.e. the digraph G=(V, E) an of Weighted Coefficients is arranged in the service priority of A ratio B high, by the node set V in network
It is divided into several groups, wherein first group is the node set for having found out the shortest path come, uses VAIt indicates, is asking first group most short
When set of paths, while the set in other paths is recorded, uses VB=(V1,V2,V3...) etc. indicate, in the case where selecting present node
When one jump, the A service selection V of higher priorityAVertex in set, the B business of lower priority is in VAAnd VBMiddle selection can make
Vart+1(Eleft) the smallest node, Vart+1(Eleft) indicate next time slot Network Load Balance degree, by existence all in network
The variance of residue energy of node is measured, Vart+1(Eleft) smaller expression network load is more balanced.
Path planning of the present invention specifically includes the following steps:
Step 1: when initial, in digraph, VAAnd VBIt only include source point, i.e. VA=VBThe distance of={ v }, v are 0, if U
Including other vertex in addition to v, it may be assumed that U={ remaining vertex }, if vertex u has side in v and U, < u, v > normally have weight, if
U is not the abutment points of v, then < u, and v > weight is ∞；
Step 2: the smallest vertex k of a distance v is chosen from U, V is added in kAIn, V is added in other abutment pointsB
Set, and adjust the distance and be ranked up, form VB=(V1,V2,V3...) etc. several paths；
Step 3: using k as intermediate point, the distance on each vertex in U is modified；If from starting point v by vertex k to vertex u's
Distance, it is shorter than the distance without vertex k to vertex u, then the distance value of vertex u is modified, modified distance value is vertex k's
Distance is plus the power on side, by VBThe good each vertex sorted in set is as intermediate point and carries out identical operation；
Step 4: step 2 and step 3 are repeated until all vertex are all divided in VAAnd VB=(V1,V2,V3...) set
In；
Step 5: from VAThe next-hop selection of higher priority business is carried out in set, lower priority node is from VB=
(V1,V2,V3...) set in selection can make Vart+1(Eleft) the smallest next-hop；
Step 6: carrying out the calculating of each business hop count after selection next-hop, if being unsatisfactory for delay constraint condition,
The business of time-out is abandoned, if it is satisfied, return step five, circuits sequentially, when next-hop is purpose node, is terminated.
The present invention propose it is a kind of under transmission line of electricity wireless sensor network scene based on path between the cluster of service priority
Planing method, the advantage is that:
The method of the present invention is based on shortest path first, collects different roads by the way that multiple set are arranged in planning path
Diameter, leader cluster node can select different paths to transmit different business data packets, this improves the spirit of data transmission
Activity.The present invention is constrained by setting load balancing, optimizes the reasonability of leader cluster node data forwarding, is finally reached data and is turned
Hair meets service delay requirement, and the purpose of balance network load.Assessment result shows that the method for the present invention and shortest path are calculated
Method is compared, and the method for the present invention can obtain better load balancing while guaranteeing quality of service requirement, is effectively extended
Network morals.
Detailed description of the invention
Fig. 1 is the wireless sensor network path planning schematic diagram based on service priority.
Fig. 2 is that the present invention is based on the paths planning method flow charts of service priority.
Fig. 3 is the path planning figure of shortest path first.
Fig. 4 is that the present invention is based on the path planning figures of service priority.
Fig. 5 is in the embodiment of the present invention, and the death nodes time of different path planning algorithms compares figure, and display is 50 times
Laboratory mean values.
Fig. 6 is in the embodiment of the present invention, and the line chart of the every all survival node dump energy variances of wheel of algorithms of different, is 50
Secondary experiment mean value.
Specific embodiment
For the perception detection of transmission line of electricity, the present invention advises the routing that center of gravity is placed on research transmission line of electricity sensor network
In cost-effective method.The present invention is a kind of based on path planning algorithm between the cluster for being layered routing, using least energy consumption as optimization aim, load
Equilibrium is constraint condition.The method of the present invention can select suitable leader cluster node to be relayed according to service priority, thus shape
At the end-to-end routing of optimization, load balancing is realized, extend network lifecycle.
By the study found that Dijkstra shortest path first is road that is a kind of classical and being very suitable for sensor network
Diameter planning algorithm, the algorithm provide a Weighted Directed Graph G=(V, E) first, and vertex set V is divided into several groups, first
Group is the vertex set to find out shortest path, is indicated with V, second group of vertex set for other also not determining shortest paths,
It is indicated with U, successively second group of vertex is added in V according to the increasing order of shortest path length, it is straight according to certain rule
It is all added into V to all vertex, algorithm terminates.The relevance grade of shortest path first is high and scalability is strong, therefore this hair
The bright wireless sensor network paths planning method that will be directed to transmission line of electricity, center of gravity is placed on to Dijkstra shortest path first
Improvement on.The present invention is based on shortest path firsts, collect different paths by the way that multiple set are arranged in planning path,
The path that cluster head can enable different service selections different is transmitted, and is finally reached and is obtained while guaranteeing quality of service requirement
Better load balancing is obtained, the purpose of network lifecycle is effectively extended.
Realization of the invention is specifically described below.
N number of leader cluster node node is numbered, all leader cluster nodes are named as Nodei(i=1,2, N), often
A node includes two attributes: position P (x, y) and dump energy Eleft, setting aggregation node Sink is destination node.Algorithm
It, can be in the condition for meeting delay constraint since delay requirement is relatively low when being routed for the relatively low service selection of delay requirement
Under by sacrificing time delay reach load balancing, example switchs to higher priority from lower-priority traffic selection path as shown in figure 1
Service selection path, thus improve network node utilization rate and extend Network morals.
Each technical characteristic involved in the method for the present invention is described below.
1) network energy model
For the average residual energy of nodes all in network:
Sending node sends energy consumption required for k bit data:
Wherein,For node i and it next-hop j Euclidean distance:
Indac is an indicator vector, for indicating to send the range index of energy consumption model:
ε is the power amplification coefficient power amplification ratio of multipath attenuation channel model, εfsFor free energy attenuation model power amplification coefficient power amplification ratio.
Receiving node receives energy consumption required for k bit data:
Ereceive=kE0 (5)
Wherein, E0Physical attribute for a definite value, depending on node itself.
Then whole network receives and sends the total energy consumption E of k bit datatotal-costAre as follows:
2) node hop count constraint
Assuming that the business transmitted in whole network has M kind, it is denoted as { B respectively1,B2,BM, their time delay limitation is respectivelyAnd their relationship is
The end-to-end time delay of different business has to be less than or equal to time delay limitation.So the constraint condition of time delay should
It is:
Assuming that the queuing delay and processing delay of the data packet of business of the same race are approximately equal, and due to the distance of data transmission
It can be ignored compared to speed, i.e. Tave=Tqueue+Tprocess+TtransmissionIt is a definite value, Tqueue,Tprocess,
TtransmissionThe queuing delay of business respectively of the same race, processing delay and propagation delay, therefore delay constraint can be converted to
The constraint of hop count:
3) load balancing constrains
Using Var (Eleft), i.e., the variances of all survival node dump energies measures wireless sensor network in network
Load balance degree, Var (Eleft) smaller, the load of whole network is more balanced.When lower-priority traffic selects path, always
It is that selection can make next time slot Var (E in several pathsleft) the smallest that paths, it may be assumed that
Min{Vart+1(Eleft)} (9)
The dump energy of each node is constantly updated:
4) path planning algorithm
Dijkstra's algorithm thought: regulation G=(V, E) is a Weighted Directed Graph, and vertex set V is divided into several groups,
First group is the vertex set for having found out shortest path, is indicated with V, only one starting point in V, often acquires one later when initial
Shortest path, all adds it in set V, and until all vertex are all added into V, algorithm terminates, and second group is it
He determines the vertex set of shortest path not yet, is indicated with U, according to the increasing order of shortest path length successively by second group
Vertex be added V in.During addition, keep from starting point v to V in each vertex shortest path length be less than or equal to from
The shortest path length on any vertex in starting point v to U.In addition to this, one distance of each vertex correspondence, vertex in V
Distance is the shortest path length from v to this vertex, and the distance on the vertex in U is the vertex only included in V from v to this vertex
For the current shortest path length of intermediate vertex.
The present invention improves dijkstra's algorithm, it is assumed that there are two types of business A business and B business, the time delays of A to need for network
Ask higher than B.The digraph G=(V, E) of one Weighted Coefficients is still set.It is several groups that node set V in network, which is divided, wherein
First group is the node set for having found out the shortest path come, uses VAIt indicates.When seeking first group of set of minimal paths, together
The set in other paths Shi Jilu, uses VB=(V1,V2,V3...) etc. indicate.Remaining thought is identical with dijkstra's algorithm.Cause
This is when selecting the next-hop of present node, the A service selection V of highest priorityAVertex in set, the B of lower priority
Business is in VAAnd VBMiddle selection can make Vart+1(Eleft) the smallest node.
Higher priority business preferentially selects shortest path in the method that the present invention designs, and is able to satisfy the time delay of business in this way
It is required that.But lower-priority traffic selects selection when next-hop that can make all survival node residual energies of whole network every time
The smallest path of variance is measured, the dump energy of nodes can be made more balanced in this way, and then extends the life of network
Period.
The path planning process figure of the method for the present invention is as shown in Fig. 2, realize that steps are as follows:
Step 1: when initial, VAAnd VBIt only include source point, i.e. VA=VBThe distance of={ v }, v are 0.U includes its in addition to v
His vertex, it may be assumed that U={ remaining vertex }, if vertex u has side in v and U, < u, v > normally have weight, if u is not the adjoining of v
Point, then < u, v > weight are ∞；
Step 2: the smallest vertex k of a distance v is chosen from U, V is added in kAIn, which is v to k
Shortest path length, by other abutment points be added VBSet, and adjust the distance and be ranked up, form VB=(V1,V2,V3...)
Etc. several paths；
Step 3: using k as intermediate point, the distance on each vertex in U is modified；If from starting point v by vertex k to vertex u's
Distance is shorter than the distance originally without vertex k, then modifies the distance value of vertex u, and modified distance value is the distance of vertex k
In addition the power on side.By VBThe good each vertex sorted in set is as intermediate point and carries out identical operation；
Step 4: step 2 and step 3 are repeated until all vertex are included in VA,VB=(V1,V2,V3...) etc. set
In.
Step 5: from VAThe next-hop selection of highest priority traffic is carried out in set, lower priority node is from VB=
(V1,V2,V3...) set in selection can make Vart+1(Eleft) the smallest next-hop；
Step 6: carrying out the calculating of each business hop count after selection next-hop, if being unsatisfactory for delay constraint condition,
Abandon the business of time-out.If it is satisfied, return step five, circuits sequentially, when next-hop is purpose node, terminate.
Key problem in technology point of the invention is:
1. the invention proposes paths planning methods between a kind of sensor network cluster based on service priority；
2. the present invention improves dijkstra's algorithm, leader cluster node is made to calculate a plurality of road using shortest path first
Diameter forwards the multipath of different business data packet different business time delay to realize and meet；
3. the present invention establishes load balancing restricted model, guarantee that cluster-level routing forwarding meets load balancing constraint, thus
Data congestion is avoided, the life cycle of whole network is extended.
Illustrate below with reference to example:
(1) parameter setting
The setting of 1 experiment parameter of table
(2) experimental result
It is tested respectively to shortest path first and based on service priority algorithm, aggregation node is located at right end, often
A sensor node can spontaneously produce data packet and forwarding data packet, and experimental result is as shown in Figure 3, Figure 4.
The path and hop count for re-recording lower different path planning algorithm generations are compared, as shown in table 2:
The path and hop count that the different path planning algorithms of table 2 generate are compared
From figure 3, it can be seen that all business are pressed without exception regardless of priority in the shortest path first of the prior art
It is forwarded according to shortest path.Fig. 4 is the routing algorithm based on service priority, and figure (a) is the relatively high industry of service priority
It is engaged in the shortest path of selection；Scheme " going the long way round " path that (b) is the relatively low service selection of service priority.
As can be seen from the table, shortest path first and based on higher priority industry under service priority path planning algorithm
The route jumping figure generated of being engaged in is identical, and is all not above the hop count constraint of 10 jumps；Based on lower under service priority path planning
The route jumping figure that priority service generates also is not above the hop count constraint of 20 jumps.
In experimental evaluation, the present invention uses general static clustering mode, entire sensor network root in the sub-clustering stage
Uniform sub-clustering is carried out according to geographical location, the leader cluster node in cluster is rotated at regular intervals.On this basis, two kinds of algorithm each round are recorded
Node death condition, compare dead first node of two kinds of algorithms and 50%, 80%, the wheel number of whole nodes, as a result such as Fig. 5
It is shown.It can be seen that dead first node and 50% based on service priority algorithm, the time of 80% node is all later than most
Short path algorithm, therefore have better energy efficiency.
In addition, recording all survival node dump energy variances of two kinds of algorithm each round, line chart is made, as a result such as
Shown in Fig. 6.It can be seen that two kinds of algorithm comparisons, the present invention is based on all survival nodes of every wheel of service priority algorithm are remaining
Energy variance is significantly less than shortest path first, therefore has better load equilibrium.
Claims (5)
1. a kind of wireless sensor network paths planning method based on service priority, it is characterized in that the wireless biography based on layering
Multiple set are arranged in planning path based on shortest path first to collect different paths in sensor network, and leader cluster node exists
Carry out data forwarding when, the different path of different service selections is transmitted, according to service priority select leader cluster node into
Row relaying, to form the end-to-end routing of optimization.
2. a kind of wireless sensor network paths planning method based on service priority according to claim 1, special
Sign is to set network to have N number of leader cluster node, two kinds of business A business and B business, and the delay requirement ratio B's of A is high, i.e. the business of A is preferential
Than B high the digraph G=(V, E) an of Weighted Coefficients is arranged, it is several groups that the node set V in network, which is divided, wherein first group in grade
For the node set for having found out the shortest path come, V is usedAIt indicates, when seeking first group of set of minimal paths, records simultaneously
The set in other paths, uses VB=(V1,V2,V3...) etc. indicate, select present node next-hop when, higher priority
A service selection VAVertex in set, the B business of lower priority is in VAAnd VBMiddle selection can make Vart+1(Eleft) the smallest section
Point, Vart+1(Eleft) indicate next time slot Network Load Balance degree, by the variance of survival node dump energies all in network
It measures, Vart+1(Eleft) smaller expression network load is more balanced.
3. a kind of wireless sensor network paths planning method based on service priority according to claim 2, special
Sign be path planning specifically includes the following steps:
Step 1: when initial, in digraph, VAAnd VBIt only include source point, i.e. VA=VBThe distance of={ v }, v are 0, if U includes
Other vertex in addition to v, it may be assumed that U={ remaining vertex }, if vertex u has side in v and U, < u, v > normally have weight, if u is not
It is the abutment points of v, then < u, v > weight are ∞；
Step 2: the smallest vertex k of a distance v is chosen from U, V is added in kAIn, V is added in other abutment pointsBSet,
And adjust the distance and be ranked up, form VB=(V1,V2,V3...) etc. several paths；
Step 3: using k as intermediate point, the distance on each vertex in U is modified；If from starting point v by vertex k to the distance of vertex u,
It is shorter than the distance without vertex k to vertex u, then the distance value of vertex u is modified, modified distance value is the distance of vertex k
In addition the power on side, by VBThe good each vertex sorted in set is as intermediate point and carries out identical operation；
Step 4: step 2 and step 3 are repeated until all vertex are all divided in VAAnd VB=(V1,V2,V3...) set in；
Step 5: from VAThe next-hop selection of higher priority business is carried out in set, lower priority node is from VB=(V1,V2,
V3...) set in selection can make Vart+1(Eleft) the smallest next-hop；
Step 6: the calculating that each business hop count is carried out after selection next-hop abandons if being unsatisfactory for delay constraint condition
The business of time-out, when next-hop is purpose node, terminates if it is satisfied, return step five, circuits sequentially.
4. a kind of wireless sensor network paths planning method based on service priority according to claim 3, special
Sign is in step 6, and the hop count calculates and time delay is constrained to:
If the business transmitted in whole network has M kind, it is denoted as { B respectively1,B2,BM, their time delay limitation is respectivelyAnd their relationship is
The end-to-end time delay T of different businessnIt has to be less than or equal to time delay limitation, the i.e. constraint condition of time delay are as follows:
If the queuing delay and processing delay of the data packet of business of the same race are approximately equal, hop count H is converted by delay constraintnPact
Beam:
Tave=Tqueue+Tprocess+TtransmissionIt is a definite value, Tqueue,Tprocess,TtransmissionBusiness respectively of the same race
Queuing delay, processing delay and propagation delay.
5. a kind of wireless sensor network path planning side based on service priority according to Claims 2 or 3 or 4
Method, it is characterized in that setting EleftFor residue energy of node, using Var (Eleft), i.e., the side of all survival node dump energies in network
Difference measures the load balance degree of wireless sensor network, Var (Eleft) smaller, the load of whole network is more balanced, each
The dump energy of node is constantly updated:
Wherein, k indicates the bit number of the bit data of transmission, E0For a definite value, depending on the physical attribute of node itself, ε is
The power amplification coefficient power amplification ratio of multipath attenuation channel model,For node i and it next-hop j Euclidean distance:
Indac is an indicator vector, for indicating to send the range index of energy consumption model:
εfsFor free energy attenuation model power amplification coefficient power amplification ratio.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811608589.8A CN109547965A (en) | 2018-12-27 | 2018-12-27 | A kind of wireless sensor network paths planning method based on service priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811608589.8A CN109547965A (en) | 2018-12-27 | 2018-12-27 | A kind of wireless sensor network paths planning method based on service priority |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109547965A true CN109547965A (en) | 2019-03-29 |
Family
ID=65856880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811608589.8A Pending CN109547965A (en) | 2018-12-27 | 2018-12-27 | A kind of wireless sensor network paths planning method based on service priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109547965A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417007A (en) * | 2019-07-25 | 2019-11-05 | 天津大学 | A kind of timing quantitative analysis method of active distribution system operational flexibility |
| CN111427378A (en) * | 2020-04-10 | 2020-07-17 | 南宁师范大学 | Method for planning preferential rescue path of unmanned aerial vehicle in mountainous region |
| CN111835634A (en) * | 2020-07-14 | 2020-10-27 | 中国电子科技集团公司第二十研究所 | Dynamic multipath routing method based on service distribution |
| CN112188559A (en) * | 2020-08-21 | 2021-01-05 | 浙江大学 | Cross-layer load balancing method and device for self-organizing network of unmanned system |
| CN112565078A (en) * | 2020-11-20 | 2021-03-26 | 普联技术有限公司 | Network routing method, device, equipment and computer readable storage medium |
| CN112629552A (en) * | 2021-01-04 | 2021-04-09 | 福州大学 | Communication balance based map partition shortest driving route planning method for motor vehicle |
| CN112672300A (en) * | 2020-12-16 | 2021-04-16 | 杭州电力设备制造有限公司 | Power consumption data vine type transmission optimization method for medium and low voltage switch cabinet |
| CN112689282A (en) * | 2020-12-16 | 2021-04-20 | 曲阜师范大学 | Anonymous communication scheme for protecting location privacy in wireless sensor network |
| CN113141305A (en) * | 2021-05-31 | 2021-07-20 | 深圳华云信息系统有限公司 | Communication method, communication device, electronic equipment and computer-readable storage medium |
| CN114205175A (en) * | 2022-02-19 | 2022-03-18 | 深圳市三江电气有限公司 | Self-checking modification system in multi-sensor sensing data transmission process |
| CN115866692A (en) * | 2023-02-28 | 2023-03-28 | 国网信息通信产业集团有限公司 | Load balancing routing method, operation method and system for wireless sensor network |
| CN116132354A (en) * | 2023-02-23 | 2023-05-16 | 中国科学院软件研究所 | Unmanned aerial vehicle cluster networking transmission path optimization method and system |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080205360A1 (en) * | 2007-02-27 | 2008-08-28 | Tropos Networks, Inc. | Balancing clusters of a wireless mesh network |
| CN101646218A (en) * | 2009-08-14 | 2010-02-10 | 南京工业大学 | Implementation method for multi-path source routing protocol based on GOP |
| CN102013037A (en) * | 2010-12-16 | 2011-04-13 | 上海电机学院 | Method and device for searching path based on particle swarm optimization (PSO) |
| US20160078116A1 (en) * | 2012-12-28 | 2016-03-17 | International Business Machines Corporation | Providing high availability in an active/active appliance cluster |
| US9338591B1 (en) * | 2014-10-09 | 2016-05-10 | Sprint Spectrum L.P. | Systems and methods for managing a location based service on a wireless device in a multi-band communication network |
| CN106453085A (en) * | 2016-12-14 | 2017-02-22 | 国家电网公司 | Business importance-based risk-balancing routing assignment method and system |
| US20170149639A1 (en) * | 2015-11-24 | 2017-05-25 | Cisco Technology, Inc. | Identifying a source of packet drops in a network |
| CN107182074A (en) * | 2017-06-16 | 2017-09-19 | 大连大学 | A kind of route optimal path choosing method based on Zigbee |
| CN107426671A (en) * | 2017-06-20 | 2017-12-01 | 南京信息工程大学 | There is the data transmission method of energy capture function in a kind of intelligent grid |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN107920379A (en) * | 2017-10-21 | 2018-04-17 | 天津大学 | A kind of energy priority method for routing based on increase transmission range and re-transmission |
| CN108135016A (en) * | 2017-12-19 | 2018-06-08 | 国网辽宁省电力有限公司 | A kind of radio network path planning method and device |
| CN108462640A (en) * | 2018-03-06 | 2018-08-28 | 广州西麦科技股份有限公司 | A kind of balancing link load multipath computational methods based on SDN network |
-
2018
- 2018-12-27 CN CN201811608589.8A patent/CN109547965A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080205360A1 (en) * | 2007-02-27 | 2008-08-28 | Tropos Networks, Inc. | Balancing clusters of a wireless mesh network |
| CN101646218A (en) * | 2009-08-14 | 2010-02-10 | 南京工业大学 | Implementation method for multi-path source routing protocol based on GOP |
| CN102013037A (en) * | 2010-12-16 | 2011-04-13 | 上海电机学院 | Method and device for searching path based on particle swarm optimization (PSO) |
| US20160078116A1 (en) * | 2012-12-28 | 2016-03-17 | International Business Machines Corporation | Providing high availability in an active/active appliance cluster |
| US9338591B1 (en) * | 2014-10-09 | 2016-05-10 | Sprint Spectrum L.P. | Systems and methods for managing a location based service on a wireless device in a multi-band communication network |
| US20170149639A1 (en) * | 2015-11-24 | 2017-05-25 | Cisco Technology, Inc. | Identifying a source of packet drops in a network |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| CN106453085A (en) * | 2016-12-14 | 2017-02-22 | 国家电网公司 | Business importance-based risk-balancing routing assignment method and system |
| CN107182074A (en) * | 2017-06-16 | 2017-09-19 | 大连大学 | A kind of route optimal path choosing method based on Zigbee |
| CN107426671A (en) * | 2017-06-20 | 2017-12-01 | 南京信息工程大学 | There is the data transmission method of energy capture function in a kind of intelligent grid |
| CN107920379A (en) * | 2017-10-21 | 2018-04-17 | 天津大学 | A kind of energy priority method for routing based on increase transmission range and re-transmission |
| CN108135016A (en) * | 2017-12-19 | 2018-06-08 | 国网辽宁省电力有限公司 | A kind of radio network path planning method and device |
| CN108462640A (en) * | 2018-03-06 | 2018-08-28 | 广州西麦科技股份有限公司 | A kind of balancing link load multipath computational methods based on SDN network |
Non-Patent Citations (3)
| Title |
|---|
| RAVI TEJA; S. INDU: "A priority based WSN clustering of Multiple Sink Scenario using Artificial Bee Colony Algorithm", 《2016 INTERNATIONAL CONFERENCE ON COMPUTATION SYSTEM AND INFORMATION TECHNOLOGY FOR SUSTAINABLE SOLUTIONS (CSITSS)》 * |
| 曹莹莹等: "基于Dijkstra最短路径算法的教育装备更新问题", 《中国教育技术装备》 * |
| 霍楚妍: "对业务优先级的电力调度数据网拥塞规避算法的研究", 《自动化与仪器仪表》 * |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417007B (en) * | 2019-07-25 | 2023-03-10 | 天津大学 | Time sequence quantitative analysis method for operation flexibility of active power distribution system |
| CN110417007A (en) * | 2019-07-25 | 2019-11-05 | 天津大学 | A kind of timing quantitative analysis method of active distribution system operational flexibility |
| CN111427378A (en) * | 2020-04-10 | 2020-07-17 | 南宁师范大学 | Method for planning preferential rescue path of unmanned aerial vehicle in mountainous region |
| CN111427378B (en) * | 2020-04-10 | 2023-04-18 | 南宁师范大学 | Method for planning preferential rescue path of unmanned aerial vehicle in mountainous region |
| CN111835634A (en) * | 2020-07-14 | 2020-10-27 | 中国电子科技集团公司第二十研究所 | Dynamic multipath routing method based on service distribution |
| CN112188559A (en) * | 2020-08-21 | 2021-01-05 | 浙江大学 | Cross-layer load balancing method and device for self-organizing network of unmanned system |
| CN112565078A (en) * | 2020-11-20 | 2021-03-26 | 普联技术有限公司 | Network routing method, device, equipment and computer readable storage medium |
| CN112565078B (en) * | 2020-11-20 | 2022-10-14 | 普联技术有限公司 | Network routing method, device, equipment and computer readable storage medium |
| CN112689282A (en) * | 2020-12-16 | 2021-04-20 | 曲阜师范大学 | Anonymous communication scheme for protecting location privacy in wireless sensor network |
| CN112672300A (en) * | 2020-12-16 | 2021-04-16 | 杭州电力设备制造有限公司 | Power consumption data vine type transmission optimization method for medium and low voltage switch cabinet |
| CN112629552B (en) * | 2021-01-04 | 2022-06-07 | 福州大学 | Communication balance based map partition shortest driving route planning method for motor vehicle |
| CN112629552A (en) * | 2021-01-04 | 2021-04-09 | 福州大学 | Communication balance based map partition shortest driving route planning method for motor vehicle |
| CN113141305A (en) * | 2021-05-31 | 2021-07-20 | 深圳华云信息系统有限公司 | Communication method, communication device, electronic equipment and computer-readable storage medium |
| CN114205175A (en) * | 2022-02-19 | 2022-03-18 | 深圳市三江电气有限公司 | Self-checking modification system in multi-sensor sensing data transmission process |
| CN116132354A (en) * | 2023-02-23 | 2023-05-16 | 中国科学院软件研究所 | Unmanned aerial vehicle cluster networking transmission path optimization method and system |
| CN116132354B (en) * | 2023-02-23 | 2024-03-22 | 中国科学院软件研究所 | Unmanned aerial vehicle cluster networking transmission path optimization method and system |
| 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 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547965A (en) | A kind of wireless sensor network paths planning method based on service priority | |
| Li et al. | Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization | |
| CN109547966B (en) | Routing planning and fault diagnosis backup method for wireless sensor network of power transmission line | |
| CN110149671A (en) | The route selection method of unmanned plane bee colony network | |
| Iova et al. | Improving the network lifetime with energy-balancing routing: Application to RPL | |
| Belamri et al. | A survey on QoS routing protocols in Vehicular Ad Hoc Network (VANET) | |
| EkbataniFard et al. | A multi-objective genetic algorithm based approach for energy efficient QoS-routing in two-tiered wireless sensor networks | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| Iova et al. | Exploiting multiple parents in RPL to improve both the network lifetime and its stability | |
| CN108112048A (en) | Recognize a kind of efficiency route protocol based on stability in sensor network | |
| CN111510956B (en) | Hybrid routing method based on clustering and reinforcement learning and ocean communication system | |
| CN107483248B (en) | Constrained minimum spanning tree topology control method based on wireless sensor network | |
| CN104602302B (en) | It is a kind of based on cluster structured ZigBee-network balancing energy method for routing | |
| Rath et al. | Load balanced routing scheme for MANETs with power and delay optimisation | |
| CN108712767A (en) | Multihop routing algorithm between a kind of cluster of Energy Consumption in Wireless Sensor Networks equilibrium | |
| Pavai et al. | Study of routing protocols in wireless sensor networks | |
| CN109041161B (en) | Heterogeneous node-based low-energy adaptive clustering method for wireless cognitive sensor network | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| Jain et al. | A route selection approach for variable data transmission in wireless sensor networks | |
| Peng et al. | An adaptive QoS and energy-aware routing algorithm for wireless sensor networks | |
| CN108566658A (en) | A kind of cluster algorithm of Energy Consumption in Wireless Sensor Networks equilibrium | |
| El-Hajj et al. | A fuzzy-based hierarchical energy efficient routing protocol for large scale mobile ad hoc networks (feer) | |
| Krishna et al. | Optimal reliable routing path selection in MANET through hybrid PSO-GA optimisation algorithm | |
| CN109862537A (en) | Access method in car networking community | |
| Srinidhi et al. | Hybrid energy-efficient and QoS-aware algorithm for intelligent transportation system in IoT |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190329 |