EECHE: an energy-efficient cluster head election algorithm in sensor networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
A density and distance based cluster head selection algorithm in sensor networks
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
A Centralized Balance Clustering Routing Protocol for Wireless Sensor Network
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In the development of wireless sensor networks applications, how to organize the sensors into a wireless communication network and route the sensed data from the field sensors to a remote base station is a particular challenging problem. In this paper, we present a novel clustering technique for wireless sensor networks. During the phrase of cluster initialization, the sensed zone is divided into several virtual hexagons which it can avoid the overlapping nodes of circular cluster. Furthermore, we make some sub-circle in the formatted virtual hexagon base on the average distance between the common nodes and the cluster's center. Depending on the special factor's value, each node will form a cluster heads order list. The clustering technique adopts a new method for cluster head election, which can avoid the frequent election of cluster head. Simulation results demonstrate that our proposed algorithm is effective in prolonging the lifetime of networks.