A Dynamic Multiple Custer-head Clustering Algorithm for Wireless Networks

DOI

10.2991/emcs-16.2016.19How to use a DOI?

Keywords

Wireless sensor networks; Dynamic; Multiple cluster-head; Clustering algorithm; Energy balance

Abstract

At present, the technology of wireless sensors develops rapidly, there are more and more studies in this area, especially the researches of sensor node energy. In this paper, we propose a new algorithm which named a dynamic multiple cluster-head clustering algorithm. In this algorithm, according to the energy of each node and nodes density, we divide the networks into seveal cluster structure. In each cluster structure, the cluster structure is divided into several layers according to the sink node hops. Each layer is independent from each other, then in the layer, we select a cluster head node, and only the cluster-head can communicates with each other. The rest of nodes will be selected as the cluster head nodes, the remaining nodes of each layer are regarded as children nodes cluster head nodes of cluster head nodes. In this way, we can get a new network topology structure and reselect the cluster head irregularly according the method which mentioned above. The algorithm that we proposed can guaranteeing a balanced energy consumption, and prolong the lifetime of the network.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Fei Lu
AU  - Yi Liu
AU  - Yongyi Zhao
PY  - 2016/01
DA  - 2016/01
TI  - A Dynamic Multiple Custer-head Clustering Algorithm for Wireless Networks
BT  - Proceedings of the 2016 International Conference on Education, Management, Computer and Society
PB  - Atlantis Press
SP  - 78
EP  - 81
SN  - 2352-538X
UR  - https://doi.org/10.2991/emcs-16.2016.19
DO  - 10.2991/emcs-16.2016.19
ID  - Lu2016/01
ER  -