
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee, DingZhu 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. 16011609, 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 DingZhu 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 = {10459219}, year = {2011}, pages = {16011609}, 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  10459219 SP1601 EP1609 EPD  16011609 A1  Ling Ding, A1  Weili Wu, A1  James Willson, A1  Hongjie Du, A1  Wonjun Lee, A1  DingZhu Du, PY  2011 KW  Connected dominating set KW  routing path KW  wireless network KW  obstacle KW  general graph KW  NPhard KW  topology control. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] L. Bao and J.J. GarciaLunaAceves, "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. 437461, 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 MultiHop 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. 141149, 2004.
[6] X. Cheng, X. Huang, D. Li, and D.Z. Du, "PolynomialTime 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. 183190, 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. 147157, 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. Rosaleshain, "Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment," Proc. IEEE INFOCOM, vol. 41, pp. 404413, 2000.
[13] P. Krishna, N. Vaidya, M. Chatterjee, and D.K. Pradhan, "A ClusterBased Approach for Routing in Dynamic Networks," ACM SIGCOMM Computer Comm. Rev., vol. 27, pp. 4965, 1997.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (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. 13, pp. 165177, 1990.
[16] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374387, 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. 17, 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. 13, pp. 1733, 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. 111119, 2006.
[20] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, "On Calculating PowerAware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks," IEEE/KICS J. Comm. and Networks, vol. 4, no. 1, pp. 5970, 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. 13, pp. 325330, 2004.
[22] L. Barriére, P. Fraigniaud, and L. Narayanan, "Robust PositionBased 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, "AdHoc Networks Beyond Unit Disk Graphs," ACM DIALMPOMC: 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. 721730, July 2007.
[25] U. Feige, "A Threshold of ln n for Approximating Set Cover," J. ACM, vol. 45, no. 4, pp. 634652, 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. 444453, 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.