Random access game in ad hoc networks with cooperative and noncooperative users

Authors:
X. Guan;B. Yang;G. Feng;C. Long
Affiliations:
Center for Networking Control and Bioinformatics, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, 066004, PR China.;Dept of Manufacturing Engineering and Engineering Management, City Univ of Hong Kong, Hong Kong SAR, PR China/ Center for Networking Control and Bioinformatics, Institute of Electrical Engineering ...;Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong SAR, PR China.;Center for Networking Control and Bioinformatics, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, 066004, PR China
Venue:
International Journal of Systems, Control and Communications
Year:
2008

Citing 8
Cited 0

Slotted Aloha as a game with partial information

Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed optimal contention window control for elastic traffic in single-cell wireless LANs

IEEE/ACM Transactions on Networking (TON)
Utility-Optimal Random-Access Control

IEEE Transactions on Wireless Communications
Game theory models for IEEE 802.11 DCF in wireless ad hoc networks

IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks

IEEE Journal on Selected Areas in Communications
Distributed Contention Window Control for Selfish Users in IEEE 802.11 Wireless LANs

IEEE Journal on Selected Areas in Communications
Robust Detection of Selfish Misbehavior in Wireless Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the fact that the exponential back-off algorithm is unfair towards nodes in the middle of networks, we propose two approaches to computing the optimal persistence probabilities in Medium Access Control based on game theory. The first is a cooperative game theoretic MAC with the objective of total payoff maximisation. By decomposing the overall problem into each user's subproblem, we solve the nonconvex random access problem in a distributed manner. The existence, uniqueness and stability of the Nash Equilibrium (NE) for the cooperative game are proved. The second is the noncooperative persistence scheme with an aim to minimise information exchanging among nodes. This formulation leads to a simple iterative scheme by which each user can arrive at a Pareto dominant NE. Simulation results illustrate the performance of these algorithms.