KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Optimal Control Of Two-Hop Routing In Dtns With Time-Varying Selfish Behavior

  • Wu, Yahui (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology) ;
  • Deng, Su (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology) ;
  • Huang, Hongbin (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology)
  • Received : 2012.03.22
  • Accepted : 2012.09.02
  • Published : 2012.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

Keywords

References

  1. K. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. of ACM SIGCOMM, pp.27-34, 2003.
  2. G. Papastergios, I. Psaras and V. Tsaoussidis, "Deep-space transport protocol: a novel transport scheme for space DTNs," Computer Communications, vol.32, no.16, pp.1757-1767, 2009. https://doi.org/10.1016/j.comcom.2009.02.012
  3. H. Zhu, S. Chang, M. Li, S, Naik, and X. Shen, "Exploiting temporal dependency for opportunistic forwarding in urban vehicular networks," in Proc. of IEEE INFOCOM, pp.2192-2200, 2011.
  4. C. E. Palazzi, and A. Bujari, "Social-aware delay tolerant networking for mobile-to-mobile file sharing," International Journal of Communication Systems, 2011.
  5. A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad hoc networks," Technical Report, Duke University, 2000.
  6. M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. On Networking, vol.10, no.4, pp.477-486, Aug.2002. https://doi.org/10.1109/TNET.2002.801403
  7. B. J. Choi, and X. Shen, "Adaptive asynchronous clock based power saving protocols for delay tolerant networks," in Proc. of GLOBECOM, pp.1-6, 2009.
  8. K. Xu, P. Hui, V. Li, J. Crowcroft, V. Latora and P. Lio, "Impact of altruism opportunistic communicaions," in Proc. of ICUFN, pp.153-158, 2009.
  9. P. Hui, K. Xu, V. Li, J. Crowcroft, V. Latora and P. Lio, , "Selfishness, altruism and message spreading in mobile social networks," in Proc. of IEEE NetSciCom, pp.1-6, 2009.
  10. B. Han, P. Hui, V. S. A. Kumar, M. Marathe, J. Shao and A. Srinivasan, "Mobile data offloading through opportunistic communications and social participation," IEEE Transactions on Mobile Computing, vol.11, no.5, pp.821-834, 2011.
  11. L. Buttyan, and J. -P. Hubaux, "Enforcing service availability in Mobile Ad-Hoc WANs," in Proc. ACM MobiHoc, pp.87-96, 2000.
  12. X. Zhuo, W. Gao, G. Cao, and Y. Dai, "Win-coupon: and incentive framework for 3G traffic offloading," in Proc. of IEEE Conference on Network Protocols (ICNP), pp.206-215, 2011.
  13. E. Altman, G. Neglia, F. D. Pellegrini and D. Miorandi, "Decentralized stochastic control of delay tolerant networks," in Proc. of INFOCOM, pp.1134-1142, 2009.
  14. Y. Li, Y. Jiang, D. Jin, L. Su, L. Zeng and D. Wu, "Energy-efficient optimal opportunistic forwarding for delay-tolerant networks," IEEE Transactions on Vehicular Technology, vol.59, no.9, pp.4500-4512, 2010.
  15. T. Spyropoulos, R. Rais, T. Turletti, K. Obraczka, and A. Vasilakos, "Routing for disruption tolerant networks: taxonomy and design," Wireless Networks, vol. 18, no. 8, pp. 2349-2370, 2010.
  16. S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant networks," in Proc. of ACM SIGCOMM, pp.145-158, 2004.
  17. W. Zhao, M. Ammar, and E. Zegura, "A message ferrying approach for data delivery in sparse mobile ad hoc networks," in Proc. of ACM MobiHoc, pp.187-198, 2004.
  18. R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks," Ad Hoc Networks, vol.1, no.2-3, pp.215-233, 2003. https://doi.org/10.1016/S1570-8705(03)00003-9
  19. T. Spyropoulos, T. Turletti, and K. Obraczka, "Routing in delay tolerant networks comprising heterogeneous node populations," IEEE Transactions on Mobile Computing, vol. 8, no. 8, pp. 1132-1147, 2009.
  20. T. Spyropoulos, K. Obraczka, and C. Raghavendra, "Spray and wait: efficient routing in intermittently connected mobile networks," in Proc. of ACM SIGCOMM Workshop on Delay Tolerant Networking, pp.252-259, 2005.
  21. M. Shiny, S. Hongyy, and I. Rhee, "DTN routing strategies using optimal search patterns," in Proc. of the third ACM Workshop on Challenged Networks, pp.27-32, 2008.
  22. Y. Wang, S. Jain, M. Martonosi, and K. Fall, "Erasure coding based routing for opportunistic networks," in Proc. of ACM SIGCOMM Workshop on Delay Tolerant Networking, pp.229-236, 2005.
  23. B. Zhao, W. Peng, Z. Song, J. Su, C. Wu, W. Yu, and Q. Hu, "Towards efficient and practical network coding in delay tolerant networks," Computers & Mathematics with Applications, vol.63, no.2, pp.588-600, 2012. https://doi.org/10.1016/j.camwa.2011.10.001
  24. R. Ramanathan, R. Hansen and P. Basu, "Prioritized epidemic routing for opportunistic networks," in Proc. of ACM/SIGMOBILE Workshop on Mobile Opportunistic Networking, pp.62-66, 2007.
  25. X. Zhang, G. Neglia, J. Kurose and D. Towsely, "Performance modeling of epidemic routing," in Proc. of IFIP Networking, pp.827-839, 2006.
  26. Y. K. Ip, W. -C. Lau and O. -C Yue, "Performance modeling of epidemic routing with heterogeneous node types," in Proc. of IEEE ICC, pp.219-224, 2008.
  27. P. Jacquet, B. Mans and G. Rodolakis, "Information propagation speed in mobile and delay tolerant networks," IEEE Transactions on Information Theory, vol.56, no.10, pp.5001-5015, 2010.
  28. E. Baccelli, P. Jacquet, B. Mans and G. Rodolakis, "Information propagation speed in bidirectional vehicular delay tolerant networks," in Proc. of IEEE INFOCOM, pp.685-693, 2011.
  29. A. AI-Hanbali, P. Nain and E. Altman, "Performance of ad hoc networks with two-hop relay routing and limited packet lifetime," in Proc. of IWQoS, pp.295-296, 2006.
  30. A. Jindal and K. Psounis, "Contention-aware performance analysis of mobility-assisted routing," IEEE Transactions on Computing, vol.8, no.2, pp.145-161, 2009.
  31. A. Panagakis, A. Vaios and I. Stavrakakis, "On the effects of cooperation in DTNs," in Proc. of COMSWARE, pp.1-6, 2007.
  32. M. Karaliopoulos, "Assessing the vulnerability of DTN data relaying schemes to node selfishness," IEEE Communications Letters, vo.13, no.12, pp.923-925, 2009.
  33. G. Resta, and P. Santi, "A framework for routing performance analysis in delay tolerant networks with application to non cooperative networks," IEEE Transaction on Parallel and Distributed Systems, vol.23, no.1, pp.2-10, 2012.
  34. Q. Li, S. Zhu and G. Cao, "Routing in socially selfish delay tolerant networks," in Proc. of INFOCOM, pp.1-9, 2010.
  35. Y. Li, P. Hui, D. Jin, L. Su and L. Zeng, "Evaluating the impact of social sefishness on the epidemic routing in delay tolerant networks," IEEE Communication Letters, vol.14, no.11, pp:1026-1028, 2010.
  36. Y. Li, G. Su, D. Wu, D. Jin, L. Su and L. Zeng, "The impact of node selfishness on multicasting in delay tolerant networks," IEEE Transactions on Vehicular Technology, vol.60, no.5, pp:2224-2238, 2011.
  37. T. Karagiannis, L. Boudec and M. Zojnovic, "Power law and exponential decay of inter contact times between mobile devices," in Proc. of ACM MobiCom, pp.183-194, 2007.
  38. H. Cai and D. Eun, "Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks," IEEE/ACM Transactions on Networking, vol.17, no.5, pp.1578-1591, 2009.
  39. W. Gao, Q. Li, B. Zhao and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in Proc. of ACM MobiHoc, pp.299-308, 2009.
  40. H. Zhu, L. Fu, G. Xue, Y. Zhu, M. Li and M. Li, "Recognizing exponential inter-contact time in VANETs," in Proc. of INFOCOM, pp.1-5, 2010.
  41. D. Grass, J. Caulkins, G. Feichtinger, G. Tragler and D. Behrens, "Optimal control of nonlinear processes: with applications in drugs, corruption, and terror," Springer Verlag, 2008.
  42. MHR. Khouzani, S. Sarkar, and E. Altman, "Optimal control of epidemic evolution," in Proc. of INFOCOM, pp.1683-1691, 2011.
  43. A. Keranen, J. Ott and T. Karkkainen, "The ONE simulator for DTN protocol evaluation," in Proc. of SIMUTOOLS, 2009.
  44. C. Bettstetter and C. Wagner, "The spatial node distribution of the random waypoint mobility model," in Proc. of WMAN, pp.41-58, 2002.
  45. Shanghai Taxi Trace Data [Online], Available: http://wirelesslab.sjtu.edu.cn.

Cited by

  1. On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks vol.71, pp.4, 2012, https://doi.org/10.1007/s11277-012-0970-2
  2. Optimal Beaconing Control in Delay-Tolerant Networks With Multiple Destinations vol.9, pp.4, 2015, https://doi.org/10.1109/jsyst.2014.2344733