Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks

Ad-hoc networks are an emerging networking technology, in which the nodes form a network with no fixed infrastructure: each node forwards messages to the others by using the wireless links induced by their power levels. Generally, energy-efficient protocols heavily rely on cooperation. In this paper, we analyze from a game-theoretic point of view the problem of performing a broadcast operation from a given station s. We show both theoretical and experimental results on how the existence of (good) Nash equilibria is determined by factors such as the transmission power of the stations or the payment policy that stations can use to enforce their reciprocal cooperation.

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

[2]  Vittorio Bilò,et al.  On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks , 2004, ISAAC.

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

[4]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[5]  Kaveh Pahlavan,et al.  Wireless Information Networks , 1995 .

[6]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.

[7]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Stéphane Pérennes,et al.  Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem , 2004, NETWORKING.

[10]  Andrea E.F. Clementiy,et al.  A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks , 2007 .

[11]  Carmine Ventre,et al.  Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees , 2004, PE-WASUN '04.

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[14]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[16]  Kevin C. Almeroth,et al.  Real-world environment models for mobile network evaluation , 2005, IEEE Journal on Selected Areas in Communications.

[17]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.