Name
Abstract | ||
|---|---|---|
We consider the lexicographic max-min fair rate control problem at the link layer in a random access wireless network. In the lexicographic max-min fair rate allocation, the minimum link rates in the network are maximized in a lexicographic order. For the Aloha multiple access model, we propose iterative approaches that attain optimal rates under very general assumptions on the network topology and communication pattern; the approaches are also amenable to a distributed implementation. The approach and result in this paper generalize those in the work of X. Wang and K. Kar (2004) on maximizing the minimum link rate in a random access network, and nicely connect to the "bottleneck-based" lexicographic max-min rate optimization algorithm popularly used in wired networks by D. Bertsekas and R. Gallagher (1992) |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/CDC.2006.377233 | San Diego, CA |
Keywords | DocType | ISSN |
iterative methods,minimax techniques,radio access networks,telecommunication control,telecommunication network topology,aloha multiple access model,bottleneck-based lexicographic max-min rate optimization,communication pattern,iterative approaches,lexicographic max-min fair rate allocation,lexicographic max-min fair rate control,link layer,minimum link rates,network topology,random access wireless networks,lexicographic order,random access,max min fairness,wireless network | Conference | 0743-1546 |
ISBN | Citations | PageRank |
1-4244-0171-2 | 2 | 0.45 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xin Wang | 1 | 63 | 8.53 |
| K. Kar | 2 | 178 | 9.53 |
| Jong-Shi Pang | 3 | 17 | 1.72 |