CN109819494B - Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method - Google Patents

Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method Download PDF

Info

Publication number
CN109819494B
CN109819494B CN201910172818.4A CN201910172818A CN109819494B CN 109819494 B CN109819494 B CN 109819494B CN 201910172818 A CN201910172818 A CN 201910172818A CN 109819494 B CN109819494 B CN 109819494B
Authority
CN
China
Prior art keywords
node
cluster head
nodes
sink
candidate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910172818.4A
Other languages
Chinese (zh)
Other versions
CN109819494A (en
Inventor
毛科技
汪敏豪
华子雯
徐瑞吉
杨志凯
周贤年
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201910172818.4A priority Critical patent/CN109819494B/en
Publication of CN109819494A publication Critical patent/CN109819494A/en
Application granted granted Critical
Publication of CN109819494B publication Critical patent/CN109819494B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

A WSN (wireless sensor network) hierarchical routing protocol implementation method with balanced energy consumption comprises the steps of establishing a neighbor node routing table for each sensor node by using a flooding method, selecting a cluster head node by using the shortest hop count of the node from a Sink node, constructing a network into a proper cluster based on a virtual force principle, carrying out multi-hop transmission on data of the cluster head node and the like. In the election of the cluster head candidate node and the calculation of the competition radius, the shortest hop count of the node from the Sink node is used as a measurement standard, so that the defect that the closer the distance is, the larger the energy consumption is made up; in the election of the cluster head, the factors such as the residual energy of the cluster head candidate node, the average link quality of the communication between the candidate node and the surrounding neighbor nodes, the number of the neighbor nodes and the like are fully considered; and selecting the next hop forwarding node by using the shortest hop count of the cluster head node from the Sink node, the residual energy of the cluster head node and the link quality of the cluster head node and the neighbor cluster head node as influence factors to design a reasonable cost forwarding function.

Description

Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method
Technical Field
The invention relates to a WSN (wireless sensor network) hierarchical routing protocol implementation method.
Background
With the rapid development and the increasing maturity of technologies such as sensors, Wireless communication, chip integration, electronic component manufacturing and the like, the development of a low-cost, low-power-consumption and multifunctional Wireless Sensor Network (WSN) is promoted. The wireless sensor network is a network formed by a large number of low-power-consumption wireless sensor nodes with computing capability, sensing capability, data processing capability and wireless communication capability, which are deployed in a monitored area. The purpose is to collect, process and transmit the information of the measured object in the monitoring area in real time.
The existing wireless sensor network routing protocol is mainly divided into a link type routing protocol and a hierarchical routing protocol, wherein the link type routing protocol takes a single sensor node as a unit and transmits data through multi-hop among the nodes, for example, Duhaitao et al propose a L E-AODV routing protocol, an optimal path is selected according to information such as link quality and node energy among the nodes, and a node state updating mechanism is utilized to avoid hot spots in the network, the link type routing protocol has the problem of difficulty in overcoming, for example, the node energy consumption of the node closer to a Sink node is faster, so the hierarchical routing protocol is widely researched, for example, compared with a classic L EACH protocol, the protocol can uniformly generate cluster heads through a node bootstrap method, then the network is clustered based on node residual energy, and the data of cluster member nodes are transmitted to the Sink node through the cluster heads or through the single hop after the cluster heads are fused.
The link type routing protocol and the hierarchical routing protocol both achieve good results, but the problem still exists that the energy consumption balance of the routing protocol, especially the two aspects of the energy consumption balance in the cluster and the energy consumption balance between cluster heads are not fully considered. The quality of the routing protocol has a significant influence on the energy consumption of the network, and the life cycle of the network is prolonged as much as possible under the condition of ensuring normal communication of the network.
Disclosure of Invention
The invention provides a method for realizing a WSN (wireless sensor network) level routing protocol with balanced energy consumption, which aims to overcome the defects in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows:
a method for realizing a WSN (wireless sensor network) hierarchical routing protocol with balanced energy consumption comprises the following steps:
step 1: establishing a neighbor node information table by a flooding method;
step 2: electing candidate nodes and calculating the competition radius of the candidate nodes according to the shortest hop number relation between the nodes and the Sink nodes, and selecting a cluster head node by combining multiple factors;
and step 3: constructing a network into a proper cluster based on a virtual force principle;
and 4, step 4: and the cluster head node performs multi-hop transmission of data on the premise of balanced energy consumption.
As a further optimization of the present invention, step 1 comprises:
11) the Sink node broadcasts a beacon frame b to other nodes in the network, wherein the b is (ID, Er, RSSI, &lTtTtranslation = L "&gTtL &lTt/T &gTtQI, Hmin) —, wherein the ID represents the identification of the beacon frame transmitting node, the Er represents the residual energy, the RSSI represents the signal strength received by the receiving node, L QI represents the link quality, and the Hmin represents the shortest hop count of the receiving node from the Sink node;
12) is a node niBuilding neighbor information table Ti，
Figure GDA0002476276080000021
Initializing Hmin to ∞, ni∈ N/Sink, N representing all nodes present in the current network whenever node NiReceiving b, storing b to TiJudging whether the shortest hop count from the Sink node is less than the current Hmin or not, if so, updating the current Hmin value, otherwise, not updating;
13) node niReorganizes the beacon frame b and broadcasts it out.
As a further optimization of the present invention, the step 2 is:
21) generating a random number R for all nodes N in the networki，0≤RiI is not less than 1, i is not less than 1 and not more than num, and num represents the number of nodes;
22) computing node niThreshold value T ofiWhere Hmax denotes in the sensor networkThe maximum value of the shortest hop count of all the nodes from the Sink node, Hmin represents the shortest hop count of the nodes from the Sink node, a1 is a constant, and the formula is as follows:
Figure GDA0002476276080000022
23) generating a cluster head candidate node list HX, HX ═ ni|Ri≤Ti,1≤i≤num}；
24) Computing node niRadius of competition of (Cr)iWherein R represents the radius of the circular deployment area, Hmax represents the maximum value of the shortest hop count from all nodes to the Sink node in the sensor network, Hmin represents the shortest hop count from the node to the Sink node, a2 is a constant, and the formula is as follows:
Figure GDA0002476276080000023
25) calculating cluster head candidate node hxiAt its competition radius CriWeighted value V of all other cluster head candidate nodesi，hxi∈ HX, i is more than or equal to 1 and less than or equal to n, n is CriThe number of other cluster head candidate nodes in the area is as follows:
Figure GDA0002476276080000031
wherein α + β + χ ═ 1, EiRepresenting the remaining energy of the cluster head candidate node, E0Representing the initial energy L QIi_avgRepresenting a candidate node niAverage link quality of communication with surrounding neighbor common nodes, as shown in equation 2-4; n is a radical ofiThe number of neighbor nodes; n is a radical ofavgIs a candidate node hxiThe average number of nodes within the competition radius is shown in equation 2-5.
Figure GDA0002476276080000032
Figure GDA0002476276080000033
26) Generating a cluster head node list CS, CS ═ { hxj|Vj＝MAX(Vj),1≤j≤n}。
As a further optimization of the present invention, the step 3 is:
31) the cluster head node broadcasts a data frame d, d is (ID, Ei, RSSI), wherein ID represents the identification of the broadcasting node, Ei represents the remaining energy, and RSSI represents the signal strength received by the receiving node;
32) is a node njConstruction of Cluster head node information Table Ij，
Figure GDA0002476276080000034
Whenever a common node njWhen data frame d is received, storing d to Ij；
33) Computing node njCluster head n adjacent theretoiVirtual force F betweeni,jIn which EiIndicating the remaining energy of the cluster head node, EjRepresenting the remaining energy, RSSI, of the common nodei,jIndicating a cluster head node niAnd a common node njThe formula is:
Figure GDA0002476276080000035
34) for any one common node nj，nj∈{ni|Fj＝MAX(Fi,j) I is more than or equal to 1 and less than or equal to n, j is more than or equal to 1 and less than or equal to m, and n is njThe number of adjacent cluster head nodes, and m is the number of common nodes.
As a further optimization of the present invention, the step 4 is:
41) calculating cluster head node niCluster head node n of next hopjCost value of forwarding data, where Hmin is node njShortest hop count from Sink node, EjRepresenting a node njL QIi,jIndicating a cluster head node ni、njThe formula of the link quality between the two is:
Figure GDA0002476276080000041
42) for any cluster head node niSelecting the next hop forwarding node nk，nk＝{nj|Cj＝MIN(Ci,j) J is more than or equal to 1 and less than or equal to n, and n is niThe number of adjacent cluster head nodes.
In fact, different sensor networks have different requirements on routing protocols, and the invention has the following provisions for higher versatility. The sensor nodes are uniformly deployed in the deployment area, and the communication radius of the sensor nodes is adjustable; all nodes except the Sink node in the sensor network are powered by batteries and have initial energy of E0And the Sink node adopts an active mode to supply power without considering the problem of energy consumption.
In the generation of the random numbers for all nodes in the network, it is considered that the probability that a node becomes a cluster head candidate node is lower when the shortest hop count of the node and a Sink node is larger, and the probability is higher otherwise.
In the election process of the cluster head candidate node, an empirical constant value is relied on, and the constant value is different with the scale of the wireless sensor network and different node deployment modes.
The invention has the following beneficial effects: aiming at the defects of the existing routing protocol, such as different node loads in the data transmission process, the situation that the whole function of the network is damaged due to the fact that the node with the overweight load dies in advance easily to cause the 'holes' of the network is caused, the invention solves the problem that the closer the node is to the Sink node, the larger the load forwarded by the node is by utilizing the difference of the cluster scale and the cluster density, and can effectively balance the energy consumption between cluster heads; and clustering by using a virtual force algorithm to realize energy consumption balance of nodes in the cluster. And finally, the energy consumption in the clusters and the energy consumption between cluster heads are comprehensively considered, so that the sensor network achieves better energy consumption balance.
Drawings
Fig. 1 is a diagram illustrating initialization of a neighbor information table according to the present invention.
FIG. 2 is a schematic diagram of a candidate node contention radius according to the present invention.
FIG. 3 is a schematic diagram of the virtual force between nodes according to the present invention.
Detailed Description
The technical solution of the present invention is further described below with reference to the accompanying drawings and embodiments.
A method for realizing a WSN (wireless sensor network) hierarchical routing protocol with balanced energy consumption comprises the following steps:
step 1, the Sink node broadcasts a beacon frame b to other nodes in the network, wherein b is (ID, Er, RSSI, &lTtTtranslation = L' &gTt L &lTt/T &gTt QI, Hmin), wherein ID represents the identification of a beacon frame transmitting node, Er represents the residual energy, RSSI represents the signal strength received by a receiving node, L QI represents the link quality, Hmin represents the shortest hop count of the receiving node from the Sink node, and n is the nodeiBuilding neighbor information table Ti，
Figure GDA0002476276080000051
Figure GDA0002476276080000052
Initializing Hmin to ∞, ni∈ N/Sink, N representing all nodes present in the current network whenever node NiReceiving b, storing b to TiJudging whether the shortest hop count from the Sink node is less than the current Hmin or not, if so, updating the current Hmin value, otherwise, not updating, as shown in FIG. 1; node niReorganizes the beacon frame b and broadcasts it out.
Step 2: generating a random number R for all nodes N in the networki，0≤RiI is not less than 1, i is not less than 1 and not more than num, and num represents the number of nodes; computing node niThreshold value T ofiWherein Hmax represents the maximum value of the shortest hop count of all nodes in the sensor network from the Sink node, Hmin represents the shortest hop count of the nodes from the Sink node, a1 is a constant, and the formula is as follows:
Figure GDA0002476276080000053
generating a cluster head candidate node list HX, HX ═ ni|Ri≤TiI is more than or equal to 1 and less than or equal to num }; computing node niRadius of competition of (Cr)iWherein R represents the radius of the circular deployment area, Hmax represents the maximum value of the shortest hop count from all nodes to the Sink node in the sensor network, Hmin represents the shortest hop count from the node to the Sink node, a2 is a constant, and the formula is as follows:
Figure GDA0002476276080000054
calculating cluster head candidate node hxiAt its competition radius CriWeighted value V of all other cluster head candidate nodesiHx as shown in FIG. 2i∈ HX, i is more than or equal to 1 and less than or equal to n, n is CriThe number of other cluster head candidate nodes in the area is as follows:
Figure GDA0002476276080000055
wherein α + β + χ ═ 1, EiRepresenting the remaining energy of the cluster head candidate node, E0Representing the initial energy L QIi_avgRepresenting a candidate node niAverage link quality of communication with surrounding neighbor common nodes; n is a radical ofiThe number of neighbor nodes; n is a radical ofavgIs a candidate node hxiThe average number of nodes within the competition radius relates to the formula:
Figure GDA0002476276080000056
Figure GDA0002476276080000061
generating a cluster head node list CS, CS ═ { hxj|Vj＝MAX(Vj),1≤j≤n}。
And step 3: the cluster head node broadcasts a data frame d, d is (ID, Ei, RSSI), wherein ID represents the identification of the broadcasting node, Ei represents the remaining energy, and RSSI represents the signal strength received by the receiving node; is a node njBuilding cluster head nodeInformation table Ij，
Figure GDA0002476276080000062
Whenever a common node njWhen data frame d is received, storing d to Ij(ii) a Computing node njCluster head n adjacent theretoiVirtual force F betweeni,jAs shown in FIG. 3, wherein EiIndicating the remaining energy of the cluster head node, EjRepresenting the remaining energy, RSSI, of the common nodei,jIndicating a cluster head node niAnd a common node njThe formula is:
Figure GDA0002476276080000063
for any one common node nj，nj∈{ni|Fj＝MAX(Fi,j) I is more than or equal to 1 and less than or equal to n, j is more than or equal to 1 and less than or equal to m, and n is njThe number of adjacent cluster head nodes, and m is the number of common nodes.
And 4, step 4: calculating cluster head node niCluster head node n of next hopjCost value of forwarding data, where Hmin is node njShortest hop count from Sink node, EjRepresenting a node njL QIi,jIndicating a cluster head node ni、njThe formula of the link quality between the two is:
Figure GDA0002476276080000064
for any cluster head node niSelecting the next hop forwarding node nk，nk＝{nj|Cj＝MIN(Ci,j) J is more than or equal to 1 and less than or equal to n, and n is niThe number of adjacent cluster head nodes.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions.

Claims (1)

1. A method for realizing a WSN (wireless sensor network) hierarchical routing protocol with balanced energy consumption comprises the following steps:
step 1: establishing a neighbor node information table by a flooding method; the method specifically comprises the following steps:
11) the Sink node broadcasts a beacon frame b to other nodes in the network, wherein the b is (ID, Er, RSSI, &lttTtranslation = L' &gttL &lttt/T &gttQI, Hmin), the ID represents the identification of a beacon frame transmitting node, the Er represents the residual energy, the RSSI represents the signal strength received by a receiving node, L QI represents the link quality, and the Hmin represents the shortest hop count of the receiving node from the Sink node;
12) is a node niBuilding neighbor information table Ti，
Figure FDA0002476276070000011
Initializing Hmin to ∞, ni∈ N/Sink, N representing all nodes present in the current network, whenever node NiReceiving b, storing b to TiJudging whether the shortest hop count from the Sink node is less than the current Hmin or not, if so, updating the current Hmin value, otherwise, not updating;
13) node niReorganizing the beacon frame b and broadcasting outwards;
step 2: electing candidate nodes and calculating the competition radius of the candidate nodes according to the shortest hop number relation between the nodes and the Sink nodes, and selecting a cluster head node by combining multiple factors; the method specifically comprises the following steps:
21) generating a random number R for all nodes N in the networki，0≤RiI is not less than 1, i is not less than 1 and not more than num, and num represents the number of nodes;
22) computing node niThreshold value T ofiWherein Hmax represents the maximum value of the shortest hop count of all nodes in the sensor network from the Sink node, Hmin represents the shortest hop count of the nodes from the Sink node, a1 is a constant,the formula is as follows:
Figure FDA0002476276070000012
23) generating a cluster head candidate node list HX, HX ═ ni|Ri≤Ti,1≤i≤num}；
24) Computing node niRadius of competition of (Cr)iWherein R represents the radius of the circular deployment area, Hmax represents the maximum value of the shortest hop count from all nodes to the Sink node in the sensor network, Hmin represents the shortest hop count from the node to the Sink node, a2 is a constant, and the formula is as follows:
Figure FDA0002476276070000013
25) calculating cluster head candidate node hxiAt its competition radius CriWeighted value V of all other cluster head candidate nodesi，hxi∈ HX, i is more than or equal to 1 and less than or equal to n, n is CriThe number of other cluster head candidate nodes in the area is as follows:
Figure FDA0002476276070000021
wherein α + β + χ ═ 1, EiRepresenting the remaining energy of the cluster head candidate node, E0Representing the initial energy L QIi_avgRepresenting a candidate node niAverage link quality of communication with surrounding neighbor common nodes, as shown in formula (3-4); n is a radical ofiThe number of neighbor nodes; n is a radical ofavgIs a candidate node hxiThe average number of nodes within the competition radius is shown as a formula (3-5);
Figure FDA0002476276070000022
Figure FDA0002476276070000023
26) generating a cluster head node list CS, CS ═ { hxj|Vj＝MAX(Vj),1≤j≤n}；
And step 3: constructing a network into a proper cluster based on a virtual force principle; the method specifically comprises the following steps:
31) the cluster head node broadcasts a data frame d, d is (ID, Ei, RSSI), wherein ID represents the identification of the broadcasting node, Ei represents the remaining energy, and RSSI represents the signal strength received by the receiving node;
32) is a node njConstruction of Cluster head node information Table Ij，
Figure FDA0002476276070000024
Whenever a common node njWhen data frame d is received, storing d to Ij；
33) Computing node njCluster head n adjacent theretoiVirtual force F betweeni,jIn which EiIndicating the remaining energy of the cluster head node, EjRepresenting the remaining energy, RSSI, of the common nodei,jIndicating a cluster head node niAnd a common node njThe formula is:
Figure FDA0002476276070000025
34) for any one common node nj，nj∈{ni|Fj＝MAX(Fi,j) I is more than or equal to 1 and less than or equal to n, j is more than or equal to 1 and less than or equal to m, and n is njThe number of adjacent cluster head nodes, and m is the number of common nodes;
and 4, step 4: the cluster head node performs multi-hop transmission of data on the premise of energy consumption balance; the method specifically comprises the following steps:
41) calculating cluster head node niCluster head node n of next hopjCost value of forwarding data, where Hmin is node njShortest hop count from Sink node, EjRepresenting a node njL QIi,jIndicating a cluster head node ni、njThe formula of the link quality between the two is:
Figure FDA0002476276070000031
42) for any cluster head node niSelecting the next hop forwarding node nk，nk＝{nj|Cj＝MIN(Ci,j) J is more than or equal to 1 and less than or equal to n, and n is niThe number of adjacent cluster head nodes.
CN201910172818.4A 2019-03-07 2019-03-07 Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method Active CN109819494B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910172818.4A CN109819494B (en) 2019-03-07 2019-03-07 Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910172818.4A CN109819494B (en) 2019-03-07 2019-03-07 Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method

Publications (2)

Publication Number Publication Date
CN109819494A CN109819494A (en) 2019-05-28
CN109819494B true CN109819494B (en) 2020-07-28

Family

ID=66608416

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910172818.4A Active CN109819494B (en) 2019-03-07 2019-03-07 Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method

Country Status (1)

Country Link
CN (1) CN109819494B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110113783B (en) * 2019-05-31 2021-10-01 中国科学技术大学 Method for realizing satellite network multi-hop routing of joint perception drive
CN112351468B (en) * 2020-11-05 2022-08-09 东方红卫星移动通信有限公司 Routing control method, node and system based on residual energy perception

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107371188A (en) * 2017-07-26 2017-11-21 浙江工业大学 A kind of energy consumption balance method for routing of controllable cluster scale
CN107995667A (en) * 2017-12-19 2018-05-04 浙江工业大学 A kind of energy consumption balance method for routing of controllable cluster scale

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160286476A1 (en) * 2015-03-26 2016-09-29 Qualcomm Incorporated Data link behavior for merger of wireless network clusters

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107371188A (en) * 2017-07-26 2017-11-21 浙江工业大学 A kind of energy consumption balance method for routing of controllable cluster scale
CN107995667A (en) * 2017-12-19 2018-05-04 浙江工业大学 A kind of energy consumption balance method for routing of controllable cluster scale

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种可控簇规模的能耗均衡路由协议的设计;应可珍，杨志凯，周贤年，毛科技，陈庆章;《传感技术学报》;20180331;全文 *
基于虚拟力的能耗均衡层次路由协议;金鑫，易晓梅，吴鹏;《传感技术学报》;20180228;全文 *

Also Published As

Publication number Publication date
CN109819494A (en) 2019-05-28

Similar Documents

Publication Publication Date Title
CN106792973B (en) Cluster head election and rotation method in energy heterogeneous wireless sensor network
Zhixiang et al. Three-layered routing protocol for WSN based on LEACH algorithm
CN108770036B (en) Inter-cluster-head communication method and wireless sensor network routing device
CN107371188B (en) Energy consumption balanced routing method capable of controlling cluster scale
CN109819494B (en) Energy consumption balanced WSN (wireless sensor network) hierarchical routing protocol implementation method
CN107995667A (en) A kind of energy consumption balance method for routing of controllable cluster scale
CN104135752A (en) Cluster head node selection method and clustering method of wireless sensor network
CN112822746A (en) Energy-efficient wireless sensor network clustering algorithm
Bo et al. An energy aware routing algorithm for software defined wireless sensor networks
Venkataramana et al. Efficient time reducing and energy saving routing algorithm for wireless sensor network
CN112218257A (en) Routing method of wireless sensor network monitoring system
CN113595903A (en) Wireless sensor network node dormancy scheduling method based on FCM (fuzzy c-means) clustering topology
Alnaham et al. Improving QoS in WSN based on an optimal path from source to sink node routing algorithm
CN110996371A (en) Clustering algorithm for prolonging life cycle of wireless sensor network
Hamad et al. An Improved Hybrid Stable Election Routing Protocol for Large Scale WSNs
Zeb et al. Location Centric Energy Harvesting Aware Routing Protocol for IoT in Smart Cities
CN111031506B (en) Wireless sensor network clustering method based on Voronoi domain processing
CN110087274B (en) Clustering method and device
Gayatri et al. An Improved Whale optimization Algorithm for Cross layer Neural Connection Network of MANET.
Chen et al. New approach of energy-efficient hierarchical clustering based on neighbor rotation for RWSN
CN111556548A (en) Heterogeneous clustering based multipath routing protocol in WBAN
Taibi et al. A hybrid approach to extend the life time of heterogeneous wireless sensor networks
Xiaoqin et al. An clustering routing Algorithm for Wireless Sensor Networks based on Density
Zhou et al. A Novel Wireless Sensor Network Data Aggregation Algorithm Based on Self-organizing Feature Mapping Neutral Network.
Li et al. Energy-aware data gathering and routing protocol based on double cluster-heads

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