Annealing Heuristic for Fair Wireless Channel Allocation by Exponential Ordered-Ordered Weighted Averaging Operator Maximization

Wireless channel allocation (WCA) is a relevant resource allocation problem that cannot be handled by a simple maximization approach. In such a case, users can often be excluded from receiving channels at all. Therefore, here we want to focus on fairness concepts for specifying wireless channel allocations. We extend the concept of fairness in traffic congestion avoidance to the wireless channel allocation problem. The main characteristics of the state achieved by the fair Bottleneck Flow Control algorithm were directly applied to the WCA problem, including lexmin fairness, maxmin fairness, proportional fairness, and, as a new result, exponential Ordered-Ordered Weighted Averaging (OOWA) operator maximization. The utility of the numerical exponential OOWA maximization for reflecting fairness in the WCA is demonstrated. Based on this and two basic properties of the general OOWA, a replace and swap operation based annealing heuristic is proposed. Its study on small problem instances allows justifying their applicability to real-world instances of the WCA problem.