Best and worst-case coverage problems for arbitrary paths in wireless sensor networks

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

Volumn , Issue , 2010, Pages 127-136

  Lee, Chunseok ^a   Shin, Donghoon ^a   Bae, Sang Won ^b   Choi, Sunghee ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Kyonggi University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DEPLOYMENT PROBLEMS; FORMAL PROOFS; MAXIMAL SUPPORT; MINIMUM SPANNING TREES; OPTIMAL PLACEMENTS; POINT SET; POSITIVE INTEGERS; SIMULATION RESULT; SINGLE SOURCE; WORST-CASE COVERAGE;

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 78650967042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASS.2010.5663957     Document Type: Conference Paper

References (34)

1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Comput. Netw., vol. 38, no. 4, pp. 393-422, 2002.
2. G. Werner-Allen, K. Lorincz, M. Welsh, O. Marcillo, J. Johnson, M. Ruiz, and J. Lees, "Deploying a wireless sensor network on an active volcano," IEEE Internet Computing, vol. 10, no. 2, pp. 18-25, 2006.
3. K. Chintalapudi, T. Fu, J. Paek, N. Kothari, S. Rangwala, J. Caffrey, R. Govindan, E. Johnson, and S. Masri, "Monitoring civil structures with a wireless sensor network," IEEE Internet Computing, vol. 10, no. 2, pp. 26-34, 2006.
4. L. Yu, N. Wang, and X. Meng, "Real-time forest fire detection with wireless sensor networks," Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on, vol. 2, pp. 1214-1217, Sept. 2005.
5. C. Hartung, R. Han, C. Seielstad, and S. Holbrook, "Firewxnet: a multi-tiered portable wireless system for monitoring weather conditions in wildland fire environments," in MobiSys '06, 2006, pp. 28-41.
6. I. Onat and A. Miri, "An intrusion detection system for wireless sensor networks," Wireless And Mobile Computing, Networking And Communications, 2005. (WiMob'2005), IEEE International Conference on, vol. 3, pp. 253-259 Vol. 3, Aug. 2005.
7. A. P. R. da Silva, M. H. T. Martins, B. P. S. Rocha, A. A. F. Loureiro, L. B. Ruiz, and H. C. Wong, "Decentralized intrusion detection in wireless sensor networks," in Q2SWinet '05, 2005, pp. 16-23.
8. S. L. F Ye, G Zhong and L. Zhang, "Energy efcient robust sensing coverage in large sensor networks," UCLA, Tech. Rep., 2002.
9. H. Gupta, S. R. Das, and Q. Gu, "Connected sensor cover: self-organization of sensor networks for efficient query execution," in MobiHoc '03, 2003, pp. 189-200.
10. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated coverage and connectivity configuration in wireless sensor networks," in SenSys '03, 2003, pp. 28-39.
11. G. Wang, G. Cao, and T. F. L. Porta, "Movement-assisted sensor deployment," IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 640-652, 2006.
12. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Coverage problems in wireless ad-hoc sensor networks," INFO-COM 2001, vol. 3, pp. 1380-1387 vol.3, 2001.
13. S. Megerian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, "Worst and best-case coverage in sensor networks," IEEE Transactions on Mobile Computing, vol. 4, no. 1, pp. 84-92, 2005.
14. Y.-T. Hou, T.-C. Lee, C.-M. Chen, and B. Jeng, "Node placement for optimal coverage in sensor networks," in Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006.
15. Y.-T. Hou, C.-M. Chen, and B. Jeng, "An optimal new-node placement to enhance the coverage of wireless sensor networks," Wireless Networks, 2009.
16. R.-H. Gau and Y.-Y. Peng, "A dual approach for the worst-case-coverage deployment problem in ad-hoc wireless sensor networks," in Mobile Adhoc and Sensor Systems, 2006.
17. A. Duttagupta, A. Bishnu, and I. Sengupta, "Optimisation problems based on the maximal breach path measure for wireless sensor network coverage," in proceedings of ICDCIT, 2006, pp. 27-40.
18. D. Du, L. Wang, and B. Xu, "The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points," in Proc. of COCOON 2001, ser. LNCS, vol. 2108, 2001, pp. 509-518.
19. J. L. Ganlet and J. S. Salowe, "Optimal and approximate bottleneck Steiner trees," Oper. Res. Lett., vol. 19, pp. 217-224, 1996.
20. D. P. Huttenlocher, K. Kedem, and M. Shrir, "The upper envelope of Voronoi surfaces and its applications," Discrete Comput. Geom., vol. 9, pp. 267-291, 1993.
21. S. W. Bae, C. Lee, and S. Choi, "On exact solutions to the Euclidean bottleneck Steiner tree problem," in Proc. 3rd Annu. Workshop Algo. and Comput. (WALCOM), ser. LNCS, vol. 5431, 2009, pp. 105-116.
22. X.-Y. Li, P.-J. Wan, and O. Frieder, "Coverage in wireless ad hoc sensor networks," IEEE Transactions on Computers, vol. 52, no. 6, pp. 753-763, 2003.
23. F. Aurenhammer and R. Klein, "Handbook of computational geometry," J.-R. Sack and J. Urrutia, Eds. Elsevier, 2000.
24. J. Jaromczyk and G. Toussaint, "Relative neighborhood graphs and their relatives," Proceedings of the IEEE, vol. 80, no. 9, pp. 1502-1517, Sep 1992.
25. K. J. Supowit, "The relative neighborhood graph, with an application to minimum spanning trees," J. ACM, vol. 30, no. 3, pp. 428-448, 1983.
26. F. P. Preparata and M. I. Shamos, Computational Geometry. Springer-Verlag, 1985.
27. B. Awerbuch, "Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems," in STOC '87, 1987, pp. 230-240.
28. C. Chiang, M. Sarrafzadeh, and C. Wong, "A powerful global router: based on Steiner min-max trees," in Proc. IEEE Int. Conf. CAD, 1989, pp. 2-5.
29. L. Wang and D.-Z. Du, "Approximations for a bottleneck Steiner tree problem," Algorithmica, vol. 32, pp. 554-561, 2002.
30. L. Wang and Z. Li, "An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane," Inform. Process. Lett., vol. 81, pp. 151-156, 2002.
31. M. Sarrafzadeh and C. Wong, "Bottleneck Steiner trees in the plane," IEEE Trans. Comput., vol. 41, no. 3, pp. 370-374, 1992.
32. R. E. Tarjan, Data Structures and Network Algorithms. SIAM, 1983.
33. M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, and V. Sacristan, "The farthest color Voronoi diagram and related problems," in Proc. 17th European Workshop Comput. Geom., 2001, pp. 113-116.
34. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.