Abstract-In this paper, we present an adaptive and distributed 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 compared 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 performance as the topology-based optimization but with more than 50% of reduction in complexity. Wireless devices are becoming ubiquitous, placing additional stress on the fixed radio spectrum available to all access technologies. To eliminate interference between different wireless technologies, current policies allocate a fixed spectrum slice to each wireless technology. This static assignment prevents devices from efficiently utilizing allocated spectrum, resulting in spectrum holes (no devices in area) and very poor utilization [16] . These results further motivate the Open Spectrum [3] approach to spectrum access. Open Spectrum allows unlicensed (secondary) users to coexist with legacy (primary) spectrum holders, thereby "creating" new capacity and commercial value from existing spectrum ranges. Secondary users opportunistically utilize unused licensed spectrum on a non-interfering or leasing basis based on agreements and constraints imposed by primary users. Open spectrum focuses on controlling the behavior of secondary users while keeping the system transparent to primaries. While maximizing spectrum utilization is the primary goal of dynamic spectrum systems, a good allocation scheme is also needed to provide fairness across users. We hereby use user to represent secondary user. A user seizing spectrum without coordinating with others can cause harmful interference with its surrounding neighbors, and thus reducing available spectrum. Given a fixed topology, existing approaches can efficiently allocate spectrum to users by reducing the problem to a variant of the graph coloring problem [23] , [18] . A conflict free spectrum assignment is obtained for the given topology.
Cao and Zheng REF propose distributed spectrum allocation in cognitive radio networks based on local bargaining.
Distributed spectrum allocation via local bargaining
2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005.
2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005.
Computer Science