CN101594657A - In the radio sensing network based on the election of cluster head method of soft-threshold - Google Patents
In the radio sensing network based on the election of cluster head method of soft-threshold Download PDFInfo
- Publication number
- CN101594657A CN101594657A CNA2009100878994A CN200910087899A CN101594657A CN 101594657 A CN101594657 A CN 101594657A CN A2009100878994 A CNA2009100878994 A CN A2009100878994A CN 200910087899 A CN200910087899 A CN 200910087899A CN 101594657 A CN101594657 A CN 101594657A
- Authority
- CN
- China
- Prior art keywords
- bunch
- node
- head
- election
- threshold value
- 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
Images
Landscapes
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
A kind of election of cluster head mechanism that is applied in the radio sensing network, this election of cluster head mechanism has been introduced the notion of soft-threshold, and the election of cluster head mechanism of traditional sub-clustering algorithm is improved.By the threshold value that can dynamically adjust is set, change the mode of the fixed threshold in traditional sub-clustering algorithm, allow the node bunch head of after serving as bunch head, still having an opportunity to continue to serve as, thereby allow more node participate in every election of cluster head of taking turns, thereby the better energy consumption of node in the equalizing network, prolong network lifetime.
Description
Technical field:
The present invention proposes a kind of wireless sensor network sub-clustering electoral machinery, relates in particular to the election of cluster head mechanism in the cluster-dividing method.
Background technology:
Wireless sensor network (Wireless sensor networks) is current to receive much concern in the world, studies hot fields by the emerging forward position that multidisciplinary height intersects.It combines technology such as sensor technology, embedded computing technique, distributed information processing, modern network and radio communication.By all kinds of microsensors target information is monitored in real time, information is handled, collaboratively the various environmental informations of monitoring in real time, perception and collection by embedded computational resource.Wireless sensor network has very wide application prospect, in military and national defense, industrial or agricultural control, city management, biologic medical, environmental monitoring, rescue and relief work, all there are important scientific research value and great practical value in many fields such as anti-probably anti-terrorism and dangerous Long-distance Control etc., caused world many countries academia, the great attention of industrial quarters and even defense sector, and become the hot research field, novel forward position of generally acknowledging that entered since 2000, and be considered to one of technology with power that 21st century is had an immense impact on, will exert far reaching influence to the human following life style.
In the research of radio sensing network, because the finite energy of node, more efficient use node energy how, balance network load is a sixty-four dollar question with the life span that prolongs network.For the radio sensing network that has great deal of nodes, the topological structure of layering has more advantage on network management and extensibility.In this network configuration, (data of collection are sent to base station (Sink node) by the route between bunch head to bunch head for Cluster Head, CH) data collection and the work of treatment in bearing bunch.The sub-clustering algorithm also is present main flow routing algorithm, in numerous sub-clustering algorithms, LEACH (low energy adaptive clustering hierarchy) algorithm is comparative maturity and sub-clustering routing algorithm commonly used, its clustering method is in a lot of level Routing Protocols that propose thereafter, as PEGASIS, HEED etc.LEACH be a kind of based on bunch the adaptive Routing Protocol of low energy consumption, its operation is divided into some wheels (round), the every wheel establishment stage and the stabilization sub stage that comprises bunch, as shown in Figure 1.Bunch establishment stage, adjacent node dynamically forms bunch, produces bunch head at random; In data communication phase, bunch interior nodes sends to a bunch head to data, and bunch head carries out data fusion and the result is sent to aggregation node.The LEACH algorithm can guarantee that each node serves as a bunch head equiprobably, makes node relative equilibrium ground consumed energy in the network.But also there are many limitations in the LEACH algorithm, as the leader cluster node skewness, does not consider residue energy of node etc.Limitation at the existence of LEACH algorithm, Chinese scholars has proposed many improved algorithms, the notion of multi-hop in PEGASIS (Power-Efficient Gathering in Sensor Information System) algorithm has proposed bunch, by bunch in set up the link of traversal all a bunches member node, each node only with the own nearest node communication of distance, and all carry out data fusion in each jumping, further reduced the network energy consumption.HEED (Hybrid Energy Efficient Distributed) algorithm improves at LEACH bunch of this problem of a skewness, in selecting, bunch head considered the dump energy of node, and introduced the selection course that a plurality of constraintss act on bunch head with master slave relation, can produce the more uniform bunch of head that distribute.
Summary of the invention:
The present invention is primarily aimed at the deficiency of a bunch selection mechanism in the LEACH algorithm and improves, and election of cluster head method (STCS, Soft Threshold based Cluster-headSelection Method) based on soft-threshold proposed on the basis of LEACH framework.The method is improved the election of cluster head mechanism of LEACH, no longer adopts rigid threshold value to come Control Node to become the probability of bunch head, and uses a kind of strategy of dynamic adjustment threshold value, and better the equalizing network energy consumption prolongs network lifetime.
In the LEACH algorithm, the method of choosing bunch head is: for any one node i in the network, produce the random number between 0 to 1 randomly, and random number and threshold value T (i) are compared, if random number is less than T (i), the selected bunch head of serving as epicycle of node, and threshold value T (i) is set to 0, will no longer participate in election of cluster head next time, otherwise, if the random number that node produces is more than or equal to T (i), node is not served as this and is taken turns a bunch head.T (i) is expressed as follows:
Wherein
(k is bunch head expectation number in every the wheel, and N is the node sum in the network), r represents current round
, G is the set of all not serving as the node of bunch head in the preceding r wheel data transmission procedure.
The present invention is different from the hard threshold strategy that traditional LEACH algorithm is adopted, make node the probability that becomes bunch head can according to own in last round of role and bunch in the member node number adjust, carry out flow process as shown in Figure 2, step is as follows:
First round election of cluster head: the threshold value T (i) that each node is set is p, that is to say that each node serves as the initial probability of bunch head and be p
R takes turns election of cluster head (r＞1): if node was served as a bunch head in r-1 wheel, then reduce node and be elected as the probability of bunch head in epicycle, T (i) is set |
r=T (i) |
R-1-ε; Otherwise, will adjust threshold value, improve node and be elected as the probability of bunch head in epicycle, be provided with
Wherein, C (i) expression node i under in the r-1 wheel bunch, NUM (C (i)) represent this bunch C (i) bunch in number of members.
Description of drawings:
The outline flowchart of Fig. 1 LEACH algorithm
The calculation flow chart of Fig. 2 soft-threshold
Fig. 3 STCS method and LEACH algorithm node survival number comparative graph (a) are scene 1, (b) are scene 2.
Embodiment:
Specific embodiments can be divided into protocol initializing, election of cluster head and bunch foundation, in bunch communication with bunch between communicate by letter, bunch first watch new several sections.
Protocol initializing: at first node is deployed in the monitored area with certain density, each sensor node burning corresponding protocols program.
Election of cluster head and bunch foundation: each node setting threshold value T (i) separately, i represents node serial number, the initial threshold of each node all is set to 0.05, the random number between each node produces 0 to 1.This number and separately threshold value are compared, if random number is less than threshold value, then the node setting is from as current leader cluster node of taking turns, and bunch header of broadcasting ADV message announcement self.Otherwise more than or equal to threshold value, then the node setting is waited for the ADV message of accepting from bunch head from as ordinary node as if random number.When ordinary node receive from around after the ADV message sent of each bunch hair, will relatively receive the signal strength signal intensity of each bunch message, select the strongest node of signal as the leader cluster node that oneself will add bunch then, and send JOIN message to it.After leader cluster node receives the JOIN message that ordinary node sends, its be set to this bunch bunch in member node, and record.So, the node of close together will be formed bunch, leader cluster node for bunch in member's distribution T DMA time slot and be sent to each member node, bunch the process of setting up finish.
In bunch communication with bunch between communicate by letter: member node is carried out transfer of data according to the TDMA time slot of leader cluster node distribution in the time of appointment in bunch, and self data monitored is passed to leader cluster node.Leader cluster node receive from bunch in after all data of member, will merge data, then with data through bunch between route reach the Sink node.
Bunch first watch is new: since leader cluster node bear bunch in data fusion, send or transmit the task of data to the base station, therefore can be than the more ability of ordinary node consumption, be balance network load, the every wheel after the DTD, to repeat said process, reselect leader cluster node, the election of cluster head of a new round, the threshold value of each node will be adjusted according under last round of bunch member node number and the own role who serves as in last wheel, if node serves as a bunch head in last round of, then reduce it is chosen as bunch head in epicycle probability, the threshold value of epicycle is adjusted into the threshold value of taking turns reduces p
2, promptly 0.0025, otherwise, if node is not served as a bunch head in last round of, then increase it is chosen as bunch head in epicycle probability, the threshold value of epicycle is adjusted into wheel threshold value increase p
2/ go up and take turns affiliated bunch number of members.
Exemplary embodiment is analyzed:
Network lifetime (life-time) is a core index of weighing the wireless sensor network performance of route protocol.Because sensor node finite energy, how to utilize sensor energy to greatest extent, prolonging network useful life as much as possible is the problem of all multi-protocols overriding concerns, be to have improved election of cluster head mechanism in the cluster-dividing method based on the election of cluster head method of soft-threshold and the difference of LEACH maximum, threshold value by dynamic adjustment node prolongs network lifetime, in order to verify the validity of STCS method, the algorithm that is proposed is carried out emulation and analysis from the average energy consumption of sensor node and the node number of surviving.The NS2 emulation tool that the emulation tool that uses is generally acknowledged by industry.
For the performance impact of test network scale, be provided with two kinds of node deployment scenes to the route agreement:
Scene 1: 100 nodes are randomly dispersed in 100*100m
2The zone in, the position that the Sink node deployment is located in (50,175);
Scene 2: 200 nodes are randomly dispersed in 200*200m
2The zone in, the position that the Sink node deployment is located in (100,350);
The primary power of each wireless sensor node is made as 2J, per 20 seconds renewal primary cluster heads.Election of cluster head method and LEACH based on soft-threshold are survived the number comparative graph shown in the (a) and (b) of Fig. 3 at network lifetime and node.
In scene 1, the STCS method is at the network operation initial stage, because node can repeatedly be served as a bunch head by election, thereby there is part of nodes too much to lose efficacy because of serving as a bunch number of times, therefore performance is compared not good enough with LEACH, but execution along with algorithm, the advantage of STSC method highlights gradually, and on overall performance, surpassed LEACH, the LEACH algorithm is because bunch head is selected limitation, some nodes is may dump energy few, but because constantly the carrying out of algorithm, LEACH is because its rigid threshold strategies, in a single day node served as a bunch head, just can not continue to participate in the election of cluster head of next round again, thereby it is more and more littler to select to take on the scope of leader cluster node, the node that some dump energies are lower can only be chosen as because there not being other selection takes on a bunch head, thereby cause node energy to exhaust faster, so in general, relative LEACH, the STCS method makes the life span of network obtain effective prolongation.
As can be seen, along with the expansion of sensor network scale, the performance of STCS method still is higher than LEACH in scene 2, and the performance of comparing under the less network size condition is better.Therefore can infer that this method stands good under bigger network size condition.
In sum,, prolong aspect such as network lifetime and all shown good performance, in the averaging network energy consumption based on the election of cluster head method of soft-threshold along with the expansion of network size than LEACH, this method still can show preferable performance, has shown good extensibility.
Symbol description:
WSN: wireless sensor network; Sink: aggregation node, base station; STCS: based on bunch head choosing of calculating threshold value The act method; LEACH: low expense adaptive layered routing algorithm; TDMA: time division multiple acess.
Claims (4)
1, a kind of election of cluster head method that is applied to clustering route protocol based on soft-threshold, it is characterized in that: node is adjusted according to a last round of situation and a bunch number of members of whether serving as bunch head at every probability of serving as bunch head of taking turns, rather than after this node was served as bunch head, directly threshold value is made as 0, thereby make node can repeatedly participate in the election process of bunch head; Concrete steps mainly comprise: election of cluster head and bunch foundation, in bunch communication with bunch between communicate by letter, bunch first watch is new.
2, the election of cluster head method based on soft-threshold according to claim 1 is characterized in that, described election of cluster head and bunch the operating procedure of foundation as follows:
Step 1: each node is provided with the threshold value T (i) of self, and i represents node serial number, establishes r and represents round, and the set-up mode of T (i) is: if current be first round election of cluster head, corresponding r=0, then T (i)=P
Init, the initial threshold of each node all is set to P
Init=0.05, otherwise,, T (i) is set then if node is served as a bunch head in last round of election |
r=T (i) |
R-1-ε if node is not served as a bunch head in last round of election, then is provided with
Be that wherein threshold value adjusts parameter, C (i) expression node i under in the r-1 wheel bunch, NUM (C (i)) represent this bunch C (i) bunch in number of members;
Step 2: the random number between each node produces 0 to 1; The threshold value that this number and each node are calculated in step 1 compares, if random number is less than threshold value, then the node setting is from as current leader cluster node of taking turns, and bunch header of broadcasting ADV message announcement self; Otherwise more than or equal to threshold value, then the node setting is waited for the ADV message of accepting from bunch head from as ordinary node as if random number;
Step 3: when ordinary node receive from around after the ADV message sent of each bunch hair, will relatively receive the signal strength signal intensity of each bunch message, select the strongest node of signal as the leader cluster node that oneself will add bunch then, and send JOIN message to it;
Step 4: after leader cluster node receives the JOIN message that ordinary node sends, its be set to this bunch bunch in member node, and record; So, the node of close together will be formed bunch;
Step 5: leader cluster node according to bunch in the number of member node produce a time division multiplexing tdm A time slot table, and member node in being broadcast to bunch, the tdma slot table has been specified the affiliated time slot of its transfer of data for member node in each bunch.
3, the election of cluster head method based on soft-threshold according to claim 1 is characterized in that, in described bunch communication with bunch between the step of communicating by letter as follows:
Step 1: member node is carried out transfer of data according to the TDMA time slot that leader cluster node distributes in the time of appointment in bunch, and self data monitored is passed to leader cluster node;
Step 2: leader cluster node receive from bunch in after all data of member, will merge data, then with data through bunch between route reach the Sink node;
4, the election of cluster head method based on soft-threshold according to claim 1 is characterized in that, a described bunch of updating steps is as follows:
Step 1: if node serves as a bunch head in last round of, then reduce it is chosen as bunch head in epicycle probability, the threshold value of epicycle is adjusted into the threshold value of taking turns reduces;
Step 2: if node do not serve as a bunch head in last round of, then increase it is chosen as bunch head in epicycle probability, the threshold value of epicycle is adjusted into the increase of wheel threshold value
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100878994A CN101594657A (en) | 2009-06-25 | 2009-06-25 | In the radio sensing network based on the election of cluster head method of soft-threshold |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100878994A CN101594657A (en) | 2009-06-25 | 2009-06-25 | In the radio sensing network based on the election of cluster head method of soft-threshold |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101594657A true CN101594657A (en) | 2009-12-02 |
Family
ID=41409026
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009100878994A Pending CN101594657A (en) | 2009-06-25 | 2009-06-25 | In the radio sensing network based on the election of cluster head method of soft-threshold |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101594657A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959244A (en) * | 2010-09-29 | 2011-01-26 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN102244882A (en) * | 2011-08-15 | 2011-11-16 | 南通大学 | Mobility-agent-based intelligent data acquisition method for wireless sensor network |
| CN102547904A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Leach protocol-based cluster head election improved algorithm |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
| CN103338494A (en) * | 2013-07-04 | 2013-10-02 | 东南大学 | Heterogenous cluster routing method of wireless sensor network based on energy collection |
| CN103607746A (en) * | 2013-12-02 | 2014-02-26 | 中国联合网络通信集团有限公司 | Method for realizing routing through wireless sensing nodes |
| CN104936230A (en) * | 2015-06-15 | 2015-09-23 | 华侨大学 | Wireless sensor network energy balance route optimization method based on cluster head expectation |
| CN105959989A (en) * | 2016-04-23 | 2016-09-21 | 中国水产科学研究院渔业工程研究所 | Wireless sensor network GPSR protocol based on clustering |
| CN107060735A (en) * | 2017-05-25 | 2017-08-18 | 中国石油天然气股份有限公司 | A kind of natural gas well data collecting system and method |
| CN109041158A (en) * | 2018-06-30 | 2018-12-18 | 沈阳师范大学 | A kind of the wireless sensor neural network intelligent control method and system of the hierarchical routing based on data aggregate |
| CN109819497A (en) * | 2019-02-27 | 2019-05-28 | 中国联合网络通信集团有限公司 | A kind of cluster head selection method and device |
| CN110048945A (en) * | 2019-04-24 | 2019-07-23 | 湖南城市学院 | A kind of node mobility cluster-dividing method and system |
| CN110764822A (en) * | 2019-10-29 | 2020-02-07 | 道崇电子科技（嘉兴）有限公司 | Self-adjudication-based non-master automatic election method |
| CN112929939A (en) * | 2021-02-07 | 2021-06-08 | 电子科技大学 | Ad Hoc network clustering method and device based on Bubble frame |
-
2009
- 2009-06-25 CN CNA2009100878994A patent/CN101594657A/en active Pending
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959244B (en) * | 2010-09-29 | 2013-03-27 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN101959244A (en) * | 2010-09-29 | 2011-01-26 | 浙江工业大学 | Method for controlling hierarchical type route suitable for wireless sensor network |
| CN102244882A (en) * | 2011-08-15 | 2011-11-16 | 南通大学 | Mobility-agent-based intelligent data acquisition method for wireless sensor network |
| CN102244882B (en) * | 2011-08-15 | 2013-10-16 | 南通大学 | Mobility-agent-based intelligent data acquisition method for wireless sensor network |
| CN102547904A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Leach protocol-based cluster head election improved algorithm |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
| CN103338494B (en) * | 2013-07-04 | 2016-04-06 | 东南大学 | The heterogeneous cluster routing method of a kind of wireless sensor network based on collection of energy |
| CN103338494A (en) * | 2013-07-04 | 2013-10-02 | 东南大学 | Heterogenous cluster routing method of wireless sensor network based on energy collection |
| CN103607746A (en) * | 2013-12-02 | 2014-02-26 | 中国联合网络通信集团有限公司 | Method for realizing routing through wireless sensing nodes |
| CN104936230A (en) * | 2015-06-15 | 2015-09-23 | 华侨大学 | Wireless sensor network energy balance route optimization method based on cluster head expectation |
| CN104936230B (en) * | 2015-06-15 | 2018-07-20 | 华侨大学 | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head |
| CN105959989A (en) * | 2016-04-23 | 2016-09-21 | 中国水产科学研究院渔业工程研究所 | Wireless sensor network GPSR protocol based on clustering |
| CN107060735A (en) * | 2017-05-25 | 2017-08-18 | 中国石油天然气股份有限公司 | A kind of natural gas well data collecting system and method |
| CN109041158A (en) * | 2018-06-30 | 2018-12-18 | 沈阳师范大学 | A kind of the wireless sensor neural network intelligent control method and system of the hierarchical routing based on data aggregate |
| CN109819497A (en) * | 2019-02-27 | 2019-05-28 | 中国联合网络通信集团有限公司 | A kind of cluster head selection method and device |
| CN110048945A (en) * | 2019-04-24 | 2019-07-23 | 湖南城市学院 | A kind of node mobility cluster-dividing method and system |
| CN110764822A (en) * | 2019-10-29 | 2020-02-07 | 道崇电子科技（嘉兴）有限公司 | Self-adjudication-based non-master automatic election method |
| CN112929939A (en) * | 2021-02-07 | 2021-06-08 | 电子科技大学 | Ad Hoc network clustering method and device based on Bubble frame |
| CN112929939B (en) * | 2021-02-07 | 2022-04-08 | 电子科技大学 | Ad Hoc network clustering method and device based on Bubble frame |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101594657A (en) | In the radio sensing network based on the election of cluster head method of soft-threshold | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| Wei et al. | An energy-efficient clustering solution for wireless sensor networks | |
| CN101841884B (en) | Wireless sensor network cluster head inheritance clustering method based on energy | |
| CN102026331B (en) | Distributed multi-jump energy-saving communication method in wireless sensor network | |
| Palan et al. | Low energy adaptive clustering hierarchy (LEACH) protocol: A retrospective analysis | |
| Liu et al. | A reliable clustering algorithm base on LEACH protocol in wireless mobile sensor networks | |
| CN102083101B (en) | Information transmission method for cognitive radio sensor network | |
| CN103916942A (en) | LEACH protocol improvement method capable of lowering energy consumption | |
| CN105323818A (en) | Energy-saving clustering routing method based on network regional division and distances | |
| Golsorkhtabar et al. | The novel energy adaptive protocol for heterogeneous wireless sensor networks | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| CN101896002B (en) | Rapid data aggregation-oriented wireless sensor and actor network clustering method | |
| CN106792973A (en) | Cluster head election and its shift process in a kind of energy heterogeneous wireless sensor network | |
| CN102665171A (en) | Routing control method based on big-scale WSN (wireless sensor network) emergency monitoring | |
| CN102523588B (en) | Method for reducing interruption probability of large-scale wireless self-organizing network | |
| Lindsey et al. | Energy efficient broadcasting for situation awareness in ad hoc networks | |
| Wang et al. | A radio frequency energy harvesting-based multihop clustering routing protocol for cognitive radio sensor networks | |
| Bala et al. | Proficient D-SEP protocol with heterogeneity for maximizing the lifetime of wireless sensor networks | |
| CN105072673A (en) | High-energy efficiency node scheduling method based on multi-channel TDMA | |
| Kapoor et al. | A survey on energy efficient routing for delay minimization in iot networks | |
| CN102448139A (en) | Hierarchical routing method for wireless sensor network | |
| Neamatollahi et al. | A distributed clustering scheme for wireless sensor networks | |
| Prakash et al. | Best cluster head selection and route optimization for cluster based sensor network using (M-pso) and Ga algorithms |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20091202 |