Efficient algorithm for constructing minimum size wireless sensor networks to fully cover critical square grids

IEEE Transactions on Wireless Communications

Volumn 10, Issue 4, 2011, Pages 1154-1164

  Ke, Wei Chieh ^a   Liu, Bing Hong ^b   Tsai, Ming Jer ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

Author keywords

approximation algorithm; coverage problem; NP Complete problem; sensor deployment; Wireless sensor network

Indexed keywords

ATTACK DETECTION; BATTLEFIELD SURVEILLANCE; COVERAGE PROBLEM; CRITICAL AREA; EFFICIENT ALGORITHM; ENVIRONMENTAL INFORMATION; ENVIRONMENTAL MONITORING; GRID COVERAGE; GRID POINTS; NP COMPLETE PROBLEMS; SENSOR DEPLOYMENT; SENSOR FIELDS; SQUARE GRID; WIRELESS COMMUNICATIONS;

APPROXIMATION ALGORITHMS; CHEMICAL ATTACK; CHEMICAL DETECTION; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 79955470420     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2011.021611.100123     Document Type: Article

References (42)

1. P. Ray and P. Varshney, "Estimation of spatially distributed processes in wireless sensor networks with random packet loss," IEEE Trans. Wireless Commun., vol. 8, no. 6, pp. 3162-3171, June 2009.
2. K. K. Rachuri and C. Murthy, "Energy efficient and scalable search in dense wireless sensor networks," IEEE Trans. Comput., vol. 58, no. 6, pp. 812-826, June 2009.
3. M. J. Tsai, H. Y. Yang, B. H. Liu, and W. Q. Huang, "Virtual- coordinatebased delivery-guaranteed routing protocol in wireless sensor networks," IEEE/ACM Trans. Networking, vol. 17, no. 4, pp. 1228-1241, Aug. 2009.
4. A. O. Fapojuwo and A. Cano-Tinoco, "Energy consumption and message delay analysis of QoS enhanced base station controlled dynamic clustering protocol for wireless sensor networks," IEEE Trans. Wireless Commun., vol. 8, no. 10, pp. 5366-5374, Oct. 2009.
5. T. R. Park, K. J. Park, and M. J. Lee, "Design and analysis of asynchronous wakeup for wireless sensor networks," IEEE Trans. Wireless Commun., vol. 8, no. 11, pp. 5530-5541, Nov. 2009.
6. Z. Merhi, M. Elgamel, and M. Bayoumi, "A lightweight collaborative fault tolerant target localization system for wireless sensor networks," IEEE Trans. Mobile Comput., vol. 8, no. 12, pp. 1690-1704, Dec. 2009.
7. V. Chvatal, "A combinatorial theorem in plane geometry," J. Combinatorial Theory Ser. B, vol. 18, pp. 39-41, 1975.
8. J. O'Rourke, Art Gallery Theorems and Algorithms. Oxford University Press, 1987.
9. F. Hoffmann, M. Kaufmann, and K. Kriegel, "The art gallery theorem for polygons with holes," in Proc. IEEE FOCS, 1991.
10. J. B. M. Melissen and P. C. Schuur, "Covering a rectangle with six and seven circles," Discrete Applied Math., vol. 99, no. 1, pp. 149-156, Feb. 2000.
11. K. J. Nurmela, "Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles," Experimental Math., vol. 9, no. 2, pp. 241-250, 2000.
12. K. J. Nurmela and P. R. J. Ostergard, "Covering a square with up to 30 equal circles," HUT-TCS-A62, Tech. Rep., 2000.
13. S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proc. IEEE ICC, 2001.
14. H. Zhang and J. C. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," J. Ad Hoc Sensor Wireless Netw., vol. 1, no. 1, pp. 89-123, Jan. 2005.
15. Z. Zhou, S. Das, and H. Gupta, "Connected k-coverage problem in sensor networks," in Proc. ICCCN, 2004.
16. C. F. Huang, Y. C. Tseng, and H. L. Wu, "Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network," ACM Trans. Sensor Netw., vol. 3, no. 1, p. 5, Mar. 2007.
17. C. Y. Chang, C. T. Chang, Y. C. Chen, and H. R. Chang, "Obstacleresistant deployment algorithms for wireless sensor networks," IEEE Trans. Veh. Technol., vol. 58, no. 6, pp. 2925-2941, July 2009.
18. X. Han, X. Cao, E. L. Lloyd, and C. C. Shen, "Deploying directional sensor networks with guaranteed connectivity and coverage," in Proc. IEEE SECON, 2008.
19. K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, "Grid coverage for surveillance and target location in distributed sensor networks," IEEE Trans. Comput., vol. 51, no. 12, pp. 1448-1453, Dec. 2002.
20. X. Xu, S. Sahni, and N. Rao, "Minimum-cost sensor coverage of planar regions," in Proc. FUSION, 2008.
21. F. Y. S. Lin and P. L. Chiu, "A simulated annealing algorithm for energyefficient sensor network design," in Proc. ICST WiOpt, 2005.
22. X. Bai, S. Kumar, Z. Yun, D. Xuan, and T. H. Lai, "Deploying wireless sensors to achieve both coverage and connectivity," in Proc. ACM MobiHoc, 2006.
23. A. Howard, M. J. Matari'c, and G. S. Sukhatme, "An incremental selfdeployment algorithm for mobile sensor networks," Autonomous Robots, vol. 13, no. 2, pp. 113-126, Sep. 2002.
24. N. Heo and P. K. Varshney, "An intelligent deployment and clustering algorithm for a distributed mobile sensor network," in Proc. IEEE SMC, 2003.
25. A. Howard, M. J. Matari'c, and G. S. Sukhatme, "Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem," in Proc. DARS, 2002.
26. Y. Zhou and K. Chakrabarty, "Sensor deployment and target localization in distributed sensor networks," ACM Trans. Embedded Comput. Syst., vol. 3, no. 1, pp. 61-91, Feb. 2004.
27. M. Ma and Y. Yang, "Adaptive triangular deployment algorithm for unattended mobile sensor networks," IEEE Trans. Comput., vol. 56, no. 7, pp. 946-958, July 2007. (Pubitemid 47249809)
28. Y. Zou and K. Chakrabarty, "A distributed coverage- and connectivitycentric technique for selecting active nodes in wireless sensor networks," IEEE Trans. Comput., vol. 54, no. 8, pp. 978-991, Aug. 2005. (Pubitemid 41235935)
29. M. Cardei and D. Z. Du, "Improving wireless sensor network lifetime through power aware organization," ACM/Springer J. Wireless Netw., vol. 11, no. 3, pp. 333-340, May 2005. (Pubitemid 41217860)
30. M. Cardei, M. T. Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," in Proc. IEEE INFOCOM, 2005.
31. W. C. Ke, B. H. Liu, and M. J. Tsai, "Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete," IEEE Trans. Comput., vol. 56, no. 5, pp. 710-715, May 2007.
32. A. Segev, "The node-weighted Steiner tree problem," Netw., vol. 17, no. 1, pp. 1-17, 1987.
33. P. N. Klein and R. Ravi, "A nearly best-possible approximation algorithm for node-weighted Steiner trees," J. Algorithms, vol. 19, no. 1, pp. 104-115, July 1995.
34. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit disk graphs," Discrete Math., vol. 86, no. 1-3, pp. 165-177, Dec. 1990.
35. N. Heo and P. K. Varshney, "Energy-efficient deployment of intelligent mobile sensor networks," IEEE Trans. Syst., Man, Cybernetics-Part A: Syst. Humans, vol. 35, no. 1, pp. 78-92, Jan. 2005. (Pubitemid 40085387)
36. V. Chvatal, "A greedy heuristic for the set cover problem," Math. Opererations Research, vol. 4, no. 3, pp. 233-235, Aug. 1979.
37. R. M. Karp, Complexity of Computer Communications. Plenum, 1972.
38. E. L. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Trans. Comput., vol. 56, no. 1, pp. 134-138, Jan. 2007.
39. X. Cheng, D. Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," ACM/Springer J. Wireless Netw., Jan. 2007.
40. A. A. Tamer Nadeem, "IEEE 802.11 fragmentation-aware energyefficient ad-hoc routing protocols," in Proc. IEEE MASS, 2004.
41. I. Stojmenovic, A. Nayak, J. Kuruvila, F. Ovalle-Martinez, and E. Villanueva-Pena, "Physical layer impact on the design and performance of routing and broadcasting protocols in ad hoc and sensor networks," Comput. Commun., vol. 28, no. 10, pp. 1138-1151, June 2005. (Pubitemid 40701642)
42. J. Chen, A. Jiang, I. A. Kanj, G. Xia, and F. Zhang, "Separability and topology control of quasi unit disk graphs," in Proc. IEEE INFOCOM, 2007.