Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
A Self-Reorganizing Slot Allocation protocol for multi-cluster sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network
International Journal of Sensor Networks
Hi-index | 0.02 |
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.