Abstract
This paper proposes a clustering algorithm - Balanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead. The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that it specifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
| Original language | English |
|---|---|
| Title of host publication | 2010 7th International Multi-Conference on Systems, Signals and Devices, SSD-10 |
| DOIs | |
| State | Published - 2010 |
| Externally published | Yes |
Publication series
| Name | 2010 7th International Multi-Conference on Systems, Signals and Devices, SSD-10 |
|---|
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Clustering
- Load-Balancing
- Wireless sensor networks
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
- Control and Systems Engineering
Fingerprint
Dive into the research topics of 'Algorithmic construction of optimal and load balanced clusters in wireless sensor networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver