Research Article
A Tree-Based Multiple-Hop Clustering Protocol for Wireless Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-17994-5_25, author={Yingjun Jiang and Chung-Horng Lung and Nishith Goel}, title={A Tree-Based Multiple-Hop Clustering Protocol for Wireless Sensor Networks}, proceedings={Ad Hoc Networks. Second International Conference, ADHOCNETS 2010, Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={5}, keywords={wireless sensor networks clustering multi-hop minimum spanning tree performance evaluation}, doi={10.1007/978-3-642-17994-5_25} }- Yingjun Jiang
Chung-Horng Lung
Nishith Goel
Year: 2012
A Tree-Based Multiple-Hop Clustering Protocol for Wireless Sensor Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-17994-5_25
Abstract
This paper introduces a static Tree-based Multiple-Hop Distributed Hierarchical Agglomerative Clustering (TMH-DHAC) approach for wireless sensor networks (WSNs). The proposed TMH-DHAC is derived from the Hierarchical Agglomerative Clustering (HAC) and the distributed HAC (DHAC) methods. TMH-DHAC adopts an energy-aware cluster-head election policy to balance the energy consumption and workload among sensor nodes in the network. The multi-hop tree structure provides the near-optimal routes for intra-cluster data transmissions. The proposed TMH-DHAC method for the time-slot allocation enables simultaneous conflict-free communications between different pairs of sensors and increases the maximum transmission throughput. The simulation results show that TMH-DHAC performs better than previous approaches: LEACH, LEACH-C and the DHAC-RSS (Received Signal Strength) protocols, in terms of the network lifetime, total data amount, energy efficiency, and average transmission distance.