Efficient construction of connected dominating set in wireless ad hoc networks

Bo Han, HaoHuan Fu, Lidong Lin, Weijia Jia
2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)  
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 connected
more » ... g set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n) respectively. The dominating set generated from our algorithm can be more reliable and load balanced for routing as compared with some wellknown algorithms. The simulation results demonstrate that our algorithm outperforms the previous work in terms of the size of resultant connected dominating set.
doi:10.1109/mahss.2004.1392211 dblp:conf/mass/HanFLJ04 fatcat:vspeen2rl5cybf5abps5yihx4u