File(s) not publicly available

Weighted fairness for flows in wireless mesh networks

conference contribution
posted on 06.12.2017, 00:00 by Steven GordonSteven Gordon, B Ngo, Aruna JayasuriyaAruna Jayasuriya
Fairly 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

127

End Page

130

Number of Pages

4

Start Date

01/01/2007

Finish Date

01/01/2007

ISBN-13

9781424413744

Location

Bangkok, Thailand

Publisher

IEEE

Place of Publication

New York

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

Name of Conference

Asia-Pacific Conference on Communications