Subscribe

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

Issue No.10 - Oct. (2011 vol.22)

pp: 1601-1609

Weili Wu , The University of Texas at Dallas, Richardson

James Willson , The University of Texas at Dallas, Richardson

Hongjie Du , The University of Texas at Dallas, Richardson

Wonjun Lee , Korea University, Seoul

Ding-Zhu Du , The University of Texas at Dallas, Richardson

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.30

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 \alpha Minimum rOuting Cost CDS (\alpha-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 \alpha-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of \alpha-MOC-CDS.

INDEX TERMS

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

CITATION

Weili Wu, James Willson, Hongjie Du, Wonjun Lee, Ding-Zhu Du, "Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.22, no. 10, pp. 1601-1609, Oct. 2011, doi:10.1109/TPDS.2011.30REFERENCES