Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks

Author

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

Author_Institution

Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA

Volume

22

Issue

10

fYear

2011

Firstpage

1601

Lastpage

1609

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

broadcasting; computational complexity; radio networks; telecommunication network routing; telecommunication network topology; CDS based broadcasting; CDS based routing; NP-hard; alpha minimum routing cost CDS; backbone topology construction; connected dominating set; heuristic algorithm; routing cost constraints; topology control problem; wireless networks; Approximation algorithms; Approximation methods; Broadcasting; Network topology; Routing; Topology; Wireless networks; Connected dominating set; NP-hard; general graph; obstacle; routing path; topology control.; wireless network;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/TPDS.2011.30

Filename

5703070