A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
In the absence of infrastructure and facing the dynamically changing topology, efficient message routing is one of the most important issues in wireless ad hoc networks. Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. In this paper, we propose a simple and efficient distributed algorithm for constructing a connecteddoi:10.1109/mahss.2004.1392211 dblp:conf/mass/HanFLJ04 fatcat:vspeen2rl5cybf5abps5yihx4u