Using Incompletely Cooperative Game Theory in Mobile Ad Hoc Networks

2007 ◽  
Author(s):  
L. Zhao ◽  
J. Zhang ◽  
K. Yang ◽  
H. Zhang
Keyword(s):  
Game Theory ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Cooperative Game ◽  
Ad Hoc ◽  
Cooperative Game Theory ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Improved Proactive Routing Protocol Considering Node Density Using Game Theory in Dense Networks

2020 ◽  
Vol 12 (3) ◽  
pp. 47
Author(s):  
Omuwa Oyakhire ◽  
Koichi Gyoda
Keyword(s):  
Game Theory ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Dense Networks ◽  
Proactive Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Control Packets

In mobile ad hoc networks, network nodes cooperate by packet forwarding from the source to the destination. As the networks become denser, more control packets are forwarded, thus consuming more bandwidth and may cause packet loss. Recently, game theory has been applied to address several problems in mobile ad hoc networks like energy efficiency. In this paper, we apply game theory to reduce the control packets in dense networks. We choose a proactive routing protocol, Optimized Link State Routing (OLSR) protocol. We consider two strategies in this method: willingness_always and willingness_never to reduce the multipoint relay (MPR) ratio in dense networks. Thus, nodes with less influence on other nodes are excluded from nomination as MPRs. Simulations were used to confirm the efficiency of using our improved method. The results show that the MPR ratio was significantly reduced, and packet delivery ratio was increased compared to the conventional protocol.

Sign in / Sign up

Export Citation Format

Share Document