Routing and Buffer managment based on game theory in delay tolerant network

Document Type : Original Article

Authors

Department of Computer Engineering, Tabriz Islamic Azad University

Abstract

Delay tolerant networks are a group of wireless networks that suffer long-term and frequent disconnections due to the scattered distribution of nodes and their movement. In these networks, which are a type of mobile networks, there may not be a connected path from the sender to the receiver, so message delivery is done by opportunistic routing based on the store, carry and Forward pattern. Routing is one of the main challenges in these networks. Routing consists of the steps of choosing a replay node, buffer management and data transmission. Various methods have been proposed to deal with the routing challenge. Most of these methods are only about replay node selection and few have discussed about buffer management and alternative packet selection. Considering that the problem of choosing an alternative package from the buffer is decision-making, it seems that using game theory can be effective in improving buffer management. In this paper, at each step of the routing process and when two nodes meet after determining the sender and receiver nodes, a method is presented that, based on game theory, decides with which packet from the receiving node's buffer if the buffer of the received packet is full, to be replaced. The simulation results of this method using THE ONE simulator show that buffer management with the proposed method increases the delivery ratio and reduces the average delay and overhead ratio.

Keywords

References

 [1] Khalid, O., Rais, R.N.B. & Madani, S.A. Benchmarking and Modeling of Routing Protocols for Delay Tolerant Networks. Wireless Pers Commun 94, 859–888 (2017).
[2] Kyung Min Baek, Dong Yeong Seo, Yun Won Chung. An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes, Appl. Sci. 2018, 8(8).
 [3] Haq, Abdul, and Yasir Faheem. "A peer-to-peer communication based content distribution protocol for incentive-aware delay tolerant networks." Wireless Networks 26.1 (2020): 583-601.‏
[4] MAO, Yuxin, et al. A fair credit-based incentive mechanism for routing in DTN-based sensor network with nodes’ selfishness. EURASIP Journal on Wireless Communications and Networking, 2020, 2020.1: 1-18.‏
[5] ESFANDIARI, Samira; REZVANI, Mohammad Hossein. An optimized content delivery approach based on demand–supply theory in disruption-tolerant networks. Telecommunication Systems, 2021, 76.2: 265-289.‏
 [6] LIN, Deyu; WANG, Quan. A game theory based energy efficient clustering routing protocol for WSNs. Wireless Networks, 2017, 23.4: 1101-1111.‏
[7] Benchmarking and Modeling of Routing Protocols for Delay Tolerant Networks Osman Khalid1 • Rao Naveed Bin Rais2 • Sajjad A. Madani1 Published online: 31 August 2016
Springer Science+Business Media New York 2016
[8] Oualhaj, O. A., Kobbane, A., Elmachkour, M., Sabir, E., & Ben-Othman, J. (2015). A coalitional-game-based incentive mechanism for content caching in heterogeneous delay tolerant networks. In 2015 international wireless communications and mobile computing conference (IWCMC) (pp. 987–992). IEEE.
[9] Yu, S., Zhang, L., Li, L., & Wang, X. (2018). Cost-aware cooperative theory based routing in mobile opportunistic networks. In China conference on wireless sensor networks (pp. 3–11). Springer.
[10]  Cong, L., Zhou, X., Li, N., Zhu, H., Fan, Y., & Bu, L. (2022, January). Research on Distributed Energy Trading Strategy Based on Game Theory. In 2022 International Conference on Big Data, Information and Computer Network (BDICN) (pp. 439-446). IEEE.
[11] Jedari, B., Liu, L., Qiu, T., Rahim, A., & Xia, F. (2017). A game-theoretic incentive scheme for social-aware routing in selfish mobile social networks. Future Generation Computer Systems, 70, 178–190.
[12]  Wu, B., Zeng, J., Shao, S., Ni, W., & Tang, Y. (2022). New Game-theoretic Approach to Decentralized Path Selection and Sleep Scheduling for Mobile Edge Computing. IEEE Transactions on Wireless Communications. Singh, J., Dhurandher, S. K., & Woungang, I. (2022).
[13] Ghafouri-ghomi, Z., & Rezvani, M. H. (2022). An optimized message routing approach inspired by the landlord-peasants game in disruption-tolerant networks. Ad Hoc Networks, 127, 102781 .
[14] Yu, S., Zhang, L., Li, L., & Wang, X. (2018). Cost-aware cooperative theory based routing in mobile opportunistic networks. In China conference on wireless sensor networks (pp. 3–11). Springer.
[15]  Kumar, S., Goswami, A., Gupta, R., Singh, S. P., & Lay-Ekuakille, A. (2022). A Game-Theoretic Approach for Cost-Effective Multicast Routing in the Internet of Things. IEEE Internet of Things Journal.
[16]. Singh, J., Dhurandher, S. K., & Woungang, I. (2022). Game Theory-Based Energy Efficient Routing in Opportunistic Networks. In International Conference on Advanced Information Networking and Applications (pp. 627-639). Springer, Cham.
[17]. Vimala, V., Pavani, L., & Vinoba, V. (2022). A Study of Repeated Game Theory in Wireless Sensor Networks. Journal of Optoelectronics Laser, 41(3), 289-292. Hadded, M., Minet, P., & Lasgouttes, J. M. (2021).
[18]. Game Theory-Based Energy Efficient Routing in Opportunistic Networks. In International Conference on Advanced Information Networking and Applications (pp. 627-639). Springer, Cham.
[19]. A game theory‐based route planning approach for automated vehicle collection. Concurrency and Computation: Practice and Experience, 33(16), e6246.
[20]. Hao, Z., Hou, J., Dang, J., Dang, X., & Qu, N. (2021). Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality. International Journal of Distributed Sensor Networks, 17(2), 1550147721996248.
[21]. Ghaffari, & Mahmoudi. (2021). Energy-aware routing in wireless sensor networks by combining multi-layer perceptron neural network algorithms and simulated annealing. Electronic and Cyber Defense, 9(3), 133-142. In persian.

Files

History

  • Receive Date: 12 September 2023
  • Revise Date: 05 December 2023
  • Accept Date: 21 December 2023
  • Publish Date: 18 January 2024

Share

How to cite

Statistics