CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks

Hongwei Du, Weili Wu, Qiang Ye, Deying Li, Wonjun Lee, Xuepeng Xu

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless (P) (=NP). Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS (D) whose size |(D)| is within a constant factor from that of the minimum CDS. In addition, for each node pair (u) and (v), there exists a routing path with all intermediate nodes in (D) and path length at most (7 · d(u,v)), where (d(u,v)) is the length of the shortest path between (u) and (v). Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.

Original languageEnglish
Article number6216366
Pages (from-to)652-661
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume24
Issue number4
DOIs
Publication statusPublished - 2013 Mar 19

Fingerprint

Approximation algorithms
Wireless sensor networks
Polynomials
Costs

Keywords

  • connected dominating set
  • routing cost
  • virtual backbone
  • Wireless sensor networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this

CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. / Du, Hongwei; Wu, Weili; Ye, Qiang; Li, Deying; Lee, Wonjun; Xu, Xuepeng.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 24, No. 4, 6216366, 19.03.2013, p. 652-661.

Research output: Contribution to journalArticle

Du, Hongwei ; Wu, Weili ; Ye, Qiang ; Li, Deying ; Lee, Wonjun ; Xu, Xuepeng. / CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: IEEE Transactions on Parallel and Distributed Systems. 2013 ; Vol. 24, No. 4. pp. 652-661.
@article{c01f3cc5c3cd43f6ad9f28c01ec4cf2c,
title = "CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks",
abstract = "Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless (P) (=NP). Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS (D) whose size |(D)| is within a constant factor from that of the minimum CDS. In addition, for each node pair (u) and (v), there exists a routing path with all intermediate nodes in (D) and path length at most (7 · d(u,v)), where (d(u,v)) is the length of the shortest path between (u) and (v). Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.",
keywords = "connected dominating set, routing cost, virtual backbone, Wireless sensor networks",
author = "Hongwei Du and Weili Wu and Qiang Ye and Deying Li and Wonjun Lee and Xuepeng Xu",
year = "2013",
month = "3",
day = "19",
doi = "10.1109/TPDS.2012.177",
language = "English",
volume = "24",
pages = "652--661",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks

AU - Du, Hongwei

AU - Wu, Weili

AU - Ye, Qiang

AU - Li, Deying

AU - Lee, Wonjun

AU - Xu, Xuepeng

PY - 2013/3/19

Y1 - 2013/3/19

N2 - Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless (P) (=NP). Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS (D) whose size |(D)| is within a constant factor from that of the minimum CDS. In addition, for each node pair (u) and (v), there exists a routing path with all intermediate nodes in (D) and path length at most (7 · d(u,v)), where (d(u,v)) is the length of the shortest path between (u) and (v). Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.

AB - Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless (P) (=NP). Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS (D) whose size |(D)| is within a constant factor from that of the minimum CDS. In addition, for each node pair (u) and (v), there exists a routing path with all intermediate nodes in (D) and path length at most (7 · d(u,v)), where (d(u,v)) is the length of the shortest path between (u) and (v). Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.

KW - connected dominating set

KW - routing cost

KW - virtual backbone

KW - Wireless sensor networks

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

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

U2 - 10.1109/TPDS.2012.177

DO - 10.1109/TPDS.2012.177

M3 - Article

AN - SCOPUS:84874964051

VL - 24

SP - 652

EP - 661

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 4

M1 - 6216366

ER -