CN109714804A - Cluster head election algorithm based on relative surplus energy and SEP agreement - Google Patents
Cluster head election algorithm based on relative surplus energy and SEP agreement Download PDFInfo
- Publication number
- CN109714804A CN109714804A CN201910026662.9A CN201910026662A CN109714804A CN 109714804 A CN109714804 A CN 109714804A CN 201910026662 A CN201910026662 A CN 201910026662A CN 109714804 A CN109714804 A CN 109714804A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- election
- energy
- wheel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention discloses the cluster head election algorithms based on relative surplus energy and SEP agreement, comprising the following steps: first calculates this cluster residue gross energy after r wheel operation；The average residual energy of this cluster node after election of cluster head r wheel is run is calculated again；Then it calculates this bunch member node and takes turns relative surplus energy when starting in r+1；It brings the optimal election probability factor for having been introduced into relative surplus energy into SEP election threshold formula again, obtains ordinary node election threshold value and higher-level node elects threshold value；If this bunch member node is ordinary node, member node is made to generate the number between [0,1] at random, if random number is less than ordinary node and elects threshold value, selects the node for leader cluster node, be otherwise non-leader cluster node；If this bunch member node is higher-level node, member node is made to generate the number between [0,1] at random, if random number is less than higher-level node and elects threshold value, select the node for leader cluster node, no is non-leader cluster node.The present invention has the advantages of capable of extending network lifecycle.
Description
Technical field
The present invention relates to wireless sensor network topology protocol technical fields in wireless communication, and in particular to a kind of cluster
Head election algorithm.
Background technique
Wireless sensor network is a kind of wireless self-organization network, by the wireless sensor node for being largely dispersed in monitoring region
Point composition, each sensing node is that modern network technology, short-distance wireless communication technology are mutually tied with Modern Sensor Technology
Conjunction is formed by a micro embedded system.Its major function is monitored in cooperation acquisition, processing and transmission network region
The information of object.In recent years, wireless sensor network is quickly grown, and is widely used in social various aspects, practical value
Also more and more approved.It is all widely used in terms of military affairs, environment, smart home.Because of wireless sensor network
The diversity of network application environment, in order to apply it to which in specific environment, there are also to be improved at many aspects for technology.
The energy efficiency for improving wireless sensor network, extends its life cycle, lower in addition to developing energy consumption on hardware
Communication chip and microprocessing unit outside, network protocol of the network operation itself be even more be worth research project.Topology control
(Topology-control) as one of important support technology of wireless sensor network, it can effectively assist improving network
Energy utilization efficiency extends the life span of network.Good network topology structure can greatly improve network data collection
With the execution efficiency of data routing.For the wireless sensor network of finite energy, good Topology Control Algorithm can make net
Network saves big energy, effectively extends network to the cover time in monitoring region, improves the actual use of wireless sensor network
Value, this is also patent main purpose.
According to the difference of each joint behavior, it can be divided into heterogeneous network and homogeneous network, heterogeneous network is by a variety of differences
The node of performance forms, and homogeneous network is then made of the node of same performance.Stablizing voting protocol (SEP) is based on wireless sensing
The heterogeneous network classics Routing Protocol of device network Secondary energy isomery, improves LEACH cluster algorithm.In SEP agreement
The cluster head election algorithm of different primary power nodes is not quite similar, and SEP agreement does not consider the dump energy of node, if residual energy
It measures low node and is elected as cluster head, the death of node will be accelerated, lead to that network lifecycle is short, network stabilization is poor.
Summary of the invention
It can make node tool of the node with higher relative surplus energy than low energy the object of the present invention is to provide a kind of
There is bigger probability to take on cluster head, can extend network lifecycle and improve network stabilization based on relative surplus energy and
The cluster head election algorithm of SEP agreement.
To realize the above-mentioned technical purpose, present invention employs following technical solutions: it is described based on relative surplus energy and
The cluster head election algorithm of SEP agreement, it is characterised in that: the following steps are included:
Step (1): the energy that this cluster gross energy and r wheel consume required for communicating before being run according to election of cluster head r wheel,
Calculate this cluster residue gross energy after r wheel is run；
Step (2): according to this cluster residue gross energy and this cluster node sum after r wheel operation, election of cluster head r is calculated
The average residual energy of this cluster node after wheel operation；
Step (3): creation TDMA timetable, by the average residual energy of this cluster node after TDMA timetable and r wheel operation
Amount is sent to member node；
Step (4): started according to the average residual energy of this cluster node after election of cluster head r wheel operation and r+1 wheel
When this bunch member node itself current remaining, calculate this bunch member node r+1 take turns start when relative surplus energy
Amount；
Step (5): this bunch member node is introduced into SEP agreement most in the relative surplus energy that r+1 takes turns when starting
It is preferred that lifting probability factor, and the optimal election probability factor for having been introduced into relative surplus energy is brought into SEP election threshold formula,
It obtains corresponding ordinary node election threshold value and higher-level node elects threshold value；
Step (6): if this bunch member node is ordinary node, generate the member node at random between one [0,1]
Number, if random number generated is less than the member node, corresponding ordinary node elects threshold value, selects the node for cluster head section
Point selects the node for non-cluster if random number generated elects threshold value not less than the corresponding ordinary node of the member node
Head node；If this bunch member node is higher-level node, the member node is set to generate the number between one [0,1] at random, if giving birth to
At random number be less than the corresponding higher-level node of the member node and elect threshold value, then select the node for leader cluster node, if giving birth to
At random number elect threshold value not less than the corresponding higher-level node of the member node, then select the node for non-leader cluster node.
Further, the cluster head election algorithm above-mentioned based on relative surplus energy and SEP agreement, in which: in step (5)
In, have been introduced into the specific formula for calculation of the optimal election probability factor of relative surplus energy are as follows:
pi_E=popt*ρ(i)
Wherein, ρ (i) this bunch member node takes turns relative surplus energy when starting, p in r+1optFor the selection of optimal cluster head
Ratio, pi_EHave been introduced into the optimal election probability factor of relative surplus energy.
Further, the cluster head election algorithm above-mentioned based on relative surplus energy and SEP agreement, in which: in step (5)
In, ordinary node elects the specific formula for calculation of threshold value are as follows:
Wherein, pnrmFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is in r+
Relative surplus energy when 1 wheel starts, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel.
Further, the cluster head election algorithm above-mentioned based on relative surplus energy and SEP agreement, in which: in step (5)
In, higher-level node elects the specific formula for calculation of threshold value are as follows:
Wherein padvFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is in r+1
Relative surplus energy when wheel starts, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel.
Through the implementation of the above technical solution, the beneficial effects of the present invention are: by considering during election of cluster head
This factor of relative surplus energy, so that it is bigger to have the node with higher relative surplus energy than the node of low energy
Probability take on leader cluster node, so that the energy of equalising network interior joint, reduce the energy consumption in message transmitting procedure,
Capacity usage ratio is improved, the dead fast disadvantage of the few node of dump energy is overcome, to extend wireless sensor network
Life cycle improves network stabilization.
Detailed description of the invention
Fig. 1 is the flow diagram of the cluster head election algorithm of the present invention based on relative surplus energy and SEP agreement.
Fig. 2 is the remaining node of SEP agreement and RRE-SEP agreement and the relationship comparison diagram for executing wheel number.
Fig. 3 is the remaining node of SEP agreement and RRE-SEP agreement and the relationship comparison diagram of node average residual energy.
Specific embodiment
Technical solution of the present invention is described in further detail with reference to the accompanying drawing:
Assuming that there is n sensor node in network, wherein higher-level node proportion is m, ordinary node before the network operation
Primary power is E0, higher-level node primary power is (1+ α) E0, α is higher-level node additional energy and ordinary node primary power
Ratio；All node energies in second level heterogeneous network are as follows:
n·(1-m)E0+n·m·(1+α)E0=n (1+m α) E0
So we assume that it is E that network, which is by n (1+m α) a primary power,0General sensor nodes constitute, most
Excellent cluster head ratio is popt；To make network energy consumption reach minimum, according to the optimal cluster head number calculating method of LEACH agreement, can obtain
The Probability p of ordinary node cluster head election outnrmProbability p is elected with the cluster head of higher-level nodeadv:
As shown in Figure 1, Figure 2, Figure 3 shows, the cluster head election algorithm based on relative surplus energy and SEP agreement, including
Following steps:
Step (1): the energy that this cluster gross energy and r wheel consume required for communicating before being run according to election of cluster head r wheel,
Calculate this cluster residue gross energy after r wheel is run；
Wherein, if the r of member node takes turns energy value Enoch(i, r), the energy value of leader cluster node itself are Ech(i, r), i
For node serial number and 1≤i≤N (j), N (j) are jth cluster node sum, and the number and 1≤j≤k, k of j cluster are that r takes turns network
Number of clusters, then r takes turns the gross energy E of jth clustertotal(r, j) are as follows:
Etotal(r, j)=(N (j) -1) * Enoch(i, r)+Ech(i, r)
R takes turns remaining gross energy E after the operation of jth clustertotal_consev(r, j) are as follows:
Wherein,It is the energy of r wheel jth leader cluster node consumption, Enoch_consume(r, j) is r wheel jth
Bunch member node consumes energy, Etotal(r, j) is the gross energy that r takes turns jth cluster；
Step (2): according to this cluster residue gross energy and this cluster node sum after r wheel operation, election of cluster head r is calculated
The average residual energy of this cluster node after wheel operation；
Wherein, the average residual energy of jth cluster node after the completion of r wheel is runAre as follows:
Wherein, Etotal_consev(r, j) is that r takes turns remaining gross energy after the operation of jth cluster, and N (j) is jth cluster node sum；
Step (3): creation TDMA timetable, by the average residual energy of this cluster node after TDMA timetable and r wheel operation
Amount is sent to member node；
Step (4): started according to the average residual energy of this cluster node after election of cluster head r wheel operation and r+1 wheel
When this bunch member node itself current remaining, calculate this bunch member node r+1 take turns start when relative surplus energy
Amount；
Wherein, the current remaining E of this bunch member node itself when r+1 wheel startsconsev(i, r) are as follows:
Therefore the relative surplus energy ρ (i) of member node i can be obtained are as follows:
Wherein, Econsev(i, r) is the current remaining of this bunch member node itself when r+1 wheel starts,
For the average residual energy of jth cluster node after the completion of r wheel operation；
Step (5): this bunch member node is introduced into SEP agreement most in the relative surplus energy that r+1 takes turns when starting
It is preferred that lifting probability factor, and the optimal election probability factor for having been introduced into relative surplus energy is brought into SEP election threshold formula,
It obtains corresponding ordinary node election threshold value and higher-level node elects threshold value；The SEP agreement for introducing relative surplus energy is abbreviated as
RRE-SEP agreement；
Wherein, the specific formula for calculation of the optimal election probability factor of relative surplus energy is had been introduced into are as follows:
pi_E=popt*ρ(i)
Wherein, ρ (i) this bunch member node takes turns relative surplus energy when starting, p in r+1optFor the selection of optimal cluster head
Ratio, pi_EHave been introduced into the optimal election probability factor of relative surplus energy；
Step (6): if this bunch member node is ordinary node, generate the member node at random between one [0,1]
Number, if random number generated is less than the member node, corresponding ordinary node elects threshold value, selects the node for cluster head section
Point selects the node for non-cluster if random number generated elects threshold value not less than the corresponding ordinary node of the member node
Head node；If this bunch member node is higher-level node, the member node is set to generate the number between one [0,1] at random, if giving birth to
At random number be less than the corresponding higher-level node of the member node and elect threshold value, then select the node for leader cluster node, if giving birth to
At random number elect threshold value not less than the corresponding higher-level node of the member node, then select the node for non-leader cluster node；
Wherein, the specific formula for calculation of ordinary node election threshold value are as follows:
Wherein, pnrmFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is in r+
Relative surplus energy when 1 wheel starts, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel；
Wherein, the specific formula for calculation of higher-level node election threshold value are as follows:
Wherein padvFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is in r+1
Relative surplus energy when wheel starts, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel.
The invention has the advantages that by considering this factor of relative surplus energy during election of cluster head, to make
The node with higher relative surplus energy is set than the node of low energy to there is bigger probability to take on leader cluster node, thus
The energy of weighing apparatus nodes, reduces the energy consumption in message transmitting procedure, improves capacity usage ratio, overcome residue
The dead fast disadvantage of the node of little energy improves network stabilization to extend the life cycle of wireless sensor network.
Claims (4)
1. the cluster head election algorithm based on relative surplus energy and SEP agreement, it is characterised in that: the following steps are included:
Step (1): the energy that this cluster gross energy and r wheel consume required for communicating before being run according to election of cluster head r wheel calculates
This cluster residue gross energy after the operation of r wheel out；
Step (2): according to this cluster residue gross energy and this cluster node sum after r wheel operation, election of cluster head r wheel fortune is calculated
The average residual energy of this cluster node after row；
Step (3): creation TDMA timetable sends out the average residual energy of this cluster node after TDMA timetable and r wheel operation
Give member node；
Step (4): sheet when being started according to the average residual energy of this cluster node after election of cluster head r wheel operation and r+1 wheel
The current remaining of bunch member node itself calculates this bunch member node in r+1 and takes turns relative surplus energy when starting；
Step (5): this bunch member node is introduced into SEP agreement most preferably in the relative surplus energy that r+1 takes turns when starting
Probability factor is lifted, and the optimal election probability factor for having been introduced into relative surplus energy is brought into SEP election threshold formula, is obtained
Corresponding ordinary node election threshold value and higher-level node elect threshold value；
Step (6): if this bunch member node is ordinary node, making the member node generate the number between one [0,1] at random, if
Random number generated is less than the corresponding ordinary node of the member node and elects threshold value, then selects the node for leader cluster node, if
Random number generated elects threshold value not less than the corresponding ordinary node of the member node, then selects the node for non-cluster head section
Point；If this bunch member node is higher-level node, the member node is set to generate the number between one [0,1] at random, if generated
Random number is less than the corresponding higher-level node of the member node and elects threshold value, then selects the node for leader cluster node, if generated
Random number elects threshold value not less than the corresponding higher-level node of the member node, then selects the node for non-leader cluster node.
2. the cluster head election algorithm according to claim 1 based on relative surplus energy and SEP agreement, it is characterised in that:
In step (5), the specific formula for calculation of the optimal election probability factor of relative surplus energy is had been introduced into are as follows:
pi_E=popt*ρ(i)
Wherein, ρ (i) this bunch member node takes turns relative surplus energy when starting, p in r+1optFor optimal cluster head selection percentage,
pi_EHave been introduced into the optimal election probability factor of relative surplus energy.
3. the cluster head election algorithm according to claim 1 based on relative surplus energy and SEP agreement, it is characterised in that:
In step (5), ordinary node elects the specific formula for calculation of threshold value are as follows:
Wherein, pnrmFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is taken turns in r+1
Relative surplus energy when beginning, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel.
4. the cluster head election algorithm according to claim 1 based on relative surplus energy and SEP agreement, it is characterised in that:
In step (5), higher-level node elects the specific formula for calculation of threshold value are as follows:
Wherein padvFor the probability of ordinary node cluster head election, r indicates to work as front-wheel number, and ρ (i) this bunch member node is opened in r+1 wheel
Relative surplus energy when the beginning, G expression have been runThe ordinary node set of cluster head is not chosen as in wheel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910026662.9A CN109714804A (en) | 2019-01-11 | 2019-01-11 | Cluster head election algorithm based on relative surplus energy and SEP agreement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910026662.9A CN109714804A (en) | 2019-01-11 | 2019-01-11 | Cluster head election algorithm based on relative surplus energy and SEP agreement |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109714804A true CN109714804A (en) | 2019-05-03 |
Family
ID=66261299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910026662.9A Pending CN109714804A (en) | 2019-01-11 | 2019-01-11 | Cluster head election algorithm based on relative surplus energy and SEP agreement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109714804A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111601268A (en) * | 2020-05-11 | 2020-08-28 | 中国联合网络通信集团有限公司 | Cluster head selection method and device, terminal equipment and storage medium |
| CN111711930A (en) * | 2020-06-04 | 2020-09-25 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN117320112A (en) * | 2023-10-26 | 2023-12-29 | 陕西思极科技有限公司 | Dual-mode communication network energy consumption balancing method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102510572A (en) * | 2011-11-18 | 2012-06-20 | 浙江工业大学 | Clustering routing control method oriented to heterogeneous wireless sensor network |
| CN108848476A (en) * | 2018-06-21 | 2018-11-20 | 河南科技大学 | Power-efficient data assembly algorithms based on communication distance control in sensor network |
-
2019
- 2019-01-11 CN CN201910026662.9A patent/CN109714804A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102510572A (en) * | 2011-11-18 | 2012-06-20 | 浙江工业大学 | Clustering routing control method oriented to heterogeneous wireless sensor network |
| CN108848476A (en) * | 2018-06-21 | 2018-11-20 | 河南科技大学 | Power-efficient data assembly algorithms based on communication distance control in sensor network |
Non-Patent Citations (2)
| Title |
|---|
| CHENGHUI WU: "Optimization of SEP Protocol Based on Relative Residual Energy", 《2018 11TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID)》 * |
| 吴承辉: "基于SEP协议的无线传感网络的能量优化研究", 《中国硕士学位论文全文数据库(电子期刊)，信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111601268A (en) * | 2020-05-11 | 2020-08-28 | 中国联合网络通信集团有限公司 | Cluster head selection method and device, terminal equipment and storage medium |
| CN111711930A (en) * | 2020-06-04 | 2020-09-25 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN111711930B (en) * | 2020-06-04 | 2023-03-24 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN117320112A (en) * | 2023-10-26 | 2023-12-29 | 陕西思极科技有限公司 | Dual-mode communication network energy consumption balancing method and system |
| CN117320112B (en) * | 2023-10-26 | 2024-05-03 | 陕西思极科技有限公司 | Dual-mode communication network energy consumption balancing method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110536342A (en) | A kind of network mode control method and terminal, storage medium | |
| CN104301973B (en) | A kind of method of wireless body area network fast wake-up association | |
| CN109714804A (en) | Cluster head election algorithm based on relative surplus energy and SEP agreement | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN108900996A (en) | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN112367675B (en) | Wireless sensor network data fusion method and network system based on self-encoder | |
| CN103139803B (en) | A kind of based on multifactorial wireless sensor network trust administrative model | |
| CN105744593B (en) | A kind of node method of network entry and device | |
| CN111278161B (en) | WLAN protocol design and optimization method based on energy collection and deep reinforcement learning | |
| CN110602798B (en) | Distributed determination method for optimal parameters of LTE network machine communication random access | |
| Kumari | Investigation: life-time and stability period in wireless sensor network | |
| TWI473522B (en) | Method and system for hierarchical clustering of wireless sensor networks | |
| Huang | Research on balanced energy consumption of wireless sensor network nodes based on clustering algorithm | |
| CN1889486A (en) | Dynamic energy managing method and apparatus in wireless sensor network | |
| Fu et al. | A Q-learning-based approach for enhancing energy efficiency of bluetooth low energy | |
| US9614580B2 (en) | Network device with frequency hopping sequences for all channel-numbers for channel hopping with blacklisting | |
| Xiong et al. | An energy aware algorithm for edge task offloading | |
| CN103826285A (en) | Cluster-head voting and alternating method for wireless sensor network | |
| Tang et al. | Minimum-latency data aggregation in duty-cycled wireless sensor networks under physical interference model | |
| CN107809764B (en) | Markov chain-based multi-event detection method | |
| CN107005935A (en) | Network energy efficiency optimization method and device | |
| CN104394599B (en) | A kind of design method of CSMA/CA agreements applied to M2M networks | |
| CN108834195B (en) | Cluster merging method in cluster network structure and module and microcontroller thereof | |
| CN103152252A (en) | Whole-domain synergy forwarding method for wireless sensing ad-hoc network nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190503 |