Ram Ramanathan
ABSTRACT
We describe PRioritized EPidemic (PREP) for routing in opportunistic networks. PREP prioritizes bundles based on costs to destination, source, and expiry time. Costs are derived from per-link "average availability" information that is disseminated in an epidemic manner. PREP maintains a gradient of replication density that decreases with increasing distance from the destination. Simulation results show that PREP outperforms AODV and Epidemic Routing by a factor of about 4 and 1.4 respectively, with the gap widening with decreasing density and decreasing storage. We expect PREP to be of greater value than other proposed solutions in highly disconnected and mobile networks where no schedule information or repeatable patterns exist.
- Wizzyproject.http://www.wizzy.org.za.Google Scholar
- B. Burns, O. Brock, and B. Levine. Mv routing and capacity building in disruption tolerant networks. In In Proc. IEEE Infocom, August 2005.Google ScholarCross Ref
- E.W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math. 1:269, 271, 1959.Google Scholar
- J. Burgess et al. Maxprop: Routing for vehicle-based disruption tolerant networks. In In Proc. IEEE Infocom, 2006.Google Scholar
- P. Juang et al. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Proc. ASPLOS, Oct 2002. Google ScholarDigital Library
- S. Burleigh et al. Delay-tolerant networking: An approach to interplanetary internet. IEEE Communications Magazine, June, 2003. Google ScholarDigital Library
- T. Spyropoulos et al. Single-copy routing in intermittently connected mobile networks. In In Proc. IEEE SECON, 2004.Google ScholarCross Ref
- V. Cerf et al. Delay-tolerant network architecture, April 2007. Internet RFC 4838.Google Scholar
- K. Harras, K. Almeroth, and E. Belding-Royer. Delay tolerant mobile networks (dtmns): Controlled ooding schemes in sparse mobile networks, 2005. Google ScholarDigital Library
- Sushant Jain, Michael Demmer, Rabin Patra, and Kevin Fall. Using redundancy to cope with failures in a delay tolerant network. In SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pages 109--120, 2005. Google ScholarDigital Library
- Sushant Jain, Kevin Fall, and Rabin Patra. Routing in a delay tolerant network. In SIGCOMM, Aug 2004. Google ScholarDigital Library
- E.P.C. Jones, L. Li, and P.A.S. Ward. Practical routing in delay-tolerant networks. In In Proc. ACM WDTN, 2005. Google ScholarDigital Library
- A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. In Proc. ACM Mobihoc, 2003. Google ScholarDigital Library
- P. Marshall. The disruption tolerant networking program, 2005. http://www.darpa.mil/sto/solicitations/DTN/briefs.htm.Google Scholar
- A. Pentland, R. Fletcher, and A. Hasson. Daknet: Rethinking connectivity in developing nations. IEEE Computer 37(1), 78--83, Jan 2004. Google ScholarDigital Library
- T. Spyropoulos, K. Psounis, and C.S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected wireless networks. In Proc. ACM Sigcomm Workshop on DTN, 2005. Google ScholarDigital Library
- P. Jacquet T. Clausen. Optimized link state routing protocol (olsr), October 2003. Internet RFC 3626. Google ScholarDigital Library
- A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks, 2000.Google Scholar
- Z. Zhang. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communication Surveys and Tutorials, Jan 2006. Google ScholarDigital Library
- W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In In Proc. ACM Mobihoc, 2004. Google ScholarDigital Library
- W. Zhao, M. Ammar, and E. Zegura. Multicasting in delay tolerant networks: Semantic models and routing algorithms. In In Proc. ACM Workshop WDTN, 2005. Google ScholarDigital Library
Index Terms
- Prioritized epidemic routing for opportunistic networks
Recommendations
Agent-based multicast opportunistic routing protocol for wireless networks
HP-MOSys '13: Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systemsOpportunistic routing techniques achieve high throughput rates for the feeble and lossy links in wireless networks. Opportunistic Routing (OR) is a broadcast based technique widely used in Delay Tolerant Networks (DTNs) that uses the relay node ...
Heuristic Routing Protocol Research on Opportunistic Networks
HPCC '12: Proceedings of the 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and SystemsOpportunistic network is a kind of ad hoc networks which exploits the nodes' meeting opportunities to transmit messages. Routing protocols have a great impact on the efficiency of data transmitting in opportunistic networks, but common routing protocols ...
An Opportunistic Network Coding Routing for Opportunistic Networks
In opportunistic networks (OppNets), instead of assuming a complete path, messages are exchanged opportunistically when two nodes encounter. To support efficient and reliable end-to-end messaging in OppNets, a number of routing protocols based on ...
Comments