Abstract

An important characteristic that distinguishes wireless sensor networks (WSNs) from other distributed systems is their need for energy efficiency because sensors have finite energy reserve. Since there is no fixed infrastructure or centralized management in WSN, a connected dominating set (CDS) has been proposed as a virtual backbone. The CDS plays a major role in routing, broadcasting, coverage and activity scheduling. To reduce the traffic during communication and prolong network lifetime, it is desirable to construct a minimum CDS (MCDS).  The MCDS problem has been studied intensively in unit disk graph (UDG), in which the nodes have the same transmission range. In real world, this kind of networks is not necessarily containing nodes with equal transmission range. In this paper, a new timer-based energy-aware distributed algorithm for MCDS problem in disk graph with bidirectional links (DGB), in which nodes have different transmission ranges, is introduced which has outstanding time and message complexity ofand constant approximation ratio. Theoretical analysis and simulation results are also presented to verify our approach’s efficiency.

Key words: Disk graphs, energy-aware, minimum connected dominating set, virtual backbone, wireless sensor network.