Finding best and worst k-coverage paths in multihop wireless sensor networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 24, Issue 12, 2013, Pages 2396-2406

  Mao, Xufei ^a   Liu, Yunhao ^a   Tang, Shaojie ^b   Liu, Huafu ^b   Han, Jiankang ^a   Li, Xiang Yang ^c  

^a TSINGHUA UNIVERSITY   (China)

^b Illinois Institute of Technology   (United States)

^c CHANGSHA UNIVERSITY   (China)

Author keywords

K breach path; K support path; Optimum k coverage; Wireless sensor networks

Indexed keywords

BEST-CASE COVERAGE; K-BREACH PATH; K-COVERAGE; K-SUPPORT PATH; MULTIHOP WIRELESS; OPTIMAL SOLUTIONS; WIRELESS SENSOR NETWORK (WSNS); WORST-CASE COVERAGE;

SENSOR NODES; WIRELESS SENSOR NETWORKS;

POLYNOMIALS;

EID: 84887874349     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.329     Document Type: Article

References (19)

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. (Pubitemid 40061937)
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. (Pubitemid 40168799)
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. (Pubitemid 33006711)
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. (Pubitemid 43898915)
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. (Pubitemid 128752023)