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)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
