¹School of IT, Madsen Bldg. F09, University of Sydney, NSW 2006, Australia
²School of Economics & Information Systems, University of Wollongong, Wollongong NSW 2522 Australia

---

Abstract—Wireless sensor networks afford a new opportunity to observe and interact with physical phenomena at an unprecedented fidelity. To fully realize this vision, these networks have to be self-organizing, selfhealing, economical and energy-efficient simultaneously. Since the communication task is a significant power consumer, there are various attempts to introduce energyawareness within the communication stack. Node clustering, to reduce direct transmission to the base station, is one such attempt to control energy dissipation for sensor data gathering. In this work, we propose an efficient dynamic clustering algorithm to achieve a network-wide energy reduction in a multihop context. We also present a realistic energy dissipation model based on the results from stochastic geometry to accurately quantify energy consumption employing the proposed clustering algorithm for various sensor node densities, network areas and transceiver properties.

Index Terms—data gathering, clustering, energy efficient, stochastic geometry, wireless sensor network

[PDF]

Cite: Selvadurai Selvakennedy, Sukunesan Sinnappan, "An Energy-Efficient Clustering Algorithm for Multihop Data Gathering in Wireless Sensor Networks," Journal of Computers vol. 1, no.1, pp. 40-47, 2006.