CN108770036B - Inter-cluster-head communication method and wireless sensor network routing device - Google Patents
Inter-cluster-head communication method and wireless sensor network routing device Download PDFInfo
- Publication number
- CN108770036B CN108770036B CN201810635516.1A CN201810635516A CN108770036B CN 108770036 B CN108770036 B CN 108770036B CN 201810635516 A CN201810635516 A CN 201810635516A CN 108770036 B CN108770036 B CN 108770036B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster head
- cluster
- nodes
- energy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 35
- 238000000034 method Methods 0.000 title claims abstract description 26
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 195
- 238000005265 energy consumption Methods 0.000 claims abstract description 12
- 230000008901 benefit Effects 0.000 claims description 16
- 230000007958 sleep Effects 0.000 claims description 6
- 230000004927 fusion Effects 0.000 claims description 3
- 230000005059 dormancy Effects 0.000 claims 2
- 230000004083 survival effect Effects 0.000 abstract description 6
- 230000002035 prolonged effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a communication method between cluster heads and a wireless sensor network routing device, wherein the method comprises the steps of calculating the optimal cluster head number in a wireless sensor network; under the condition that the optimal cluster head number is unchanged, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads; when each cluster head node sends data to a sink node, virtual connection is established with all cluster head nodes at the downstream of the cluster head node according to a routing table, and the selected probability value of all cluster head nodes at the downstream of the cluster head node is calculated; selecting the cluster head with the maximum probability value as a next hop cluster head; and establishing communication paths among all cluster heads in the wireless sensor network. The technical scheme of the inter-cluster-head communication method and the routing device of the wireless sensor network can ensure the balanced energy consumption in the wireless sensor network and prolong the survival time of the network while ensuring the network connectivity.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to an inter-cluster-head communication method and a wireless sensor network routing apparatus.
Background
At present, a Wireless Sensor Network (WSN) is a cross product of emerging subjects and traditional subjects, and it covers high and new technologies in various fields such as micro sensors, Wireless communication, low power consumption embedded, biology, and the like. It is an ad hoc network consisting of a large number of sensor nodes, which have limited energy, computing power, and storage capacity, and whose energy is not easily supplemented or replaced because they are often deployed in areas that are difficult for personnel to reach. Therefore, how to reduce the energy consumption of the nodes is directly related to the overall performance of the wireless sensor network on the basis of limited energy of the nodes.
The currently common methods for communication between nodes mainly include: a flooding communication method and a negotiation communication method. The flooding communication method does not need the process of path selection and maintenance, and can transmit data to the destination node at the fastest speed, but the broadcasting method greatly increases the energy consumption of the nodes in the network and reduces the survival time of the network. The negotiation communication method can ensure effective transmission of data and reduce energy consumption of nodes irrelevant to the data, but the adoption of the negotiation method can cause the phenomenon that the data is not needed by the adjacent nodes and needed by the remote nodes, so that the data cannot be normally transmitted to the target node.
Disclosure of Invention
The invention aims to solve at least one of the technical problems in the prior art, and provides an inter-cluster-head communication method and a wireless sensor network routing device, which can ensure the balanced energy consumption in a wireless sensor network and prolong the network survival time while ensuring the network connectivity.
To achieve the object of the present invention, there is provided an inter-cluster-head communication method including:
calculating the optimal cluster head number in the wireless sensor network;
under the condition that the optimal cluster head number is not changed, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
when each cluster head node sends data to a sink node, virtual connection is established with all cluster head nodes at the downstream of the cluster head node according to a routing table, and the selected probability value of all cluster head nodes at the downstream of the cluster head node is calculated;
selecting the cluster head with the maximum selected probability value as a next hop cluster head;
and establishing communication paths among all cluster heads in the wireless sensor network.
Optionally, under the condition that the optimal number of cluster heads is not changed, selecting a cluster head node according to the remaining energy of each node, and selecting a cluster with the remaining energy lower than a first predetermined value to join the node that does not become a cluster head, where the step includes:
judging whether the residual energy of each node is greater than an energy threshold value;
if so, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
and if not, calculating the average minimum energy consumption of each node, selecting cluster head nodes according to the minimum energy consumption, and selecting the cluster head nodes with the residual energy higher than a second preset value to join the nodes which do not become the cluster heads.
Optionally, if not, calculating an average minimum consumed energy of each node, and in the step of selecting a cluster head node according to the minimum consumed energy, and selecting a cluster with a remaining energy higher than a second predetermined value to join a node that does not become a cluster head, the average minimum consumed energy of each node satisfies the following formula:
wherein E isave_min(i)Minimum consumption energy of the ith node; ciThe centrality of the ith node in the wireless sensor network; m is the number of neighbor nodes of the ith node; minP (m) is the minimum power of the communication between the mth node and the ith node in the neighbor nodes of the ith node; i is 1,2, …, n, n is the number of nodes; m is 1,2, …, k, k is the number of neighbor nodes.
Optionally, in the step of establishing a virtual connection with all cluster head nodes downstream of the cluster head node according to a routing table and calculating a selected probability value of all cluster head nodes downstream of the cluster head node when each cluster head node sends data to a sink node, the selected probability value satisfies the following formula:
wherein,
selecting a probability value of a downstream cluster head node of the h-th layer of cluster head nodes; w (E)i) The energy benefit value of the ith node; w (T)i) Is the sleep benefit value of the ith node.
Optionally, the energy benefit value of the ith node satisfies the following formula:
wherein,
the current residual energy of the ith node;
is the initial energy of the ith node.
Optionally, the sleep benefit value of the ith node satisfies the following formula:
wherein τ is the operating time of each cycle of clustering; piProbability of becoming a cluster head for the ith node;
starting time of becoming cluster head for jth node;
the termination time of becoming a cluster head for the ith node for the jth time; round (i) is the number of cycle rounds that the ith node becomes a cluster head; i is 1,2, …, n, n is the number of nodes; j ═ 1,2, …, round (i)。
Optionally, in the step of calculating the optimal cluster head number in the wireless sensor network, the optimal cluster head number satisfies the following formula:
wherein a is the radius of a circular network area; n is the number of nodes; omega is the data fusion rate of the cluster head node sent by the node; eelecConsuming energy for transmit/receive units;
the distance between the cluster head node and the sink node.
As another technical solution, the present invention further provides a wireless sensor network routing apparatus, including:
the computing module is used for computing the optimal cluster head number in the wireless sensor network;
the election module is used for electing cluster head nodes according to the residual energy of each node under the condition that the optimal cluster head number is unchanged, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
the connection calculation module is used for establishing virtual connection with all cluster head nodes at the downstream of the cluster head node according to a routing table when each cluster head node sends data to the sink node, and calculating the selected probability value of all cluster head nodes at the downstream of the cluster head node;
the forwarding module is used for selecting the cluster head with the maximum selected probability value as a next hop cluster head;
and the establishing module is used for establishing communication paths among all cluster heads in the wireless sensor network.
Optionally, the election module includes a judgment unit, a calculation unit and an election unit, wherein,
the judging unit is used for judging whether the residual energy of each node is larger than an energy threshold value;
if so, the election unit is used for electing the cluster head nodes according to the residual energy of each node, and enabling the nodes which do not become the cluster heads to select the clusters with the residual energy lower than a first preset value to join;
if not, the calculation unit is used for calculating the average minimum consumption energy of each node;
the selection unit is used for selecting cluster head nodes according to the minimum consumed energy, and the nodes which do not become cluster heads select clusters with residual energy higher than a second preset value to join.
The invention has the following beneficial effects:
according to the inter-cluster-head communication method and the technical scheme of the wireless sensor network routing device, the optimal cluster head number in the wireless sensor network is calculated, the cluster head nodes are selected according to the residual energy of each node, the selected probability value of all cluster head nodes on the downstream of the cluster head nodes is calculated, the cluster head with the maximum selected probability value is selected to serve as the next hop cluster head, and all inter-cluster-head communication paths in the wireless sensor network are established. Therefore, the energy balance consumption in the wireless sensor network can be ensured while the network connectivity is ensured, and the network survival time is prolonged.
Drawings
Fig. 1 is a flowchart of a method for inter-cluster-head communication according to an embodiment of the present invention;
fig. 2 is a schematic block diagram of a routing apparatus of a wireless sensor network according to an embodiment of the present invention;
FIG. 3 is a functional block diagram of an election module employed in embodiments of the present invention.
Detailed Description
In order to make those skilled in the art better understand the technical solution of the present invention, the inter-cluster-head communication method and the wireless sensor network routing apparatus provided by the present invention are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, a method for communication between cluster heads according to an embodiment of the present invention includes:
Optionally, the optimal cluster head number satisfies the following formula:
wherein a is the radius of a circular network area; n is the number of nodes; omega is the data fusion rate of the cluster head node sent by the node; eelecConsuming energy for transmit/receive units;
the distance between the cluster head node and the sink node.
And 102, under the condition that the optimal cluster head number is not changed, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads.
The step 102 further includes:
judging whether the residual energy of each node is greater than an energy threshold value;
if so, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
and if not, calculating the average minimum energy consumption of each node, selecting cluster head nodes according to the minimum energy consumption, and selecting the cluster head nodes with the residual energy higher than a second preset value to join the nodes which do not become the cluster heads.
That is, a cluster head node is elected with the remaining energy of each node as a main parameter, but when the remaining energy of each node is low, a cluster head node may be elected with the average minimum consumed energy of each node as a main parameter. Therefore, cluster head nodes can be selected more reasonably, and energy balanced consumption in the wireless sensor network can be further guaranteed.
The first predetermined value may be determined according to specific situations, as long as a node that does not become a cluster head can select a cluster with lower remaining energy to join.
Optionally, the average minimum consumed energy of each node satisfies the following formula:
wherein E isave_min(i)Minimum consumption energy of the ith node; ciThe centrality of the ith node in the wireless sensor network is defined; m is the number of neighbor nodes of the ith node; minP (m) is the minimum power of the communication between the mth node and the ith node in the neighbor nodes of the ith node; i is 1,2, …, n, n is the number of nodes; m is 1,2, …, k, k is the number of neighbor nodes.
103, when each cluster head node sends data to the sink node, establishing virtual connection with all cluster head nodes at the downstream of the cluster head node according to the routing table, and calculating the selected probability value of all cluster head nodes at the downstream of the cluster head node.
The sink node is used for receiving the data sent by the cluster head node and sending the data to the external network.
Optionally, the selected probability value satisfies the following formula:
wherein,
selecting a probability value of a downstream cluster head node of the h-th layer of cluster head nodes; w (E)i) The energy benefit value of the ith node; w (T)i) Is the sleep benefit value of the ith node.
Optionally, the energy benefit value of the ith node satisfies the following formula:
wherein,
the current residual energy of the ith node;
is the initial energy of the ith node.
Optionally, the sleep benefit value of the ith node satisfies the following formula:
wherein τ is the operating time of each cycle of clustering; piProbability of becoming a cluster head for the ith node;
starting time of becoming cluster head for jth node;
the termination time of becoming a cluster head for the ith node for the jth time; round (i) is the number of cycle rounds that the ith node becomes a cluster head; i is 1,2, …, n, n is the number of nodes; j ═ 1,2, …, round (i).
And 104, selecting the cluster head with the maximum selected probability value as the next hop forwarding cluster head.
And 105, establishing communication paths among all cluster heads in the wireless sensor network.
According to the inter-cluster-head communication method provided by the embodiment of the invention, the optimal cluster head number in the wireless sensor network is calculated, the cluster head nodes are elected according to the residual energy of each node, the selected probability value of all cluster head nodes at the downstream of the cluster head nodes is calculated, the cluster head with the maximum selected probability value is selected to be used as the next hop cluster head, and all inter-cluster-head communication paths in the wireless sensor network are established. Therefore, the energy balance consumption in the wireless sensor network can be ensured while the network connectivity is ensured, and the network survival time is prolonged.
As another technical solution, please refer to fig. 2, an embodiment of the present invention further provides a wireless sensor network routing apparatus, including:
the calculating module 1 is used for calculating the optimal cluster head number in the wireless sensor network;
an election module 2, configured to elect a cluster head node according to the remaining energy of each node under the condition that the optimal cluster head number is not changed, and a node that does not become a cluster head selects a cluster whose remaining energy is lower than a first predetermined value to join;
the connection calculation module 3 is configured to establish a virtual connection with all cluster head nodes downstream of each cluster head node according to the routing table when each cluster head node sends data to the sink node, and calculate a selected probability value between each cluster head node and all cluster head nodes downstream of the cluster head node;
the forwarding module 4 is used for selecting the cluster head with the maximum probability value as a next hop cluster head;
and the establishing module 5 is used for establishing communication paths among all cluster heads in the wireless sensor network.
Optionally, referring to fig. 3, the election module 2 includes a determining unit 21, a calculating unit 22, and an election unit 23, where the determining unit 21 is configured to determine whether the remaining energy of each node is greater than an energy threshold;
if yes, the election unit 23 is configured to elect a cluster head node according to the remaining energy of each node, and enable a node that does not become a cluster head to select a cluster with remaining energy lower than a first predetermined value to join;
if not, the calculating unit 22 is configured to calculate an average minimum consumed energy of each node; the election unit 23 is configured to elect a cluster head node according to the minimum consumed energy, and a node that does not become a cluster head selects a cluster with a remaining energy higher than a second predetermined value to join.
That is, a cluster head node is elected with the remaining energy of each node as a main parameter, but when the remaining energy of each node is low, a cluster head node may be elected with the average minimum consumed energy of each node as a main parameter. Therefore, cluster head nodes can be selected more reasonably, and energy balanced consumption in the wireless sensor network can be further ensured
The routing device of the wireless sensor network provided by the embodiment of the invention calculates the optimal cluster head number in the wireless sensor network, elects the cluster head nodes according to the residual energy of each node, calculates the selected probability value of all cluster head nodes at the downstream of the cluster head node, selects the cluster head with the maximum selected probability value as the next hop cluster head, and establishes the communication paths among all cluster heads in the wireless sensor network. Therefore, the energy balance consumption in the wireless sensor network can be ensured while the network connectivity is ensured, and the network survival time is prolonged.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.
Claims (4)
1. An inter-cluster-head communication method, comprising:
calculating the optimal cluster head number in the wireless sensor network;
under the condition that the optimal cluster head number is not changed, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
when each cluster head node sends data to a sink node, virtual connection is established with all cluster head nodes at the downstream of the cluster head node according to a routing table, and the selected probability value of all cluster head nodes at the downstream of the cluster head node is calculated; the selected probability value satisfies the following formula:
wherein,
selecting a probability value of a downstream cluster head node of the h-th layer of cluster head nodes; w (E)i) The energy benefit value of the ith node; w (T)i) The dormancy benefit value of the ith node;
selecting the cluster head with the maximum selected probability value as a next hop cluster head;
establishing communication paths among all cluster heads in a wireless sensor network;
under the condition that the optimal cluster head number is not changed, selecting cluster head nodes according to the residual energy of each node, wherein the nodes which do not become cluster heads select clusters with the residual energy lower than a first preset value to join, and the method comprises the following steps:
judging whether the residual energy of each node is greater than an energy threshold value;
if so, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
if not, calculating the average minimum consumption energy of each node, selecting cluster head nodes according to the minimum consumption energy, and selecting the cluster heads of the nodes which do not become the cluster heads to join with the nodes of which the residual energy is higher than a second preset value;
the energy benefit value of the ith node satisfies the following formula:
wherein,
the current residual energy of the ith node;
initial energy of the ith node;
the sleep benefit value of the ith node satisfies the following formula:
wherein τ is the operating time of each cycle of clustering; piProbability of becoming a cluster head for the ith node;
starting time of becoming cluster head for jth node;
the termination time of becoming a cluster head for the ith node for the jth time; round (i) is the number of cycle rounds that the ith node becomes a cluster head; i is 1,2, …, n, n is the number of nodes; j ═ 1,2, …, round (i).
2. The inter-cluster-head communication method according to claim 1, wherein in the step of calculating the average minimum energy consumption of each node if no, and selecting cluster head nodes according to the minimum energy consumption, and selecting clusters with the remaining energy higher than a second predetermined value from nodes that do not become cluster heads, the average minimum energy consumption of each node satisfies the following formula:
wherein E isave_min(i)Minimum consumption energy of the ith node; ciThe centrality of the ith node in the wireless sensor network; m is the number of neighbor nodes of the ith node; min P (m) is the minimum power of communication between the mth node and the ith node in the neighbor nodes of the ith node; i is 1,2, …, n, n is the number of nodes; m is 1,2, …, k, k is the number of neighbor nodes.
3. The inter-cluster-head communication method according to claim 1, wherein in the step of calculating the optimal cluster head number in the wireless sensor network, the optimal cluster head number satisfies the following formula:
wherein a is the radius of a circular network area; n is the number of nodes; omega is the data fusion rate of the cluster head node sent by the node; eelecConsuming energy for transmit/receive units;
the distance between the cluster head node and the sink node.
4. A wireless sensor network routing device, comprising:
the computing module is used for computing the optimal cluster head number in the wireless sensor network;
the election module is used for electing cluster head nodes according to the residual energy of each node under the condition that the optimal cluster head number is unchanged, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads; under the condition that the optimal cluster head number is not changed, selecting cluster head nodes according to the residual energy of each node, wherein the nodes which do not become cluster heads select clusters with the residual energy lower than a first preset value to join, and the method comprises the following steps:
judging whether the residual energy of each node is greater than an energy threshold value;
if so, selecting cluster head nodes according to the residual energy of each node, and selecting the cluster with the residual energy lower than a first preset value to join the nodes which do not become the cluster heads;
if not, calculating the average minimum consumption energy of each node, selecting cluster head nodes according to the minimum consumption energy, and selecting the cluster heads of the nodes which do not become the cluster heads to join with the nodes of which the residual energy is higher than a second preset value;
the connection calculation module is used for establishing virtual connection with all cluster head nodes at the downstream of the cluster head node according to a routing table when each cluster head node sends data to the sink node, and calculating the selected probability value of all cluster head nodes at the downstream of the cluster head node; the selected probability value satisfies the following formula:
wherein,
selecting a probability value of a downstream cluster head node of the h-th layer of cluster head nodes; w (E)i) The energy benefit value of the ith node; w (T)i) The dormancy benefit value of the ith node;
the forwarding module is used for selecting the cluster head with the maximum selected probability value as a next hop cluster head;
the establishing module is used for establishing communication paths among all cluster heads in the wireless sensor network;
the energy benefit value of the ith node satisfies the following formula:
wherein,
the current residual energy of the ith node;
initial energy of the ith node;
the sleep benefit value of the ith node satisfies the following formula:
wherein τ is the operating time of each cycle of clustering; piProbability of becoming a cluster head for the ith node;
starting time of becoming cluster head for jth node;
the termination time of becoming a cluster head for the ith node for the jth time; round (i) is the number of cycle rounds that the ith node becomes a cluster head; i is 1,2, …, n is nodeThe number of (2); j ═ 1,2, …, round (i).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810635516.1A CN108770036B (en) | 2018-06-20 | 2018-06-20 | Inter-cluster-head communication method and wireless sensor network routing device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810635516.1A CN108770036B (en) | 2018-06-20 | 2018-06-20 | Inter-cluster-head communication method and wireless sensor network routing device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108770036A CN108770036A (en) | 2018-11-06 |
| CN108770036B true CN108770036B (en) | 2020-10-02 |
Family
ID=63979086
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810635516.1A Active CN108770036B (en) | 2018-06-20 | 2018-06-20 | Inter-cluster-head communication method and wireless sensor network routing device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108770036B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109598915A (en) * | 2018-11-23 | 2019-04-09 | 山东东山新驿煤矿有限公司 | A kind of intelligent monitor system of coal water content |
| CN109510763B (en) * | 2019-01-03 | 2021-03-19 | 中国联合网络通信集团有限公司 | Node cluster head election method and system |
| CN109688557B (en) * | 2019-02-21 | 2020-10-23 | 中国联合网络通信集团有限公司 | Cooperative node selection method and device |
| CN109600812B (en) * | 2019-02-21 | 2021-06-29 | 中国联合网络通信集团有限公司 | Routing method, routing device and sensor |
| CN109729498B (en) * | 2019-02-27 | 2021-10-22 | 重庆邮电大学 | Target tracking method and system based on Voronoi diagram adaptive node selection |
| CN109890062A (en) * | 2019-03-12 | 2019-06-14 | 中国联合网络通信集团有限公司 | System adaptive recognition method, device and equipment, computer readable storage medium |
| CN109963317A (en) * | 2019-05-14 | 2019-07-02 | 中国联合网络通信集团有限公司 | A kind of election of cluster head method, apparatus |
| CN111010710B (en) * | 2019-12-14 | 2023-06-02 | 贵州电网有限责任公司 | Sensor network transmission method based on load balancing in power equipment communication |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102905336A (en) * | 2012-09-10 | 2013-01-30 | 中国科学院信息工程研究所 | Routing method and system |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| CN105072661A (en) * | 2015-07-15 | 2015-11-18 | 国家电网公司 | Clustering multi-hop routing protocol of wireless sensor network |
| WO2016095692A1 (en) * | 2014-12-15 | 2016-06-23 | 江南大学 | Method for improving ant colony optimization sensor-network cluster head |
| CN105848241A (en) * | 2016-03-21 | 2016-08-10 | 广州供电局有限公司 | Clustering method and system of mobile ad hoc network |
| CN107529201A (en) * | 2017-08-29 | 2017-12-29 | 武汉中原电子信息有限公司 | A kind of wireless sensor network data transmission method based on LEACH agreements |
-
2018
- 2018-06-20 CN CN201810635516.1A patent/CN108770036B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102905336A (en) * | 2012-09-10 | 2013-01-30 | 中国科学院信息工程研究所 | Routing method and system |
| CN103533595A (en) * | 2013-10-28 | 2014-01-22 | 天津工业大学 | Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks |
| WO2016095692A1 (en) * | 2014-12-15 | 2016-06-23 | 江南大学 | Method for improving ant colony optimization sensor-network cluster head |
| CN105072661A (en) * | 2015-07-15 | 2015-11-18 | 国家电网公司 | Clustering multi-hop routing protocol of wireless sensor network |
| CN105848241A (en) * | 2016-03-21 | 2016-08-10 | 广州供电局有限公司 | Clustering method and system of mobile ad hoc network |
| CN107529201A (en) * | 2017-08-29 | 2017-12-29 | 武汉中原电子信息有限公司 | A kind of wireless sensor network data transmission method based on LEACH agreements |
Non-Patent Citations (3)
| Title |
|---|
| Enhanced passive clustering based on distance and residual energy for wireless sensor network;Abderrahim Maizate;《IEEE》;20131003;全文 * |
| 基于LEACH协议的无线传感器网络分簇算法研究;王爱美;《CNKI》;20140228;全文 * |
| 无线传感器网络中能耗均衡的路由协议研究;李博;《CNKI》;20160531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108770036A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108770036B (en) | Inter-cluster-head communication method and wireless sensor network routing device | |
| Ahmed et al. | Sleep-awake energy efficient distributed clustering algorithm for wireless sensor networks | |
| Tanwar et al. | A systematic review on heterogeneous routing protocols for wireless sensor network | |
| Prasanth et al. | Implementation of efficient intra-and inter-zone routing for extending network consistency in wireless sensor networks | |
| Sharma et al. | MSGR: A mode-switched grid-based sustainable routing protocol for wireless sensor networks | |
| Tao et al. | Flow-balanced routing for multi-hop clustered wireless sensor networks | |
| Khan et al. | Dual head clustering scheme in wireless sensor networks | |
| Ranjani et al. | Energy-efficient cluster based data aggregation for wireless sensor networks | |
| KR101615352B1 (en) | Energy-based data trasmission method for wireless sensor networks | |
| Liu et al. | A mixed transmission strategy to achieve energy balancing in wireless sensor networks | |
| CN106413031A (en) | Self-adaptive clustering algorithm for heterogeneous network based on node level | |
| Yuan et al. | Congestion control for wireless sensor networks: A survey | |
| Bo et al. | An energy aware routing algorithm for software defined wireless sensor networks | |
| Han et al. | Joint wireless and optical power states scheduling for green multi-radio fiber-wireless access network | |
| Miah et al. | Performance analysis of ILEACH and LEACH protocols for wireless sensor networks | |
| Mishra et al. | Power aware routing in mobile ad hoc networks-a survey | |
| SB et al. | Sector based multi-hop clustering protocol for wireless sensor networks | |
| Patra et al. | Energy efficient hybrid multihop clustering algorithm in wireless sensor networks | |
| Prasad et al. | A qoi based energy efficient clustering for dense wireless sensor network | |
| Nisha et al. | An energy efficient self organizing multicast routing protocol for internet of things | |
| Bansal et al. | FTEP: A fault tolerant election protocol for multi-level clustering in homogeneous wireless sensor networks | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks | |
| CN111031506B (en) | Wireless sensor network clustering method based on Voronoi domain processing | |
| Sujithra et al. | Genetic algorithm based energy efficient data gathering in wireless sensor networks | |
| Bhattacharjee et al. | A dynamic energy efficient multi hop routing technique using energy aware clustering in wireless sensor network |
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 |