File(s) not publicly available
Weighted fairness for flows in wireless mesh networks
conference contribution
posted on 2017-12-06, 00:00 authored by Steven GordonSteven Gordon, B Ngo, Aruna JayasuriyaAruna JayasuriyaFairly allocating bandwidth to application sessions (flows) is difficult in Wireless Mesh Networks due to dynamics of wireless channel capacity and contention between flows on different nodes. Different scheduling algorithms have been applied to improve fairness in various scenarios. In this paper we propose a flow-based fairness scheme where a node determines its probability to send based on its flow requirements, and requirements of neighbor nodes. We propose novel methods for calculating this probability and distributing requirements to neighbors. Analysis shows our scheme can improve fairness, maintain high throughput, but at the expense of increased delay.
History
Start Page
127End Page
130Number of Pages
4Start Date
2007-01-01Finish Date
2007-01-01ISBN-13
9781424413744Location
Bangkok, ThailandPublisher
IEEEPlace of Publication
New YorkPublisher DOI
Full Text URL
Peer Reviewed
- Yes
Open Access
- No
External Author Affiliations
Institute for Resource Industries and Sustainability (IRIS); Mahāwitthayālai Thammasāt; University of South Australia;Era Eligible
- Yes