Optimal coverage paths in ad-hoc sensor networks

IEEE International Conference on Communications

Volumn 1, Issue , 2003, Pages 507-511

  Mehta, Dinesh P ^a   Lopez, Mario A ^b   Lin, Lan ^b  

^a Advanced Coatings and Surface Engineering Laboratory   (United States)

^b Ritchie School of Engineering and Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; REDUNDANCY;

SENSOR NETWORKS;

SENSORS;

EID: 0038052863     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. S. Meguerdichian, F. Khoushanfar, M. Potkonjak, and M. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks," in IEEE Infocom, pp. 1380-1387, 2001.
2. X.-Y. Li, P. J. Wan, O. Frieder, "Coverage in Wireless Ad-Hoc Sensor Networks," in ICC, 2002.
3. S. Meguerdichian, F. Khoushanfar, G. Qu, M. Potkonjak, "Exposure in Wireless Ad-Hoc Sensor Networks," in Proc. of 7th Ann. Int. Conf. on Mobile Computing and Networking (Mobicom), pp. 139-150, 2001.
4. A. Okabe, B. Boots, K. Sugihara, S. N. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. New York: Wiley, 1999.
5. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications. New York: Springer, 1997.
6. J. O'Rourke, Computational Geometry in C. New York: Cambridge University Press, 1998.
7. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms. New York: McGraw Hill, 2001.
8. B. Schieber and U. Vishkin, "On finding lowest common ancestors: simplifications and parallelization," SIAM Journal of Computing, vol. 17, pp. 1253-62, 1988.