Profile

New User

New to Graphy Publications? Create an account to get started today.

Registered Users

Have an account? Sign in now.

How to Cite | Author Information | Publication History | Funding Information
International Journal of Computer & Software Engineering Volume 4 (2019), Article ID 4:IJCSE-145, 7 pages
https://doi.org/10.15344/2456-4451/2019/145
Research Article
An Efficient Message Forwarding Scheme with Epidemic Routing Considering the Number of Stopover Nodes in Delay Tolerant Network Environment

Yusuke Ishibayashi1* and Shinji Sugawara2

1Graduate School of Engineering, Chiba Institute of Technology, Chiba 275-0016, Narashino, Japan
2Faculty of Engineering, Chiba Institute of Technology, Chiba 275-0016, Narashino, Japan
Yusuke Ishibayashi, Graduate School of Engineering, Chiba Institute of Technology, Chiba 275-0016, Narashino, Japan; E-mail: s1422030dm@s.chibakoudai.jp
06 March 2019; 23 April 2019; 25 April 2019
Ishibayashi Y, Sugawara S (2019) An Efficient Message Forwarding Scheme with Epidemic Routing Considering the Number of Stopover Nodes in Delay Tolerant Network Environment. Int J Comput Softw Eng 4: 145. doi: https://doi.org/10.15344/2456-4451/2019/145
This work was partially supported by JSPS KAKENHI Grant Number JP17K00134.
© 2019 Ishibayashi et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

References

  1. Vahdat A, Becker D (2005) Epidemic Routing for Parti6ally Connected Ad Hoc Networks. Duke Tech 62: 210-228. View
  2. Socievole A, Rango FD, Coscarella C (2011) “Routing Approaches and Performance Evaluation in Delay Tolerant Networks”, Telecommunications Symposium (WTS), New York City, NY, 2011, pp. 1-6. View
  3. Spyropoulos T, Psounis K, Raghavendra CS (2005) “Spray and wait: an efficient routing scheme for intermittently connected mobile networks”, In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, ACM, pp 252- 259.
  4. Maitreyi P, Rao MS (2017) “Design of Binary Spray and wait protocol for intermittently connected mobile networks.” In 2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), Las Vegas, NV, pp. 1-3. View
  5. Burgess J, Gallagher B, Jensen D, Levine BN (2006) “MaxProp: Routing for Vehicle-Based Disruption- Tolerant Networks”, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, Barcelona, pp. 1-11. View
  6. Lindgren A, Doria A, Schelen O (2004) Probabilistic Routing in Intermittently Connected Networks. In: Dini P., Lorenz P., de Souza J.N. (eds) Service Assurance with Partial and Intermittent Resources. SAPIR 2004. Lecture Notes in Computer Science, vol 3126. Springer, Berlin, Heidelberg. View
  7. Ariwibisono FX, Basuki A, Ramdani F () Hybrid PRoPHET-Epidemic Routing Protocol for Optimizing Possibility of Sending Messages in Remote Fishermen Residential Area" Journal of Telecommunication, Electronic and Computer Engineering 10: 31-36. View
  8. Keranen A (2008) “Opportunistic Network Environment simulator”, Special Assignment Report, Helsinki University of Technology Department of Communications and Networking. View
  9. OpenStreetMap Foundation(OSMF), OpenStreetMap. View
  10. MapBasedMovement. View
Best viewed in Mozilla Firefox, Google Chrome, Safari, Above IE 9.0 version
Privacy Policy | Copyright & Permissions
Copyright © 2013-2024 Graphy Publications, All Rights Reserved.