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

51 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

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

Fingerprint Dive into the research topics of 'Efficient algorithms for topology control problem with routing cost constraints in wireless networks'. Together they form a unique fingerprint.

  • Cite this