Connected dominating sets in disk graphs with bidirectional links |
| |
Authors: | Thai MT Du D-Z |
| |
Affiliation: | Dept. of Comput. Sci. & Eng., Minnesota Univ., Minneapolis, MN, USA; |
| |
Abstract: | In this paper, we study the connected dominating set (CDS) problem in disk graphs. The CDS problem has a significant impact on an efficient design of routing protocols in wireless networks. This problem has been studied extensively in unit disk graphs, in which each node has the same transmission range. However, in wireless ad hoc networks, the transmission ranges of all nodes are not necessary equal. In this paper, we introduce the CDS problem in disk graphs and present a constant approximation algorithm which can be implemented as a distributed algorithm. |
| |
Keywords: | |
|
|