CN104411000A - Method for selecting cluster head of hierarchical routing protocol in wireless sensor network - Google Patents

Method for selecting cluster head of hierarchical routing protocol in wireless sensor network Download PDF

Info

Publication number
CN104411000A
CN104411000A CN201410770123.3A CN201410770123A CN104411000A CN 104411000 A CN104411000 A CN 104411000A CN 201410770123 A CN201410770123 A CN 201410770123A CN 104411000 A CN104411000 A CN 104411000A
Authority
CN
China
Prior art keywords
node
cluster head
bunch head
energy
nodes
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
Application number
CN201410770123.3A
Other languages
Chinese (zh)
Inventor
李忠民
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanchang Hangkong University
Original Assignee
Nanchang Hangkong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanchang Hangkong University filed Critical Nanchang Hangkong University
Priority to CN201410770123.3A priority Critical patent/CN104411000A/en
Publication of CN104411000A publication Critical patent/CN104411000A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H04W84/20Master-slave selection or change arrangements
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

In a low-energy adaptive clustering hierarchy protocol, a cluster head is randomly selected and not limited by parameters such as node energy and distance, and an energy consumption imbalance probability exists in a wireless sensor network and can cause the situation that the network lifetime is shortened. The invention discloses a method for selecting the cluster head of a hierarchical routing protocol in the wireless sensor network; the method is a new method for selecting the cluster head of the hierarchical routing protocol. According to the method, the selection of a cluster head node takes the residual energy of the cluster head into account to guarantee balance of energy consumption in the network. The method has the advantages that the disadvantage of energy consumption imbalance of a cluster head node caused by no consideration of energy consumption imbalance of the cluster head node in an existing method is overcome, the cluster head is selected by taking the residual energy of the node into account, the energy efficiency is improved, and the network lifetime is prolonged.

Description

Hierarchical routing protocol bunch head system of selection in a kind of wireless sensor network
Technical field
The present invention relates to the actualizing technology of hierarchical routing protocol bunch head system of selection in wireless sensor network, can be used for the massive wireless sensor of laminated devices, belong to areas of information technology, be specifically related to hierarchical routing protocol bunch head system of selection in a kind of wireless sensor network.
Background technology
Along with the continuous expansion of wireless sensor network application and network size, the main flow that hierarchical routing protocol becomes wireless sensor network is gradually selected.Network hierarchical routing protocol of wireless sensor is the earliest LEACH agreement, and it is typical Clustering protocol, and nowadays many hierarchical routing protocols all develop on LEACH protocol basis.
LEACH is proposed by people such as Heinzelman, and this agreement is a kind of self-organizing, self adaptation collection bunch agreement, and it uses random mode the energy load of whole network to be evenly distributed in each sensor node.Be divided into multiple this locality collection bunch at LEACH interior joint, each bunch has a node as local aggregation node or bunch head.Other nodes can accept the state information of bunch heads, and will belong to which bunch by selecting a bunch head for minimal communications energy to decide node itself.LEACH is an example of single-hop individual-layer data polymerization as shown in Figure 1.
In order to energy load be assigned on node as much as possible, the operation of LEACH is divided into multiple wheel, and each is taken turns and is divided into two stages, establishment stage namely bunch and stable operation stage.First stage groundwork be bunch head selection and bunch structure, second stage is that the data gathered are carried out the process transmitted.
Bunch establishment stage, first to carry out the selection of bunch head, namely determine which node becomes bunch head of epicycle.In LEACH agreement, the system of selection of bunch head is: the n-th node produces the random number between 0 to 1, if the value of this random number is less than threshold value , so this node becomes bunch head of epicycle.Threshold value in LEACH calculating by formula (1) calculate come:
(1)
Wherein, n is the sequence number of node, and P is the percentage that leader cluster node accounts for all nodes in system, and r is for working as front-wheel number, and G is the node set of elected bunch head in nearest 1/P takes turns.
In the stabilization sub stage, each node of transducer is by the tidal data recovering of collection and be sent to aggregation node or sent to the owner of network by leader cluster node.Leader cluster node carries out data fusion to the data gathered and namely mass data is compressed, and then information is sent to.Therefore, more consume energy than non-leader cluster node as a leader cluster node.
Node serves as bunch head in turn and the energy of bunch head can be avoided to exhaust rapidly, and the end in the useful life of all nodes be connected with bunch head node.So bunch head selection, topological structure and data route are the emphasis of LEACH agreement current research.
In the above-mentioned methods, the life span of network can be improved, depend on the assumed condition that LEACH agreement uses, the applied environment whether these assumed conditions are realistic, directly have influence on the performance of LEACH agreement.LEACH agreement hypothesis is selected in bout at initial bunch of head, and the energy of all nodes is identical, and each node energy consumption becoming bunch head is roughly the same, is not suitable for the unbalanced wireless sensor network of node energy.The present invention is directed to the problems referred to above and propose solution.
Summary of the invention
The object of the present invention is to provide hierarchical routing protocol bunch head system of selection in a kind of wireless sensor network, this system of selection improves for above-mentioned mechanism.
The present invention is achieved like this, hierarchical routing protocol bunch head system of selection in a kind of wireless sensor network, and first assumed wireless sensor network has N number of node, and number consecutively is 1,2 ..., N; When the dump energy of node is not 0, be called active node, when the dump energy of node is 0, be called death nodes; It is characterized in that method step is as follows:
(1) take turns the 1st, the selection of bunch head is identical with LEACH agreement, that is: the node being numbered n (0<n≤N) produces the random number between 0 to 1, if the value of this random number is less than threshold value , so this node becomes bunch head of epicycle; Otherwise node is non-leader cluster node; Threshold value in LEACH calculating by formula (1) calculate come:
(1)
Wherein, n is the numbering of node, and P is the percentage that leader cluster node accounts for all nodes in system, and r is for working as front-wheel number, and G is the node set of elected bunch head in nearest 1/P takes turns;
(2) at r (r>1) wheel, first, calculate by formula (2) the average energy E that r takes turns all active nodes mean(r);
(2)
(3)
Here, E (n, r-1) is the dump energy that the n-th node is taken turns at (r-1).
L (n) represents the state that the n-th node is taken turns at this, be this node of 0 expression is death nodes, be this node of 1 expression is active node.
Base station broadcast E meanr () is to all active nodes.
Dump energy weight EW (n, the r) computing formula that r takes turns node n (0<n≤N) is
(4)
R takes turns bunch head system of selection: the node being numbered n (0<n≤N) produces the random number between 0 to 1, calculates its threshold value T (n, r)
(5)
Wherein, n is the numbering of node, P is the percentage that leader cluster node accounts for all nodes in system, r is for working as front-wheel number, G is the node set of not elected bunch head in nearest 1/P takes turns, EW (n, r) is the dump energy weight that r takes turns node n (0<n≤N); When this random number is than threshold value T (n, r) hour, this node will become the leader cluster node of epicycle.
The range of application that the present invention is possible: in the massive wireless sensor of laminated devices.
Advantage of the present invention is: solve existing method and do not consider that leader cluster node is unbalanced, thus cause the unbalanced drawback of leader cluster node energy ezpenditure, by considering that the dump energy of node selects a bunch head, improve energy efficiency, extending network lifetime.
Accompanying drawing explanation
Fig. 1 is LEACH agreement single-hop individual-layer data paradigmatic structure schematic diagram in background technology of the present invention.
Embodiment
The application process of the present invention in massive wireless sensor is illustrated below with example.In instances, suppose that base station can obtain the number of the total dump energy information of system and active node.In each is taken turns, each active node has an energy weight, and this energy weight is used for changing the probability that this node becomes leader cluster node.When this energy weight is greater than 1, the possibility that this node becomes leader cluster node will increase.
Bunch same LEACH of head system of selection of the first round.
Kth (k>1) is taken turns, and calculates the dump energy information that (k-1) takes turns each node, takes turns the average energy E of all active nodes by following formulae discovery kth mean(k).
(0<n≤100)
Here, E (n, k-1) is the dump energy that the n-th node is taken turns at (k-1).
L (n) represents the state that the n-th node is taken turns at this, be this node of 0 expression is death nodes, be this node of 1 expression is active node.
Base station broadcast E meank () is to all active nodes.
Dump energy weight EW (n, the k) computing formula of kth wheel node n (0<n≤100) is
When a node determine it kth wheel energy weight, it can judge whether oneself becomes leader cluster node.Its strategy is: the random number between producing 0 to 1, calculates its threshold value T (n, k)
When this random number is larger than threshold value T (n, k), this node will become leader cluster node.

Claims (1)

1. a hierarchical routing protocol bunch head system of selection in wireless sensor network, first assumed wireless sensor network has N number of node, and number consecutively is 1,2 ..., N; When the dump energy of node is not 0, be called active node, when the dump energy of node is 0, be called death nodes; It is characterized in that method step is as follows:
(1) take turns the 1st, the selection of bunch head is identical with LEACH agreement, that is: the node being numbered n (0<n≤N) produces the random number between 0 to 1, if the value of this random number is less than threshold value , so this node becomes bunch head of epicycle; Otherwise node is non-leader cluster node; Threshold value in LEACH calculating by formula (1) calculate come:
(1)
Wherein, n is the numbering of node, and P is the percentage that leader cluster node accounts for all nodes in system, and r is for working as front-wheel number, and G is the node set of elected bunch head in nearest 1/P takes turns;
(2) at r (r>1) wheel, first, calculate by formula (2) the average energy E that r takes turns all active nodes mean(r);
(2)
(3)
Here, E (n, r-1) is the dump energy that the n-th node is taken turns at (r-1);
L (n) represents the state that the n-th node is taken turns at this, be this node of 0 expression is death nodes, be this node of 1 expression is active node;
Base station broadcast E meanr () is to all active nodes;
Dump energy weight EW (n, the r) computing formula that r takes turns node n (0<n≤N) is
(4)
R takes turns bunch head system of selection: the node being numbered n (0<n≤N) produces the random number between 0 to 1, calculates its threshold value T (n, r)
(5)
Wherein, n is the numbering of node, P is the percentage that leader cluster node accounts for all nodes in system, r is for working as front-wheel number, G is the node set of not elected bunch head in nearest 1/P takes turns, EW (n, r) is the dump energy weight that r takes turns node n (0<n≤N); When this random number is than threshold value T (n, r) hour, this node will become the leader cluster node of epicycle.
CN201410770123.3A 2014-12-15 2014-12-15 Method for selecting cluster head of hierarchical routing protocol in wireless sensor network Pending CN104411000A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410770123.3A CN104411000A (en) 2014-12-15 2014-12-15 Method for selecting cluster head of hierarchical routing protocol in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410770123.3A CN104411000A (en) 2014-12-15 2014-12-15 Method for selecting cluster head of hierarchical routing protocol in wireless sensor network

Publications (1)

Publication Number Publication Date
CN104411000A true CN104411000A (en) 2015-03-11

Family

ID=52648582

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410770123.3A Pending CN104411000A (en) 2014-12-15 2014-12-15 Method for selecting cluster head of hierarchical routing protocol in wireless sensor network

Country Status (1)

Country Link
CN (1) CN104411000A (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104869604A (en) * 2015-06-09 2015-08-26 北京交通大学 RPL-based layer type route establishment method of wireless sensor network
CN105722174A (en) * 2016-02-01 2016-06-29 国网新疆电力公司电力科学研究院 Node link scheduling method of heterogeneous integrated power consumption information collection network
CN105898679A (en) * 2016-03-31 2016-08-24 中南大学 Method for collecting heterogeneous sensing data based on representative nodes and multilayer fusion
CN106507425A (en) * 2016-10-11 2017-03-15 北京邮电大学 It is applied to the effective clustering method of modified model distributed energy of heterogeneous wireless sensor net
CN106850826A (en) * 2017-02-23 2017-06-13 上海喆之信息科技有限公司 Long-distance management system outside a kind of medical institute
CN106899670A (en) * 2017-02-23 2017-06-27 上海耐相智能科技有限公司 Based on big data pest and disease monitoring early warning system
CN106911774A (en) * 2017-02-23 2017-06-30 深圳汇通智能化科技有限公司 A kind of Internet of Things wireless intelligent home security system
CN108307471A (en) * 2018-01-12 2018-07-20 武汉大学 A kind of cluster-head node selection algorithm of energy balance
CN110049526A (en) * 2019-04-12 2019-07-23 山东师范大学 Based on the method for data capture and system for improving cluster algorithm in WSN

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101188535A (en) * 2007-12-06 2008-05-28 上海大学 Method for identifying the section energy balance route of wireless sensor network based on 2-child tree
US20090092112A1 (en) * 2007-10-09 2009-04-09 Eui Jik Kim Wireless sensor network system and cluster management method thereof
CN101841884A (en) * 2010-04-30 2010-09-22 北京航空航天大学 Wireless sensor network cluster head inheritance clustering method based on energy
US20140185503A1 (en) * 2012-12-28 2014-07-03 Unisys Corporation Communication protocol for wireless sensor networks using communication and energy costs

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090092112A1 (en) * 2007-10-09 2009-04-09 Eui Jik Kim Wireless sensor network system and cluster management method thereof
CN101188535A (en) * 2007-12-06 2008-05-28 上海大学 Method for identifying the section energy balance route of wireless sensor network based on 2-child tree
CN101841884A (en) * 2010-04-30 2010-09-22 北京航空航天大学 Wireless sensor network cluster head inheritance clustering method based on energy
US20140185503A1 (en) * 2012-12-28 2014-07-03 Unisys Corporation Communication protocol for wireless sensor networks using communication and energy costs

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
白凤娥,王莉莉,马艳艳, 田霖: "无线传感器网络路由协议LEACH的算法分析", 《太原理工大学学报》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104869604B (en) * 2015-06-09 2018-08-10 北京交通大学 The number of plies type method for routing foundation of wireless sensor network based on RPL
CN104869604A (en) * 2015-06-09 2015-08-26 北京交通大学 RPL-based layer type route establishment method of wireless sensor network
CN105722174A (en) * 2016-02-01 2016-06-29 国网新疆电力公司电力科学研究院 Node link scheduling method of heterogeneous integrated power consumption information collection network
CN105898679A (en) * 2016-03-31 2016-08-24 中南大学 Method for collecting heterogeneous sensing data based on representative nodes and multilayer fusion
CN105898679B (en) * 2016-03-31 2019-09-20 中南大学 It is a kind of based on the heterogeneous sensor method of data capture for representing node more and being merged with multilayer
CN106507425A (en) * 2016-10-11 2017-03-15 北京邮电大学 It is applied to the effective clustering method of modified model distributed energy of heterogeneous wireless sensor net
CN106507425B (en) * 2016-10-11 2020-02-07 北京邮电大学 Improved distributed energy efficient clustering method suitable for heterogeneous wireless sensor network
CN106911774A (en) * 2017-02-23 2017-06-30 深圳汇通智能化科技有限公司 A kind of Internet of Things wireless intelligent home security system
CN106899670A (en) * 2017-02-23 2017-06-27 上海耐相智能科技有限公司 Based on big data pest and disease monitoring early warning system
CN106850826A (en) * 2017-02-23 2017-06-13 上海喆之信息科技有限公司 Long-distance management system outside a kind of medical institute
CN108307471A (en) * 2018-01-12 2018-07-20 武汉大学 A kind of cluster-head node selection algorithm of energy balance
CN108307471B (en) * 2018-01-12 2020-09-25 武汉大学 Energy balance cluster head node selection method
CN110049526A (en) * 2019-04-12 2019-07-23 山东师范大学 Based on the method for data capture and system for improving cluster algorithm in WSN

Similar Documents

Publication Publication Date Title
CN104411000A (en) Method for selecting cluster head of hierarchical routing protocol in wireless sensor network
Mohapatra et al. Energy management in wireless sensor network through EB-LEACH
CN104284386B (en) Wireless sensor network cluster head selection method based on betweenness
Kumar et al. DE-LEACH: distance and energy aware LEACH
Gupta et al. Energy aware data collection in wireless sensor network using chain based PEGASIS
CN101572662A (en) Energy-saving packet forwarding method based on position information in wireless sensor network
Chaudhary et al. Review paper on energy-efficient protocols in wireless sensor networks
KR101387248B1 (en) Generating method for balanced chain topology in wireless sensor networks
CN103338492B (en) A kind of heterogeneous wireless sensor network cluster-dividing method based on DEEC method
CN102983948A (en) Adaptive clustering transmission method and device for wireless sensor network
Wang et al. Energy-efficient dual prediction-based data gathering for environmental monitoring applications
Ibrahim et al. Comparative Study of Energy Saving Routing Protocols for Wireless Sensor Networks
Manjusha et al. Efficient cluster head selection method for wireless sensor network
Ovaliadis et al. A new approach for a better recovery of cluster head nodes in underwater sensor networks
Kumar et al. MEEP: multihop energy efficient protocol for heterogeneous wireless sensor network
Bhindu et al. An Energy Efficient Cluster Based Data Aggregation in Wireless Sensor Network
Abouelkhair et al. Hierarchal energy efficient network protocol for wireless sensing
Islam et al. Recent trends in energy-efficient clustering in WSNs
Bisht et al. Performance analysis of hierarchical and nonhierarchical routing techniques in wireless sensor networks
Zhang et al. OCTBR: optimized clustering tree based routing protocol for wireless sensor networks
Han et al. EBRP: An energy balance routing protocol for wireless sensor network with intermittent connectivity
Dahda et al. Energy Efficient Hybrid Technique Based on Dynamic Clustering in Wireless Sensor Network
Divya et al. Modified low energy adaptive clustering hierarchy for heterogeneous wireless sensor network
Guo et al. Distributed energy balanced routing for wireless sensor network using energy prediction metric
Nghiem et al. A coverage and energy aware cluster-head selection algorithm in wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20150311

RJ01 Rejection of invention patent application after publication