Abstract
It is shown that the local fairness algorithm given can exploit the throughput advantage offered by spatial reuse better than a global fairness algorithm. This is because it ensures fair use of network resources among nodes competing for the same subset of links, while permitting free access to noncongested parts of the network. The performance advantage of this local fairness scheme is demonstrated by simulating the system under various traffic scenarios, and the results are compared to results for the MetaRing SAT-based fairness algorithm. It is also shown that under certain traffic patterns, the performance of this algorithm achieves the optimal throughput result predicted by the known max-min fairness definition. >
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.
