Computing best coverage path in the presence of obstacles in a sensor field

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4619 LNCS, Issue , 2007, Pages 577-588

  Roy, Senjuti Basu ^a   Das, Gautam ^a   Das, Sajal ^a  

^a University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; WIRELESS SENSOR NETWORKS;

BEST COVERAGE PATH (BCP); EUCLIDEAN DISTANCE;

SENSORS;

EID: 38149014043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_50     Document Type: Conference Paper

References (15)

1. Lingas, A.: Voronoi diagrams with barriers and their applications. Inform. Process. Letters 32, 191-198 (1989)
2. Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)
3. Chew, L.P.: Constrained delaunay triangulations. In: Proceedings of the third annual symposium on Computational geometry, pp. 215-222 (1987)
4. Cormen, T.J., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press and McGraw-Hill (1990)
5. Meguerdichian, C.S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. Infocom. (April 2001)
6. Aurenhammer, F., Stekl, G.: On the peeper's voronoi diagram. SIGACT News 22(4), 50-59 (1991)
7. Gage, D.W.: Command control for many-robot systems. Nineteenth Annual AUVS Technical Symposium, Reprinted in Unmanned Systems Magazine, vol. 10(4), pp. 28-34 (January 1992)
8. Ghosh, S., Mount, D.: An outputsensitive algorithm for computing visibility graphs. SIAM Journal of Computing 20(5), 888-910 (1991)
9. Li, X.-Y., Wan, P.-J., Frieder, O.: Coverage problems in wireless ad-hoc sensor networks. IEEE Transactions for Computers 52, 753-763 (2003)
10. Megerian, S., Koshanfar, F., Potonjak, M., Srivastava, M.B.: Worst and best-case coverage in sensor networks. IEEE Transaction for Mobile Computing 4, 84-92 (2005)
11. Seidel, R.: Constrained delaunay triangulations and Voronoi diagrams with obstacles. Rep. 260, IIG-TU Graz, Austria, pp. 178-191 (1988)
12. Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad hoc sensor networks. In: Procs. of 7th Annual International Conference on Mobile Computing and Networking (MobiCom '01), pp. 139-150 (July 2001)
13. Wang, C.A., Tsin, Y.H.: Finding constrained and weighted voronoi diagrams in the plane. Computational Geometry: Theory and Applications 10(2), 89-104 (1998)
14. Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook on Computational Geometry, pp. 973-1026. Elsevier Science Publishers, Amsterdam (2000)
15. Art gallery theorems and algorithms. Oxford University Press, Inc., Oxford, J. O'Rourke (1987)