Locating and bypassing routing holes in sensor networks

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2458-2468

  Fang, Qing ^a   Gao, Jie ^a   Guibas, Leonidas J ^a  

^a Stanford University   (United States)

Author keywords

Combinatories; Graph theory; System design

Indexed keywords

COMBINATORICS; MOBILE NETWORK; ROUTING; ROUTING PROTOCOLS;

GRAPH THEORY; NETWORK PROTOCOLS; PACKET NETWORKS; ROUTERS; SYSTEMS ANALYSIS; WIRELESS TELECOMMUNICATION SYSTEMS;

SENSORS;

EID: 8344224464     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris, "A scalable location service for geographic ad-hoc routing," in Proc. 6th Annu. ACM/IEEE International Conference on Mobile Computeing and Networking., 2000.
2. 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 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), 2002, pp. 78-87. [Online]. Available: citeseer.nj.nec.com/ratnasamy02ght.html
3. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. MobiCom, 2000, pp. 243-254.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in 3rd Int. Workshop on Discrete Algorithms and methods for mobile computing and communications (DialM '99), 1999, pp. 48-55.
5. Y. Yu, R. Govindan, and D. Estrin, "Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks," UCLA/CSD-TR-01-0023, Tech. Rep., 2001.
6. D. Ganesan and D. Estrin, "DIMENSIONS:why do we need a new data handling architecture for sensor networks?" in First workshop on Hot Topics in Networks, 2002.
7. J. Hightower and G. Borriello, "Location systems for ubiquitous computing," IEEE Computer, vol. 34, no. 8, pp. 57-667, August 2001.
8. A. Savvides, C.-C. Han, and M. B. Strivastava, "Dynamic fine-grained localization in ad-hoc networks of sensors," in Proc. MobiCom, 2001, pp. 166-179.
9. A. Savvides and M. B. Strivastava, "Distributed fine-grained localization in ad-hoc networks," IEEE Transactions of Mobile Computing, 2003.
10. A. Ward, A. Jones, and A. Hopper, "A new location technique for the active office," IEEE Personnel Communications, vol. 4, no. 5, pp. 42-47, October 1997.
11. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York, NY: Springer-Verlag, 1985.
12. J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanner for routing in mobile networks," in Proc. 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing. 2001, pp. 45-55.
13. J. Liebeherr, M. Nahas, and W. Si, "Application-layer multicasting with delaunay triangulation overlays," IEEE Journal on Selected Areas in Communications, vol. 20, no. 8, October 2002.
14. M. Mauve, J. Widmer, and H. Hartenstein, "A survey on position-based routing in mobile ad hoc networks," IEEE Network Magazine, vol. 15, no. 6, pp. 30-39, November 2001. [Online]. Available: citeseer.nj.nec.com/article/ mauve01survey.html
15. F. Kuhn, R. Wattenhofer, and A. Zollinger, "Asymptotically optimal geometric mobile ad-hoc routing," in Proc. Dial-M. 2002, pp. 24-33.
16. _. "Worst-case optimal and average-case efficient geometric ad-hoc routing," in Proc. MobiHoc, 2003, pp. 267-278.