Random access game in ad hoc networks with cooperative and noncooperative users
by X. Guan, B. Yang, G. Feng, C. Long
International Journal of Systems, Control and Communications (IJSCC), Vol. 1, No. 1, 2008

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.

Online publication date: Thu, 17-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com