Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Random access game in ad hoc networks with cooperative and noncooperative users 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Systems, Control and Communications Inderscience Publishers

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

Loading next page...
 
/lp/inderscience-publishers/random-access-game-in-ad-hoc-networks-with-cooperative-and-EKDlEP1Qnn

References (14)

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1755-9340
eISSN
1755-9359
DOI
10.1504/IJSCC.2008.019581
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Systems, Control and CommunicationsInderscience Publishers

Published: Jan 1, 2008

There are no references for this article.