The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2013 vol.24)
pp: 652-661
Hongwei Du , Dept. of Comput. Sci. & Technol., Harbin Inst. of Technol., Shenzhen, China
Weili Wu , Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
Qiang Ye , Dept. of Comput. Sci. & Inf. Technol., Univ. of Prince Edward Island, Charlottetown, PE, Canada
Deying Li , Dept. of Comput. Sci., Renmin Univ. of China, Beijing, China
Wonjun Lee , Dept. of Comput. Sci. & Eng., Korea Univ., Seoul, South Korea
Xuepeng Xu , Dept. of Comput. Sci. & Inf. Technol., Univ. of Prince Edward Island, Charlottetown, PE, Canada
ABSTRACT
Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone construction based on Connected Dominating Set (CDS) is a competitive approach among the existing methods used to establish virtual backbone in WSNs. Traditionally, CDS size was the only factor considered in the CDS-based approach. The motivation was that smaller CDS leads to simplified network maintenance. However, routing cost in terms of routing path length is also an important factor for virtual backbone construction. In our research, both of these two factors are taken into account. Specifically, we attempt to devise a polynomial-time constant-approximation algorithm that leads to a CDS with bounded CDS size and guaranteed routing cost. We prove that, under general graph model, there is no polynomial-time constant-approximation algorithm unless P = NP. Under Unit Disk Graph (UDG) model, we propose an innovative polynomial-time constant-approximation algorithm, GOC-MCDS-C, that produces a CDS D whose size I D is within a constant factor from that of the minimum CDS. In addition, for each node pair u and v, there exists a routing path with all intermediate nodes in D and path length at most 7 · d(u, v), where d(u, v) is the length of the shortest path between u and v. Our theoretical analysis and simulation results show that the distributed version of the proposed algorithm, GOC-MCDS-D, outperforms the existing approaches.
INDEX TERMS
wireless sensor networks, computational complexity, graph theory, set theory, telecommunication network routing, GOC-MCDS-C algorithm, CDS-based virtual backbone construction, guaranteed routing cost, wireless sensor networks, WSN, connected dominating set, network maintenance, routing path length, polynomial-time constant-approximation algorithm, bounded CDS size, general graph model, unit disk graph model, UDG model, Routing, Wireless sensor networks, Approximation algorithms, Approximation methods, Educational institutions, Computer science, Electronic mail, routing cost, Wireless sensor networks, virtual backbone, connected dominating set
CITATION
Hongwei Du, Weili Wu, Qiang Ye, Deying Li, Wonjun Lee, Xuepeng Xu, "CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 4, pp. 652-661, April 2013, doi:10.1109/TPDS.2012.177
REFERENCES
[1] V. Bharghavan and B. Das, "Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets," Proc. Int'l Conf. Comm., June 1997.
[2] M. Cardei, M.X. Cheng, X. Cheng, and D.-Z. Du, "Connected Domination in Ad Hoc Wireless Networks," Proc. Sixth Int'l Conf. Computer Science and Informatics (CS&I), 2002.
[3] 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.
[4] X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du, "A Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks," Networks, vol. 42, no. 4, pp. 202-208, 2003.
[5] B.N. Clark, C.J. Colbourn, and D.S. Johnson, "Unit Disk Graphs," Discrete Math. vol. 86, nos. 1-3, pp. 165-177, 1990.
[6] L. Ding, W. Wu, J. Willson, H. Du, W. Lee, and D.-Z. Du, "Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 10, pp. 1601-1609, Oct. 2011.
[7] 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 Network," Proc. 30th Int'l Conf. Distributed Computing Systems (ICDCS), pp. 448-457, 2010.
[8] D.-Z. Du, R.L. Graham, P.M. Pardalos, P.-J. Wan, W. Wu, and W. Zhao, "Analysis of Greedy Approximations with Nonsubmodular Potential Functions," Proc. ACM-SIAM 19th Ann. Symp. Discrete Algorithms (SODA), pp. 167-175, 2008.
[9] H. Du, Q. Ye, W. Wu, D. Li, D.-Z. Du, and S. Howard, "Constant Approximation for Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 1737-1744, 2011.
[10] U. Feige, "A Threshold of ln n for Approximating Set-Cover," Proc. ACM 28th Symp. Theory of Computing, pp. 314-318, 1996.
[11] S. Funke, A. Kesselman, and U. Meyer, "A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444-453, 2006.
[12] R. Raz and S. Safra, "A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP," Proc. ACM 29th Ann. Symp. Theory of Computing (STOC), pp. 475-484, 1997.
[13] X. Gao, Y. Wang, X. Li, and W. Wu, "Analysis on Theoretical Bounds for Approximating Dominating Set Problems," Discrete Math., Algorithms and Applications, vol. 1, no. 1, pp. 71-84, 2009.
[14] S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[15] 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.
[16] P.-J. Wan, L. Wang, F. Yao, and C.-W. Yi, "Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks," Proc. IEEE 28th Int'l Conf. Distributed Computing Systems (ICDCS), pp. 337-344, 2008.
[17] Y.S. Li, M.T. Thai, F. Wang, C.-W. Yi, P.-J. Wan, and D.-Z. Du, "On Greedy Construction of Connected Dominating Sets in Wireless Networks," Wiley J. Wireless Comm. and Mobile Computing, vol. 5, no. 8, pp. 927-932, 2005.
[18] M. Min, X. Huang, C.-H. Huang, W. Wu, H. Du, and X. Jia, "Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks," J. Global Optimization, vol. 35, no. 1, pp. 111-119, 2006.
[19] L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K.-I. Ko, "A Greedy Approximation for Minimum Connected Dominating Set," Theoretical Computer Science, vol. 329, nos. 1-3, pp. 325-330, 2004.
[20] A. Salhieh, J. Weinmann, M. Kochha, and L. Schwiebert, "Power Efficient Topologies for Wireless Sensor Networks," Proc. Int'l Conf. Parallel Processing (ICPP), pp. 156-163, 2001.
[21] R. Sivakumar, B. Das, and V. Bharghavan, "An improved Spine-Based Infrastructure for Routing in Ad Hoc Networks," Proc. IEEE Symp. Computer and Comm., pp. 340-351, 1998.
[22] I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks," Proc. IEEE Hawaii Int'l Conf. System Sciences, Jan. 2001.
[23] J. Willson, X. Gao, Z. Qu, Y. Zhu, Y. Li, and W. Wu, "Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints," submitted.
[24] P. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Proc. ACM Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999.
[25] M. Li, P.-J. Wan, and F.F. Yao, "Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks," Proc. 20th Int'l Symp. Algorithms and Computation (ISAAC '09), pp. 699-709, 2009.
[26] J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," Proc. ACM Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999.
[27] W. Wu, H. Du, X. Jia, Y. Li, and S. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs," Theoretical Computer Science, vol. 352, no. 1, pp. 1-7, 2006.
[28] 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.
[29] M.T. Thai, R. Tiwari, and D.-Z. Du, "On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links," IEEE Trans. Mobile Computing, vol. 7, no. 9, pp. 1098-1109, Sept. 2008.
[30] H. Groemer, "Über Die Einlagerung von Kreisen in Einen Konvexen Bereich," Math. Z. vol. 73, pp. 285-294, 1960.
[31] N. Oler, "An Inequality in the Geometry of Numbers," Acta Math. vol. 105, pp. 19-48, 1961.
[32] T.H. Corman, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2009.
[33] J. Schneider and R. Wattenhofer, "A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs," Proc. ACM SIGACT-SIGOPS 27th Ann. Symp. Principles of Distributed Computing, Aug. 2008.
[34] N. Linial, "Locality in Distributed Graph Algorithms," SIAM J. Computing, vol. 21, no. 1, pp. 193-201, 1992.
[35] J. Wu, B. Wu, and I. Stojmenovic, "Poweraware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks Using Connected Dominating Sets," Wireless Comm. and Mobile Computing, vol. 3, no. 4, pp. 425-438, 2003.
[36] D. SimplotRyl, I. Stojmenovic, and J. Wu, "EnergyEfficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks," Handbook of Sensor Networks, pp. 343-380, Wiley, 2005.
[37] Y. Li, M.T. Thai, F. Wang, C. Yi, P.-J. Wan, and D.-Z. Du, "On Greedy Construction of Connected Dominating Sets in Wireless Networks," Wireless Comm. and Mobile Computing, vol. 5, no. 8, pp. 927-932, 2005.
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool