Issue No. 12 - Dec. (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.329
Xufei Mao , Tsinghua University, Beijing and Hong Kong University of Science and Technology, Hong Kong
Yunhao Liu , Tsinghua University, Beijing and Hong Kong University of Science and Technology, Hong Kong
Shaojie Tang , Illinois Institute of Technology, Chicago
Huafu Liu , Changsha University, Changsha
Jiankang Han , Tsinghua University, Beijing and Hong Kong University of Science and Technology, Hong Kong
Xiang-Yang Li , Illinois Institute of Technology, Chicago
Coverage is a fundamental problem in wireless sensor networks (WSNs). From both economic and applicable concerns, designers always would like to provide guaranteed QoS of coverage of WSNs. In this paper, we address two path-coverage problems in WSNs, maximum $(k)$-support path coverage (a.k.a. best case coverage) and minimum $(k)$-breach path coverage (a.k.a. worst case coverage), in which every point on the desired resultant path is covered by at least $(k)$ sensors simultaneously while optimizing certain objectives. We present two polynomial-time approaches to find optimal solutions for both maximum $(k)$-support coverage problem and minimum $(k)$-breach coverage problem. The time complexity of both algorithms are $(O(k^2n\log n))$, where $(n)$ is the number of deployed sensor nodes and $(k)$ is the coverage degree. In addition, a number of properties of $(k)$th-nearest point Voronoi diagram are presented, which is new to the literature.
Wireless sensor networks, Spread spectrum management, Algorithm design and analysis, Wireless communication
X. Mao, Y. Liu, S. Tang, H. Liu, J. Han and X. Li, "Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. 12, pp. 2396-2406, 2013.