作者: Peng-Jun Wan , Khaled M. Alzoubi , Ophir Frieder
DOI: 10.1023/B:MONE.0000013625.87793.13
关键词:
摘要: Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None these constant factors. Thus cannot guarantee to generate a CDS small size. Their message complexities can be high O(n2), and time may also large O(n2) O(n3). We then present our own algorithm that outperforms existing algorithms. This an factor at most 8, O(n) complexity O(n log n) complexity. By establishing Ω(n lower bound on any nontrivial CDS, is thus message-optimal.