This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks
April 2013 (vol. 24 no. 4)
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
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 and Distributed Systems, vol. 24, no. 4, pp. 652-661, April 2013, doi:10.1109/TPDS.2012.177
Usage of this product signifies your acceptance of the Terms of Use.