MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
A Game Theoretic Framework for Bandwidth Reservation in Mobile Ad Hoc Networks
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Flooding in wireless ad hoc networks
Computer Communications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.