Conjecture-based channel selection game for delay-sensitive users in multi-channel wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Noncooperative carrier sense game in wireless networks
IEEE Transactions on Wireless Communications
Rethinking thresholds-based rate adaptation algorithms: a reverse engineering perspective
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Random access protocols for WLANs based on mechanism design
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic conjectures in random access networks using bio-inspired learning
IEEE Journal on Selected Areas in Communications
Threshold optimization for rate adaptation algorithms in IEEE 802.11 WLANs
IEEE Transactions on Wireless Communications
Random access for elastic and inelastic traffic in WLANs
IEEE Transactions on Wireless Communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Stackelberg contention games in multiuser networks
EURASIP Journal on Advances in Signal Processing - Special issue on game theory in signal processing and communications
Medium access control protocols with memory
IEEE/ACM Transactions on Networking (TON)
Pathbook: Cross-layer optimization for full-duplex wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.07 |
This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly participating in a non-cooperative game. Each link attempts to maximize a selfish local utility function, whose exact shape is reverse-engineered from the protocol description, through a stochastic subgradient method in which the link updates its persistence probability based on its transmission success or failure. We prove that existence of a Nash equilibrium is guaranteed in general. Then we establish the minimum amount of backoff aggressiveness needed, as a function of density of active users, for uniqueness of Nash equilibrium and convergence of the best response strategy. Convergence properties and connection with the best response strategy are also proved for variants of the stochastic-subgradient-based dynamics of the game. Together with known results in reverse-engineering TCP and BGP, this paper further advances the recent efforts in reverse-engineering layers 2-4 protocols. In contrast to the TCP reverse-engineering results in earlier literature, MAC reverse-engineering highlights the non-cooperative nature of random access.