Distributed spectrum allocation via local bargaining
Lili Cao, Haitao Zheng · 2005
Abstract — In this paper, we present an adaptive and dis-tributed approach to spectrum allocation in mobile ad-hoc networks. We propose a local bargaining approach where users affected by the mobility event self-organize into bargaining groups and adapt their spectrum assignment to approximate a new optimal assignment. The number of computations required to adapt to topology changes can be significantly reduced com-pared to that of the conventional topology-based optimizations that ignore the prior assignment. In particular, we propose a Fairness Bargaining with Feed Poverty to improve fairness in spectrum assignment and derive a theoretical lower bound on the minimum assignment each user can get from bargaining for certain network configurations. Such bound can be utilized to guide the bargaining process. We also show that the difference between the proposed bargaining approach and the true optimal approach is upper-bounded. Experimental results demonstrate that the proposed bargaining approach provides similar perfor-mance as the topology-based optimization but with more than 50 % of reduction in complexity. I.