Improving construction for connected dominating set with steiner tree in wireless sensor networks

Abstract

The connected dominating set plays an important role in ad hoc wireless networking. Many constructions for approximating the minimum connected dominating set have been proposed in the literature. In this paper we propose a new one with Steiner tree which produces approximation solution within a factor of 6.8 from optimal. This approximation algorithm can also be implemented distributedly. © Springer 2006.