Game theoretic approach in routing protocol for wireless ad hoc networks

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.

[1]  R. Gibbons.  Game theory for applied economists , 1992 .

[2]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[3]  Udo W. Pooch,et al.  A game theoretic framework for bandwidth reservation in mobile ad hoc networks , 2004, First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks.

[4]  Andreas Diekmann,et al.  Cooperation in an asymmetric volunteer’s dilemma game Theory and experimental evidence , 1993 .

[5]  T. Nandagopal,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, MobiCom 1999.

[6]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[7]  Chong-Kwon Kim,et al.  Flooding in wireless ad hoc networks , 2001, Comput. Commun..

[8]  Silvia Giordano,et al.  Modelling cooperation in mobile ad hoc networks: a formal description of selfishness , 2003 .

[9]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[10]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Stephen B. Wicker,et al.  Selfish users in Aloha: a game-theoretic approach , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[12]  Yu-Chee Tseng,et al.  Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network , 2003, IEEE Trans. Computers.

[13]  S. Hart,et al.  Handbook of Game Theory with Economic Applications , 1992 .

[14]  Gianluigi Ferrari,et al.  Minimum number of neighbors for fully connected uniform ad hoc wireless networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[15]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[16]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[17]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[18]  Stephen B. Wicker,et al.  Stability of multipacket slotted Aloha with selfish users and perfect information , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[20]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[21]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[22]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[23]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[24]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[25]  A. Diekmann.  Volunteer's Dilemma , 1985 .

[26]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[27]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[28]  H. Inaltekin,et al.  A one-shot random access game for wireless networks , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[29]  Stephan Eidenbenz,et al.  Equilibria in Topology Control Games for Ad Hoc Networks , 2003, DIALM-POMC '03.