Subscribe
Issue No.12 - Dec. (2013 vol.24)
pp: 2396-2406
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
ABSTRACT
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.
INDEX TERMS
Wireless sensor networks, Spread spectrum management, Algorithm design and analysis, Wireless communication,wireless sensor networks, Optimum k-coverage, k-support path, k-breach path
CITATION
Xufei Mao, Yunhao Liu, Shaojie Tang, Huafu Liu, Jiankang Han, Xiang-Yang Li, "Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 12, pp. 2396-2406, Dec. 2013, doi:10.1109/TPDS.2012.329
REFERENCES
 [1] http:/www.mathworks.com/, 2013. [2] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer, 1997. [3] C. Fang and C.P. Low, "Redundant Coverage in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Comm. (ICC), 2007. [4] C. Huang and Y. Tseng, "The Coverage Problem in a Wireless Sensor Network," Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA), 2003. [5] C. Huang, Y.C. Tseng, and L. Lo, "The Coverage Problem in Three-Dimensional Wireless Sensor Networks," Proc. IEEE GLOBECOM, 2004. [6] S. Kumar, T. Lai, and J. Barlogh, "On $k$ -Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, pp. 144-158, 2004. [7] D. Lee, "On $k$ -Nearest Neighbor Voronoi Diagrams in the Plane," IEEE Trans. Computers, vol. C-31, no. 6, pp. 478-486, June 1982. [8] X. Li, P. Wan, and O. Frieder, "Coverage in Wireless Ad-Hoc Sensor Networks," IEEE Trans. Computers, vol. 52, no. 6, pp. 753-763, June 2003. [9] S. Megerian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Worst and Best Case Coverage in Sensor Networks," IEEE Trans. Mobile Computing, vol. 4, no. 1, pp. 84-92, Jan. 2005. [10] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks," Proc. IEEE INFOCOM, pp. 139-150, 2001. [11] D.P. Mehta, M.A. Lopez, and L. Lin, "Optimal Coverage Paths in Ad-Hoc Sensor Networks," Proc. IEEE Int'l Conf. Comm., vol. 1, 2003. [12] A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu, Spatial Tessellations. Wiley Series in Probability and Statics. John Wiley & Sons 2000. [13] J.O. Rourke, Computational Geometry in $c$ . Cambridge Univ. Press, 1998. [14] S. Skyum, "A Sweepline Algorithm for Generalized Delaunay Triangulations," Technical Report DAIMI PB-373, CS Dept., Aarhus Univ., 1991. [15] S. Tang, X. Mao, and X.Y. Li, "Evaluating Coverage Quality through Best Covered Paths in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 99-108, 2011. [16] P. Wan and C. Yi, "Coverage by Randomly Deployed Wireless Sensor Networks," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2658-2669, June 2006. [17] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks," ACM Trans. Sensor Networks, vol. 1, pp. 36-72, 2005. [18] Z. Zhou, S. Das, and H. Gupta, "Connected $k$ -Coverage Problem in Sensor Networks," Proc. Int'l Conf. Computer Comm. and Networks (ICCCN), 2004. [19] S. Zhu and M. Huang, "A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks," IEEE Trans. Parallel and Distributed System, vol. 9, no. 9, pp. 841-855, Sept. 1998.