Fixed-rate equilibrium in wireless collision channels

Authors:
Ishai Menache;Nahum Shimkin
Affiliations:
Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa, Israel;Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa, Israel
Venue:
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Year:
2007

Citing 6
Cited 1

Matrix analysis

Matrix analysis
Data networks

Data networks
Topics in matrix analysis

Topics in matrix analysis
Slotted Aloha as a game with partial information

Computer Networks: The International Journal of Computer and Telecommunications Networking
Selfish Routing and the Price of Anarchy

Selfish Routing and the Price of Anarchy
Fading channels: information-theoretic and communications aspects

IEEE Transactions on Information Theory

Stochastic learning solution for constrained Nash Equilibrium throughput in non saturated wireless collision channels

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a collision channel, shared by a finite number of self-interested users with heterogenous throughput demands. It is assumed that each user transmits with a fixed probability at each time slot, and the transmission is successful if no other user transmits simultaneously. Each user is interested in adjusting its transmission rate so that its throughput demand is met. When throughput requirements are feasible, we show that there exist two equilibrium points where users satisfy their respective demands. In one equilibrium all users transmit at lower rates, compared to their transmission rates at the other equilibrium. This fact is meaningful in wireless systems, where lower transmission rates translate to power savings. Subsequently, we propose a distributed scheme that ensures convergence to the lower-rate equilibrium point. We also provide some lower bounds on the channel throughput that is obtained with self-interested users, both in the symmetric and non-symmetric case.