[{“box”:0,”content”:”[if 992 equals=”Open Access”]n
n
Open Access
nn
n
n[/if 992]n
n
n
n
n
n
Mangadevi Atti, Manas Kumar Yogi
n
- n t
n
n
n[/foreach]
n
n[if 2099 not_equal=”Yes”]n
- [foreach 286] [if 1175 not_equal=””]n t
- Assistant Professor, Assistant Professor, Information Technology Department, Pragati Engineering College (Autonomous), Surampalem, Computer Science and Engineering Department, Pragati Engineering College (Autonomous), Surampalem, Andhra Pradesh, Andhra Pradesh, India, India
n[/if 1175][/foreach]
n[/if 2099][if 2099 equals=”Yes”][/if 2099]n
Abstract
nThis article explores the application of game theory principles to enhance opportunistic routing in Mobile Ad hoc Networks (MANETs). MANETs are characterized by their dynamic topology, limited resources, and lack of infrastructure, making traditional routing protocols less efficient. Opportunistic routing leverages the mobility of nodes and the broadcast nature of wireless communication to achieve reliable message delivery. However, existing opportunistic routing algorithms may suffer from challenges such as high message loss rates and excessive overhead. By incorporating game theory principles, such as strategic decision-making and incentive mechanisms, into the routing process, this research aims to improve the performance and efficiency of opportunistic routing in MANETs. The proposed approach enables nodes to strategically decide when and where to forward messages based on their own utility functions, network conditions, and interactions with other nodes. Through simulation studies and performance evaluations, the effectiveness of the game theory-based opportunistic routing algorithm is demonstrated in terms of packet delivery ratio, end-to-end latency, and overhead reduction. The results highlight the potential of game theory to address the inherent uncertainties and dynamics of MANETs, leading to more robust and adaptive routing solutions.
n
Keywords: Game Theory, MANETs, Routing, Congestion, Network Traffic
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Mobile Computing Technology(ijmct)]
n
n
n
n
n
nn
nn[if 992 equals=”Open Access”] Full Text PDF Download[/if 992]
[if 379 not_equal=””]nBrowse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
- Li, Limiao, et al. “GIR: an opportunistic network routing algorithm based on game theory.” IEEE Access 8 (2020): 201158-201172.
- Khan, Burhan Ul Islam, et al. “A game theory-based strategic approach to ensure reliable data transmission with optimized network operations in futuristic mobile adhoc networks.” Ieee Access 8 (2020): 124097-124109.
- Habib, Md Arafat, and Sangman Moh. “Game theory-based routing for wireless sensor networks: A comparative survey.” Applied Sciences 9.14 (2019): 2896.
- Tran, Thong Nhat, et al. “A game theory based clustering protocol to support multicast routing in cognitive radio mobile ad hoc networks.” IEEE Access 8 (2020): 141310-141330.
- Khan, Burhan Ul Islam, et al. “Game theory analysis and modeling of sophisticated multi-collusion attack in MANETs.” IEEE Access 9 (2021): 61778-61792.
- Ryu, Joonsu, and Sungwook Kim. “Reputation-Based Opportunistic Routing Protocol Using Q-Learning for MANET Attacked by Malicious Nodes.” IEEE Access (2023).
- Chakchouk, Nessrine. “A survey on opportunistic routing in wireless communication networks.” IEEE Communications Surveys & Tutorials 17.4 (2015): 2214-2241.
- Li, Yongqiang, et al. “A new adaptive multipath routing algorithm based on game theory for ad hoc networks.” Journal of High Speed Networks 24.4 (2018): 297-310.
- Mumtaz, Shahid, and Atilio Gameiro. “Game Theory in Wireless Ad-hoc Opportunistic Radios.” Q. Huang, Game Theory. Rijeka: Intech (2010): 41-49.
- Wu, Di, et al. “Routing algorithm based on multi-community evolutionary game for VANET.” Journal of Networks 7.7 (2012): 1106.
- Dalal, Renu, et al. “Proliferation of opportunistic routing: A systematic review.” IEEE Access 10 (2021): 5855-5883.
- Saifullah, Zhi Ren, and Dong Ren. “PR-BBGT: a probabilistic routing protocol based on bilateral bargaining game theory for oppnets.” Proceedings of the 5th International Conference on Communication and Information Processing. 2019.
- Sobin, C. C., Vaskar Raychoudhury, and Snehanshu Saha. “An incentive-based scheme for mitigating node selfishness in smart opportunistic mobile networks.” Wireless Personal Communications 96 (2017): 3533-3551.
- Xu, Yang, et al. “Incentive jamming-based secure routing in decentralized internet of things.” IEEE Internet of Things Journal 8.4 (2020): 3000-3013.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
n
n
n
n
| Volume | 02 | |
| [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] | 01 | |
| Received | March 4, 2024 | |
| Accepted | March 19, 2024 | |
| Published | May 8, 2024 |
n
n
n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]