Location independent compact routing for wireless networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Location independent compact routing for wireless networks

Full text

Pdf (122 KB)

Source

International Conference on Mobile Computing and Networking archive
Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking table of contents

Los Angeles, California

POSTER SESSION: Poster session table of contents

Pages: 57 - 59

Year of Publication: 2006

ISBN:1-59593-558-4

Authors

Robert Gilbert	University of California, Santa Barbara, CA
Kerby Johnson	University of California, Santa Barbara, CA
Shaomei Wu	University of California, Santa Barbara, CA
Ben Y. Zhao	University of California, Santa Barbara, CA
Haitao Zheng	University of California, Santa Barbara, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1161252.1161267 What is a DOI?

ABSTRACT

While reactive routing protocols such as AODV operate efficiently for small ad hoc wireless networks, their O(N) perflow control overhead limits deployment on larger-scale networks. Deployment of compact routing protocols such as geographic routing have met with challenges. In this paper, we present Table Attenuation Routing Protocol (TARP), a protocol that combines compact per-node routing state with scalability to large networks. Preliminary evaluation shows that TARP performs similar to AODV in smaller networks and better in larger networks.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, v.13 n.7, p.422-426, July 1970 [doi>10.1145/362686.362692]
	2	Josh Broch , David A. Maltz , David B. Johnson , Yih-Chun Hu , Jorjeta Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, p.85-97, October 25-30, 1998, Dallas, Texas, United States [doi>10.1145/288235.288256]
	3	Matthew Caesar , Miguel Castro , Edmund B. Nightingale , Greg O'Shea , Antony Rowstron, Virtual ring routing: network routing inspired by DHTs, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, September 11-15, 2006, Pisa, Italy
	4	Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., and Stoica, I. Towards a common API for structured P2P overlays. In Proc. of IPTPS (February 2003).
	5	Das, S. R., et al. Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Personal Communications (February 2001), 16--28.
	6	Fonseca, R., et al. Beacon vector routing: Scalable point-to-point in wireless sensornets. In Proc. of NSDI (Boston, MA, May 2004).
	7	Jacquet, P., et al. Optimized Link State Routing Protocol for Ad Hoc Networks. In Proc. of IEEE INMIC (Lahore, Pakistan, Dec. 2001).
	8	Johnson, D. B., and Maltz, D. A. Dynamic Source Routing in Ad-Hoc Wireless Networks. In Mobile Computing, vol. 353. Kluwer Academic Publishers, 1996.
	9	Brad Karp , H. T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, Proceedings of the 6th annual international conference on Mobile computing and networking, p.243-254, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345953]
	10	Kim, Y.-J., Govindan, R., Karp, B., and Shenker, S. Geographic routing made practical. In Proc. of NSDI (Boston, MA, May 2005).
	11	Leong, B., Liskov, B., and Morris, R. Geographic routing without planarization. In Proc. of NSDI (2006).
	12	Papapetrou, E., Pitoura, E., and Lillis, K. Speeding-up Cache Lookups in Wireless Ad-Hoc Routing using Bloom Filters. In Proc. of PIMRC (Berlin, Germany, Sept. 2005).
	13	Guangyu Pei , Mario Gerla , Xiaoyan Hong, LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility, Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, November 20, 2000, Boston, Massachusetts
	14	Charles E. Perkins , Pravin Bhagwat, Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers, Proceedings of the conference on Communications architectures, protocols and applications, p.234-244, August 31-September 02, 1994, London, United Kingdom
	15	Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
	16	Rhea, S. C., and Kubiatowicz, J. Probabilistic Location and Routing. In Proc. of INFOCOM (June 2002).
	17	Scalable Network Technologies. Qualnet Network Simulator, version 3.8, 2006. http://www.scalable-networks.com.
	18	Zhao, B. Y., et al. Tapestry: A global-scale overlay for rapid service deployment. IEEE JSAC 22, 1 (Jan. 2004).

CITED BY 2

	Thi Minh Chau Tran , Björn Scheuermann , Martin Mauve, Detecting the presence of nodes in MANETs, Proceedings of the second workshop on Challenged networks CHANTS, September 14-14, 2007, Montreal, Quebec, Canada
	Thi Minh Chau Tran , Björn Scheuermann , Martin Mauve, Lightweight detection of node presence in MANETs, Ad Hoc Networks, v.7 n.7, p.1386-1399, September, 2009