| Summary: | Limited energy of the sensors is one of the key issues towards realizing a reliable wireless sensor network (WSN), which can survive under the emerging WSN applications. A promising method for conserving the energy of these sensors can be implemented by applying a sleep-wake scheduling while distributing the data gathering and sensing tasks to a dominating set of awake sensors while the other nodes are in a sleep mode. Producing the maximum possible number of such disjoint dominating sets, called the domatic partition problem in unit disk graphs, can further prolong the network lifetime. This problem becomes challenging when the initial energy of the nodes varies from one to another. In this paper, we introduce multiple local search algorithms that can improve the total lifetime of WSNs consisting of nodes with varying initial energy. We discuss the performance of the existing dominating set algorithm and introduce three more algorithms which can be applied on multiple disjoint dominating sets with nodes having varying initial energy. We discuss the efficiency of each of the algorithms through extensive simulations.
|
|---|
