Towards utility-optimal random access without message passing

Authors:
J. Liu;Y. Yi;A. Proutiere;M. Chiang;H. V. Poor
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, NJ, U.S.A.;Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejon, Republic of Korea;Microsoft Research, Cambridge, U.K.;Department of Electrical Engineering, Princeton University, Princeton, NJ, U.S.A.;Department of Electrical Engineering, Princeton University, Princeton, NJ, U.S.A.
Venue:
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Year:
2010

Citing 0
Cited 14

Resource allocation over network dynamics without timescale separation

INFOCOM'10 Proceedings of the 29th conference on Information communications
Markov approximation for combinatorial network optimization

INFOCOM'10 Proceedings of the 29th conference on Information communications
Multiagent Q-learning for aloha-like spectrum access in cognitive radio systems

EURASIP Journal on Wireless Communications and Networking
On the performance of TCP over throughput-optimal CSMA

Proceedings of the Nineteenth International Workshop on Quality of Service
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions

IEEE/ACM Transactions on Networking (TON)
Research challenges towards the Future Internet

Computer Communications
Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice

Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability and delay of distributed scheduling algorithms for networks of conflicting queues

Queueing Systems: Theory and Applications
Embedding of virtual network requests over static wireless multihop networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Delays and mixing times in random-access networks

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
CSMA over time-varying channels: optimality, uniqueness and limited backoff rate

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Cross-layer lifetime maximisation in wireless multihop networks with network coding

International Journal of Ad Hoc and Ubiquitous Computing
Throughput optimization in wireless local networks with inter-AP interference via a joint-association control, rate control, and contention resolution

Ad Hoc Networks
Distributed Lifetime and Data Rate Optimization with Dynamic Approximation in Wireless Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been recently suggested by Jiang and Walrand that adaptive carrier sense multiple access (CSMA) can achieve optimal utility without any message passing in wireless networks. In this paper, after a survey of recent work on random access, a generalization of this algorithm is considered. In the continuous-time model, a proof is presented of the convergence of these adaptive CSMA algorithms to be arbitrarily close to utility optimality, without assuming that the network dynamics converge to an equilibrium in between consecutive CSMA parameter updates. In the more realistic, slotted-time model, the impact of collisions on the utility achieved is characterized, and the tradeoff between optimality and short-term fairness is quantified. Copyright © 2009 John Wiley & Sons, Ltd. This paper shows how random access without message passing can approach utility optimality via adaptive CSMA. After a survey of recent work on distributed scheduling, a utility-optimal CSMA is considered, together with a proof of its convergence in a continuous-time model without assuming timescale separation. The impact of collisions is studied in the more realistic slotted-time model, together with the tradeoff between optimality and short-term fairness.