Title: GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks

Authors: Manish Kumar; Shekhar Verma; Neerav Agarwal

Addresses: Indian Institute of Information Technology, Deoghat, Jhalwa, Allahabad – 211012, India ' Indian Institute of Information Technology, Deoghat, Jhalwa, Allahabad – 211012, India ' Sapient Consulting Private Limited, Unitech Infospace, SEZ, Gurgaon-122016, India

Abstract: Data gathering plays an important role in several applications of wireless sensor network (WSN). In an energy constrained WSN environment, the data gathering must be energy efficient to maximise the operational lifetime of the network. This paper proposes GMCA for data gathering which makes a dynamic backbone for data transfer to the base station. This results in the enhancement of the network lifetime. The approach endeavours to find the most energy efficient path for every message and distribute energy consumption evenly in the network simultaneously. Simulation results show that GMCA performs better than existing algorithms and enhances the lifetime of a sensor network significantly.

Keywords: wireless sensor networks; WSNs; relays; rooted trees; network lifetime; GMCA; data gathering; greedy clustering algorithms; multilevel clustering algorithms; energy efficiency; energy consumption.

DOI: 10.1504/IJCNDS.2013.055518

International Journal of Communication Networks and Distributed Systems, 2013 Vol.11 No.2, pp.198 - 213

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 18 Jun 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article