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

130 Citations (Scopus)

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
Externally publishedYes

Fingerprint

Wireless networks
Wireless ad hoc networks
Approximation algorithms
Routing protocols
Parallel algorithms

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this

Connected dominating sets in wireless networks with different transmission ranges. / Thai, My T.; Wang, Feng; Liu, Dan; Zhu, Shiwei; Du, Ding Zhu.

In: IEEE Transactions on Mobile Computing, Vol. 6, No. 7, 07.2007, p. 721-730.

Research output: Contribution to journalArticle

Thai, My T. ; Wang, Feng ; Liu, Dan ; Zhu, Shiwei ; Du, Ding Zhu. / Connected dominating sets in wireless networks with different transmission ranges. In: IEEE Transactions on Mobile Computing. 2007 ; Vol. 6, No. 7. pp. 721-730.
@article{429f4e3f13954e57991347b86be2e812,
title = "Connected dominating sets in wireless networks with different transmission ranges",
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.",
keywords = "Connected dominating set, Disk graph, Independent set, Virtual backbone, Wireless network",
author = "Thai, {My T.} and Feng Wang and Dan Liu and Shiwei Zhu and Du, {Ding Zhu}",
year = "2007",
month = "7",
doi = "10.1109/TMC.2007.1034",
language = "English (US)",
volume = "6",
pages = "721--730",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Connected dominating sets in wireless networks with different transmission ranges

AU - Thai, My T.

AU - Wang, Feng

AU - Liu, Dan

AU - Zhu, Shiwei

AU - Du, Ding Zhu

PY - 2007/7

Y1 - 2007/7

N2 - 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.

AB - 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.

KW - Connected dominating set

KW - Disk graph

KW - Independent set

KW - Virtual backbone

KW - Wireless network

UR - http://www.scopus.com/inward/record.url?scp=34249747984&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249747984&partnerID=8YFLogxK

U2 - 10.1109/TMC.2007.1034

DO - 10.1109/TMC.2007.1034

M3 - Article

AN - SCOPUS:34249747984

VL - 6

SP - 721

EP - 730

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 7

ER -