Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks

This publication has 18 references indexed in Scilit:

• A game-theoretic framework for congestion control in general topology networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Comparison between graph-based and interference-based STDMA scheduling
  Published by Association for Computing Machinery (ACM) ,2001
• A game theoretic framework for bandwidth allocation and pricing in broadband networks
  IEEE/ACM Transactions on Networking, 2000
• Fair end-to-end window-based congestion control
  IEEE/ACM Transactions on Networking, 2000
• Optimization flow control. I. Basic algorithm and convergence
  IEEE/ACM Transactions on Networking, 1999
• Guaranteeing Fair Service to Persistent Dependent Tasks
  SIAM Journal on Computing, 1998
• Rate control for communication networks: shadow prices, proportional fairness and stability
  Journal of the Operational Research Society, 1998
• Link scheduling in polynomial time
  IEEE Transactions on Information Theory, 1988
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
  Econometrica, 1965
• A Theorem on Coloring the Lines of a Network
  Journal of Mathematics and Physics, 1949