Distributed algorithm for connected Dominating Sets in Wireless Sensor Networks with different transmission ranges

Since there is no fixed infrastructure or centralized management in wireless sensor networks (WSNs), 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. The CDS problem has been studied intensively in unit disk graph (UDG), in which each node has the same transmission range. In real world this kind of networks are not necessarily contain nodes with equal transmission range. Recently one research has investigated the CDS problem in disk graph with bidirectional links (DGB), in which nodes have different transmission ranges. This approach has constant Approximation ratio with time and message complexity of O(n
²
). In this paper, a new distributed algorithm for CDS problem in DGB with constant approximation ratio is introduced which has outstanding time complexity of O(n) and message complexity of O(nlog n).