IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
A station strategy to deter backoff attacks in IEEE 802.11 LANs
Journal of Discrete Algorithms
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Radio resource sharing games: enabling QoS support in unlicensed bands
IEEE Network: The Magazine of Global Internetworking
Ad hoc multi-WLAN: a game-theoretic model of correlated play
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
DRinK: a defense strategy of cooperative wireless terminals in a wireless multihoming environment
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
| Hi-index | 0.00 |
Autonomous wireless multihomed stations (connected to multiple wireless networks) are likely to behave selfishly, trying at the same time to avoid crowded networks, select networks of higher data rates, and use the selected network in a more persistent way than standard MAC protocols prescribe. We analyze the underlying noncooperative game and find its Nash equilibria unsatisfactory. Yet for a repeated version of the game, a strategy of toggling between selfish and honest play can be devised, leading to all stations playing honest and resilient to sophisticated deviations that may seek an unfairly high bandwidth share. Numerical illustration is provided using a multi-WLAN model with each WLAN employing IEEE 802.11 MAC with a different data rate.