Open Access
Translator Disclaimer
2014 Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks
Jarosław Hurkała, Tomasz Śliwiński
J. Appl. Math. 2014(SI08): 1-11 (2014). DOI: 10.1155/2014/108673

Abstract

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.

Citation

Download Citation

Jarosław Hurkała. Tomasz Śliwiński. "Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks." J. Appl. Math. 2014 (SI08) 1 - 11, 2014. https://doi.org/10.1155/2014/108673

Information

Published: 2014
First available in Project Euclid: 1 October 2014

zbMATH: 07131323
Digital Object Identifier: 10.1155/2014/108673

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
11 PAGES


SHARE
Vol.2014 • No. SI08 • 2014
Back to Top