CFP last date
20 May 2024
Reseach Article

Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks

by Paresh C. Patel, Nikhil N. Gondaliya
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 18
Year of Publication: 2015
Authors: Paresh C. Patel, Nikhil N. Gondaliya
10.5120/ijca2015907576

Paresh C. Patel, Nikhil N. Gondaliya . Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks. International Journal of Computer Applications. 131, 18 ( December 2015), 29-35. DOI=10.5120/ijca2015907576

@article{ 10.5120/ijca2015907576,
author = { Paresh C. Patel, Nikhil N. Gondaliya },
title = { Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 131 },
number = { 18 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 29-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number18/23550-2015907576/ },
doi = { 10.5120/ijca2015907576 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:27:43.977268+05:30
%A Paresh C. Patel
%A Nikhil N. Gondaliya
%T Encounter based Routing and Buffer Management Scheme in Delay Tolerant Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 18
%P 29-35
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Delay Tolerant Networks (DTNs) are one of the most interesting evolutions of MANETs where frequent disconnection of networks is there so that end to end path not establish between source to destination. When seeing routing protocols of DTNs, a forwarding and buffer management are important to be considered for successful message delivery. ‘Encounter Based Routing (EBR)’ which increase delivery ratio by decreasing overhead and delay using the encounter value of the nodes. EBR takes the average Encounter Value (EV) of the node and decide that how many copies of the message to be sent to the other nodes. Higher the EV value, the node will get more number of message copies. We propose the modified EBR which optimizes the performance of the existing EBR. We consider the change of rate of EV with respect to time and then intelligently decide the number of replicas to be sent to the encountered nodes. The modified EBR scheme performs better in terms of delivery ratio than the existing EBR protocol. We also propose the buffer management policy using EV of the node to decide the dropping of the message in the Epidemic routing protocol. These schemes are HEV (High Encounter Value) and LEV (Low Encounter Value) and they are compared with the existing traditional policies such as LIFO and FIFO. The simulation results show that our proposed dropping policy improves the overhead ratio, delivery delay and hop count metrics than the existing ones.

References
  1. SuvarnaPatil, Geetha R. Chillerge "Delay Tolerant Networks – Survey Paper" ISSN: 2248-9622, Vol. 4, Issue 2(Version 2), pp.21-25 February 2014, IJERA.
  2. Yue Cao and Zhili Sun,"Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges" Communications Surveys & Tutorials, Vol.15, No. 2, Second Quarter 1553-877X/13/$31.00 @ 2013 IEEE.
  3. Salman Ali, Junaid Qadir, Adeel Baig, "Routing Protocols in Delay Tolerant Networks – A Survey" ICET 978-1-4244-8058-6/10/$26.00 ©2010 IEEE.
  4. Samuel C. Nelson, Mehedi Bakht, and Robin Kravets “Encounter–Based Routing in DTNs” INFOCOM 978-1-4244-3513-5/09/$25.00 ©2009 IEEE.
  5. Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks" SIGCOMM’05 Workshops, ACM 1-59593-026-4/05/0008 .August 22–26, @ 2005.
  6. Eung-Hyup Kim, Jae-Choong Nam, Jae-In Choi, You-Ze Cho "Probability-based Spray and Wait Protocol in Delay Tolerant Networks" ICOIN 978-1-4799-3689-2/14/$31.00 ©2014 IEEE.
  7. Amin Vahdat and David Becker "Epidemic routing for partially connected ad hoc networks" Technical Report CS-200006, Duke University, April 2000.
  8. Ker Anen, “Opportunistic Network Environment Simulator. Special assignment report, helsinki University of Technology,” Department of Communications and Networking, May 2008.
  9. Sweta Jain, Meenu Chawla, "Survey of buffer management policies for delay tolerant networks", doi: 10.1049/joe.2014.0067 The Journal of Engineering.
  10. Anita Rani, Sangeeta Rani, Harminder Singh Bindra. “Performance Evaluation of MaxProp Routing Protocol with DL, FIFO, DLA and MOFO Buffer Management Techniques in DTN under Variable Message Buffer Size” IJERT, ISSN: 2278-0181 Vol. 3 Issue 2, February – 2014.
  11. CRAWDAD Community for Wireless Data At Dartmouth,http://crawdad.org/keyword-DTN.htm
Index Terms

Computer Science
Information Sciences

Keywords

DTNs Epidemic Spray and Wait (SnW) Encounter Routing Protocol (EBR) ONE Simulator LIFO FIFO EHV (Encounter High Value) and ELV (Encounter Low Value).