CN108770036A - Communication means and wireless sensor network Routing Protocol between cluster head - Google Patents
Communication means and wireless sensor network Routing Protocol between cluster head Download PDFInfo
- Publication number
- CN108770036A CN108770036A CN201810635516.1A CN201810635516A CN108770036A CN 108770036 A CN108770036 A CN 108770036A CN 201810635516 A CN201810635516 A CN 201810635516A CN 108770036 A CN108770036 A CN 108770036A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- cluster head
- leader
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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
Abstract
Communication means and wireless sensor network Routing Protocol between a kind of cluster head of present invention offer, this method include the optimal cluster head number calculated in wireless sensor network；Under conditions of optimal cluster head number is constant, leader cluster node is elected according to the dump energy of each node, the node selection dump energy for not becoming cluster head is added less than the cluster of first predetermined value；When each leader cluster node is to-aggregation node transmission data, virtual link is established according to all leader cluster nodes in routing table and the leader cluster node downstream, and calculates and choose probability value with all leader cluster nodes in the leader cluster node downstream；It selects that the maximum cluster head of probability value is chosen to forward cluster head as next-hop；Establish in wireless sensor network communication path between all cluster heads.The technical solution of communication means and wireless sensor network Routing Protocol between cluster head provided by the invention can ensure even energy consumption in wireless sensor network while ensureing network connectivty, extend network lifetime.
Description
Technical field
The present invention relates to fields of communication technology, and in particular, to communication means and wireless sensor network road between a kind of cluster head
By agreement.
Background technology
Currently, wireless sensor network (Wireless Sensor Networks, WSN) is new branch of science and traditional subject
Cross products, it has included the new and high technology of the multiple fields such as microsensor, wireless communication, low-power-consumption embedded, biological.
The self-organizing network that it is made of a large amount of sensor node, the energy of these nodes, computing capability, storage capacity all have very much
Limit, and because being often deployed in the region that personnel are difficult to reach, energy is difficult to obtain supplement or replacement.Therefore, how
On the basis of node energy is limited, the energy consumption for reducing node is directly related to the overall performance of wireless sensor network.
Currently used communication method between nodes mainly have：Flood communication means and negotiation communication method.Flood communication party
Method does not need Path selection and the process of maintenance, and destination node can be passed data to prestissimo, but uses broadcast
Method considerably increase nodes energy consumption, reduce network lifetime.Negotiation communication method may insure data
Effectively transmission reduces the energy consumption of the node unrelated with the data, but uses the method negotiated to be likely to result in neighbors and be not required to
It wants and the phenomenon that distant-end node needs this data occurs so that data can not normally be transmitted to destination node.
Invention content
The present invention is directed at least solve one of the technical problems existing in the prior art, it is proposed that communication party between a kind of cluster head
Method and wireless sensor network Routing Protocol can ensure energy in wireless sensor network while ensureing network connectivty
Equilibrium consumption, extends network lifetime.
Communication means between a kind of cluster head is provided to achieve the purpose of the present invention, including：
Calculate the optimal cluster head number in wireless sensor network；
Under conditions of the optimal cluster head number is constant, leader cluster node is elected according to the dump energy of each node, is not had
It is added less than the cluster of first predetermined value as the node selection dump energy of cluster head；
When each leader cluster node is to-aggregation node transmission data, according to routing table and the leader cluster node downstream
All leader cluster nodes establish virtual link, and calculate and choose probability value with all leader cluster nodes in the leader cluster node downstream；
The maximum cluster head of probability value is chosen to forward cluster head as next-hop described in selecting；
Establish in wireless sensor network communication path between all cluster heads.
Optionally, described under conditions of the optimal cluster head number is constant, cluster is elected according to the dump energy of each node
Head node, the step of addition less than the cluster of first predetermined value as the node of cluster head selection dump energy, including：
Judge whether the dump energy of each node is more than energy threshold；
If so, electing leader cluster node according to the dump energy of each node, the node selection for not becoming cluster head is remaining
Energy is added less than the cluster of first predetermined value；
If it is not, then calculating the average minimal consumption energy of each node, and cluster head is elected according to the minimal consumption energy
Node, the node selection dump energy for not becoming cluster head are added higher than the cluster of second predetermined value.
Optionally, described if it is not, then calculate the average minimal consumption energy of each node, and according to the minimal consumption
Energy elects leader cluster node, the step of addition higher than the cluster of second predetermined value as the node of cluster head selection dump energy
In, the average minimal consumption energy of each node meets following formula：
Wherein, Eave_min(i)For the minimal consumption energy of i-th of node；CiIt is i-th of node in the wireless sensor network
Centrad in network；M is the neighbor node number of i-th of node；MinP (m) is m-th of node in the neighbor node of i-th of node
The minimum power communicated with i-th of node；I=1,2 ..., n, n are the quantity of node；M=1,2 ..., k, k are neighbor node
Quantity.
Optionally, in each leader cluster node when to aggregation node transmission data, according to routing table and the cluster
All leader cluster nodes in head node downstream establish virtual link, and calculate and all leader cluster nodes in the leader cluster node downstream
It is described that probability value is chosen to meet following formula in the step of choosing probability value：
Wherein,Probability value is chosen for the downstream leader cluster node of h layers of leader cluster node；w(Ei) it is i-th of node
Energy benefits value；w(Ti) be i-th of node suspend mode benefit value.
Optionally, the energy benefits value of i-th of node meets following formula：
Wherein,For the current remaining of i-th of node；For the primary power of i-th of node.
Optionally, the suspend mode benefit value of i-th of node meets following formula：
Wherein, τ is the run time for often taking turns the period as cluster head；PiBecome the probability of cluster head for i-th of node；For
I-th of node jth time becomes the initial time of cluster head；Become the termination time of cluster head for i-th of node jth time；round
(i) it is cycle wheel number of i-th of node as cluster head；I=1,2 ..., n, n are the quantity of node；J=1,2 ..., round
(i)。
Optionally, in the step of the optimal cluster head number in the calculating wireless sensor network, the optimal cluster head number
Meet following formula：
Wherein, a is circular grid zone radius；N is number of nodes；ω is the data fusion that node sends leader cluster node
Rate；EelecEnergy is consumed for transmission/recruiting unit；For the distance between leader cluster node and aggregation node.
As another technical solution, the present invention also provides a kind of wireless sensor network Routing Protocols, which is characterized in that packet
It includes：
Computing module, for calculating the optimal cluster head number in wireless sensor network；
Module is elected, under conditions of the optimal cluster head number is constant, being elected according to the dump energy of each node
Leader cluster node, the node selection dump energy for not becoming cluster head are added less than the cluster of first predetermined value；
Connect computing module, for when each leader cluster node is to aggregation node transmission data, according to routing table with
All leader cluster nodes in the leader cluster node downstream establish virtual link, and calculate all cluster head sections with the leader cluster node downstream
Point chooses probability value；
Forwarding module described chooses the maximum cluster head of probability value as next-hop forwarding cluster head for selecting；
Module is established, for establishing in wireless sensor network communication path between all cluster heads.
Optionally, the election module includes judging unit, computing unit and election unit, wherein
Judging unit, for judging whether the dump energy of each node is more than energy threshold；
If so, the election unit be used for according to the dump energy of each node elect leader cluster node, and make not at
Dump energy is selected to be added less than the cluster of first predetermined value for the node of cluster head；
If it is not, then the computing unit is used to calculate the average minimal consumption energy of each node；The selecting unit is used
In electing leader cluster node according to the minimal consumption energy, the node selection dump energy for not becoming cluster head is predetermined higher than second
The cluster of value is added.
The invention has the advantages that：
Between cluster head provided by the invention in the technical solution of communication means and wireless sensor network Routing Protocol, pass through calculating
Optimal cluster head number in wireless sensor network and leader cluster node is elected according to the dump energy of each node, and calculate with
All leader cluster nodes in the leader cluster node downstream choose probability value, select to choose the maximum cluster head of probability value as next
Hair cluster head is redirected, communication path between all cluster heads is established in wireless sensor network.In this way, can ensure network connectivty
Meanwhile ensureing even energy consumption in wireless sensor network, extend network lifetime.
Description of the drawings
The flow diagram of Fig. 1 communication means between cluster head provided in an embodiment of the present invention；
Fig. 2 is the functional block diagram of wireless sensor network Routing Protocol provided in an embodiment of the present invention；
Fig. 3 is the functional block diagram of election module used in the embodiment of the present invention.
Specific implementation mode
To make those skilled in the art more fully understand technical scheme of the present invention, come below in conjunction with the accompanying drawings to the present invention
Communication means and wireless sensor network Routing Protocol are described in detail between the cluster head of offer.
Referring to Fig. 1, communication means between cluster head provided in an embodiment of the present invention comprising：
Step 101, the optimal cluster head number in wireless sensor network is calculated.
Optionally, optimal cluster head number meets following formula：
Wherein, a is circular grid zone radius；N is number of nodes；ω is the data fusion that node sends leader cluster node
Rate；EelecEnergy is consumed for transmission/recruiting unit；For the distance between leader cluster node and aggregation node.
Step 102, under conditions of optimal cluster head number is constant, leader cluster node is elected according to the dump energy of each node,
The node selection dump energy for not becoming cluster head is added less than the cluster of first predetermined value.
Above-mentioned steps 102 further comprise：
Judge whether the dump energy of each node is more than energy threshold；
If so, electing leader cluster node according to the dump energy of each node, the node selection for not becoming cluster head is remaining
Energy is added less than the cluster of first predetermined value；
If it is not, then calculating the average minimal consumption energy of each node, and leader cluster node is elected according to minimal consumption energy,
The node selection dump energy for not becoming cluster head is added higher than the cluster of second predetermined value.
That is, leader cluster node is elected using the dump energy of each node as major parameter, still, when each node
Dump energy it is relatively low when, can using the average minimal consumption energy of each node as major parameter elect leader cluster node.This
Sample can more reasonably elect leader cluster node, so as to be further ensured that even energy consumption in wireless sensor network.
Above-mentioned first predetermined value can as the case may be depending on, can be selected as long as no the node as cluster head relatively low
The cluster of dump energy is added.
Optionally, the average minimal consumption energy of each node meets following formula：
Wherein, Eave_min(i)For the minimal consumption energy of i-th of node；CiIt is i-th of node in wireless sensor network
Centrad；M is the neighbor node number of i-th of node；MinP (m) be i-th of node neighbor node in m-th of node and the
The minimum power of i node communication；I=1,2 ..., n, n are the quantity of node；M=1,2 ..., k, k are the number of neighbor node
Amount.
Step 103, when each leader cluster node is to aggregation node transmission data, according to routing table and the leader cluster node downstream
All leader cluster nodes establish virtual link, and calculate and choose probability with all leader cluster nodes in the leader cluster node downstream
Value.
Above-mentioned aggregation node is used to receive the data of leader cluster node transmission, and is sent to outer net.
Optionally, above-mentioned that probability value is chosen to meet following formula：
Wherein,Probability value is chosen for the downstream leader cluster node of h layers of leader cluster node；w(Ei) it is i-th of node
Energy benefits value；w(Ti) be i-th of node suspend mode benefit value.
Optionally, the energy benefits value of i-th of node meets following formula：
Wherein,For the current remaining of i-th of node；For the primary power of i-th of node.
Optionally, the suspend mode benefit value of i-th of node meets following formula：
Wherein, τ is the run time for often taking turns the period as cluster head；PiBecome the probability of cluster head for i-th of node；For
I-th of node jth time becomes the initial time of cluster head；Become the termination time of cluster head for i-th of node jth time；round
(i) it is cycle wheel number of i-th of node as cluster head；I=1,2 ..., n, n are the quantity of node；J=1,2 ..., round
(i)。
Step 104, it selects that the maximum cluster head of probability value is chosen to forward cluster head as next-hop.
Step 105, communication path between all cluster heads is established in wireless sensor network.
Communication means between cluster head provided in an embodiment of the present invention, by calculating the optimal cluster head number in wireless sensor network
And leader cluster node is elected according to the dump energy of each node, and calculate all leader cluster nodes with the leader cluster node downstream
Choose probability value, select to choose the maximum cluster head of probability value to forward cluster head as next-hop, establish wireless sensor network
Communication path between all cluster heads in network.In this way, can ensure energy in wireless sensor network while ensureing network connectivty
Equilibrium consumption, extends network lifetime.
As another technical solution, referring to Fig. 2, the embodiment of the present invention also provides a kind of wireless sensor network routing association
View comprising：
Computing module 1, for calculating the optimal cluster head number in wireless sensor network；
Module 2 is elected, under conditions of above-mentioned optimal cluster head number is constant, being elected according to the dump energy of each node
Leader cluster node, the node selection dump energy for not becoming cluster head are added less than the cluster of first predetermined value；
Computing module 3 is connected, is used for when each leader cluster node is to aggregation node transmission data, according to routing table and the cluster
All leader cluster nodes in head node downstream establish virtual link, and calculate and all leader cluster nodes in the leader cluster node downstream
Choose probability value；
Forwarding module 4 chooses the maximum cluster head of probability value to forward cluster head as next-hop for selecting；
Module 5 is established, for establishing in wireless sensor network communication path between all cluster heads.
Optionally, referring to Fig. 3, election module 2 includes judging unit 21, computing unit 22 and election unit 23, wherein
Judging unit 21 is used to judge whether the dump energy of each node to be more than energy threshold；
If so, election unit 23 is used to elect leader cluster node according to the dump energy of each node, and make not become
The node selection dump energy of cluster head is added less than the cluster of first predetermined value；
If it is not, then computing unit 22 is used to calculate the average minimal consumption energy of each node；Unit 23 is elected to be used for root
Leader cluster node is elected according to minimal consumption energy, the node selection dump energy for not becoming cluster head adds higher than the cluster of second predetermined value
Enter.
That is, leader cluster node is elected using the dump energy of each node as major parameter, still, when each node
Dump energy it is relatively low when, can using the average minimal consumption energy of each node as major parameter elect leader cluster node.This
Sample can more reasonably elect leader cluster node, so as to be further ensured that even energy consumption in wireless sensor network
Wireless sensor network Routing Protocol provided in an embodiment of the present invention, it is optimal in wireless sensor network by calculating
Cluster head number and leader cluster node is elected according to the dump energy of each node, and calculates all clusters with the leader cluster node downstream
Head node chooses probability value, selects that the maximum cluster head of probability value is chosen to forward cluster head as next-hop, establishes wireless pass
Communication path between all cluster heads in sensor network.In this way, can ensure wireless sensor network while ensureing network connectivty
Middle even energy consumption extends network lifetime.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, in the essence for not departing from the present invention
In the case of refreshing and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (9)
1. communication means between a kind of cluster head, which is characterized in that including：
Calculate the optimal cluster head number in wireless sensor network；
Under conditions of the optimal cluster head number is constant, leader cluster node is elected according to the dump energy of each node, is not become
The node selection dump energy of cluster head is added less than the cluster of first predetermined value；
When each leader cluster node is to-aggregation node transmission data, according to all of routing table and the leader cluster node downstream
Leader cluster node establishes virtual link, and calculates and choose probability value with all leader cluster nodes in the leader cluster node downstream；
The maximum cluster head of probability value is chosen to forward cluster head as next-hop described in selecting；
Establish in wireless sensor network communication path between all cluster heads.
2. communication means between cluster head according to claim 1, which is characterized in that described constant in the optimal cluster head number
Under the conditions of, leader cluster node is elected according to the dump energy of each node, the node selection dump energy for not becoming cluster head is less than
The step of cluster of first predetermined value is added, including：
Judge whether the dump energy of each node is more than energy threshold；
If so, electing leader cluster node according to the dump energy of each node, the node for not becoming cluster head selects dump energy
Cluster less than first predetermined value is added；
If it is not, then calculating the average minimal consumption energy of each node, and leader cluster node is elected according to the minimal consumption energy,
The node selection dump energy for not becoming cluster head is added higher than the cluster of second predetermined value.
3. communication means between cluster head according to claim 2, which is characterized in that described if it is not, then calculating each node
Average minimal consumption energy, and according to the minimal consumption energy elect leader cluster node, not become cluster head node select
In the step of dump energy is added higher than the cluster of second predetermined value, the average minimal consumption energy of each node meets following
Formula：
Wherein, Eave_min(i)For the minimal consumption energy of i-th of node；CiIt is i-th of node in the wireless sensor network
Centrad；M is the neighbor node number of i-th of node；MinP (m) be i-th of node neighbor node in m-th of node and the
The minimum power of i node communication；I=1,2 ..., n, n are the quantity of node；M=1,2 ..., k, k are the number of neighbor node
Amount.
4. communication means between cluster head according to claim 1, which is characterized in that each leader cluster node to
When aggregation node transmission data, virtual link is established according to all leader cluster nodes in routing table and the leader cluster node downstream, and count
Calculate with all leader cluster nodes in the leader cluster node downstream the step of choosing probability value in, it is described that choose probability value to meet following
Formula：
Wherein,Probability value is chosen for the downstream leader cluster node of h layers of leader cluster node；w(Ei) be i-th of node energy
Benefit value；w(Ti) be i-th of node suspend mode benefit value.
5. communication means between cluster head according to claim 4, which is characterized in that the energy benefits value of i-th of node
Meet following formula：
Wherein,For the current remaining of i-th of node；For the primary power of i-th of node.
6. communication means between cluster head according to claim 4, which is characterized in that the suspend mode benefit value of i-th of node
Meet following formula：
Wherein, τ is the run time for often taking turns the period as cluster head；PiBecome the probability of cluster head for i-th of node；It is i-th
Node jth time becomes the initial time of cluster head；Become the termination time of cluster head for i-th of node jth time；Round (i) is
I-th of node becomes the cycle wheel number of cluster head；I=1,2 ..., n, n are the quantity of node；J=1,2 ..., round (i).
7. communication means between cluster head according to claim 1, which is characterized in that in the calculating wireless sensor network
Optimal cluster head number step in, the optimal cluster head number meets following formula：
Wherein, a is circular grid zone radius；N is number of nodes；ω is the data fusion rate that node sends leader cluster node；Eelec
Energy is consumed for transmission/recruiting unit；For the distance between leader cluster node and aggregation node.
8. a kind of wireless sensor network Routing Protocol, which is characterized in that including：
Computing module, for calculating the optimal cluster head number in wireless sensor network；
Module is elected, under conditions of the optimal cluster head number is constant, cluster head to be elected according to the dump energy of each node
Node, the node selection dump energy for not becoming cluster head are added less than the cluster of first predetermined value；
Computing module is connected, is used for when each leader cluster node is to aggregation node transmission data, according to routing table and the cluster
All leader cluster nodes in head node downstream establish virtual link, and calculate and all leader cluster nodes in the leader cluster node downstream
Choose probability value；
Forwarding module described chooses the maximum cluster head of probability value as next-hop forwarding cluster head for selecting；
Module is established, for establishing in wireless sensor network communication path between all cluster heads.
9. wireless sensor network Routing Protocol according to claim 8, which is characterized in that the election module includes judging
Unit, computing unit and election unit, wherein
Judging unit, for judging whether the dump energy of each node is more than energy threshold；
If so, the election unit is used to elect leader cluster node according to the dump energy of each node, and make not become cluster
The node selection dump energy of head is added less than the cluster of first predetermined value；
If it is not, then the computing unit is used to calculate the average minimal consumption energy of each node；The selecting unit is used for root
Leader cluster node is elected according to the minimal consumption energy, does not become the node selection dump energy of cluster head higher than second predetermined value
Cluster is added.
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 true CN108770036A (en) | 2018-11-06 |
| CN108770036B 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) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109510763A (en) * | 2019-01-03 | 2019-03-22 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| CN109600812A (en) * | 2019-02-21 | 2019-04-09 | 中国联合网络通信集团有限公司 | Method for routing, route device, sensor |
| CN109598915A (en) * | 2018-11-23 | 2019-04-09 | 山东东山新驿煤矿有限公司 | A kind of intelligent monitor system of coal water content |
| CN109688557A (en) * | 2019-02-21 | 2019-04-26 | 中国联合网络通信集团有限公司 | A kind of cooperative node selection method, device |
| CN109729498A (en) * | 2019-02-27 | 2019-05-07 | 重庆邮电大学 | A kind of method for tracking target and system of the adaptive session point selection based on Wei Nuotu |
| 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 |
| CN111010710A (en) * | 2019-12-14 | 2020-04-14 | 贵州电网有限责任公司 | 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 |
|---|
| ABDERRAHIM MAIZATE: "Enhanced passive clustering based on distance and residual energy for wireless sensor network", 《IEEE》 * |
| 李博: "无线传感器网络中能耗均衡的路由协议研究", 《CNKI》 * |
| 王爱美: "基于LEACH协议的无线传感器网络分簇算法研究", 《CNKI》 * |
Cited By (9)
| 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 |
| CN109510763A (en) * | 2019-01-03 | 2019-03-22 | 中国联合网络通信集团有限公司 | A kind of node cluster head electoral machinery and system |
| CN109600812A (en) * | 2019-02-21 | 2019-04-09 | 中国联合网络通信集团有限公司 | Method for routing, route device, sensor |
| CN109688557A (en) * | 2019-02-21 | 2019-04-26 | 中国联合网络通信集团有限公司 | A kind of cooperative node selection method, device |
| CN109729498A (en) * | 2019-02-27 | 2019-05-07 | 重庆邮电大学 | A kind of method for tracking target and system of the adaptive session point selection based on Wei Nuotu |
| 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 |
| CN111010710A (en) * | 2019-12-14 | 2020-04-14 | 贵州电网有限责任公司 | Sensor network transmission method based on load balancing in power equipment communication |
| CN111010710B (en) * | 2019-12-14 | 2023-06-02 | 贵州电网有限责任公司 | Sensor network transmission method based on load balancing in power equipment communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108770036B (en) | 2020-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108770036A (en) | Communication means and wireless sensor network Routing Protocol between cluster head | |
| CN106102075B (en) | Cluster-dividing method and system based on hierarchical region division in wireless sensor network | |
| Gautam et al. | Distance aware intelligent clustering protocol for wireless sensor networks | |
| US8774050B2 (en) | Dynamic wake-up time adjustment based on designated paths through a computer network | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN104284387B (en) | A kind of cluster routing method towards mobile sensor network | |
| CN108696903A (en) | A kind of LEACH algorithm optimization methods based on energy consumption balance | |
| CN108900996A (en) | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach | |
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| Liu et al. | A mixed transmission strategy to achieve energy balancing in wireless sensor networks | |
| Gong et al. | A tree-based routing protocol in wireless sensor networks | |
| CN109951834A (en) | Bluetooth mesh method for routing based on the improved algorithm that floods | |
| Bala et al. | Proficient D-SEP protocol with heterogeneity for maximizing the lifetime of wireless sensor networks | |
| Phate et al. | Minimizing congestion and improved QoS of AODV using clustering in mobile ad hoc network | |
| Jerbi et al. | A novel clustering algorithm for coverage a large scale in WSN | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Coiro et al. | Energy saving improvements in IP networks through table lookup bypass in router line cards | |
| Abdullah et al. | Energy Efficient MANET Routing Protocol Based on Ant Colony Optimization. | |
| CN110213805A (en) | Wireless ad hoc network routing decision processing method and system | |
| Beniwal et al. | Energy efficient routing protocols in resource constrained IoT networks | |
| Toor et al. | A novel energy efficient routing protocol EACBM for scalable wireless sensor networks | |
| Bansal et al. | Energy-efficient multilevel clustering protocol for underwater wireless sensor networks | |
| Jing et al. | A cluster-based multipath delivery scheme for wireless sensor networks | |
| Kaur et al. | A Study of Efficiency Evaluation of Power Economical Protocols of Wireless Sensor Systems | |
| Wang | Distributed Energy Balance Clustering Algorithm 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 |