Sampling based sensor-network deployment

2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Volumn 2, Issue , 2004, Pages 1780-1785

  Isler, Volkan ^a   Kannan, Sampath ^a   Daniilidis, Kostas ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; LEARNING SYSTEMS; MOBILE ROBOTS; RANDOM PROCESSES; ROBOTICS; SAMPLING; WIRELESS TELECOMMUNICATION SYSTEMS;

AIRBORNE DEPLOYMENT; SENSOR-NETWORKS; WIRELESS NETWORKING; WIRELESS SENSOR NETWORKS;

SENSORS;

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

References (40)

1. A. Acampora. Last mile by laser. Scientific American, 287:48-53, July 2002.
2. P. K. Agarwal and S. Sen. Randomized algorithms for geometric optimization problems. Handbook of Randomization (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, eds.), Kluwer Academic Publishers, pages 151-201, 2001.
3. d. Advances in Applied Probability, 29(3):567-581, 1997.
4. d. Advances in Applied Probability, 29(3):582-594, 1997.
5. d. Statistics and Probability Letters, 60:351-377, 2002.
6. Maxim Batalin and Gaurav S. Sukhatme. Coverage, exploration and deployment by a mobile robot and communication network. Telecommunication Systems, 2004.
7. C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. In Proceedings of the third ACM international symposium on Mobile ad hoc networking and computing, pages 80-91. ACM Press, 2002.
8. B. Bollabas. Random Graphs. Cambridge University Press, 2001.
9. N. Bulusu, J. Heidemann, and D. Estrin. Adaptive beacon placement. In Twenty-first International Conference on Distributed Computing Systems (ICDCS-21), page xxx. University of California, Los Angeles, IEEE Computer Society, April 2001.
10. Peter I. Corke, Stefan E. Hrabar, Ron Peterson, Daniela Rus, Srikanth Saripalli, and Gaurav S. Sukhatme. Autonomous deployment and repair of a sensor network using an unmanned aerial vehicle. In IEEE International Conference on Robotics and Automation, 2004.
11. J. Cortés, S. Martínez, T. Karatas, and F. Bullo. Coverage control for mobile sensing networks. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 1327-1332, Arlington, VA, May 2002.
12. S. S. Dhillon and K. Chakrabarty. A fault-tolerant approach to sensor deployment in distributed sensor networks. Proc. Army Science Conference, Paper ID: JP-05, 2002.
13. 2. In J. Rolim, M. Luby, and M. Serna, editors, Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 294-306. Springer-Verlag, 1998.
14. J. Diaz, J. Petit, and M. J. Serna. Faulty random geometric networks. Parallel Processing Letters, 10(4):343-358, 2000.
15. S. Eidenbenz, C. Stamm, and P. Widmayer. Inapproximability results for guarding polygons and terrains. Algorithmica, 31:79-113, 2001.
16. D. Estrin, R. Govindan, J. S. Heidemann, and S. Kumar. Scalable coordination in sensor networks. In ACM Mobile Computing and Networking (MOBICOM), pages 263-270, 1999.
17. A. Farag. Scalable analysis and design of ad hoc networks via random graph theory. In Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications, pages 43-50. ACM Press, 2002.
18. H.H. Gonzalez-Banos and J.C. Latombe. A randomized art-gallery algorithm for sensor placement. Proc. ACM Symp. on Computational Geometry (SoCG'01), 2001.
19. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Birkhauser, Boston, 1998.
20. P. Gupta and P. R. Kumar. Internets in the sky: The capacity of three dimensional wireless networks. Communications in Information and Systems, 1:33-49, 2001.
21. D. Haussler and E. Welzl. ε-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
22. A. Howard, M. J. Mataric, and G.S. Sukhatme. An incremental self-deployment algorithm for mobile sensor networks. Autonomous Robots, Special Issue on Intelligent Embedded Systems, 13(2): 113-126, 2002.
23. V. Isler, S. Kannan, K. Daniilidis, and P.Valtr. VC-dimension of exterior visibility. "IEEE Trans. Pattern Analysis and Machine Intelligence", 26(5):667-671, 2004.
24. J. M. Kahn, R. H. Katz, and K. S. J. Pister. Mobile networking for "smart dust". In ACM Mobile Computing and Networking (MOBICOM), pages 271-278, 1999.
25. L. E. Kavraki, J. C. Latombe, R. Motwani, and Pr. Raghavan. Randomized query processing in robot path planning. In ACM Symposium on Theory of Computing, pages 353-362, 1995.
26. X. Y. Li, P. J. Wan, and O. Frieder. Coverage in wireless ad-hoc sensor networks, April 2002.
27. J. Matousek. Geometric computation and the art of sampling. In IEEE Symposium on Foundations of Computer Science, 1998.
28. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In INFOCOM, pages 1380-1387, 2001.
29. J. O'Rourke. Art Gallery Theorems And Algorithms. Oxford University Press, 1987.
30. J. O'Rourke. Visibility. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 25, pages 467-480. CRC Press LLC, 1997.
31. D. Payton, M. Daily, M. Howard, and C. Lee. Pheromone robotics. Autonomous Robots, 11(3):319-324, November 2001.
32. M. D. Penrose. On k-connectivity for a geometric random graph. Random Structures and Algorithms, 15(2): 145-164, 1999.
33. Sameera Poduri and Gaurav S. Sukhatme. Constrained coverage for mobile sensor networks. In IEEE International Conference on Robotics and Automation, 2004.
34. A. Savvides, C. Han, and M. Strivastav. Dynamic fine-grained localization in ad-hoc networks of sensor s. In ACM SIGMOBILE, Rome, Italy, July 2001.
35. S. D. Servetto and G. Barrenechea. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In 1st ACM International Workshop on Wireless Sensor Networks and Applications. ACM MobiCom, September 2002.
36. T. Shermer. Recent results in art galleries. Proceedings of the IEEE, 80:1384-1399, 1992.
37. K.A. Tarabanis, P.K. Allen, and R.Y. Tsai. A survey of sensor planning in computer vision. IEEE Trans. Robotics and Automation, 11:86-104, 1995.
38. P. Valtr. Guarding galleries where no point sees a small area. Israel Journal of Mathematics, 104:1-16, 1998.
39. V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.
40. Y. Zou and K. Chakrabarty. Sensor deployment and target localization in distributed sensor networks, accepted for publication in ACM Transactions on Embedded Computing Systems, 2003.