TY - GEN
T1 - Interference-aware MAC protocol for wireless networks by a game-theoretic approach
AU - Lee, Hyung June
AU - Kwon, Hyukjoon
AU - Motskin, Arik
AU - Guibas, Leonidas
PY - 2009
Y1 - 2009
N2 - We propose an interference-aware MAC protocol using a simple transmission strategy motivated by a game-theoretic approach. We formulate a channel access game, which considers nodes concurrently transmitting in nearby clusters, incorporating a realistic wireless communication model - the SINR model. Under inter-cluster interference, we derive a decentralized transmission strategy, which achieves a Bayesian Nash Equilibrium (BNE). The proposed MAC protocol balances network throughput and battery consumption at each transmission. We compare our BNE-based decentralized strategy with a centralized globally optimal strategy in terms of efficiency and balance. We further show that the transmission threshold should be adaptively tuned depending on the number of active users in the network, crosstalk, ambient noise, transmission cost, and radio-dependent receiver sensitivity. We also present a simple dynamic procedure for nodes to efficiently find a Nash Equilibrium (NE) without requiring each node to know the total number of active nodes or the channel gain distribution, and prove that this procedure is guaranteed to converge.
AB - We propose an interference-aware MAC protocol using a simple transmission strategy motivated by a game-theoretic approach. We formulate a channel access game, which considers nodes concurrently transmitting in nearby clusters, incorporating a realistic wireless communication model - the SINR model. Under inter-cluster interference, we derive a decentralized transmission strategy, which achieves a Bayesian Nash Equilibrium (BNE). The proposed MAC protocol balances network throughput and battery consumption at each transmission. We compare our BNE-based decentralized strategy with a centralized globally optimal strategy in terms of efficiency and balance. We further show that the transmission threshold should be adaptively tuned depending on the number of active users in the network, crosstalk, ambient noise, transmission cost, and radio-dependent receiver sensitivity. We also present a simple dynamic procedure for nodes to efficiently find a Nash Equilibrium (NE) without requiring each node to know the total number of active nodes or the channel gain distribution, and prove that this procedure is guaranteed to converge.
UR - http://www.scopus.com/inward/record.url?scp=70349673038&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2009.5062106
DO - 10.1109/INFCOM.2009.5062106
M3 - Conference contribution
AN - SCOPUS:70349673038
SN - 9781424435135
T3 - Proceedings - IEEE INFOCOM
SP - 1854
EP - 1862
BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -