CN109547966A - The route planning and fault diagnosis backup method of transmission line of electricity wireless sensor network - Google Patents
The route planning and fault diagnosis backup method of transmission line of electricity wireless sensor network Download PDFInfo
- Publication number
- CN109547966A CN109547966A CN201811609271.1A CN201811609271A CN109547966A CN 109547966 A CN109547966 A CN 109547966A CN 201811609271 A CN201811609271 A CN 201811609271A CN 109547966 A CN109547966 A CN 109547966A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- leader cluster
- data
- leader
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 82
- 230000005540 biological transmission Effects 0.000 title claims abstract description 74
- 238000013439 planning Methods 0.000 title claims abstract description 57
- 230000005611 electricity Effects 0.000 title claims abstract description 38
- 238000003745 diagnosis Methods 0.000 title claims abstract description 20
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 97
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 86
- 230000007246 mechanism Effects 0.000 claims abstract description 55
- 238000005265 energy consumption Methods 0.000 claims abstract description 51
- 230000004069 differentiation Effects 0.000 claims abstract description 14
- 230000002776 aggregation Effects 0.000 claims description 30
- 238000004220 aggregation Methods 0.000 claims description 30
- 230000006854 communication Effects 0.000 claims description 25
- 238000004891 communication Methods 0.000 claims description 24
- 230000008569 process Effects 0.000 claims description 7
- 238000001514 detection method Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 claims description 6
- 238000013459 approach Methods 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 4
- 230000005484 gravity Effects 0.000 claims description 3
- 230000003321 amplification Effects 0.000 claims description 2
- 238000009795 derivation Methods 0.000 claims description 2
- 238000003199 nucleic acid amplification method Methods 0.000 claims description 2
- 230000008447 perception Effects 0.000 claims description 2
- 230000004044 response Effects 0.000 claims description 2
- 239000004744 fabric Substances 0.000 claims 1
- 238000000265 homogenisation Methods 0.000 abstract description 2
- 238000011282 treatment Methods 0.000 abstract description 2
- 238000012544 monitoring process Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 238000011156 evaluation Methods 0.000 description 5
- 230000009467 reduction Effects 0.000 description 5
- 238000007792 addition Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 230000004083 survival effect Effects 0.000 description 4
- 238000012360 testing method Methods 0.000 description 4
- 238000012512 characterization method Methods 0.000 description 3
- 230000000295 complement effect Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000002474 experimental method Methods 0.000 description 3
- 239000003016 pheromone Substances 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 230000006641 stabilisation Effects 0.000 description 2
- 238000011105 stabilization Methods 0.000 description 2
- 240000007594 Oryza sativa Species 0.000 description 1
- 235000007164 Oryza sativa Nutrition 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000001939 inductive effect Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 235000009566 rice Nutrition 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000003068 static effect Effects 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/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/22—Alternate routing
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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
-
- 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
-
- 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
A kind of route planning and fault diagnosis backup method of transmission line of electricity wireless sensor network, for sub-clustering, three aspects of route planning and failover backup optimize, a kind of uniform cluster algorithm optimal based on balancing energy and energy consumption is proposed in terms of sub-clustering, two factors of dump energy and traffic load are considered, Homogenization Treatments are carried out to the distribution of cluster head further according to distance factor；A kind of data forwarding mechanism based on traffic differentiation is proposed in terms of route planning, in the case where meeting delay requirement, requires traffic assignments respective paths to carry out data forwarding different delay；A kind of failover backup mechanism based on dump energy and optimal energy consumption is proposed in terms of failover backup, is divided into link backup and node standby two parts.The method of the present invention can be in the case where meeting service delay constraint requirements and reliability, and the traffic load of balanced each cluster head reduces the total energy consumption of data transmission procedure, finally extends Network morals.
Description
Technical field
The invention belongs to electric power internet of things field, are related to transmission line of electricity wireless sensor network, are based on energy to be a kind of
The path planning and failover backup method of consumption balanced transmission line of electricity Internet of Things sensing and monitoring application.
Background technique
Power industry is one of widely used field of technology of Internet of things, such as transmission line of electricity on-line monitoring, intelligence
Substation, intelligent machine room etc., the sensor device in these Internet of Things (IoT) will meet smart home, body/health monitoring,
Environmental monitoring, the application such as maintenance based on state.Transmission line of electricity is that power grid asset is maximum, distribution is most wide, equipment operating environment is multiple
Miscellaneous severe and multiple external force influence factor electric power link.Due to the equipment safety problem of transmission line of electricity, such as conducting wire running temperature
Excessively high, arc sag variation, windage yaw electric discharge, aeolian vibration, shaft tower inclination etc., there is an urgent need to install effective sensing on transmission line of electricity to set
It is standby.On-line Fault monitors system and various kinds of equipment parameter is transmitted to data processing centre by things-internet gateway, then using first
Into data analysis technique handle various kinds of equipment data, judge the whether faulty generation of transmission line of electricity.This is power grid security decision
Foundation is provided.
For the state of development for understanding the prior art, retrieval is carried out to existing paper and patent, has compared and analyzes, has been screened
It is related to the present invention as follows out to spend relatively high technical information:
Technical solution 1: " 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 2: " low power consumption adaptive clustering and multi-hop wireless sensor network topology control based on fuzzy decision
Method processed ", patent publication No. CN104394566 A is related to a kind of layering route planning method based on LEACH agreement, the party
The committed step of method is as follows: first, election of cluster head.The present invention uses the strategy for randomly selecting cluster head the same in LEACH agreement.
When initialization, each sensor node N generates 0 to 1 number at random, if random number is lower than threshold T (N), the sensor section
Point is just elected as cluster head.Second, cluster.After each area has chosen cluster head, each sensor node is according to receiving signal strength or weakness
Which cluster selected to be added.If existed without cluster head, if the sensor node directly and base station communication, the otherwise biography of non-cluster head
The behavior of sensor node is generally all within the scope of cluster.Third, cluster-level routing selection.It is selected in the structure and cluster head of cluster
Afterwards, the communication path for leading to base station for each cluster head and directly will be selected with the sensor node of base station communication, here
Introduce the theory of fuzzy set and fuzzy decision, the thought of algorithm is as follows: 1) all cluster heads and directly with the biography of base station communication
Sensor node is divided into three set, measures the degree of membership of these sensor nodes with different membership functions respectively；2) it carries out
Differentiate that the sensor node for being 0 degree of membership directly removes, and takes the range of intersection reduction candidate sensor node；3) mould is utilized
The theory for pasting decision carries out scoring addition to remaining sensor node, and acquirement divides relay node of the soprano as next-hop.
Technical solution 3: " wireless sensor network fault diagnosis method ", patent publication No. CN102340811A are related to
Wireless sensor network and fault diagnosis field disclose a kind of wireless sensor network fault diagnosis method, the pass of this method
Steps are as follows for key: first, data measured by the sensor node in online real time collecting wireless sensor network；Second,
The failure of single sensor node is detected using the space-time characterisation of the data；Third utilizes the correlation before adjacent node
Detect the failure of entire wireless sensor network；4th, the parameter that step 2 and step 3 the two processes are got is carried out
Attribute reduction；5th, the fault diagnosis result of wireless sensor network is obtained according to the attribute reduction result of step 4.
It is analyzed, is had the following problems for the above-mentioned prior art:
Technical solution 1 uses a kind of wireless sensor network routing method of energy efficient, for the sensor of layering
Network architecture realizes several routing protocols for wireless sensors networks using ant group algorithm, saves it is characterized in that: being determined according to dump energy
Whether point has the qualification of election contest cluster head；According to node geo-location, cluster division is carried out using split plot design is repeated, guarantees each cluster
Geographical location is uniformly and cluster internal segment points are close；Bunch member node transmits information to cluster head by way of single-hop；Using ant
Group's algorithm selects routing link according to the pheromone concentration of each chain road, cluster-level routing is carried out, by the data transmission of each cluster
To Sink node；With the operation of network, the pheromone concentration of link is periodically calculated, and according to this information update node-routing
Table, maintaining routing information.This method uses ant group algorithm on cluster-level routing can guarantee to select the reasonability of link.But
Ant group algorithm convergence time is too long, is not suitable for the application of large-scale sensor network scene.
Technical solution 2 uses a kind of low power consumption adaptive clustering and multi-hop wireless sensor network based on fuzzy decision and opens up
Flutter control method, which is characterized in that recycle by a wheel for one, each round includes establishment stage and stabilization sub stage；Described builds
The vertical stage includes election of cluster head, cluster, cluster-level routing three steps of selection；The step of described election of cluster head, is assisted using LEACH
The same strategy for randomly selecting cluster head in view.The randomness of cluster head selection may result in that Node distribution is undesirable to be influenced
The performance of stabilization sub stage data transmission.The step of data are transmitted.This method is used in data transfer phase, leader cluster node
Fuzzy decision selects next-hop relay node, and which optimizes the selection of next-hop node in data transmission, make residual energy
Measure it is more, apart from the closer next-hop node of aggregation node be more likely to become relay node.But which is not to business number
According to distinguishing, low QoS business and high QoS business all select shorter path to transmit, and cause excess energy consumption and network congestion.
Technical solution 3 uses the method for diagnosing faults based on measurement data space-time characterisation in a kind of WSN, and this method utilizes
The failure of the space-time characterisation detection individual node of data measured by sensor node in wireless sensor network, and utilize
Correlation between node realizes quick, the correctly fault detection of whole nodes in network.Also and according to wireless sensor network
The application environment and fault signature of network obtain diagnosis decision table, using the conclusion old attribute reduction algorithms in improved rough set to examining
Disconnected decision table carries out attribute reduction, the method for establishing a set of failure modes with Hamming network.Although this method can be to sensor
Node is measured in real time, but this method does not account for the fault restoration situation of sensor node, also standby without malfunctioning node
Part mechanism, this is incompatible in the case of manually repairing malfunctioning node and high link cost in Internet of Things transmission line of electricity, when having
After great deal of nodes breaks down, significant impact may be generated to the performance of whole network.
Summary of the invention
For prior art defect existing for the path transmission and failure safe scheme of wireless sensor network, this hair
Bright purpose is that research is directed to the route planning method of transmission line of electricity wireless sensor network, and this method is based on the wireless of layering
Sensor network studies one kind uniformly first, and efficient sub-clustering mode is that subsequent leader cluster node carries out high performance data transmission
It lays the groundwork, later, leader cluster node can select suitable leader cluster node to carry out when carrying out data transmission according to service priority
Relaying realizes load balancing to form the end-to-end routing of optimization, extends network lifecycle, meanwhile, the present invention also according to
Route planning proposes a kind of failover backup mode of uniform energy consumption, to guarantee the reliable transmission of business datum.
The technical solution of the present invention is as follows: a kind of route planning method of transmission line of electricity wireless sensor network, before this to biography
Sensor network carries out uniform sub-clustering, and then when carrying out data transmission, leader cluster node collects adjacent leader cluster node and cluster interior nodes
The information of transmission, and the routing forwarding based on traffic differentiation is carried out, including following part: 1) cluster head select, and is based on energy and section
Point two kinds of factors of traffic load establish cluster head selection mechanism, keep dump energy high, and the big node of traffic load is more likely to become cluster
Head node；2) cluster head is distributed, and is optimized processing to the cluster head selected, is set the optimum distance range of adjacent leader cluster node, and
It is distributed leader cluster node by additions and deletions leader cluster node on this basis more uniform；3) data transmit, based on service priority into
Row route planning, cluster head carries out priority ranking to the data packet of the different business received, preferential according to the business of data packet
Grade plans that different paths carries out data forwarding.
Further, it is also proposed that a kind of fault diagnosis side of the route planning method of transmission line of electricity wireless sensor network
Method, carry out fault diagnosis based on information reconciliation sensing agreement SPIN, carried out using the message of three types: detection PRO message is answered
REP message and data DATA message are answered,
Step 1: sensor node, which faces node to its next-hop first, sends PRO information, the information is next for detecting
Whether hop node is normal；
Step 2: replying REP information to source node, and go to third step after next-hop node receives PRO information；If
Source node is not received by REP information whithin a period of time, then it is assumed that next-hop node breaks down, and is informed by flooding approach
The other sensors node node failure situation, source node retransmits data information according to fault tolerant mechanism, and goes to
The first step；
Step 3: source node after receiving REP information, sends DATA information to next-hop node.
Further, it is also proposed that a kind of failover backup side of the route planning method of transmission line of electricity wireless sensor network
Method, is divided into link backup and failover backup two parts, and link backup is based on data forwarding mode, and each node is to unused path
Data forwarding is carried out, to play the role of link backup；Node standby is carried out according to fault diagnosis: based on surplus in data transmission
Complementary energy and optimal energy consumption carry out malfunctioning node backup, and leader cluster node is when carrying out data forwarding, under discovery selection path
One to jump leader cluster node dead, then planning path again, selects the leader cluster node in other paths to carry out data forwarding, wherein every
The node standby stage in a period selects the maximum cluster node of weight as standby by way of setting weight in each cluster
Part node replaces leader cluster node to carry out data convergence and forwarding after leader cluster node death by backup leader cluster node.
The present invention is based on hierarchy routing algorithms, improve two stages of sub-clustering and route planning of traditional batch algorithm, and
Propose a kind of failover backup mechanism.In the sub-clustering stage, the invention proposes a kind of based on optimal equal of balancing energy and energy consumption
Even cluster algorithm, it is contemplated that two factors of dump energy and traffic load carry out the distribution of cluster head further according to distance factor equal
Homogenize processing.In the route planning stage, the data forwarding mechanism based on traffic differentiation that the invention proposes a kind of is meeting time delay
In the case where it is required that, requires traffic assignments respective paths to carry out data forwarding different delay, be finally reached when meeting business
In the case where prolonging constraint requirements, the traffic load of balanced each leader cluster node reduces the total energy consumption of data transmission procedure, finally prolongs
Long Network morals.In terms of the failover backup of route planning, the invention proposes a kind of fault diagnosis mechanism and backups
Resources Sharing Mechanism.Fault diagnosis mechanism is similar with " three-way handshake " agreement, can diagnose to whether node breaks down.It is standby
Part Resources Sharing Mechanism includes two aspect of link backup and node standby.Since the method for the present invention is realized in data transmission
Multi-path planning, so can be still forwarded by remaining path to data packet if main path fails.Meanwhile it being weighed by setting
The mode of value can have the larger backup leader cluster node of a weight in each cluster, after leader cluster node death, by backup cluster head
Node replaces leader cluster node to carry out data convergence and forwarding, this method ensure that the reliable transmission of business datum.
Innovation point of the invention is:
1) path planning and the event of a kind of the transmission line of electricity Internet of Things sensing based on energy consumption balance and monitoring application are proposed
Hinder backup method (EHRPFB), including the uniform sub-clustering mechanism optimal based on balancing energy and energy consumption, the number based on traffic differentiation
According to forwarding mechanism and the malfunctioning node back mechanism based on dump energy and optimal energy consumption；
2) a kind of sub-clustering mechanism is proposed to plan that the mechanism is in leader cluster node to entire sensor network topological structure
The dump energy of node and the traffic load of node are considered in selection, the node for keeping the high traffic load of dump energy big is more likely into
For leader cluster node；In cluster head distribution, which sets adjacent leader cluster node according to whole network scale and Node distribution situation
Optimum distance range, and on this basis by additions and deletions leader cluster node make leader cluster node be distributed it is more uniform；
3) it proposes that a kind of data forwarding mechanism is transmitted come the data to whole network to plan, leader cluster node is according to the machine
System carries out data forwarding, priority ranking is carried out to the data packet of the different business received, according to the surplus of adjacent leader cluster node
Complementary energy situation and distance, the mode for meeting whole network load balancing to the data packet selection of different priorities are forwarded,
To improve the life cycle of entire sensor network；
4) propose a kind of failover backup mechanism to replace to dead leader cluster node, the mechanism be divided into link backup and
Failover backup two parts content, link backup is based on the data forwarding mode that designs of the present invention, and each node is to unused path
Data forwarding is carried out, to play the role of link backup；Node standby is then to work as leader cluster node by way of setting weight
It breaks down, then replaces failed cluster head node to carry out data as backup leader cluster node by the cluster node of maximum weight and converge sum number
According to forwarding, finally meet the reliability of whole network data transmission.
The path planning of the invention proposes a kind of transmission line of electricity Internet of Things sensing and monitoring application based on energy consumption balance
And failover backup method (EHRPFB), the advantage is that:
The method of the present invention is directed to sub-clustering, and three aspects of route planning and failover backup optimize.In terms of sub-clustering, this hair
It is bright to propose a kind of uniform cluster algorithm optimal based on balancing energy and energy consumption, it is contemplated that dump energy and traffic load two
Factor carries out Homogenization Treatments to the distribution of cluster head further according to distance factor.In terms of route planning, the invention proposes one kind
Data forwarding mechanism based on traffic differentiation requires traffic assignments corresponding different delay in the case where meeting delay requirement
Path carries out data forwarding.In terms of failover backup, the failure based on dump energy and optimal energy consumption that the invention proposes a kind of
Back mechanism.The mechanism is divided into link backup and node standby two parts.The data forwarding that link backup is designed based on the present invention
Mode, each node can carry out data forwarding to unused path, to play the role of link backup；Node standby is then
By way of setting weight, when leader cluster node breaks down, then by the cluster node of maximum weight as backup leader cluster node generation
Data convergence and data forwarding are carried out for failed cluster head node.Assessment result shows that algorithm proposed by the invention can be full
In the case where sufficient service delay constraint requirements and reliability, the traffic load of balanced each cluster head reduces data transmission procedure
Total energy consumption finally extends Network morals.
Detailed description of the invention
Fig. 1 is topological structure schematic diagram of the method for the present invention in long chain type transmission line of electricity.
Fig. 2 is link fault tolerant mechanism schematic diagram of the present invention.
Fig. 3 is node fault-tolerance schematic diagram of mechanism of the invention.
Fig. 4 is the uniform sub-clustering mechanism flow chart optimal the present invention is based on balancing energy and energy consumption.
Fig. 5 is that the present invention is based on the data forwarding mechanism flow charts of service priority.
Fig. 6 is that the present invention is based on the failover backup mechanism flow charts of dump energy and optimal energy consumption.
Fig. 7 is present invention figure compared with the sub-clustering result of the I-LEACH algorithm of the prior art, it is shown that sub-clustering the 1st was taken turns
Node death condition, (a) are I-LEACH algorithm, (b) are the method for the present invention.
Fig. 8 is present invention figure compared with the sub-clustering result of the I-LEACH algorithm of the prior art, it is shown that sub-clustering the 30th was taken turns
Node death condition, (a) are I-LEACH algorithm, (b) are the method for the present invention.
Fig. 9 is present invention figure compared with the sub-clustering result of the I-LEACH algorithm of the prior art, it is shown that sub-clustering the 50th was taken turns
Node death condition, (a) are I-LEACH algorithm, (b) are the method for the present invention.
Figure 10 is the present invention dead wheel number comparison dead with the node of I-LEACH algorithm.
Figure 11 is CRLA cluster-level routing algorithm and the route planning schematic diagram based on ant group algorithm, and (a) is ant group algorithm,
It (b) is CRLA algorithm.
Figure 12 is the present invention is based on the route planning schematic diagram of traffic differentiation, and (a) is the road of higher service priority business
It is (b) route planning of lower service priority by planning.
Figure 13 is the present invention is based on the route planning method of traffic differentiation, CRLA cluster-level routing algorithm and to be based on ant colony
The node death condition of three kinds of algorithm each round of algorithm, it is shown that the mean value of test of many times.
Figure 14 is the present invention is based on the route planning method of traffic differentiation, CRLA cluster-level routing algorithm and to be based on ant colony
Three kinds of algorithms of algorithm, line chart made of all survival node dump energy variances of each round.
Figure 15 is that whether there is or not the efficient comparison diagram of back mechanism, (a) probability of node failure p under different probability of node failure
=0.001, (b) probability of node failure p=0.005, (c) probability of node failure p=0.01, (d) probability of node failure p=
0.05。
Specific embodiment
By the study found that the layering route planning in wireless sensor network is calculated and is calculated compared to not stratified route planning
Method has the advantage that 1) adaptivity: by the periodical rotation of leader cluster node and the addition of cluster member or withdrawing
Realize lasting monitoring and data acquisition.2) energy saving: since base station is far from network, the communication of node and base station is energy consumption highest
Operation, to network carry out sub-clustering after, cluster head is responsible for sending base station for the data of entire cluster, reduces the section with base station communication
Points, greatly reduce network energy consumption.3) eliminate data redundancy: there is a large amount of data redundancy in WSN, cluster head is by this cluster
Data be sent to before base station, data fusion and squeeze operation can be carried out to eliminate redundancy, be further reduced logical with base station
Traffic.4) robustness: node is elected as leader cluster node by way of a kind of self-organizing, collects information in current cluster and is merging
After be transmitted to base station, in the entire network the distribution of the Load Balanced of network, the energy greatly reduced in communication process disappears
Consumption, also enhances the robustness of network.5) part/global optimization: compared with other Routing Protocols, cluster algorithm can not only be right
Local message carries out fusion optimization.But also global information can be optimized.6) scalability: cluster algorithm is easy and it
He combines routing algorithm, to improve the performance of routing algorithm.
Therefore, for the fault detection of transmission line of electricity, center of gravity is placed on research transmission line of electricity sensor network by the present invention
In route planning method, the method for the present invention is the road of a kind of the transmission line of electricity Internet of Things sensing based on energy consumption balance and monitoring application
Diameter planning and failover backup method (an energy-balancing based hierarchical route planning
and fault backup method for IoT sensing and monitoring of transmission lines,
EHRPFB), and there is three node clustering strategy, data forwarding strategy and failover backup strategy mechanism.Firstly, side of the present invention
Method contains a kind of node clustering strategy based on energy balance and energy optimization.Preferential selection has high dump energy and high stream
The node of load is measured as leader cluster node, is then uniformly distributed leader cluster node.It is based on next, the method for the present invention contains one kind
The data forwarding strategy of load balancing with Differentiated Services, and requires to be different services selections according to service priority and delay
Suitable routing.The method of the present invention further comprises a kind of failover backup strategy based on dump energy and optimal energy consumption, the mechanism
It is divided into link backup and node standby two parts.The data forwarding mode that link backup is designed based on the present invention, each node can
To carry out data forwarding to unused path, to play the role of link backup；Node standby is then by setting weight
Mode, when leader cluster node breaks down, then by the cluster node conduct backup leader cluster node of maximum weight instead of failed cluster head node
Carry out data convergence and data forwarding.In short, the method for the present invention can reduce data transmission under the premise of guaranteeing that delay requires
Total energy consumption, extend the life cycle of sensor network.
Implementation of the invention is described in detail below.
(1) wireless sensor network framework
Topological structure schematic diagram in transmission line of electricity is as shown in Figure 1, sensor is counted to aggregation node by ZigBee
According to transmission.The node that circle surrounds is leader cluster node, and leader cluster node is after receiving multiple business data packets, when meeting business
Under the requirement prolonged, routing forwarding is carried out by different paths.After data are transferred to aggregation node, aggregation node, which can use, to be had
Line private network (OPGW) mode transmits data to substation.In addition to this, wireless private network (LoRa) or nothing can also be used in aggregation node
Both long-distance radio communication modes of line public network (NB-IoT) transmit data to substation.
The sensor topology of transmission line of electricity is link type structure, and link type network structure has structure special, complicated
Spend low feature.Known every transmission line of electricity has three-phase, i.e. A, B, C three-phase, solid respectively on the three-phase of each overhead line structures
Surely sensor node is disposed.We dispose layered network model such as network topological diagram, and make following hypothesis: 1) all the sensors
It is all static, although monitoring business may be different, identical in usually transmission data frequency, size of data is almost the same, is supervising
Data are sent immediately when measuring emergency situations, which has higher priority.2) all the sensors both know about the residue of oneself
Energy, and its transimission power is adjusted according to communication distance.3) link is symmetrical, and radio signal has phase in all directions
Same energy attenuation.4) all the sensors can be run under forwarding (cluster head) mode and inductive mode.
(2) network energy model
If the energy of transmitting terminal for receiving data, and assumes that data are transmitted for sending data, the energy of receiving end
When two nodes between dissipation energy use free space model.Therefore, when between the node that two distances are d (unit: rice)
When sending t bit data, energy consumed by transmitting terminal are as follows:
Econsum(t, d)=t (Eelec+ε·dindex) (1)
Wherein, EelecIndicate the energy of transmit circuit loss, Euclidean distance of the d between two nodes, d0For apart from critical
Value, εfsAnd εmpEnergy needed for power amplification in respectively two kinds of models.
Node receives energy consumed by t bit are as follows:
Er(t)=tEelec (2)
Wherein, ErTo receive the energy that t bit data need.
(3) route planning method of the present invention
3.1) best leader cluster node number
If the primary power of all nodes is identical, for all nodes other than sensing business is different, other parameters are all the same.?
This assumes that N number of sensor node is uniformly distributed on the three-phase line of transmission line of electricity, and area size is set as LW, aggregation node
It is arranged in the side of transmission line of electricity.In each sub-clustering period, each cluster node sends t bit data to cluster head.According to energy consumption
The total power consumption of formula (1), the whole network in each sub-clustering period is equal to:
Wherein, dave-sinkIndicate average distance of the leader cluster node to aggregation node, dave-chIndicate cluster node to corresponding cluster head
The average distance of node, M indicate the quantity of leader cluster node.
Since all nodes are equally distributed, available following formula:
By to the leader cluster node quantity M derivation in formula (3), and makes it equal to 0 and can obtain best leader cluster node quantity are as follows:
3.2) each node becomes the best rotational cycle of leader cluster node
The present invention sets TroFor the rotational cycle of each leader cluster node, i.e., each node is elected as leader cluster node with Probability p
Afterwards, at least to pass through TroLeader cluster node could be elected as after a sub-clustering period with Probability p again, then
Assuming that i-th of node is as follows as leader cluster node probability in the r wheel sub-clustering period:
Wherein, paveBecome the probability of cluster head, E for ideally each nodei(r) it is taken turns for i-th of node r surplus
Complementary energy,For the average residual energy that all nodes are taken turns in r, it is expressed as follows:
Wherein, R is the life cycle of ideally whole network, can be expressed with following formula:
Then in r wheel, the rotational cycle of i-th of node can be expressed from the next:
Wherein, EroundIt is provided by formula (3), EtotalFor entire sensor network initial total energy, it is expressed as follows:
EinitFor the initial residual energy of each node, initial residual energy is identical.
3.3) leader cluster node is selected
Cluster head selection course is broadly divided into two stages, and the first stage generates pre- leader cluster node, and second stage is to the first round
The pre- leader cluster node generated is adjusted, and finally determines real leader cluster node.
In the first phase, the selection of pre- leader cluster node selects formula with reference to LEACH agreement cluster head, and on this basis
Consider two factors more, one be sensor node dump energy, one is other nodes in the node and communication range
Communication cost, current invention assumes that communication cost refers to that the node receives the communication energy consumption of other nodes communication range Nei.Pre- cluster
The election process of head node is as follows: node generates a random number, which is between 0~1, if this random number is less than threshold value
T (n), then the node is chosen as pre- leader cluster node in working as front-wheel.The expression formula of T (n) is as follows:
In formula, G is the node set of not elected cluster head in the best rotational cycle of each node, is not belonging to the section of the set
Point T (n)=0；R is when front-wheel number.
The average residual energy theorem of node is as follows:
Assuming that certain node n is in distance range dmaxThere are k to face node in range, each faces the number that node sends related service
According to including t bit data, then receiving the corresponding energy consumption of each node data is Er(t)=tEelec, then for central node n
For, it receives and faces the total energy consumption that node sends t bit data are as follows:
The energy consumption of whole network per node on average reception neighbor information are as follows:
It is considered herein that DmaxThe communication range of data packet, D are forwarded for leader cluster node in cluster-level routing multi-hopmaxIt is pushed away by following
It leads and obtains.
Assuming that communication distance d of the cluster node to leader cluster nodechMeet:
Then:
In view of the particularity of transmission line of electricity topological structure, factor is addedWithMake final dmaxMeet:
Wherein, L is the length of scene, and Lm is the lateral separation that sensor is placed, and W is the width of scene, and Wm is sensor
The longitudinal gap of placement, M are the quantity of leader cluster node.
dmaxFor the optimal distance of cluster node to leader cluster node, dmaxWith DmaxRelationship is as follows:
In second stage, each pre- leader cluster node becomes pre- leader cluster node information to surrounding broadcast, if two pre- cluster head sections
The distance of point is less than the distance D of settingmin, then the lesser pre- leader cluster node of weight is reduced to ordinary node, and weight is biggish to be upgraded to cluster
Head node.Minimum range DminIt is determined by following formula:
The weights omega (n) of node is determined by following formula:
In formula, α, β and χ are respectively residue energy of node, node receive neighbors send associated traffic data packet energy consumption with
And the weight coefficient apart from aggregation node distance.
After leader cluster node determines, leader cluster node sends message request, each ordinary node ownership to other nodes of surrounding
In the nearest leader cluster node of the distance in communication range.If the node, which becomes, not to be belonged to without leader cluster node in communication range
Node.
In non-home node, cluster head is regenerated, cluster head generating probability is as follows:
Wherein, M' is the value that desired cluster head quantity M subtracts practical cluster head quantity, and N' is non-home node quantity,For
Average residual energy in non-home node, Er-total(n, t) ' is to receive energy consumption in non-home node,Not belong to section
Per node on average in point receives the energy consumption of neighbor information.
3.4) delay constraint of data transmission
Present invention assumes that there are many business in whole network, kth kind business is denoted as BK, its delay requirement isThen
Sensor is transmitted to time D used in aggregation node from perception data to data packetKIt should meet
Assuming that the time delay that each leader cluster node handles the data packet of business of the same race is constant, and assume that data packet exists
It is also constant that the queuing time of each leader cluster node is equal, but data packet in transmission since distance can be with compared to speed
It ignores, then by Dave=Dqueue+Dprocess+DtransmissionIt is set as definite value, Dqueue,Dprocess,DtransmissionRespectively
The queuing delay of business of the same race, processing delay and propagation delay, therefore delay constraint can be converted into the constraint of hop count:
3.5) the fault diagnosis mechanism based on information reconciliation sensing agreement (SPIN)
Disappeared in fault diagnosis mechanism using message detection PRO message, response REP message and the data DATA of three types
Breath.
Step 1: sensor node, which faces node to its next-hop first, sends PRO information, the information is next for detecting
Whether hop node is normal.
Step 2: replying REP information to source node, and go to third step after next-hop node receives PRO information；If
Source node is not received by REP information whithin a period of time, then it is assumed that next-hop node breaks down, and is informed by flooding approach
The other sensors node node failure situation.Source node retransmits data information according to fault tolerant mechanism, and goes to
The first step.
Step 3: source node after receiving REP information, sends DATA information to next-hop node.
3.6) failover backup mechanism
Path planning of the invention pertains only to leader cluster node, so fault tolerant mechanism only considers the fault-tolerant of leader cluster node.Sensing
Fault diagnosis mechanism is carried out between device node periodically to determine whether link is normal.
1) the link backup mechanism based on multi-path planning
The routing table of EHRPFB algorithm according to the present invention, each leader cluster node can cover a plurality of road of destination node
Diameter, when some intermediate node is dead in certain paths, then leader cluster node will be updated routing table, and leader cluster node is according to new routing table
Information carries out data forwarding.
As shown in Fig. 2, the routing table of leader cluster node 7 contains two paths, it is 7-3-5- aggregation node and 7-14- respectively
10-18- aggregation node.When main path interior joint 5 breaks down, by fault diagnosis mechanism, node 3 perceives the hair of node 5
Raw failure simultaneously informs the other sensors node nodes break down by flooding approach.Node 7 is learning that node 5 breaks down
Afterwards, routing table is updated, and the data forwarded will be needed to carry out data forwarding by backup path.
2) the malfunctioning node back mechanism based on dump energy and optimal energy consumption
EHRPFB algorithm according to the present invention carries out sub-clustering to sensor network, and the maximum cluster of weight is selected in each cluster
Node is as backup node.Routing table is sent to backup leader cluster node by leader cluster node, and will more after updating routing table every time
New routing table is sent to backup leader cluster node.Weight equation is as follows:
Wherein, w is specific gravity shared by node energy, Eave-remainFor the average residual energy of cluster interior nodes, daveFor in cluster
The average distance of node and other nodes,For the average of all node average distances, it is expressed as follows:
λ is cluster interior nodes number, dijFor the distance between node i and node j.
When leader cluster node death, then former leader cluster node is substituted by backup leader cluster node, remaining node transmits data in cluster
Backup leader cluster node is given, meanwhile, backup leader cluster node receives the data of other leader cluster nodes forwarding and carries out data forwarding.
As shown in figure 3, leader cluster node 3 and node 2,4,9 belong in a cluster, and node 9 is backup leader cluster node.Work as cluster
After head node 3 breaks down, backup leader cluster node finds that leader cluster node breaks down by fault diagnosis mechanism, then passes through flooding
Method informs that other sensors node, node 9 replace the convergence and forwarding of the progress data of node 3.During data transmission, if
Node 3 breaks down, then routing table will be updated to 7-9-5- aggregation node from 7-3-5- aggregation node by leader cluster node 7.
Implementation method of the invention is specifically described below.
The invention proposes a kind of uniform sub-clustering mechanism optimal based on balancing energy and energy consumption.Firstly, according to decaying function
Rate formula sets the optimal distance d between nodemax.The distance between cluster head is set as DmaxWithin be adjacent leader cluster node,
DminMinimum range limitation between cluster head.Secondly, carrying out sub-clustering to network, node work is randomly selected according to new probability formula (12)
For pre- leader cluster node, remaining node is as ordinary node.Third step, if distance is less than D between pre- leader cluster nodemin, then weight compared with
Big node becomes leader cluster node, and weight is lesser to be reduced to ordinary node.4th step, if leader cluster node quantity compares desired amt
Few, then all ordinary nodes belong to leader cluster node nearest apart from oneself in communication range, remaining ordinary node becomes and do not return
Belong to node；If being otherwise more than or equal to desired value without non-home node or leader cluster node quantity, all ordinary nodes are belonged to
The leader cluster node nearest apart from oneself, sub-clustering stage terminate.5th step is given birth to according to new probability formula (22) again in non-home node
At leader cluster node, all non-home nodes belong to leader cluster node nearest apart from oneself in communication range, remaining node is still
Non- home node.Go to step 4.Process such as Fig. 4 of uniform sub-clustering mechanism.
The data forwarding mechanism based on service priority that the invention also provides a kind of.Rank is transmitted in the data of each round
Section, cluster head receive cluster internal segment point data and other cluster heads forwarding data simultaneously, and by Delay Priority to the data of various businesses
Packet distinguishes.Each data packet can carry a timestamp, and be defined to the effective time of data packet with hop count constraint,
The every forwarding of data packet is primary, and hop count constraint can all reduce 1.In data forwarding process, cluster head first to hop count constraint be 1 number
Aggregation node is forwarded directly to according to packet；After this, cluster head is to the highest service selection dijkstra's algorithm of time delay constraint requirements
Under the next-hop cluster head node of shortest path carry out data forwarding, and next-hop cluster head node is marked；Then consider
Sub-priority business preferentially selects under dijkstra's algorithm in not labeled node in the case where meeting delay requirement
Shortest path and next-hop cluster node is marked；If not meeting delay requirement most in unlabelled node
Short path, then leader cluster node selects the path for meeting delay requirement from marked node；If still without delay requirement is met
Path, then select shortest path carry out data forwarding；And so on, until the forwarding of all data packets finishes.Data forwarding machine
The process of system is as shown in Figure 5.
On the basis of route planning in front, the failure based on dump energy and optimal energy consumption that the invention also provides a kind of
Node standby mechanism.For leader cluster node when carrying out data forwarding, the next-hop cluster head node in discovery selection path is dead, then again
Planning path selects the leader cluster node in other paths to carry out data forwarding.In the node standby stage in each period, pass through setting
The mode of weight can have the larger backup leader cluster node of a weight in each cluster.After leader cluster node death, by backup cluster
Head node replaces leader cluster node to carry out data convergence and forwarding.The back mechanism of leader cluster node is for example as shown in Figure 6.
Illustrate below with reference to example:
(1) parameter setting
In order to prove effectiveness of the invention, experimental evaluation is carried out and has been verified.The experiment to the position of destination node,
The setting of communication distance, primary power, transmission energy consumption and number of nodes etc. between node.
1 parameter setting of table
| Parameter | Value | Parameter | Value |
| Node location number N | 90 | Data transmissions consume E0(J) | 2×10^(-8) |
| It is expected that node number M | 90*0.9 | It sends energy consumption (J/ (bit × m)) | 50E0 |
| Leader cluster node generating probability P | 0.1 | It receives energy consumption (J/bit) | 50E0 |
| Node distribution region A (m2) | 2×3000 | It converges energy consumption (J/bit) | 5E0 |
| Ordinary node transmits radius r (m) | 300 | It controls information (bit) | 32 |
| Leader cluster node transmits radius R (m) | 600 | Data information (bit) | 4000 |
| Node primary power (J) | 1500J | Higher priority business hop count constraint (hop) | 10 |
| Destination node position (m) | (3000,1) | Lower-priority traffic hop count constraint (hop) | 15 |
(2) experimental result
The present invention mainly carries out experimental evaluation in terms of three of algorithm.In sub-clustering phase experiments, algorithm of the invention
It is mainly compared and analyzed with I-LEACH algorithm in death nodes distribution situation and node death degree, I-LEACH algorithm exists
In the cluster head selection mechanism of LEACH algorithm, have modified the calculation formula of threshold value T (n), make neighbor node is more, dump energy more
Greatly, the node closer from aggregation node is bigger as the probability of leader cluster node.In data transfer phae, algorithm master of the invention
It to be compared point with ant group algorithm and CRLA algorithm in route planning mode, node death degree and node energy consumption balance degree
Analysis.Ant group algorithm is a kind of intelligent algorithm, in such a way that search path leaves pheromones, converges to planning path constantly most
Shortest path.CRLA algorithm is the improvement of LEACH-C algorithm, and a kind of calculation that single-hop is combined with multi-hop is executed in terms of cluster-level routing
Method, for all data after being less than certain threshold value apart from aggregation node, data pass through single-hop transmission to aggregation node.In failover backup
Stage, the present invention mainly evaluate proposed failover backup mechanism using node failure rate.
1) the uniform clustering algorithm optimal based on balancing energy and energy consumption
If Fig. 7~9 are the sub-clustering experimental result picture for carrying out I-LEACH algorithm and EHRPFB algorithm, aggregation node position respectively
In right end, leader cluster node indicates that cluster node is indicated with " o " with " * ", and line segment indicates the leader cluster node of each cluster node ownership,
Node, solid node are death nodes to hollow node for survival.
I-LEACH and EHRPFB algorithm is run, records the node death feelings of two kinds of algorithm sub-clusterings the 1st, 30,50 wheel respectively
Condition, as a result as shown in figs. 7-9:
It can be seen that the death nodes number of EHRPFB algorithm is all significantly less than I-LEACH calculation in each round before 50 wheels
Method；When taking turns to the 50th, most of node of I-LEACH algorithm is dead.Furthermore, it is possible to find the dead section of EHRPFB algorithm
Point is to spread since chain Lu Zhizheng to both sides, and the death nodes of I-LEACH algorithm are from the side far from aggregation node
To beginning, this is because the leader cluster node distribution of EHRPFB algorithm is more uniform, the node in the middle part of link is due to needing
The data packet number of forwarding is more, so consumption energy is very fast；And I-LEACH algorithm, due to the cluster head section far from aggregation node
Point quantity is very few, and cluster head sends data to aggregation node using single-hop transmission, so the cluster head far from aggregation node can be very
It is fast dead.In comparison, the node death rate of EHRPFB algorithm is slow compared with I-LEACH algorithm, this is from figure it is evident that knot
Fruit.
In order to more intuitively compare the energy characteristics and load equilibrium of two kinds of cluster-dividing methods, experimental evaluation is being carried out
When, the node death condition of two kinds of cluster algorithm each round is recorded, two kinds of cluster algorithms, first node, 30% section are compared
The dead wheel number of point, 50% node and 80% node.In order to guarantee that the reliability of experimental result, all data are all multiple realities
Test the mean value of result.It is as shown in Figure 10 that column diagram is made in result.
From the figure, it can be seen that two kinds of algorithm comparisons, the node death time of EHRPFB algorithm is all later than I-LEACH calculation
Method.It can be seen that EHRPFB algorithm effectively extends network life, and in network lifetime compared to I-LEACH algorithm
It is interior, improve load equilibrium and network connectivity.
2) the data forwarding mechanism based on service priority
The present invention is to CRLA cluster-level routing algorithm, the routing algorithm based on ant group algorithm and based on the routing of service priority
Algorithm carries out experimental evaluation respectively, and aggregation node is located at right end, and each sensor node can spontaneously produce data packet
With forwarding data packet, data may be detected by being equivalent to each node in actual conditions.In experiment, these three path plannings
The cluster algorithm of algorithm is all using EHRPFB sub-clustering phase algorithm.Experimental result is as shown in 11~12.
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
Figure 11, Figure 12 give the characteristics of Path selection under algorithms of different, and the path in 2 pairs of figures of table records.It can be with
Find out, in ant group algorithm, after certain the number of iterations, planning path converges on a shorter path.CRLA algorithm
In all data after being less than certain threshold value apart from aggregation node, data are by single-hop transmission to aggregation node.Both clusters
Between route planning mode all business be all single path transmission.And based in traffic differentiation algorithm, Figure 12 (a) is that business is excellent
The relatively high business of first grade, the business of high priority directly select shortest path when selecting path；Figure 12 (b) is that business is excellent
The relatively low business of first grade, according to Route Routes selection algorithm proposed by the invention, the business of low priority is in selection path
When, it can be without selection shortest path " going the long way round ".
In experimental evaluation, the node death condition of three kinds of algorithm each round is recorded, the result of test of many times mean value is such as
Shown in Figure 13.It can be seen that three kinds of algorithm comparisons, the node death time based on traffic differentiation algorithm is all later than other two kinds of roads
By algorithm, therefore there is better energy efficiency.This is because the cluster-level routing algorithm based on traffic differentiation for delay requirement compared with
Low data packet uses the data forwarding paths of load balancing, and node energy consumption is balanced, so the death nodes in every wheel sub-clustering period
Quantity is optimized.
In addition, recording all survival node dump energy variances of three kinds of algorithm each round, line chart is made, repeatedly tries
The result for testing mean value is as shown in figure 14.It can be seen that the dump energy variance of traffic differentiation algorithm is overall minimum.This is because
The node energy consumption of CRLA algorithm very dependent on propagation threshold selection, Near Threshold node due to transmission energy consumption is high, section
Point is dead very fast.And in other two kinds of algorithms, traffic differentiation algorithm due to be to the forwarding of the multipaths of different business data, so
Node energy consumption is more balanced, and the survival node quantity in every wheel sub-clustering period is optimized, and is finally reached extension network lifecycle
Purpose.
3) malfunctioning node back mechanism
Since the route planning mode of this algorithm has this particularity of multi-path selecting solution, EHRPFB algorithm inherently has
Link fault-tolerance.So this part is mainly demonstrated and is analyzed to the fault tolerant mechanism of node.Average section after record wheel sub-clustering
Point is efficient, i.e. data transmission period after the effective time of node/every wheel sub-clustering, as shown in figure 15.
It can be seen from fig. 15 that there is the node effective percentage of back mechanism to be significantly greater than the node effective percentage without back mechanism,
This is because the node in entire cluster all will failure after leader cluster node breaks down.But it is used in the present invention based on reliable
Property Spare Capacity Sharing mechanism make the presence of backup leader cluster node in each cluster, when leader cluster node breaks down, backup cluster head section
Point can replace leader cluster node carry out data convergence and forwarding, this dramatically reduces break down node to whole network other
The efficient influence of node.
Claims (8)
1. a kind of route planning method of transmission line of electricity wireless sensor network, it is characterized in that being carried out before this to sensor network equal
Even sub-clustering, then when carrying out data transmission, the information that leader cluster node collects adjacent leader cluster node and cluster interior nodes are sent is gone forward side by side
Routing forwarding of the row based on traffic differentiation, including following part: 1) cluster head selects, based on two kinds of energy and node traffic load because
Element establishes cluster head selection mechanism, keeps dump energy high, and the big node of traffic load is more likely to become leader cluster node；2) cluster head point
Cloth optimizes processing to the cluster head selected, and sets the optimum distance range of adjacent leader cluster node, and passes through increasing on this basis
Deleting leader cluster node keeps leader cluster node distribution more uniform；3) data are transmitted, and carry out route planning, cluster head pair based on service priority
The data packet of the different business received carries out priority ranking, according to the service priority of data packet plan different paths into
Row data forwarding.
2. the route planning method of a kind of transmission line of electricity wireless sensor network according to claim 1, it is characterized in that cluster
Head selection and cluster head distribution specifically: the primary power for setting all nodes in network is identical, and all nodes are in addition to sensing business not
With outside, other parameters are all the same, if N number of sensor node is uniformly distributed on the three-phase line of transmission line of electricity, area size is set
It is set to LW, aggregation node is arranged in the side of transmission line of electricity, and in each sub-clustering period, each cluster node sends t bit number
According to cluster head is given, according to energy consumption formula (1), the total power consumption of the whole network in each sub-clustering period is equal to:
Wherein, EelecIndicate the energy of transmit circuit loss, dave-sinkIndicate leader cluster node to aggregation node average distance,
dave-chIndicate average distance of the cluster node to corresponding leader cluster node, εfsAnd εmpFor energy needed for corresponding power amplification, M table
Show the quantity of leader cluster node,
Due to all nodes be it is equally distributed, obtain following formula:
By to the leader cluster node quantity M derivation in formula (3), and 0 is made it equal to, obtains best leader cluster node quantity are as follows:
After determining leader cluster node quantity, T is setroFor the rotational cycle of each leader cluster node, i.e., each node is with probabilitypIt is elected as
After leader cluster node, at least to pass through TroIt could be again with probability after a sub-clustering periodpIt is elected as leader cluster node, then
If it is as follows that i-th of node becomes leader cluster node probability in the r wheel sub-clustering period:
Wherein, paveBecome the probability of cluster head, E for ideally each nodeiIt (r) is the residual energy of i-th of node r wheel
Amount,For the average residual energy that all nodes are taken turns in r, it is expressed as follows:
Wherein, R is the life cycle of ideally whole network:
Then in r wheel, the rotational cycle of i-th of node is expressed from the next:
Wherein, EroundIt is provided by formula (3), EtotalFor entire sensor network initial total energy, it is expressed as follows:
EinitFor the initial residual energy of each node, initial residual energy is identical；
Cluster head selection course is divided into two stages, and the first stage generates pre- leader cluster node, and second stage generates the first round pre-
Leader cluster node is adjusted, and finally determines real leader cluster node:
In the first phase, the election process of pre- leader cluster node is as follows: node generate a random number, the number be in 0~1 it
Between, if this random number is less than threshold value T (n), then the node is when being chosen as pre- leader cluster node in front-wheel, and the expression formula of T (n) is such as
Under:
In formula, G is the node set of not elected cluster head in the best rotational cycle of each node, is not belonging to the node T of the set
(n)=0；R be when front-wheel number,
The average residual energy theorem of node is as follows:
If certain node n is in distance range dmaxThere are k to face node in range, the data for each facing node transmission related service include
There is t bit data, then receiving the corresponding energy consumption of each node data is Er(t)=tEelec, then for node n, receive
Face the total energy consumption that node sends t bit data are as follows:
The energy consumption of whole network per node on average reception neighbor information are as follows:
DmaxThe communication range of data packet, D are forwarded for leader cluster node in cluster-level routing multi-hopmaxIt is derived from by following:
Assuming that communication distance d of the cluster node to leader cluster nodechMeet:
Then:
In view of the particularity of transmission line of electricity topological structure, factor is addedWithMake final dmaxMeet:
dmaxFor the optimal distance of cluster node to leader cluster node, dmaxWith DmaxRelationship is as follows:
In second stage, each pre- leader cluster node becomes pre- leader cluster node information to surrounding broadcast, if two pre- leader cluster nodes
Distance is less than the distance D of settingmin, then in two pre- leader cluster nodes, the lesser pre- leader cluster node of weight is reduced to ordinary node, weight
It is biggish to be upgraded to leader cluster node, minimum range DminIt is determined by following formula:
The weights omega (n) of node is determined by following formula:
In formula, α, β and χ are respectively residue energy of node, node receive neighbors send associated traffic data packet energy consumption and away from
Weight coefficient with a distance from aggregation node.
3. a kind of route planning method of transmission line of electricity wireless sensor network according to claim 2, it is characterized in that
After leader cluster node determines, leader cluster node sends message request to other nodes of surrounding, and each ordinary node is belonged in communication model
The nearest leader cluster node of interior distance is enclosed, if without leader cluster node in communication range, which becomes non-home node, do not returning
Belong in node, regenerate cluster head, cluster head generating probability is as follows:
Wherein, M' is the value that desired cluster head quantity M subtracts practical cluster head quantity, and N' is non-home node quantity,Not return
Belong to the average residual energy in node, Er-total(n, t) ' is to receive energy consumption in non-home node,For in non-home node
Per node on average receive neighbor information energy consumption.
4. a kind of route planning method of transmission line of electricity wireless sensor network according to claim 1 or 2, it is characterized in that
Data transmission carries out route planning based on service priority, and in the data transfer phase of each round, cluster head receives cluster internal segment simultaneously
Point data and other cluster heads forward data, and distinguish by data packet of the Delay Priority to various businesses, each data packet
A timestamp is carried, and the effective time of data packet is defined with hop count constraint, the every forwarding of data packet is primary, and hop count is about
Beam reduces 1；In data forwarding process, the data packet that cluster head is first 1 to hop count constraint is forwarded directly to aggregation node；Herein
Later, next-hop cluster head node of the cluster head to the shortest path under the highest service selection dijkstra's algorithm of time delay constraint requirements
Data forwarding is carried out, and next-hop cluster head node is marked；Then consider sub-priority business, meet delay requirement
In the case of, the shortest path under dijkstra's algorithm is preferentially selected in not labeled node and next-hop cluster node is carried out
Label；If not meeting the shortest path of delay requirement in unlabelled node, then leader cluster node is from marked node
Selection meets the path of delay requirement；If selecting shortest path to carry out data still without the path for meeting delay requirement and turning
Hair；And so on, until the forwarding of all data packets finishes.
5. a kind of route planning method of transmission line of electricity wireless sensor network according to claim 4, described in feature
It is that delay requirement is, if there are many business in whole network, K kind business is denoted as BK, its delay requirement isThen pass
Sensor is transmitted to time D used in aggregation node from perception data to data packetKIt should meet
If the time delay that each leader cluster node handles the data packet of business of the same race is constant, data packet is in each leader cluster node
Queuing time it is equal also be constant,For definite value, Dqueue, Dprocess,
DtransmissionThus delay constraint is converted into jump by the respectively queuing delay of K kind business, processing delay and propagation delay
Several constraints, the hop count constraint of K kind business are as follows:
6. the method for diagnosing faults of the route planning method of transmission line of electricity wireless sensor network according to claim 1,
It is characterized in that carrying out fault diagnosis based on information reconciliation sensing agreement SPIN, carried out using the message of three types: detection PRO disappears
Breath, response REP message and data DATA message,
Step 1: sensor node, which faces node to its next-hop first, sends PRO information, the information is for detecting next-hop section
Whether point is normal；
Step 2: replying REP information to source node, and go to third step after next-hop node receives PRO information；If one
Source node is not received by REP information in the section time, then it is assumed that next-hop node breaks down, and informs other by flooding approach
The sensor node node failure situation, source node retransmits data information according to fault tolerant mechanism, and goes to first
Step；
Step 3: source node after receiving REP information, sends DATA information to next-hop node.
7. the failover backup method of the route planning method of transmission line of electricity wireless sensor network according to claim 6,
It is characterized in that be divided into link backup and failover backup two parts, link backup is based on data forwarding mode, and each node is not to having to
Path carry out data forwarding, to play the role of link backup；Node standby is carried out according to fault diagnosis: in data transmission
Malfunctioning node backup is carried out based on dump energy and optimal energy consumption, leader cluster node is when carrying out data forwarding, such as discovery selection road
The next-hop cluster head node of diameter is dead, then planning path again, and the leader cluster node in other paths is selected to carry out data forwarding,
In, in the node standby stage in each period, by way of setting weight, the maximum cluster node of weight is selected in each cluster
As backup node, after leader cluster node death, leader cluster node is replaced to carry out data convergence and forwarding by backup leader cluster node.
8. the failover backup method of the route planning method of transmission line of electricity wireless sensor network according to claim 7,
It is characterized in that selecting the maximum cluster node of weight as backup node, leader cluster node in each cluster after sensor network sub-clustering
Routing table is sent to backup leader cluster node, and the routing table of update is sent to backup cluster head section after updating routing table every time
The weight equation of point, node is as follows:
Wherein, w is specific gravity shared by node energy, Eave-remainFor the average residual energy of cluster interior nodes, daveFor cluster interior nodes
With the average distance of other nodes,For the average of all node average distances, it is expressed as follows:
λ is cluster interior nodes number, dijFor the distance between node i and node j；
When leader cluster node death, then former leader cluster node is substituted by backup leader cluster node, remaining node transfers data to standby in cluster
Part leader cluster node, meanwhile, backup leader cluster node receives the data of other leader cluster nodes forwarding and carries out data forwarding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811609271.1A CN109547966B (en) | 2018-12-27 | 2018-12-27 | Routing planning and fault diagnosis backup method for wireless sensor network of power transmission line |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811609271.1A CN109547966B (en) | 2018-12-27 | 2018-12-27 | Routing planning and fault diagnosis backup method for wireless sensor network of power transmission line |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109547966A true CN109547966A (en) | 2019-03-29 |
| CN109547966B CN109547966B (en) | 2021-12-17 |
Family
ID=65858127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811609271.1A Active CN109547966B (en) | 2018-12-27 | 2018-12-27 | Routing planning and fault diagnosis backup method for wireless sensor network of power transmission line |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109547966B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110247791A (en) * | 2019-05-22 | 2019-09-17 | 北京英视睿达科技有限公司 | The environmental monitoring system and update method of work online updating free of discontinuities |
| CN110324875A (en) * | 2019-05-28 | 2019-10-11 | 西安空间无线电技术研究所 | A kind of wireless sensor network energy consumption balance method for routing based on node center |
| CN110611939A (en) * | 2019-08-20 | 2019-12-24 | 贵州电网有限责任公司 | Mesh structure-based intelligent transmission method for monitoring data of power distribution network |
| CN111365198A (en) * | 2020-03-10 | 2020-07-03 | 中国海洋大学 | Vibration monitoring method and system for offshore wind turbine generator |
| CN111917637A (en) * | 2019-05-09 | 2020-11-10 | 华为技术有限公司 | Data message sending method and device |
| CN111935001A (en) * | 2019-05-13 | 2020-11-13 | 华为技术有限公司 | Path switching method, node and system |
| CN111954306A (en) * | 2020-07-08 | 2020-11-17 | 北京瀚诺半导体科技有限公司 | Hybrid transmission method and system based on time slot and packet scheduling |
| CN112491526A (en) * | 2020-11-28 | 2021-03-12 | 深圳前海数字贸易科技服务有限公司 | Special supervision area service monitoring and management method and system |
| CN112714154A (en) * | 2020-12-11 | 2021-04-27 | 国网宁夏电力有限公司吴忠供电公司 | Routing control method and system for intelligent sensor for power grid monitoring |
| WO2021143239A1 (en) * | 2020-01-13 | 2021-07-22 | 腾讯科技（深圳）有限公司 | Routing control method and apparatus, electronic device, and storage medium |
| CN113573392A (en) * | 2021-07-13 | 2021-10-29 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN114189874A (en) * | 2021-12-13 | 2022-03-15 | 国家电网有限公司 | 5G-based power transmission line online monitoring system network construction method |
| CN114286414A (en) * | 2021-12-24 | 2022-04-05 | 北京邮电大学 | Energy-saving routing strategy design method capable of providing differentiated services |
| CN115396906A (en) * | 2022-07-28 | 2022-11-25 | 国网内蒙古东部电力有限公司信息通信分公司 | Power transmission line MEC service deployment method based on renewable energy |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140355628A1 (en) * | 2013-06-03 | 2014-12-04 | King Abdulaziz City For Science And Technology | Recursive time synchronization protocol method for wireless sensor networks |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105898764A (en) * | 2016-05-30 | 2016-08-24 | 四川大学 | Multi-stage energy heterogeneous wireless sensor network deployment method |
| US9491060B1 (en) * | 2014-06-30 | 2016-11-08 | EMC IP Holding Company LLC | Integrated wireless sensor network (WSN) and massively parallel processing database management system (MPP DBMS) |
| CN106358214A (en) * | 2016-09-26 | 2017-01-25 | 重庆三峡学院 | Wireless sensor network immunity clustering coverage optimization method |
| CN107580355A (en) * | 2017-08-22 | 2018-01-12 | 西安科技大学 | The location-based uniformly sub-clustering hierarchical routing algorithm of wireless sensor network |
| CN109041127A (en) * | 2018-09-26 | 2018-12-18 | 北航（四川）西部国际创新港科技有限公司 | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network |
-
2018
- 2018-12-27 CN CN201811609271.1A patent/CN109547966B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140355628A1 (en) * | 2013-06-03 | 2014-12-04 | King Abdulaziz City For Science And Technology | Recursive time synchronization protocol method for wireless sensor networks |
| US9491060B1 (en) * | 2014-06-30 | 2016-11-08 | EMC IP Holding Company LLC | Integrated wireless sensor network (WSN) and massively parallel processing database management system (MPP DBMS) |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105898764A (en) * | 2016-05-30 | 2016-08-24 | 四川大学 | Multi-stage energy heterogeneous wireless sensor network deployment method |
| CN106358214A (en) * | 2016-09-26 | 2017-01-25 | 重庆三峡学院 | Wireless sensor network immunity clustering coverage optimization method |
| CN107580355A (en) * | 2017-08-22 | 2018-01-12 | 西安科技大学 | The location-based uniformly sub-clustering hierarchical routing algorithm of wireless sensor network |
| CN109041127A (en) * | 2018-09-26 | 2018-12-18 | 北航（四川）西部国际创新港科技有限公司 | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network |
Non-Patent Citations (2)
| Title |
|---|
| CHUANYAO NIE; HUI WU; WENGUANG ZHENG: "Latency and Lifetime-Aware Clustering and Routing in Wireless Sensor Networks", 《2016 IEEE 41ST CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN)》 * |
| 渠帅军: "智能配电网中无线传感器网络路由协议的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111917637A (en) * | 2019-05-09 | 2020-11-10 | 华为技术有限公司 | Data message sending method and device |
| CN111917637B (en) * | 2019-05-09 | 2022-05-17 | 华为技术有限公司 | Data message sending method and device |
| CN111935001A (en) * | 2019-05-13 | 2020-11-13 | 华为技术有限公司 | Path switching method, node and system |
| CN110247791A (en) * | 2019-05-22 | 2019-09-17 | 北京英视睿达科技有限公司 | The environmental monitoring system and update method of work online updating free of discontinuities |
| CN110247791B (en) * | 2019-05-22 | 2022-04-01 | 北京英视睿达科技股份有限公司 | Environment monitoring system and updating method for continuous work online updating |
| CN110324875A (en) * | 2019-05-28 | 2019-10-11 | 西安空间无线电技术研究所 | A kind of wireless sensor network energy consumption balance method for routing based on node center |
| CN110611939A (en) * | 2019-08-20 | 2019-12-24 | 贵州电网有限责任公司 | Mesh structure-based intelligent transmission method for monitoring data of power distribution network |
| CN110611939B (en) * | 2019-08-20 | 2023-09-26 | 贵州电网有限责任公司 | Intelligent transmission method for monitoring data of power distribution network based on mesh structure |
| WO2021143239A1 (en) * | 2020-01-13 | 2021-07-22 | 腾讯科技（深圳）有限公司 | Routing control method and apparatus, electronic device, and storage medium |
| CN111365198A (en) * | 2020-03-10 | 2020-07-03 | 中国海洋大学 | Vibration monitoring method and system for offshore wind turbine generator |
| CN111954306A (en) * | 2020-07-08 | 2020-11-17 | 北京瀚诺半导体科技有限公司 | Hybrid transmission method and system based on time slot and packet scheduling |
| CN111954306B (en) * | 2020-07-08 | 2024-02-27 | 北京瀚诺半导体科技有限公司 | Hybrid transmission method and system based on time slot and packet scheduling |
| CN112491526A (en) * | 2020-11-28 | 2021-03-12 | 深圳前海数字贸易科技服务有限公司 | Special supervision area service monitoring and management method and system |
| CN112491526B (en) * | 2020-11-28 | 2021-07-30 | 深圳前海数字贸易科技服务有限公司 | Special supervision area service monitoring and management method and system |
| CN112714154A (en) * | 2020-12-11 | 2021-04-27 | 国网宁夏电力有限公司吴忠供电公司 | Routing control method and system for intelligent sensor for power grid monitoring |
| CN112714154B (en) * | 2020-12-11 | 2023-01-10 | 国网宁夏电力有限公司吴忠供电公司 | Routing control method and system for intelligent sensor for power grid monitoring |
| CN113573392B (en) * | 2021-07-13 | 2022-11-22 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN113573392A (en) * | 2021-07-13 | 2021-10-29 | 电子科技大学中山学院 | Energy-saving communication method under abnormal state of gateway of Internet of things |
| CN114189874A (en) * | 2021-12-13 | 2022-03-15 | 国家电网有限公司 | 5G-based power transmission line online monitoring system network construction method |
| CN114189874B (en) * | 2021-12-13 | 2024-04-16 | 国家电网有限公司 | 5G-based network construction method for power transmission line online monitoring system |
| CN114286414A (en) * | 2021-12-24 | 2022-04-05 | 北京邮电大学 | Energy-saving routing strategy design method capable of providing differentiated services |
| CN115396906A (en) * | 2022-07-28 | 2022-11-25 | 国网内蒙古东部电力有限公司信息通信分公司 | Power transmission line MEC service deployment method based on renewable energy |
| CN115396906B (en) * | 2022-07-28 | 2024-01-23 | 国网内蒙古东部电力有限公司信息通信分公司 | Transmission line MEC service deployment method based on renewable energy sources |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109547966B (en) | 2021-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547966A (en) | The route planning and fault diagnosis backup method of transmission line of electricity wireless sensor network | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| Menaria et al. | NLFFT: A novel fault tolerance model using artificial intelligence to improve performance in wireless sensor networks | |
| CN103929782B (en) | A kind of resources balance multi-path route method suitable for industrial wireless sensor network | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| CN109547965A (en) | A kind of wireless sensor network paths planning method based on service priority | |
| Cheng et al. | Path geo-diversification: Design and analysis | |
| Ahamad et al. | Inspecting and finding faults in railway tracks using wireless sensor networks | |
| CN114050858B (en) | Double-layer hierarchical giant constellation fault management and response method | |
| Manikannu et al. | A survey of energy efficient routing and optimization techniques in wireless sensor networks | |
| CN115442275B (en) | Hybrid telemetry method and system based on hierarchical trusted streams | |
| Kshirsagar et al. | A fault tolerant approach to extend network life time of wireless sensor network | |
| Huang et al. | LCD: light‐weight control model for data plane in software‐defined wireless sensor networks | |
| Al-Hadhrami et al. | Power aware routing algorithms (PARA) in wireless mesh networks for emergency management | |
| CN113225215B (en) | Method and system for identifying differentiated service network key link under SDN architecture | |
| Sethi et al. | A multi-agent hybrid protocol for data fusion and data aggregation in non-deterministic wireless sensor networks | |
| Komalan et al. | A survey on cluster based routing, data aggregation and fault detection techniques for locating real time faults in modern metro train tracks using wireless sensor network | |
| Saqaeeyan et al. | IEATH: Improved energy aware and two hop multipath routing protocol in wireless sensor networks | |
| Argoubi et al. | Deep: Delay and energy efficient proactive routing protocol for event-driven wsns | |
| Zhang et al. | Grouping-based clustering routing protocol in wireless sensor networks | |
| Khan et al. | Event based data gathering in wireless sensor networks | |
| Li et al. | A MANET accessing Internet routing algorithm based on dynamic gateway adaptive selection | |
| Sridevi et al. | An efficient caching mechanism with optimized economic utility-aware enhanced reliable opportunistic routing protocol for enhancement on storage space utilization in MANETs | |
| Khodabandeh et al. | Scalable Cluster-Based Path Planning for Timely Data Gathering in Wireless Sensor Networks |
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 |