Document Type
Article
Publication Date
2009
Publication Title
Ad Hoc Networks
Volume
7
Issue
3
First Page
569
Keywords
Information systems, Networks, Network protocols
Last Page
578
Abstract
This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. The players of the game are the wireless nodes with set of strategies {Forward, Not forward}. The game is played whenever an arbitrary node in the network receives a flooding packet. In FDG, every player needs to know the number of players of the game. That is why a neighbor discovery protocol (NDP) is introduced. In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. This provides the probability that the flooding packet would be forwarded by the receiver node. FDG with NDP is implemented in AODV protocol in Network Simulator NS-2 to verify its performance with simulations. FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase.
DOI
doi:10.1016/j.adhoc.2008.07.003
Recommended Citation
Naserian, Mohammad and Tepe, Kemal. (2009). Game theoretic approach in routing protocol for wireless ad hoc networks. Ad Hoc Networks, 7 (3), 569-578.
https://scholar.uwindsor.ca/electricalengpub/2
Comments
First published at http://dx.doi.org/10.1016/j.adhoc.2008.07.003