The Analysis of a Game Theoretic MAC Protocol for Wireless Networks Export

@proceedings{citeulike:2373463, abstract = {We give a rigorous mathematical analysis of a game-theoretic MAC protocol for wireless networks. We begin with a wireless communication network in which n selfish nodes (agents), which might have different perceived utilities, contend for access on a common wireless communication channel. We first formulate this distributed multiple access problem in terms of a one-shot random access game, and characterize the Nash equilibria of the game. We then look at the asymptotic properties of the system as n rarr infin. When all nodes are identical, the best possible bounds on the rate of convergence of the asymptotic packet arrivals and the channel throughput are given. The analysis of the asymptotic packet arrivals in the heterogeneous case concludes the paper}, author = {Inaltekin, H. and Wicker, S.}, booktitle = {Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on}, citeulike-article-id = {2373463}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/SAHCN.2006.288434}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4068132}, doi = {10.1109/SAHCN.2006.288434}, journal = {Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on}, keywords = {gametheory, network, wireless}, pages = {296--305}, posted-at = {2008-03-10 19:46:12}, priority = {2}, title = {The Analysis of a Game Theoretic MAC Protocol for Wireless Networks}, url = {http://dx.doi.org/10.1109/SAHCN.2006.288434}, volume = {1}, year = {2006} }

TY - CONF ID - citeulike:2373463 L3 - citeulike-article-id:2373463 N2 - We give a rigorous mathematical analysis of a game-theoretic MAC protocol for wireless networks. We begin with a wireless communication network in which n selfish nodes (agents), which might have different perceived utilities, contend for access on a common wireless communication channel. We first formulate this distributed multiple access problem in terms of a one-shot random access game, and characterize the Nash equilibria of the game. We then look at the asymptotic properties of the system as n rarr infin. When all nodes are identical, the best possible bounds on the rate of convergence of the asymptotic packet arrivals and the channel throughput are given. The analysis of the asymptotic packet arrivals in the heterogeneous case concludes the paper JF - Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on EP - 305 TI - The Analysis of a Game Theoretic MAC Protocol for Wireless Networks VL - 1 T2 - Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on SP - 296 KW - gametheory KW - network KW - wireless AU - Inaltekin, H AU - Wicker, S PY - 2006/// UR - http://dx.doi.org/10.1109/SAHCN.2006.288434 ER -