A Novel Approach to Fair Routing in Wireless Mesh Networks

Maatta, Juho; Bräysy, T.

doi:10.1155/2009/379059

Cited by 9 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whereas Kim et al state that there is a trade‐off between fairness and throughput, Luo et al claim to improve throughput while enhancing fairness . Määttä and Bräysy propose a heuristic algorithm to solve the association and routing problem. The three latter works use simple fairness concepts.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fair optimization of mesh‐connected WLAN hotspots

Dely

D’Andreagiovanni

Kassler

2013

Wireless Communications

View full text Add to dashboard Cite

In Wireless mesh networks mesh access points (MAPs) forward traffic wirelessly towards users or Internet gateways. A user device usually connects to the MAP with the strongest signal, as such MAP should guarantee the best quality of service. However, this connection policy may lead to: (i) unfairness towards users that are distant from gateways; (ii) uneven distribution of users to MAPs; and (iii) inefficient use of network paths. We present a new model and solution approach to the problem of assigning users to MAPs and routing the data within the mesh network with the objective of providing max-min fair throughput. The problem is formulated as a mixed-integer linear programming problem (MILP). Because of the inherent complexity of the problem, real size instances cannot be solved to optimality within the time limits for online optimization. Therefore, we propose an original heuristic solution algorithm for the resulting MILP. Both numerical comparisons and network simulations demonstrate the effectiveness of the proposed heuristic. For random networks, the heuristic achieves 98% of the optimal solution. Network simulations show that in medium-sized networks, the number of users with at least 1 Mbit/s minimum end-to-end rate increases by 550% when compared with the classical signal-strength based association.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The three latter works use simple fairness concepts. In and , the bit rate of any two STA cannot differ by more than a fairness ratio. However, such ratio may limit the rate of one STA, even if it does not compete with a second STA that receives a lower rate.…”

Section: Introductionmentioning

confidence: 99%