The Community for Technology Leaders
RSS Icon
Big Island, HI
Jan. 10, 2002 to Jan. 10, 2002
ISBN: 0-7695-1435-9
pp: 297
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDS of small size. Their message complexities can be as high as $O\left(n^{2}\right) $, and their time complexities may also be as large as $O\left(n^{2}\right) $ and $O\left(n^{3}\right) $. We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, $O\left(n\right) $ time complexity and $O\left(n\log n\right) $ message complexity. By establishing the $\Omega\left(n\log n\right) $ lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.
wireless ad hoc networks, distributed algorithm, connected dominating set, independent set, leader election, spanning tree
K. Alzoubi, P.-J. Wan, O. Frieder, "New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks", HICSS, 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Proceedings of the 35th Annual Hawaii International Conference on System Sciences 2002, pp. 297, doi:10.1109/HICSS.2002.994519
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool