Efficient computation of minimum exposure paths in a sensor network field

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

Volumn 4549 LNCS, Issue , 2007, Pages 295-308

  Djidjev, Hristo N ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; SENSOR NETWORKS; TOPOLOGY;

APPROXIMATION RATIOS; CONVEX POLYGON; EFFICIENT COMPUTATION; FASTER IMPLEMENTATION; GUARANTEED PERFORMANCE; NETWORK OF SENSORS; SENSOR FIELDS; TOPOLOGICAL CHARACTERISTICS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38149097134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover Publications, New York (1964)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs (1993)
3. Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1), 25-53 (2005)
4. Aurenhammer, F.: Voronoi diagrams - surrvey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345-405 (1991)
5. Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Ilyas, M., Mahgoub, I. (eds.) Handbook of Sensor Networks, CRC Press, Boca Raton (2004)
6. Clouqueur, T., Phipatanasuphorn, V., Ramanathan, P., Saluja, K.K.: Sensor deployment strategy for detection of targets traversing a region. ACM Mobile Networks and Applications 8(4), 453-461 (2003)
7. Gage, D.W.: Command control for many-robot systems. Unmanned Systems Magazine 10(4), 28-34 (1992)
8. Hata, M.: Empirical formula for propagation loss in land mobile radio services. IEEE Transactions on Vehicular Technology 29(3), 317-325 (1980)
9. Huang, H., Richa, A.W., Segal, M.: Dynamic coverage in ad-hoc sensor networks. Mobile Networks and Applications 10(1-2), 9-17 (2005)
10. Li, X.-Y., Wan, P.-J., Frieder, O.: Coverage in wireless ad hoc sensor networks. IEEE Transactions on Computers 52(6), 753-763 (2003)
11. Megerian, S., Koushanfar, F., Qu, G., Veltri, G., Potkonjak, M.: Exposure in wireless sensor networks: theory and practical solutions. Wireless Networks 8(5), 443-454 (2002)
12. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM, pp. 1380-1387 (2001)
13. Sun, Z., Reif, J.H.: Bushwhack: An approximation algorithm for minimal paths through pseudo-euclidean spaces. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 160-171. Springer, Heidelberg (2001)
14. Veltri, G., Huang, Q., Qu, G., Potkonjak, M.: Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: SenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 40-50. ACM Press, New York (2003)
15. Weinstock, R.: Calculus of Variations, with Applications to Physics and Engineering. Dover Publications, New York (1974)