Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 108673, 11 pages
Research Article

Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Institute of Control & Computation Engineering, Warsaw University of Technology, Ulica Nowowiejska 15/19, 00-665 Warsaw, Poland

Received 10 February 2014; Revised 27 April 2014; Accepted 7 May 2014; Published 25 May 2014

Academic Editor: Dritan Nace

Copyright © 2014 Jarosław Hurkała and Tomasz Śliwiński. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.