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.
Highlights
Wireless sensor networks (WSNs) have attracted a great deal of research attention due to their wide range of potential applications
There is no physical backbone infrastructure, a virtual backbone can be formed by constructing a connected dominating set (CDS)
We verify our algorithm by evaluate its performance on random networks in terms of CDS size, message overhead, average energy consumption per node in CDS construction and the number of the rounds that the network survives until can not construct a
Summary
Wireless sensor networks (WSNs) have attracted a great deal of research attention due to their wide range of potential applications. In practice, the transmission ranges of all nodes are not necessary equal In this case, a WSN can be modeled using a directed graph G(V , E). Thai et al (2007) proposed the first distributed algorithm for MCDS in DGB with the constant approximation ratio and the time and message complexity of O(n2 ) , which is dominated by MIS phase. Their algorithms in this phase using SORT list for finding node with largest transmission range among its neighbors. The algorithm has the time and message complexity of O(n) that it is the very better than (Thai et al, 2007)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
