Skip to main content
SpringerLink
Log in

Optimal Routing Control in Delay Tolerant Networks with Time-Varying Fees

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Due to the uncertainty of the connections in delay tolerant networks, the source may need help from other nodes and make these nodes serve as relays to forward the messages to the destination. To further improve the performance, the source may also make these nodes serve as agents, which can help the source to make other nodes serve as relays. However, nodes may not be willing to help the source without any reward because of the selfish nature. This means that the source has to pay certain reward to the nodes that provide help. Furthermore, such fees may be varying with time. For example, if the nodes guess that the source is eager to transmit the message to the destination, they may ask for more reward. In addition, the reward that the source obtains from the destination may be varying with time, too. For example, the sooner the destination gets the message, the more reward may be. In such complex case, it may not be good for the source to request help all the time. This paper proposes a unifying theoretical framework based on Ordinary Differential Equations to evaluate the total reward that the source can obtain. Then, based on the framework, we study the optimal control problem by Pontryagin’s Maximum Principle and prove that the optimal policy confirms to the threshold form in some cases. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Furthermore, we demonstrate that the performance of the optimal policy is the best through extensive numerical results.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Yoo, J., Choi, S., & Kim, C. (2010). The multi-copy diversity for routing in sparse vehicular ad hoc netowrks. Telecommunication Systems, 50, 297–309.

    Article  Google Scholar 

  2. Dong, L., Liu, H., Zhang, Y., Palul, S., & Raychauduri, D. (2009). On the cache-and-forward network architecture. In Proceedings of ICC.

  3. Wu, Y., Deng, S., & Huang, H. (2012). Information propagation through opportunistic communication in mobile social networks. ACM/Springer Mobile Networks and Applications, 17, 773–781.

    Article  Google Scholar 

  4. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of ACM SIGCOMM.

  5. Hui, P., Xu, K., Li, V., Crowcroft, J., Latora, V., & Lio, P. (2009). Selfishness, altruism and message spreading in mobile social networks. In Proceedings of IEEE NetSciCom.

  6. Xu, K., Hui, P., Li, V., Crowcroft, J., Latora, V., & Lio, P. (2009). Impact of altruism opportunistic communicaions. In Proceedings of ICUFN.

  7. Vahdat, A., & Becker, D. (2000). Epidecmic routing for partially connected ad hoc networks. Duke University, Durham, NC, Technical Report. CS-200006.

  8. Altman, E., Neglia, G., Pellegrini, F. D., & Miorandi, D. (2009). Decentralized stochastic control of delay tolerant networks. In Proceedings of INFOCOM.

  9. Li, Y., Jiang, Y., Jin, D., Su, L., Zeng, L., & Wu, D. (2010). Energy-efficient optimal opportunistic forwarding for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 59(9), 4500–4512.

    Article  Google Scholar 

  10. Resta, G., & Santi, P. (2009). The effects of node cooperation level on routing performance in delay toelrant networks. In Proceedings of IEEE SECON.

  11. Karaliopoulos, M. (2009). Assessing the vulnerability of DTN data relaying schemes to node selfishness. IEEE Communication Letters, 15(12), 923–925.

    Article  Google Scholar 

  12. Han, B., Hui, P., Kumar, V. S. A., Marathe, M., Shao, J., & Srinivasan, A. (2012). Mobile data offloading through opportunistic communications and social participation. IEEE Transactions on Mobile Computing, 11, 821–834.

    Google Scholar 

  13. Gu, B., Hong, X., & Wang, P. (2011). Analysis for bio-inspired thrown-box assisted message dissemination in delay tolerant netowrks. Telecommunicaiton Systems, 52, 217–227.

    Article  Google Scholar 

  14. Soares, V., Farahmand, F., & Rodrigures, J. (2011). Traffic differentiation support in vehicular delay-tolerant networks. Telecommunication Systems, 18(1–2), 151–162.

    Article  Google Scholar 

  15. Chen, Y., Lin, Y., & Pan, C. (2011). DIR: Diagonal-intersection-based routing protocol for vehicular ad hoc networks. Telecommunication Systems, 46, 299–316.

    Article  Google Scholar 

  16. Liu, C., & Wu, J. (2009). An optimal probabilistic forwarding protocol in delay tolerant networks. In Proceedings of ACM MobiHoc.

  17. Wu, Y., Deng, S., & Huang, H. (2012). On modeling the impact of selfish behaviors on limited epidemic routing in delay tolerant networks. Wireless Personal Communications, 71, 2759–2782.

    Article  Google Scholar 

  18. Ramanathan, R., Hansen, R., & Basu, P. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedinds of ACM/SIGMOBILE workshop on mobile opportunistic networking.

  19. Zhang, X., Neglia, G., Kurose, J., & Towsley, D. (2007). Performance modeling of epidemic routing. Computer Networks, 51(10), 2867–2891.

    Article  MATH  Google Scholar 

  20. Ip, Y. K., Lau, W.-C., & Yue, O.-C (2008). Performance modeling of epidemic routing with heterogeneous node types. In Proceedings of IEEE ICC (pp. 219–224).

  21. Jacquet, P., Mans, B., & Rodolakis, G. (2010). Information propagatino speed in mobile and delay tolerant networks. IEEE Transactions on Information Theory, 56(10), 5001–5015.

    Article  MathSciNet  Google Scholar 

  22. Baccelli, E., Jacquet, P., Mans, B., & Rodolakis, G. (2011). Information propagton speed in bidirectionakl vehicular delay tolerant networks. In Proceedings of INFOCOM (pp. 685–693). Shanghai, China.

  23. AI-Hanbali, A., Nain, P., & Altman, E. (2006). Performance of ad hoc networks with two-hop relay routing and limited packet lifetime. In Proceedings of Valuetools.

  24. Jindal, A., & Psounis, K. (2009). Contention-aware performance analysis of mobility-assisted routing. IEEE Transactions on Computing, 8(2), 145–161.

    Google Scholar 

  25. Panagakis, A., Vaios, A., & Stavrakakis, I. (2007). On the effects of cooperation in DTNs. In Proceedings of COMSWARE (pp. 1–6).

  26. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. Proceedings of INFOCOM.

  27. Li, Y., Hui, P., Jin, D., Su, L., & Zeng, L. (2010). Evaluating the impact of social sefishness on the epidemic routing in delay tolerant networks. IEEE Communication Letters, 14(11), 1026–1028.

    Article  Google Scholar 

  28. Li, Y., Su, G., Wu, D., Jin, D., Su, L., & Zeng, L. (2011). The impact of node selfishness on multicasting in delay tolerant networks. IEEE Transactions on Vehicular Technology, 60(5), 2224–2238.

    Article  Google Scholar 

  29. Akkarajitsakul, K., Hossain, E. E., & Niyato, D. (2013). Coalition-based cooperative packet delivery under uncertainty: A dynamic Bayesian coalitional game. IEEE Transactions on Mobile Computing, 12(2), 371–385.

    Article  Google Scholar 

  30. Zhuo, X., Gao, W., Cao, G., & Dai, Y. (2011). Win-coupon: An incentive framework for 3g traffic offloading. In Proceedings of ICNP.

  31. Chen, I. R., Bao, F., Chang, M., & Cho, J. H. (2010). Trust management for encounter-based routing in delay tolerant networks. In Proceedings of GLOBECOM (pp. 1–6).

  32. Altman, E., Azad, A. P., Basar, T., & De Pellegrini, F. (2010). Optimal activation and transmission control in delay tolerant networks. In Proceedings of INFOCOM.

  33. Li, Y., Wang, Z., Jin, D., Su, L., Zeng, L., & Chen, S. (2012). Optimal beaconing control for epidemic routing in delay-tolerant networks. IEEE Transactions on Vehicular Technology, 61(1), 311–320.

    Article  Google Scholar 

  34. Singh, C., Kumar, A., & Sundaresan, R. (2010). Delay and energy optimal two-hop relaying in delay tolerant networks. In Proceedings of WiOpt (pp. 256–265).

  35. Khouzani, MHR., Sarkar, S., & Altman, E. (2011). Optimal control of epidemic evolution. In Proceedings of INFOCOM (pp. 2138–2146). Shanghai, China.

  36. Khouzani, MHR., Venkatesh, S.S., & Sarkar, S. (2011). Market based control of epidemics. In Proceedings of communication, control, and computing (pp. 314–320).

  37. Wu, Y., Deng, S., & Huang, H. (2013). Optimal incentive policy in delay tolerant networks with limited cost. Security and Communication Networks. doi:10.1002/sec.781.

  38. Wu, Y., Deng, S., & Huang, H. (2012). Optimal Routing Control in Disconnected Machine-to-Machine Networks. International Journal of Distributed Sensor Networks.

  39. Karagiannis, T., Boudec, L., & Zojnovic, M. (2007). Power law and exponential decay of inter contact times between mobile devices. In Proceedings of ACM MobiCom.

  40. Cai, H., & Eun, D. (2009). Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks. In IEEE/ACM Transactions on Networking.

  41. Gao, W., Li, Q., Zhao, B., & Cao, G. (2009). Multicasting in delay tolerant networks: a social network perspective. In Proceedings of ACM MobiHoc.

  42. Zhu, H., Fu, L., Xue, G., Zhu, Y., & Li, M., & Li, M. (2010). Recognizing exponential inter-contact time in VANETs. In Proceedind of INFOCOM.

  43. Grass, D., Caulkins, J., Feichtinger, G., Tragler, G., & Behrens, D. (2008). Optimal control of nonlinear processes: with applications in drugs, corruption, and terror. In Springer Verlag.

  44. Keranen, A., Ott, J., & Karkkainen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of SIMUTOOLS.

  45. Mei, A., & Stefa, J. (2009). SWIM: a simple model to generate small mobile worlds. In Proceedings of IEEE INFOCOM (pp. 2106–2113).

  46. Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., & Diot, C. (2005). Pocket switched networks and the consequences of human mobility in conference environments. In Proceedings of WDTN (pp. 244–251).

  47. Phoenix Scaling of Infocom 05 experiment with 1000 nodes [Online], Available: http://swim.di.uniroma1.it/.

  48. Shanghai Taxi Trace Data [Online], Available: http://wirelesslab.sjtu.edu.cn.

  49. Spyropoulos, T., Psounis, K., & Raghavendra, C. (2004). Single-copy routing in intermittently connected mobile networks. In Proceedings of SECON (pp. 235–244).

Download references

Author information

Authors and Affiliations

  1. Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha , 410073, China

    Yahui Wu, Hongbin Huang & Su Deng

Authors
  1. Yahui Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongbin Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Su Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yahui Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Y., Huang, H. & Deng, S. Optimal Routing Control in Delay Tolerant Networks with Time-Varying Fees. Wireless Pers Commun 75, 687–705 (2014). https://doi.org/10.1007/s11277-013-1385-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1385-4

Keywords

Search

Navigation