This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks
Oct. 2011 (vol. 22 no. 10)
pp. 1601-1609
ASCII Text
x 
 
Ling Ding, 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 and Distributed Systems, vol. 22, no. 10, pp. 1601-1609, Oct., 2011.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2011.30,
author = {Ling Ding and Weili Wu and James Willson and Hongjie Du and Wonjun Lee and Ding-Zhu Du},
title = {Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {22},
number = {10},
issn = {1045-9219},
year = {2011},
pages = {1601-1609},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.30},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks
IS - 10
SN - 1045-9219
SP1601
EP1609
EPD - 1601-1609
A1 - Ling Ding,
A1 - Weili Wu,
A1 - James Willson,
A1 - Hongjie Du,
A1 - Wonjun Lee,
A1 - Ding-Zhu Du,
PY - 2011
KW - Connected dominating set
KW - routing path
KW - wireless network
KW - obstacle
KW - general graph
KW - NP-hard
KW - topology control.
VL - 22
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
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
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.

[1] L. Bao and J.J. Garcia-Luna-Aceves, "Topology Management in Ad Hoc Networks," Proc. ACM MobiHoc, 2003.
[2] J. Willson, X. Gao, Z. Qu, Y. Zhu, Y. Li, and W. Wu, "Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints," Discrete Math., Algorithms and Applications, (DMAA), vol. 1, no. 4, pp. 437-461, 2009.
[3] M. Burkhart, P.V. Rickenbach, R. Wattenhofer, and A. Zollinger, "Does Topology Control Reduce Interference?," Proc. ACM MobiHoc, 2004.
[4] K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-Hop Wireless Network Performance," Proc. ACM MobiCom, 2003.
[5] P.-J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, 2004.
[6] X. Cheng, X. Huang, D. Li, and D.-Z. Du, "Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks," Networks, vol. 42, p. 7, 2003.
[7] X. Cheng, M. Ding, D.H. Du, and X. Jia, "Virtual Backbone Construction in Multihop Ad Hoc Wireless Networks: Research Articles," Wireless Comm. and Mobile Computing, vol. 6, no. 2, pp. 183-190, 2006.
[8] L. Ding, Y. Shao, and M. Li, "On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2008.
[9] K. Mohammed, L. Gewali, and V. Muthukumar, "Generating Quality Dominating Sets for Sensor Network," Proc. IEEE Sixth Int'l Conf. Computational Intelligence and Multimedia Applications (ICCIMA), 2005.
[10] D. Kim, Y. Wu, Y. Li, F. Zou, and D.-Z. Du, "Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 2, pp. 147-157, Feb. 2009.
[11] L. Ding, X. Gao, W. Wu, W. Lee, X. Zhu, and D.-Z. Du, "Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks," Proc. IEEE 30th Int'l Conf. Distributed Computing Systems (ICDCS), 2010.
[12] R. Ramanathan and R. Rosales-hain, "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment," Proc. IEEE INFOCOM, vol. 41, pp. 404-413, 2000.
[13] P. Krishna, N. Vaidya, M. Chatterjee, and D.K. Pradhan, "A Cluster-Based Approach for Routing in Dynamic Networks," ACM SIGCOMM Computer Comm. Rev., vol. 27, pp. 49-65, 1997.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, 1979.
[15] B.N. Clark, C.J. Colbourn, and D.S. Johnson, "Unit Disk Graphs," Discrete Math., vol. 86, nos. 1-3, pp. 165-177, 1990.
[16] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374-387, 1996.
[17] W. Wu, H. Du, X. Jia, Y. Li, and S.C.-H. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs," Theoretical Computer Science, vol. 352, no. 1, pp. 1-7, 2006.
[18] D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang, and G. Xue, "Approximations for Steiner Trees with Minimum Number of Steiner Points," J. Global Optimization, vol. 18, nos. 1-3, pp. 17-33, 2000.
[19] M. Min, H. Du, X. Jia, C.X. Huang, S.C.-H. Huang, and W. Wu, "Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks," J. Global Optimization, vol. 35, no. 1, pp. 111-119, 2006.
[20] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, "On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks," IEEE/KICS J. Comm. and Networks, vol. 4, no. 1, pp. 59-70, Mar. 2002.
[21] L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.-I. Ko, "A Greedy Approximation for Minimum Connected Dominating Sets," Theoretical Computer Science, vol. 329, nos. 1-3, pp. 325-330, 2004.
[22] L. Barriére, P. Fraigniaud, and L. Narayanan, "Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges," Proc. ACM Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), 2001.
[23] F. Kuhn and A. Zollinger, "Ad-Hoc Networks Beyond Unit Disk Graphs," ACM DIALM-POMC: Proc.Joint Workshop Foundations of Mobile Computing, 2003.
[24] M.T. Thai, F. Wang, D. Liu, S. Zhu, and D.-Z. Du, "Connected Dominating Sets in Wireless Networks with Different Transmission Ranges," IEEE Trans. Mobile Computing, vol. 6, no. 7, pp. 721-730, July 2007.
[25] U. Feige, "A Threshold of ln n for Approximating Set Cover," J. ACM, vol. 45, no. 4, pp. 634-652, 1998.
[26] S. Funke, A. Kesselman, U. Meyer, and M. Segal, "A Simple Improved Distributed Algorithm for Minimum Cds in Unit Disk Graphs," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444-453, 2006.
[27] Y. Zeng, X. Jia, and Y. He, "Energy Efficient Distributed Connected Dominating Sets Construction in Wireless Sensor Networks," Proc. ACM Int'l Conf. Wireless Comm. and Mobile Computing (IWCMC), 2006.

Index Terms:
Connected dominating set, routing path, wireless network, obstacle, general graph, NP-hard, topology control.
Citation:
Ling Ding, 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 and Distributed Systems, vol. 22, no. 10, pp. 1601-1609, Oct. 2011, doi:10.1109/TPDS.2011.30
Usage of this product signifies your acceptance of the Terms of Use.