Distributed and dynamic Voronoi overlays for coverage detection and distributed hash tables in ad-hoc networks

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 10, Issue , 2004, Pages 549-556

  Cǎrbunar, Bogdan ^a   Grama, Ananth ^a   Vitek, Jan ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE FORMULATIONS; DYNAMIC VORONOI OVERLAYS; MAP SERVICES; SENSOR NETWORKS;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTER SIMULATION; OPTIMIZATION; PROBLEM SOLVING; ROUTERS;

TELECOMMUNICATION NETWORKS;

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

References (18)

1. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001.
2. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, 2001.
3. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. LNCS, 2218:329-351, 2001.
4. B. Zhao, I. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, U. C. Berkeley, April 2001.
5. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. Ght: A geographic hash table for data-centric storage in sensornets. In Proceedings of the First ACM WSNA, September 2002.
6. I. Stojmenovic. Voronoi diagram and convex hull based geocasting and routing in wireless networks. Technical Report TR-99-11, University of Ottawa, December 1999.
7. Limin Hu. Topology control for multihop packet radio networks. IEEE Transactions on Communications, 41(10):1474-1481, October 1993.
8. J. O'Rourke. Open problem from art gallery solved. IJCGA, 2:215-217, June 1992.
9. K. Lieska, E. Laitinen, and J. Lahteenmaki. Radio coverage optimization using genetic algorithms. In IEEE PIMRC, 1998.
10. Z.J. Haas. On the relaying capability of the reconfigurable wireless networks. In. IEEE 47th Vehicular Technology Conference, volume 2, pages 1148-1152, May 1997.
11. S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak. Exposure in wireless ad hoc sensor networks. In Proceedings of MobiCom, July 2001.
12. Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proceedings of IEEE INFOCOM, 2001.
13. S. Shakkottai, R. Srikant, and N. Shroff. Unreliable sensor grids: Coverage, connectivity and diameter. In Proceedings of IEEE INFOCOM, April 2003.
14. Gerhard Albers, Leonidas J. Guibas, Joseph S. B. Mitchell, and Thomas Roos. Voronoi diagrams of moving points. IJCGA, 8(3):365-380, 1998.
15. Brad Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of MobiCom, pages 243-254, 2000.
16. Bose and Morin. Online routing in triangulations. In Proceedings of ISAAC, 1999.
17. Young-Bae Ko and Nitin H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proceedings of MobiCom, pages 66-75, 1998.
18. Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A. Woodward. A distance routing effect algorithm for mobility (DREAM). In Proceedings of MobiCom, 1998.