Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Power balanced coverage-time optimization for clustered wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Scheduling sleeping nodes in high density cluster-based sensor networks
Mobile Networks and Applications
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Balanced-energy sleep scheduling scheme for high-density cluster-based sensor networks
Computer Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Wireless Sensor Network (WSN) is an active area of research today. A WSN consists of a number of sensor nods each with limited energy, bandwidth, storage, and processing capability. Clustering is one of the basic approaches for designing energy-efficient, robust and highly scalable distributed sensor networks. One of the approaches to enhance the lifetime of WSN is to allow only some nodes in a cluster of sensor nodes, called cluster heads, to communicate with the base station. In this paper, we take a unique look at the cluster head election problem, specifically concentrating on Homogeneous Wireless Sensor Networks. Our approach for cluster-based network organization is based on a Voronoi diagram that favor nodes deployed in densely populated network areas as better candidates for cluster head nodes, active sensor nodes and routers.