The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2011 vol. 22)
ISSN: 1045-9219
pp: 1601-1609
Ling Ding , The University of Texas at Dallas, Richardson
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
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

J. Willson, W. Wu, W. Lee, L. Ding, H. Du and D. Du, "Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1601-1609, 2011.
doi:10.1109/TPDS.2011.30
81 ms
(Ver 3.3 (11022016))