A bargaining approach to power control in networks of autonomous wireless entities
Vaggelis G. Douros, George C. Polyzos, Stavros Toumpis · 2010
Interference is a fundamental problem in wireless networks, even in sparse topologies. Power Control (PC) is a powerful tool for mitigating it, however how to apply it to achieve the desired results is not obvious and satisfying the goals of all entities is not always possible. We introduce the Bargaining Foschini-Miljanic (BFM) algorithm, a (partially) distributed algorithm that combines the well-known Foschini-Miljanic (FM) PC algorithm for wireless networks with bargaining between (unsatisfied) entities, in order to maximize the number of entities that gain access to the medium and to achieve additional goals (such as fairness and improved performance). We compare this scheme with the already proposed policy of simply re-applying the FM algorithm to a smaller setup, imposing on the "weakest" node (the one that is furthest from its SINR target) to "power off". Simulations show that our scheme leads to a larger number of efficient solutions without the need to consistently exclude specific nodes. Moreover, our algorithm improves significantly the fairness of the system.