Skip to main content
SpringerLink
Log in

Dynamic DTN Routing Strategies Based on Knowledge

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

This paper presents a novel based-knowledge dynamic routing model with rate allocation for delay-tolerant networks (DTNs). The objectives are how to embody knowledge about destination offered by joint nodes and how to apply knowledge about destination to transfer data when the instantaneous end-to-end paths do not exist in DTNs. The first problem is addressed through a rate allocation model. For rate allocation, taking into account the dynamic feature of rate control as well as the selfish nature of joint nodes, we design a non-cooperative differential game model to offer efficient rate allocation scheme with the constraint of limited bandwidth, and obtain a feedback Nash equilibrium solution of the game. In this study, knowledge is valued information and provides advisable solutions to problems. For the second problem, assuming that the obtained value function in rate allocation model is the available knowledge about destination of joint node; with this assumption, a polynomial time routing algorithm is proposed to describe the procedure of the routing model.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In ACM SIGCOMM’03 (pp. 27–34).

  2. Jain, S., Fal, K., & Patra R. (2004). Routing in a delay tolerant network. In Proceedings of the SIGCOMM’2004 (pp. 145–158). Portland: ACM Press.

  3. Lu, X. F., & Hui, P. (2010). An energy-efficient n-epidemic routing protocol for delay tolerant networks. In 2010 Fifth IEEE International Conference on Networking, Architecture, and Storage (pp. 341–347).

  4. Wang, X., Shu, Y., Jin, Z., Pan, Q., & Lee, B. S. (2009). Adaptive randomized epidemic routing for disruption tolerant networks. In 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks (pp. 424–429).

  5. Jin, Z., Wang, J., Zhang, S., Zhang, S., & Shu, Y. (2010). Epidemic-based controlled flooding and adaptive multicast for delay tolerant networks. In 2010 Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing (pp. 191–193).

  6. Zhou, R., Cao, Y., Jin, J., & Zhu, D. (2010). Group based epidemic routing for delay and tolerant networks. In 2010 6th International Conference on Wireless Communications Workshops (pp. 760–763).

  7. Zhang J., Luo G. (2012) Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications 66(1): 217–233

    Article  Google Scholar 

  8. Tseng Y. C., Ni S. Y., Chen Y. S., Sheu J. P. (2002) The broadcast storm problem in a mobile ad hoc network. Wireless Networks 8(2–3): 153–167

    Article  MATH  Google Scholar 

  9. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (pp. 235–244).

  10. Harras, K. A., Almeroth, K. C., & BeldingRoyer, E. M. (2005). Delay tolerant mobile networks (dtmns): Controlled flooding in sparse mobile networks. In NETWORKING’05 Proceedings of the 4th IFIP-TC6 International Conference on Networking Technologies, Service, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems (pp. 1180–1192).

  11. Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., & Krishnan, R. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking (pp. 62–66).

  12. Chen, L.-J., Yu, C.-H., Sun, T., Chen Y.-C., & Chu, H.-H. (2006). A hybrid routing approach for opportunistic networks. In Proceedings of the 2006 SIGCOMM Workshop on Challenged Networks (pp. 213–220).

  13. Wang, Y., Jain, S., Martonosi, M., & Fall, K. (2005). Erasure coding based routing for opportunistic networks. In Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN) (pp. 229–236).

  14. Yuan, Q., Cardei, I., & Wu, J. (2009). Predict and relay: An efficient routing in disruption-tolerant networks. In Proceedings of the Tenth ACM International Symposium on Mobile ad hoc Networking and Computing (pp. 95–104).

  15. Spyropoulos T., Psounis K., Raghavendra C. S. (2008) Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking 16(1): 77–90

    Article  Google Scholar 

  16. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. (2006) Maxprop: Routing for vehicle-based disruption-tolerant networks. In 25th IEEE International Conference On Computer Communications (pp. 1–11).

  17. Park, H. S., Jang, J. H., Lee, S. H., & Kim, J. D. (2012). Position-based DTN routing in metropolitan bus network. In 2012 International Conference on Systems and Informatics (pp. 1449–1453).

  18. Tournoux P. U., Leguay J., Benbadis F., Whitbeck J., Conan V., Amorim M. D. (2011) Density-aware routing in highly dynamic DTNs: The RollerNet case. IEEE Transactions on Mobile Computing 10(12): 1755–1768

    Article  Google Scholar 

  19. Jones E. P. C., Li L., Schmidtke J. K., Ward P. A. S. (2007) Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing 6(8): 943–959

    Article  Google Scholar 

  20. Musolesi M., Mascolo C. (2009) CAR: Context-aware adaptive routing for delay tolerant mobile networks. IEEE Transactions on Mobile computing 8(2): 246–260

    Article  Google Scholar 

  21. de Oliveira, E. C. R., & de Albuquerque, C. V. N. (2009). NECTAR: A DTN routing protocol based on neighborhood contact history. In SAC’09 March (pp. 40–46).

  22. Tournoux P. U., Leguay J., Benbadis F., Whitbeck J., Conan V., Amorim M. D. (2011) Density-aware routing in highly dynamic DTNs: The RollerNet case. IEEE Transactions on Mobile Computing 10(12): 1755–1768

    Article  Google Scholar 

  23. Shannon C. E. (1948) A mathematical theory of communication. The Bell System Technical Journal 27: 379–423

    MathSciNet  Google Scholar 

  24. Yeung D. W. K., Petrosyan L. A. (2005) Cooperative stochastic differential games. Springer, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, 100083, People’s Republic of China

    Xian-wei Zhou, Zhi-mi Cheng, Yan Ding & Qian Liu

  2. School of Electrical and Electronic Engineering, Singapore Polytechnic, Singapore, Singapore

    Joo-Ghee Lim

Authors
  1. Xian-wei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhi-mi Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joo-Ghee Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qian Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-mi Cheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, Xw., Cheng, Zm., Ding, Y. et al. Dynamic DTN Routing Strategies Based on Knowledge. Wireless Pers Commun 71, 1819–1836 (2013). https://doi.org/10.1007/s11277-012-0912-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0912-z

Keywords

Search

Navigation