Neighbor Selection Game in Wireless Ad Hoc Networks

In wireless ad hoc networks, there is no infrastructure to enforce cooperation between nodes. As a result, nodes may act selfishly when running network protocols to conserve their energy resources as much as possible. In this paper, we consider the “neighbor selection” game in which each individual node tries to selfishly choose its neighborhood such that its own energy consumption is optimized. We first focus on a simplified version of this game where nodes know their transmission power before participating in the game. After analyzing the problem, we propose a couple of distributed algorithms to find stable topologies using two kinds of global and local connectivity information. We then take into account the general case where the transmission powers are unknown variables and should be determined during the game. Finally, we evaluate the performance of the proposed algorithms through simulations.

[1]  Paolo Santi,et al.  A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks , 2006, DIWANS '06.

[2]  Jamal N. Al-Karaki,et al.  Stimulating Node Cooperation in Mobile Ad hoc Networks , 2008, Wirel. Pers. Commun..

[3]  Nasser Yazdani,et al.  Joint range assignment and routing to conserve energy in wireless ad hoc networks , 2009, Comput. Networks.

[4]  Marwan Krunz,et al.  CDMA-based MAC protocol for wireless ad hoc networks , 2003, MobiHoc '03.

[5]  Piet Van Mieghem,et al.  Phase transition in the link weight structure of networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Allen B. MacKenzie,et al.  Analyzing Selfish Topology Control in Multi-Radio Multi-Channel Multi-Hop Wireless Networks , 2009, 2009 IEEE International Conference on Communications.

[7]  Jan Karel Lenstra,et al.  The complexity of the network design problem : (preprint) , 1977 .

[8]  Nasser Yazdani,et al.  Energy-efficient topology control in wireless ad hoc networks with selfish nodes , 2012, Comput. Networks.

[9]  Max Q.-H. Meng,et al.  Game-Theoretic Modeling of Joint Topology Control and Power Scheduling for Wireless Heterogeneous Sensor Networks , 2009, IEEE Transactions on Automation Science and Engineering.

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

[11]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[12]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Krishna M. Sivalingam,et al.  A Survey of Energy Efficient Network Protocols for Wireless Networks , 2001, Wirel. Networks.

[14]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[15]  Yunhuai Liu,et al.  Topology Control in Wireless Ad Hoc Networks with Selfish Nodes , 2008 .

[16]  Allen B. MacKenzie,et al.  Effect of Selfish Node Behavior on Efficient Topology Design , 2008, IEEE Transactions on Mobile Computing.

[17]  Harish Sethu,et al.  Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  P. Van Mieghem,et al.  Influence of the link weight structure on the shortest path , 2005 .

[19]  Bin Liu,et al.  Virtual Game-Based Energy Balanced Topology Control Algorithm for Wireless Sensor Networks , 2013, Wirel. Pers. Commun..

[20]  Baochun Li,et al.  Strategyproof Mechanisms towards Evolutionary Topology Formation in Autonomous Networks , 2004 .

[21]  V. Georgiev.  Using Game Theory to Analyze Wireless Ad Hoc Networks . ” , 2008 .

[22]  Richard T. Wong,et al.  Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.

[23]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[24]  A. C. Graves,et al.  A Method for Measuring Half-Lives , 1947 .

[25]  Chuan Yi Tang,et al.  Approximation algorithms for the shortest total path length spanning tree problem , 2000, Discret. Appl. Math..

[26]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..

[27]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[28]  Baochun Li,et al.  Strategyproof Mechanisms towards Dynamic Topology Formation in Autonomous Networks , 2005, Mob. Networks Appl..

[29]  L. Shapley,et al.  Potential Games , 1994 .

[30]  Krishan Kumar,et al.  Literature Survey on Power Control Algorithms for Mobile Ad-hoc Network , 2011, Wirel. Pers. Commun..

[31]  Sunil Samtani,et al.  Cognitive topology control based on game theory , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[32]  Allen B. MacKenzie,et al.  The price of ignorance: distributed topology control in cognitive networks , 2010, IEEE Transactions on Wireless Communications.

[33]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[34]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[35]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[36]  Xiang-Yang Li,et al.  Localized topology control for unicast and broadcast in wireless ad hoc networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[37]  A.B. MacKenzie,et al.  Distributed topology control in ad-hoc networks: a game theoretic perspective , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[38]  Nasser Yazdani,et al.  Efficient construction of network topology to conserve energy in wireless ad hoc networks , 2008, Comput. Commun..

[39]  Abtin Keshavarzian,et al.  Load balancing in ad hoc networks: single-path routing vs. multi-path routing , 2004, IEEE INFOCOM 2004.