Flow-optimized random access for wireless multihop networks

Authors:
Juha Leino;Aleksi Penttinen;Jorma Virtamo
Affiliations:
Department of Communications and Networking, TKK Helsinki University of Technology, P.O. Box 3000, FI-02015 TKK, Finland;Department of Communications and Networking, TKK Helsinki University of Technology, P.O. Box 3000, FI-02015 TKK, Finland;Department of Communications and Networking, TKK Helsinki University of Technology, P.O. Box 3000, FI-02015 TKK, Finland
Venue:
Performance Evaluation
Year:
2009

Citing 11
Cited 0

Data networks

Data networks
Insensitive Bandwidth Sharing in Data Networks

Queueing Systems: Theory and Applications
On performance bounds for balanced fairness

Performance Evaluation - Internet performance symposium (IPS 2002)
A queueing analysis of max-min fairness, proportional fairness and balanced fairness

Queueing Systems: Theory and Applications
On light and heavy traffic approximations of balanced fairness

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Flow-optimized random access for wireless multihop networks

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Approximating flow throughput in complex data networks

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
The capacity of wireless networks

IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks

IEEE Transactions on Information Theory
Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study elastic traffic performance in time-slotted wireless random access networks, where the link access probabilities are adjusted at flow level each time a new flow (file transfer) arrives or a flow in progress terminates. By defining the capacity sets of such networks we carry out performance analysis in a dynamic setting, where the flows come and go and share the resources according to the balanced fairness principle. We derive flow throughput analytically for three special scenarios and devise an algorithm for general networks. At low loads, flow-optimized random access yields almost the same performance as optimal/deterministic scheduling.