ACM Home Page
Please provide us with feedback. Feedback
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access
Full text PdfPdf (570 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing table of contents
Urbana-Champaign, IL, USA
SESSION: Transport 1 table of contents
Pages: 157 - 168  
Year of Publication: 2005
ISBN:1-59593-004-3
Authors
Xin Wang  Rensselaer Polytechnic Institute, Troy, NY
Koushik Kar  Rensselaer Polytechnic Institute, Troy, NY
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 167,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1062689.1062710
What is a DOI?

ABSTRACT

In this paper, we address the rate control problem in a multi-hop random access wireless network, with the objective of achieving proportional fairness amongst the end-to-end sessions. The problem is considered in the framework of nonlinear optimization. Compared to its counterpart in a wired network where link capacities are assumed to be fixed, rate control in a multi-hop random access network is much more complex and requires joint optimization at both the transport layer and the link layer. This is due to the fact that the attainable throughput on each link in the network is `elastic' and is typically a non-convex and non-separable function of the transmission attempt rates. Two cross-layer algorithms, a dual based algorithm and a primal based algorithm, are proposed in this paper to solve the rate control problem in a multi-hop random access network. Both algorithms can be implemented in a distributed manner, and work at the link layer to adjust link attempt probabilities and at the transport layer to adjust session rates. We prove rigorously that the two proposed algorithms converge to the globally optimal solutions. Simulation results are provided to support our conclusions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
D. P. Bertsekas, Nonlinear Programming, Athena Scientific, 1999.
 
3
 
4
F. P. Kelly, "Charging and Rate Control for Elastic Traffic", European Transactions on Telecommunications, vol. 8, no. 1, 1997, pp. 33--37.
 
5
F. Kelly, A. Maulloo, D. Tan, "Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability", Journal of Operations Research Society, vol. 49, no. 3, 1998, pp. 237--252.
 
6
7
8
 
9
L. Tassiulas, S. Sarkar, "Maxmin Fair Scheduling in Wireless Networks", in Proceedings of Infocom 2002, pp. 763--772, New York, USA, June 2002.
 
10
M. Johnasson, L. Xiao, "Cross-layer optimization of wireless networks using nonlinear column generation", accept by IEEE Transactions on Wireless Communications.
 
11
L. Xiao, M. Johnasson, S. Boyd, "Simultaneous Routing and Resource Allocation via Dual Decomposition", IEEE Transactions on Communications, Vol. 52, No. 7, pages 1136--1144, July 2004.
 
12
M. Chiang, "To Layer or Not To Layer: Balancing Transport and Physical Layers in Wireless Multihop Networks", in Proceedings of Infocom 2004, Hong Kong, China, March 2004.
 
13
K. Kar, S. Sarkar, L. Tassiulas, "Achieving Proportionally Fair Rates using Local Information in Multi-hop Aloha Networks", Proceedings of Annual Allerton Conference, Urbana-Champaign, USA, October 2003.
 
14
X. Wang, K. Kar, "Distributed Algorithms for Max-min Fair Rate Allocation in Aloha Networks", Proceedings of Annual Allerton Conference, Urbana-Champaign, USA, October 2004.

CITED BY  11