CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient DTN Routing Protocol

by Mamoun Hussein Mamoun
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 80 - Number 9
Year of Publication: 2013
Authors: Mamoun Hussein Mamoun
10.5120/13889-1813

Mamoun Hussein Mamoun . Efficient DTN Routing Protocol. International Journal of Computer Applications. 80, 9 ( October 2013), 16-19. DOI=10.5120/13889-1813

@article{ 10.5120/13889-1813,
author = { Mamoun Hussein Mamoun },
title = { Efficient DTN Routing Protocol },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 80 },
number = { 9 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume80/number9/13889-1813/ },
doi = { 10.5120/13889-1813 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:54:06.310126+05:30
%A Mamoun Hussein Mamoun
%T Efficient DTN Routing Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 80
%N 9
%P 16-19
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a novel routing protocol for Disruption Tolerant Networks (DTNs) called Efficient DTN Routing Protocol (EDRP). EDRP smartly integrates the forwarding and buffer management policies into an adaptive protocol that includes a local network parameters estimation mechanism. It dynamically adjusts the delivery probability for messages according to a new metric. Meanwhile, EDRP arranges the forwarding sequence and the dropping priority based on their assigned weight. The weight is determined by the Replication Density (RD), the Message Length (ML), and Message Remaining Life Time (MRLT). An extensive simulation of EDRP was carried out and its performance was compared to well known DTN routing protocols: PRoPHET, and Epidemic Routing protocols. Simulation results show that the proposed routing protocol outperforms them in terms of packet delivery ratio , delivery delay and message overhead.

References
  1. K. Fall, "A delay-tolerant network architecture for challenged internets", Proc. of ACM SIGCOMM, pp 27-34, Aug. , 2003.
  2. S. Jain, K. Fall, and R. Patra, "Routing in a delay- tolerant network", Proc. of ACM SIGCOMM, pp 145-158, 2004.
  3. J. Scott, P. Hui, J. Crowcroft, C. Diot, "Haggle: A Networking Architecture Designed Around Mobile Users" Proc. 3rd Annual Conference of IFIP WONS, Jan. 2006.
  4. L. Pelusi, A. Passarella, and M. Conti, "Opportunistic Networking: data forwarding in disconnected mobile ad hoc networks", IEEE Communications Magazine, vol. 44, no. 11, pp. 134- 141, Nov. 2006.
  5. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks", Tech. Rep. CS-2000-06, CS Dept. , Duke University, April 2000.
  6. A. Lindgren et al, "Probabilistic Routing in Intermittently Connected Networks", Mobile Comp. and Comm. Rev, vol. 7, no. 3, pp. 19- 20, July 2003.
  7. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: Efficient routing in intermittently connected mobile networks", In Proceedings of ACMSIGCOMM workshop on Delay Tolerant Networking (WDTN'5), pp 252-259, 2005.
  8. T. Spyropoulos, K. Psounis, and Cauligi S. Raghavendra, "Spray and Focus Efficient Mobility-Assisted Routing for Heterogeneous and correlated Mobility", in Proc. PerCom. Workshops apos, pp 79-85, March 2007.
  9. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "MaxProp: Routing for Vehicle-Based Disruption- Tolerant Networks", In Proc. IEEE Infocom, pp. 1-11, IEEE, April 2006.
  10. Gabriel Sandulescu, and Simin Nadjm-Tehrani, "Opportunistic DTN routing with window-aware adaptive replication", AINTEC' 08, November, 18- 20, Bangkok, Thailand.
  11. Mamoun H. M. , "Efficient Routing Scheme for Opportunistic Networks ", International Journal of Engineering and Technology, Vol. 2, No 6, pp. 940-945, June 2012.
  12. Mamoun H. M. , S. El Barrak "Adaptive Priority Routing Protocol for DTN Networks ", International Journal of Engineering and Technology, Vol. 3, No 3, pp. 258-264, March 2013.
  13. Mamoun H. M. and, S. El Barrak, "Proposed Fuzzy Based Routing for DTN", International Journal of Computer Applications, Vol. 66, No 6, pp. 19-22, March 2013.
  14. A. Mathurapoj, C. Pronavalai and G. Chakraborty, "Fuzzy-spray: Efficient routing in delay tolerant ad-hoc network based on fuzzy decision mechanism", Fuzzy Systems, 2009. FUZZ-IEEE 2009. IEEE International Conference on, IEEE, 2009, PP. 104-109.
  15. Shubo Xu, "Theory of Analytic and Hierarchy Process", Tianjin University, 1988.
  16. X. Zhang, G. Kurose, and D. Twosley, "Performance modeling of epidemic routing", in Proceeding of IFIP Networking, 2006.
  17. Ari Keronen, and Jurg Ott, "The One simulator for DTN protocol evaluation", in SIMUTools 2009, Rom, Italy.
Index Terms

Computer Science
Information Sciences

Keywords

DTN Adaptive Routing Weight Estimation Drop Policy.

Powered by PhDFocusTM