Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks
Developing effective, fairness-preserving optimization algorithms is of considerable importance in systems which serve many users. In this paper we show the results of the threshold accepting procedure applied to extremely difficult problem of fair resource allocation in wireless mesh networks (WMN)...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/108673 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Developing effective, fairness-preserving optimization algorithms is of considerable importance in systems which serve many users. In this paper we show the results of the threshold accepting procedure applied to extremely difficult problem of fair resource allocation in wireless mesh networks (WMN). The fairness is modeled by allowing preferences with regard to distribution of Internet traffic between network participants. As aggregation operator we utilize weighted ordered weighted averaging (WOWA). In the underlaying optimization problem, the physical medium properties cause strong interference among simultaneously operating node devices, leading to nonlinearities in the mixed-integer pricing subproblem. That is where the threshold accepting procedure is applied. We show that, the threshold accepting heuristic performs much better than the widely utilized simulated annealing algorithm. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |