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

Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network

by Anjula Mehto, Meenu Chawla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 86 - Number 18
Year of Publication: 2014
Authors: Anjula Mehto, Meenu Chawla
10.5120/15088-3457

Anjula Mehto, Meenu Chawla . Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network. International Journal of Computer Applications. 86, 18 ( January 2014), 30-35. DOI=10.5120/15088-3457

@article{ 10.5120/15088-3457,
author = { Anjula Mehto, Meenu Chawla },
title = { Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 86 },
number = { 18 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 30-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume86/number18/15088-3457/ },
doi = { 10.5120/15088-3457 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:04:35.289126+05:30
%A Anjula Mehto
%A Meenu Chawla
%T Modified Different Neighbor History Spray and Wait using PROPHET in Delay Tolerant Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 86
%N 18
%P 30-35
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Delay Tolerant Networks or Disruption Tolerant Networks are intermittent networks that may lack continuous connectivity as most of the time there does not exist a direct link between source and destination for message transmission. In this paper, Modified DNH (Different Neighbor-History) Spray and Wait using PROPHET is proposed. It improves the wait phase of Different Neighbor-History Spray and Wait. This protocol calculates number of message copies to be forwarded based on performance of receiver node in spray phase and in wait phase the waiting node uses probabilistic routing protocol using history of encounters and transitivity for transmission. Simulation results show that this method improves delivery probability and average latency of transmission as compared to Spray and Wait and also DNH-Spray and Wait routing scheme.

References
  1. Fall, K. "A Delay-Tolerant Network architecture for challenged Inter­nets", In ACM SIGCOMM, 2003.
  2. Cerf, V. , Burleigh, S. , and Dust, R. 1995. "Interplanetary internet (IPN): Architectural Definition" Phil. Trans. Roy. Soc. London, vol. A247, 529-551.
  3. Dunbabin, M. , Corke, P. , Vailescu, I. , and Rus, D. 2006. Data muling over underwater wireless sensor networks using an autonomous underwater vehicle. In Proceedings of the Intl Conf on Robotics and Automation (ICRA) IEEE.
  4. Juang, P. , Oki, H. , and Wang, Y. 2002. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In Proceedings of the ASPLOS '02, Oct. 2002.
  5. Ivancic, W. , Eddy, W. , and Wood, L. 2008. Delay/Disruption-tolerant network testing using a LEO satellite". In Proceedings of the ESTC, Maryland.
  6. Warthman, F. , 2008. Delay Tolerant Networks (DTNs), a tutorial.
  7. Lindgren, A. , Doria, A. , and Schein, O. , Probabilistic routing in intermittently connected networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 239-254.
  8. Spyropoulos, T. , Psounis, K. , and Raghavendra, C. S. "Spray and Wait: An efficient routing scheme for intermittently connected mobile networks", in ACM, 2005.
  9. Prueksasri, V. , Intanagonwiwat, C. , and Rojviboonchai, K. 2011. DNH-SaW: The Different neighbor-history spray and wait routing scheme for delay tolerant networks. In Proceedings of the International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS).
  10. Jenjaturong, S. , and Intanagonwiwat, C. 2008. A set cover-based density control algorithm for sensing coverage problems in wireless sensor networks. In Proceedings of the 3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom.
  11. Xue, J. , Fan, X. , Cao, Y. , Fang J. and Li, J. 2009. Spray and wait routing based on average delivery probability in delay tolerant network. In Proceedings of the International Conference on Networks Security, Wireless Communications and Trusted Computing, Wuhan, Hubei, 500 – 502.
  12. Kim, Y. P. , Koo, J. , Jung, E. , Nakano, K. , Sengoku, M. , and Park, Y. J. 2010. Composite methods for improving spray and wait routing protocol in delay tolerant Networks. In Proceedings of the International Symposium on Communications and Information Technologies (ISCIT), Tokyo, 1229 – 1234.
  13. Wang, G. , Wang, B. , and Gao, Y. 2010. Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In Proceedings of the International Conference on Communications and Mobile Computing.
  14. Keranen, A. , Ott, L. , and Karkkainen, T. 2009. The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Belgium.
  15. Mehto A. , and Chawla, M. 2013. Comparing delay tolerant network routing protocols for optimizing L-copies in spray and wait routing for minimum delay. In Proceedings of the World Conference on Advances in Communication and Control Systems,(CAC2S), India.
Index Terms

Computer Science
Information Sciences

Keywords

Routing protocols Spray and wait routing PROPHET routing

Powered by PhDFocusTM