Dynamic Cluster Head Selection Method for Wireless Sensor Network

In view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced e...

Full description

Saved in:
Bibliographic Details
Published in:IEEE sensors journal 2016-04, Vol.16 (8), p.2746-2754
Main Authors: Jia, Dongyao, Zhu, Huaihua, Zou, Shengxiong, Hu, Po
Format: Article
Language:English
Subjects:
Algorithms
Clustering
Clustering algorithms
dynamic
energy
Energy consumption
Heuristic algorithms
Monitoring
redundancy node
Sensor phenomena and characterization
the average remaining
Wireless networks
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2015.2512322