Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks

Julia Albath
Mayur Thakur
Sanjay Kumar Madria, Missouri University of Science and Technology

This document has been relocated to

There were 8 downloads as of 28 Jun 2016.


Using partitioning in wireless sensor networks to create clusters for routing, data management, and other protocols has been proven as a way to ensure scalability and to deal with sensor network shortcomings such as limited communication ranges and energy. Choosing a cluster head within each cluster is important because cluster heads use additional energy for their responsibilities and that burden needs to be carefully passed around. Many existing protocols either choose cluster heads randomly or use nodes with the highest remaining energy. We introduce the energy constrained minimum dominating set (ECDS) to model the problem of optimally choosing cluster heads with energy constraints. We propose a distributed algorithm for the constrained dominating set which runs in O(log n log Δ) rounds with high probability. We experimentally show that the distributed algorithm performs well in terms of energy usage, node lifetime, and clustering time and, thus, is very suitable for wireless sensor networks.