Efficient algorithms for topology control problem with routing cost constraints in wireless networks

Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee, Ding Zhu Du

Research output: Contribution to journalArticle

50 Citations (Scopus)

Abstract

Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named α Minimum rOuting Cost CDS (α-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum α-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of α-MOC-CDS.

Original languageEnglish
Article number5703070
Pages (from-to)1601-1609
Number of pages9
JournalIEEE Transactions on Parallel and Distributed Systems
Volume22
Issue number10
DOIs
Publication statusPublished - 2011 Sep 7

Fingerprint

Wireless networks
Topology
Costs
Heuristic algorithms
Broadcasting

Keywords

  • Connected dominating set
  • general graph
  • NP-hard
  • obstacle
  • routing path
  • topology control
  • wireless network

ASJC Scopus subject areas

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

Cite this

Efficient algorithms for topology control problem with routing cost constraints in wireless networks. / Ding, Ling; Wu, Weili; Willson, James; Du, Hongjie; Lee, Wonjun; Du, Ding Zhu.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 22, No. 10, 5703070, 07.09.2011, p. 1601-1609.

Research output: Contribution to journalArticle

Ding, Ling ; Wu, Weili ; Willson, James ; Du, Hongjie ; Lee, Wonjun ; Du, Ding Zhu. / Efficient algorithms for topology control problem with routing cost constraints in wireless networks. In: IEEE Transactions on Parallel and Distributed Systems. 2011 ; Vol. 22, No. 10. pp. 1601-1609.
@article{3e049d2314ad4bb7a4ea522606b978a3,
title = "Efficient algorithms for topology control problem with routing cost constraints in wireless networks",
abstract = "Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named α Minimum rOuting Cost CDS (α-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum α-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of α-MOC-CDS.",
keywords = "Connected dominating set, general graph, NP-hard, obstacle, routing path, topology control, wireless network",
author = "Ling Ding and Weili Wu and James Willson and Hongjie Du and Wonjun Lee and Du, {Ding Zhu}",
year = "2011",
month = "9",
day = "7",
doi = "10.1109/TPDS.2011.30",
language = "English",
volume = "22",
pages = "1601--1609",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "10",

}

TY - JOUR

T1 - Efficient algorithms for topology control problem with routing cost constraints in wireless networks

AU - Ding, Ling

AU - Wu, Weili

AU - Willson, James

AU - Du, Hongjie

AU - Lee, Wonjun

AU - Du, Ding Zhu

PY - 2011/9/7

Y1 - 2011/9/7

N2 - Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named α Minimum rOuting Cost CDS (α-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum α-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of α-MOC-CDS.

AB - Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named α Minimum rOuting Cost CDS (α-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum α-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of α-MOC-CDS.

KW - Connected dominating set

KW - general graph

KW - NP-hard

KW - obstacle

KW - routing path

KW - topology control

KW - wireless network

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

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

U2 - 10.1109/TPDS.2011.30

DO - 10.1109/TPDS.2011.30

M3 - Article

AN - SCOPUS:80052324399

VL - 22

SP - 1601

EP - 1609

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 10

M1 - 5703070

ER -