NECTAR

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

NECTAR: a DTN routing protocol based on neighborhood contact history

Full text

Pdf (531 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents

Honolulu, Hawaii

SESSION: Computer networks track table of contents

Pages 40-46

Year of Publication: 2009

ISBN:978-1-60558-166-8

Authors

Etienne C. R. de Oliveira	Universidade Federal Fluminense
Célio V. N. de Albuquerque	Universidade Federal Fluminense

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 30, Downloads (12 Months): 81, Citation Count: 0

Additional Information:

abstract references 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/1529282.1529290 What is a DOI?

ABSTRACT

There are a number of scenarios where connectivity is intermittent, and a given destination may not be reachable at the moment a message is sent. Networks with these characteristics are known as Delay and Disruption Tolerant Networks (DTN). The NECTAR protocol proposed in this article is based on the contacts history in order to create a Neighborhood Index and then determine the most appropriated route for DTNs. Simulations performed with real data retrieved from mobile and wireless environments at Dartmouth College in scenarios where the occurrence of highly-partitioned networks is frequent, and with the presence of resource constrained nodes show that NECTAR is able to deliver more messages than Epidemic and PROPHET protocols with lower consumption of network resources.

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	Aruna Balasubramanian , Brian Levine , Arun Venkataramani, DTN routing as a resource allocation problem, Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, August 27-31, 2007, Kyoto, Japan
	2	J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE Infocom, pages 1--11, 2006.
	3	S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss. Delay-tolerant networking: an approach to interplanetary internet. IEEE Communications Magazine, 41(6): 128--136, 2003.
	4	T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. In Proc. IEEE IWCMC, 2(5): 483--502, 2002.
	5	A. Doria, M. Uden, and D. P. Pandey. Providing connectivity to the saami nomadic community. In Proc. Open Collaborative Design for Sustainable Development, 2002.
	6	Sushant Jain , Kevin Fall , Rabin Patra, Routing in a delay tolerant network, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
	7	D. Kotz, T. Henderson, and I. Abyzov. Downloaded from http://crawdad.cs.dartmouth.edu/dartmouth/campus/syslog/01_04, Dec. 2004.
	8	J. Leguay, T. Friedman, and V. Conan. Evaluating mobility pattern space routing for DTNs. In Proc. IEEE Infocom, pages 1--10, 2006.
	9	Chien-Shiu Lin , Wei-Shyh Chang , Ling-Jyh Chen , Cheng-Fu Chou, Performance Study of Routing Schemes in Delay Tolerant Networks, Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops, p.1702-1707, March 25-28, 2008 [doi>10.1109/WAINA.2008.216]
	10	A. Lindgren and A. Doria. Probabilistic routing protocol for intermittently connected networks. RFC Draft, Internet Engineering Task Force, Fev 2008.
	11	Anders Lindgren , Avri Doria , Olov Schelén, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing and Communications Review, v.7 n.3, July 2003 [doi>10.1145/961268.961272]
	12	OLPC. One laptop per child, 2008. Available at: http://laptop.org/.
	13	Ram Ramanathan , Richard Hansen , Prithwish Basu , Regina Rosales-Hain , Rajesh Krishnan, Prioritized epidemic routing for opportunistic networks, Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking, June 11-11, 2007, San Juan, Puerto Rico [doi>10.1145/1247694.1247707]
	14	Libo Song , David Kotz , Ravi Jain , Xiaoning He, Evaluating location predictors with extensive Wi-Fi mobility data, ACM SIGMOBILE Mobile Computing and Communications Review, v.7 n.4, October 2003 [doi>10.1145/965732.965747]
	15	Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.252-259, August 26-26, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080139.1080143]
	16	UMass. Umass trace repository, 2007. Available at: http://traces.cs.umass.edu/.
	17	A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.
	18	Xiaolan Zhang , Giovanni Neglia , Jim Kurose , Don Towsley, Performance modeling of epidemic routing, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.10, p.2867-2891, July, 2007 [doi>10.1016/j.comnet.2006.11.028]
	19	W. Zhao , M. Ammar , E. Zegura, A message ferrying approach for data delivery in sparse mobile ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, May 24-26, 2004, Roppongi Hills, Tokyo, Japan [doi>10.1145/989459.989483]