Open Access Open Access  Restricted Access Subscription or Fee Access

Performance Comparison of DTN Routing Protocols for Delay Tolerant Networks with Cluster Based Movement Model

Harminder Singh Bindra, A.L. Sangal

Abstract


Opportunistic Networks or DTN are the class of networks where the nodes do not have contemporaneous connections, but intermittent connections. The main characteristic of DTN packet delivery is large end-to-end path latency and a DTN routing protocols has to cope with frequent disconnections. In this paper we have investigated the performance of four different routing protocols namely Epidemic, Prophet, Maxprop and Spray and Wait (SNW) under cluster based movement model scenario. For the simulation we have used Opportunistic Network Environment (ONE) Simulator. The performance is analyzed on three metrics: Delivery Probability, Overhead Ratio, and Average Latency. From the simulation results obtained it is analyzed that the Maxprop routing protocol gives the best performance in the considered scenario and simulation setting. Maxprop gives best delivery probability of about 0.99 as compared to delivery probability of spray and wait, prophet and epidemic which varies between 0.l45 to 0.55. The average latency of maxprop is minimum whereas Maxprop has second lowest overhead ratio among the considered routing protocols.

Keywords


Delay Tolerant Networks, Epidemic, Prophet, RAPID, Opportunistic Network, Opportunistic Network Environment (ONE)

Full Text:

PDF

References


Zhensheng Zhang; , "Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges," IEEE Communications Surveys & Tutorials, vol.8, no.1, pp.24-37, First Quarter 2006

Luciana Pelusi, Andrea Passarella, and Marco Conti,“Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad hoc Networks”, IEEE Communications Magazine, Vol. 44, No. 11. (November 2006), pp. 134-141.

Sushant Jain, Kevin Fall, and Rabin Patra. 2004. Routing in a delay tolerant network. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '04). ACM, New York, NY, USA, 145-158.

VAHDAT, A., AND BECKER, D. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.

Anders Lindgren, Avri Doria, and Olov Schel 2003. Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7, 3 (July 2003), 19-20.

Leguay, J.; Friedman, T.; Conan, V.; , "Evaluating Mobility Pattern Space Routing for DTNs," INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings , vol., no., pp.1-10, April 2006

Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra, “Single-Copy Routing in Intermittently Connected Mobile Networks,” First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. pp. 235-244.

Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (WDTN '05). ACM, New York, NY, USA, pp 252-259.

Spyropoulos, T.; Psounis, K.; Raghavendra, C.S.; , "Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case," Networking, IEEE/ACM Transactions on , vol.16, no.1, pp.77-90, Feb. 2008

Anders Lindgren, Avri Doria, and Olov Schel 2003. Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7, 3 (July 2003), 19-20.

G Ari Ker Ott, and Teemu K. 2009. The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques (Simutools '09).

TKK/COMNET. Project page of the ONE simulator. http://www.netlab.tkk.fi/tutkimus/dtn/theone, 2009.

Aruna Balasubramanian, Brian Levine, and Arun Venkataramani. DTN routing as a resource allocation problem. In Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '07). ACM, New York, NY, USA, pp 373-384


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.