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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

New Adaptive Routing Proposal for DTN

by Mamoun Hussein Mamoun
journal cover thumbnail

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

Mamoun Hussein Mamoun . New Adaptive Routing Proposal for DTN. International Journal of Computer Applications. 82, 9 ( November 2013), 37-40. DOI=10.5120/14147-2306

@article{ 10.5120/14147-2306,
author = { Mamoun Hussein Mamoun },
title = { New Adaptive Routing Proposal for DTN },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 9 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number9/14147-2306/ },
doi = { 10.5120/14147-2306 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:57:20.276865+05:30
%A Mamoun Hussein Mamoun
%T New Adaptive Routing Proposal for DTN
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 9
%P 37-40
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In Disruption Tolerant Networks, packet forwarding scheme has a major drawback in terms of network congestion. In order to solve this problem, a New Adaptive Routing Proposal (NARP) has been proposed NARP uses the message forwarding probability scheme in order to increase the delivery ratio and bandwidth utilization. Also, NARP arranges the dropping sequence based on their assigned priority. The priority is determined by the average hop count and average latency. Meanwhile NARP has an ACK list exchange mechanism that is used to purge the redundant messages. Simulation of NARP was carried out and its performance was compared to well known DTN routing protocols: Epidemic Routing, and Spray and Wait Routing. Simulation results show that NARP outperforms them in terms of packet delivery ratio, average latency, and overhead ratio.

References
  1. P. Marshall. The disruption tolerant networking program, 2005. http://www. darpa. mil/sto/solicitations/DTN/briefs. htm.
  2. P. Basu and T. Little, "Networked parking spaces: architecture and applications", Preceding of the 56th IEEE Vehicular Technology Conference (VTC 2002-Fall), vol . 2, pp. 1153- 1157, 2002.
  3. S. Burleigh et al. , "Delay-tolerant networking: An approach to interplanetary internet", in IEEE Communications Magazine, vol. 41, no. 7, pp. 128-136, June, 2003.
  4. A. Doria, M. Udn, and D. P. Pandey, "Providing connectivity to the saami nomadic community", in Proc. 2nd Int. Conf. on Open Collaborative Design for Sustainable Innovation, Dec. 2002.
  5. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks", Duke Tech Report CS-2000-06, 2000
  6. A. Spyropoulos et al. , "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks", ACM SIGCOMM Wksp. Delay Tolerant Networking, pp. 252- 259, August, 2005.
  7. Spyropoulos T, Psounis K, Raghavendra C S. , "Single-Copy Routing in Intermittently Connected Mobile Networks", in Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004,pp. 235- 244, Oct. , 2004
  8. A. Lindgren, A. Doria, and O. Scheln, "Probabilistic routing in intermittently connected networks", In SIGMOBILE Mobile Computing and Comm. Rev. vol. 7, no. 3, pp. 19- 20, 2003.
  9. J. Burgess et al. , " Maxprop: Routing for vehicle-based disruption tolerant networks", In Proc. IEEE Infocom, 25th Int. Conf. on Computer Comm. pp. 1- 11, April, 2006.
  10. Sushant Jain, Kevin Fall, and Rabin Patra, "Routing in a delay tolerant network", In ACM SIGCOMM Computer Comm. Rev, vol. 34, no. 4, pp. 145-158, October, 2004.
  11. Zhao W, Ammar M, Zegura E. , "Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network", In IEEE INFOCOM, pp. 1407~1418, . vol. 2, March, 2005
  12. Krifa A, C Barakat, Spyropoulos T. , "An Optimal Joint Scheduling and Drop Policy for Delay Tolerant Networks", In World of Wireless, Mobile and Multimedia Networks (WoWMoM 2008 Int. Symposium), pp. :1~6 , June, 2008.
  13. X. Zhang, G. Neglia, J. Kurose, and D. Twosley, "Performance modeling of epidemic routing," in Proceedings of Int. Federation for Information Processing (IFIP) Networking, pp. 535-546, 2006.
  14. Mamoun Hussein Mamoun, "Efficient DTN Routing Protocol", International Journal of Computer Applications, vol. 80, no. 9, pp. 16-19, October, 2013. .
  15. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks", Technical Report CS 20006, Dept. of Computer Science, Duke University, Durham, NC 2000.
  16. Ari Keronen, and Jurg Ott, "The One simulator for DTN protocol evaluation", In SIMUTools, Rom, Italy, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

DTN routing New routing mechanism adaptive forwarding policy packet dropping policy.

Powered by PhDFocusTM