- Opportunistic network enivonrment ONE. http://www.netlab.tkk.fi/tutkimus/dtn/theone/.Google Scholar
- Aruna Balasubramanian, Brian Neil Levine, and Arun Venkataramani. DTN routing as a resource allocation problem. In Proc. ACM SIGCOMM, August 2007. Google ScholarDigital Library
- John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM, April 2006.Google ScholarCross Ref
- Vijay Erramilli, Augustin Chaintreau, Mark Crovella, and Christophe Diot. Diversity of forwarding paths in pocket switched networks. In IMC '07: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pages 161--174, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. In Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), 2003.Google ScholarDigital Library
- Samuel C. Nelson, Albert F. Harris, and Robin Kravets. Event-driven, role-based mobility in disaster recovery networks. In CHANTS 07: Proceedings of the second workshop on Challenged networks, 2007. Google ScholarDigital Library
- Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In WDTN '05: Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, 2005. Google ScholarDigital Library
- Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, 2007. Google ScholarDigital Library
- Amin Vahdat and David Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Department of Computer Science, Duke University, apr 2000.Google Scholar
Index Terms
- Encounter: based routing in DTNs
Recommendations
An encounter-based multicast scheme for disruption tolerant networks
Some ad hoc network scenarios are characterized by frequent partitions and intermittent connectivity. Hence, existing ad hoc routing schemes that assume that an end-to-end path exists from a source to a destination do not work in such challenging ...
Encounter based fuzzy logic routing in delay tolerant networks
Delay tolerant networks (DTNs) are a newest class of networks that have the ability to provide connectivity to areas that are yet to be served by conventional networks. Routing in DTN is a tough task because nodes have no prior information about the ...
Encounter Count and Interaction Time-Based Routing Protocol for Opportunistic Networks
AbstractOpportunistic network is an extension of Mobile Ad-hoc network, and therefore, it shares most of the properties of the Mobile Ad-hoc network except routing protocols. Highly intermittent connections between nodes in opportunistic networks make the ...
Comments