Connected dominating sets in wireless networks with different transmission ranges

My T. Thai, Feng Wang, Dan Liu, Shiwei Zhu, Ding Zhu Du

Research output: Contribution to journalArticle

132 Scopus citations

Abstract

Since there is no fixed infrastructure or centralized management in wireless ad hoc networks, a Connected Dominating Set (CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless networks. This problem has been studied extensively in Unit Disk Graphs (UDG), in which all nodes have the same transmission ranges. However, in practice, the transmission ranges of all nodes are not necessarily equal. In this paper, we model a network as a disk graph and introduce the CDS problem in disk graphs. We present two efficient approximation algorithms to obtain a minimum CDS. The performance ratio of these algorithms is constant if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded. These algorithms can be implemented as distributed algorithms. Furthermore, we show a size relationship between a maximal independent set and a CDS as well as a bound of the maximum number of independent neighbors of a node in disk graphs. The theoretical analysis and simulation results are also presented to verify our approaches.

Original languageEnglish (US)
Pages (from-to)721-730
Number of pages10
JournalIEEE Transactions on Mobile Computing
Volume6
Issue number7
DOIs
StatePublished - Jul 2007

Keywords

  • Connected dominating set
  • Disk graph
  • Independent set
  • Virtual backbone
  • Wireless network

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Connected dominating sets in wireless networks with different transmission ranges'. Together they form a unique fingerprint.

  • Cite this