Skip to main content
SpringerLink
Log in

DTN Routing Method Based on Node Movement Prediction and Message Deliverability

  • Conference paper
  • First Online:
Advances in Network-Based Information Systems (NBiS 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 526))

Included in the following conference series:

Abstract

In recent years, sensors have been deployed for measurement for weather, environment, or traffic. The obtained data is used for analysis or research. When such sensors are deployed in huge numbers, cost of real-time monitoring is very high. Method for data collection at low cost is therefore required. Delay/Disruption Tolerant Networking (DTN), a networking method for communication without base stations, enables data collection at low cost. A model for sensor data recovery has been proposed for DTN, and it is considered to be effective for recovery of sensor data which can be delayed to some extent. However, DTN has a problem of consuming network resources by message replication. This is a problem in which message replication puts pressure on limited network resources such as buffer capacity and communication bandwidth, resulting in a decrease in the message arrival rate to the destination. In this paper, we propose a method for determining the destination of DTN data considering the expected path of the node. In the proposed method, duplicate transfer is carried out to the node which arrives near the destination. In the evaluation, we compare the number of arrived data with the number of generated data of the proposed method and that of the existing method. As a result of comparison, we confirmed the improvement of the arrival rate by the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 299.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of MobiHoc 2004, pp. 27–34 (2003)

    Google Scholar 

  2. Vahdat, A., Becker, D., et al.: Epidemic routing for partially connected ad hoc networks (2000)

    Google Scholar 

  3. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 252–259 (2005)

    Google Scholar 

  4. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Trans. Netw. 16(1), 77–90 (2008)

    Article  Google Scholar 

  5. Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)

    Article  Google Scholar 

  6. Shah, R.C., Roy, S., Jain, S., Brunette, W.: Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Netw. 1(2–3), 215–233 (2003)

    Article  Google Scholar 

  7. Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 187–198 (2004)

    Google Scholar 

  8. Sugihara, R., Gupta, R.K.: Speed control and scheduling of data mules in sensor networks. ACM Trans. Sensor Netw. (TOSN) 7(1), 1–29 (2010)

    Article  Google Scholar 

  9. Sugihara, R., Gupta, R.K.: Path planning of data mules in sensor networks. ACM Trans. Sensor Netw. (TOSN) 8(1), 1–27 (2011)

    Article  Google Scholar 

  10. Citovsky, G., Gao, J., Mitchell, J.S.B., Zeng, J.: Exact and approximation algorithms for data mule scheduling in a sensor network. In: Bose, P., Gąsieniec, L.A., Römer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 57–70. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28472-9_5

    Chapter  Google Scholar 

  11. Ngu, K., Ouahada, K., Rimer, S.: Using mini-bus taxis as data mules. In: 2018 IEEE 7th International Conference on Adaptive Science and Technology (ICAST), pp. 1–7. IEEE (2018)

    Google Scholar 

  12. Yaacoub, E., Abualsaud, K., Khattab, T., Chehab, A.: Secure transmission of IoT mHealth patient monitoring data from remote areas using DTN. IEEE Netw. 34(5), 226–231 (2020)

    Article  Google Scholar 

  13. Bonola, M., Bracciale, L., Loreti, P., Amici, R., Rabuffi, A., Bianchi, G.: Opportunistic communication in smart city: experimental insight with small-scale taxi fleets as data carriers. Ad Hoc Netw. 43, 43–55 (2016)

    Article  Google Scholar 

  14. Derakhshanfard, N., Sabaei, M., Rahmani, A.M.: Sharing spray and wait routing algorithm in opportunistic networks. Wirel. Netw. 22(7), 2403–2414 (2016)

    Article  Google Scholar 

  15. Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, pp. 1–10 (2009)

    Google Scholar 

Download references

Acknowledgements

The author is grateful to Mr. Ryusei Fukuda for suggesting the topic treated in this paper.

Author information

Authors and Affiliations

  1. Kochi University of Technology, 185 Miyanokuchi, Kami, Kochi, Japan

    Kazunori Ueda

Authors
  1. Kazunori Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kazunori Ueda .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Hiroyoshi Miwa

  3. Faculty of Bussiness Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ueda, K. (2022). DTN Routing Method Based on Node Movement Prediction and Message Deliverability. In: Barolli, L., Miwa, H., Enokido, T. (eds) Advances in Network-Based Information Systems. NBiS 2022. Lecture Notes in Networks and Systems, vol 526. Springer, Cham. https://doi.org/10.1007/978-3-031-14314-4_27

Download citation

Publish with us

Policies and ethics

Search

Navigation