Establishing overlapped multihop clusters in wireless sensor networks
by Adel Youssef, Mohamed F. Younis, Moustafa Youssef, Ashok Agrawala
International Journal of Sensor Networks (IJSNET), Vol. 2, No. 1/2, 2007

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.

Online publication date: Mon, 02-Apr-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com