Authors: Adel Youssef, Mohamed F. Younis, Moustafa Youssef, Ashok Agrawala
Addresses: Google Inc., University of Maryland, College Park, MD 20742, USA. ' Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore Country, Baltimore, MD 21250, USA. ' Department of Computer Science, University of Maryland, College Park, MD 20742, USA. ' Department of Computer Science, University of Maryland, College Park, MD 20742, USA
Abstract: The past few years have witnessed increased interest in the potential use of Wireless Sensor Networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Grouping nodes into clusters has been the most popular approach for achieving efficient and scalable performance in WSNs. Most of the published algorithms strive to partition the sensors into disjoint clusters. However, we argue that guaranteeing some degree of overlap among clusters can facilitate many applications, like intercluster routing, topology discovery and node localisation, recovery from Cluster Head (CH) failure, etc. We formulate the overlapping multihop clustering problem as an extension to the k-Dominating Set (KDS) problem. Then we propose Multihop Overlapping Clustering Algorithm (MOCA); a randomised distributed multihop clustering algorithm for organising the sensors into overlapping clusters. MOCA is validated in a simulated environment. The simulation results demonstrate that MOCA is scalable, introduces low overhead and produces approximately equal-sized clusters.
Keywords: clustering; k-dominating set; KDS; ad hoc networks; wireless sensor networks; WSNs; wireless networks; multihop clusters; overlapping clusters; simulation.
International Journal of Sensor Networks, 2007 Vol.2 No.1/2, pp.108 - 117
Published online: 02 Apr 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article