A dynamic spectrum management strategy based on cooperative bargaining framework

Authors:
Ayan Paul;Madhubanti Maitra;Swarup Mandal;Samir K. Sadhukhan;Debashis Saha
Affiliations:
-;-;-;-;-
Venue:
Engineering Applications of Artificial Intelligence
Year:
2013

Citing 7
Cited 0

A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems

SIAM Journal on Scientific Computing
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Noncooperative Game-Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access Networks

IEEE Transactions on Mobile Computing
An economic framework for dynamic spectrum access and service pricing

IEEE/ACM Transactions on Networking (TON)
Dynamic spectrum allocation in composite reconfigurable wireless networks

IEEE Communications Magazine
A survey on spectrum management in cognitive radio networks

IEEE Communications Magazine
A sustainable and collaborative strategy for dynamic spectrum management in next generation wireless networks

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes a dynamic and fair spectrum management strategy to be adopted by a service provider (SP). Here, we consider a scenario where multiple access networks (ANs) of different (not necessarily competing) technologies are owned by a single SP. We envisage that an SP employs an entity, called local spectrum controller (LSC), which manages a common pool of spectrum and is responsible for distributing the spectrum to individual ANs in a fair manner. Since the available spectrum is inadequate to satisfy the aggregate demand from all ANs simultaneously, LSC has to employ a dynamic spectrum allocation strategy. We have modeled the problem as an n-player cooperative bargaining game and have solved the problem with the help of solution techniques namely, Nash bargaining solution (NBS), Kalai-Smorodinsky bargaining solution (KSBS) and modified Thomson bargaining solution (MTBS). We have presented two novel heuristics to compute KSBS and MTBS. Moreover, a suitable utility function for the AN with respect to its received spectrum have been presented. We have also identified possible objectives of LSC (i.e., SP), namely minimizing overall dissatisfaction (MOD) of heterogeneous network, maintaining equality of distribution (MED) and maximizing proportional fairness (MPF). Finally, we have compared performances of above solutions with max-min fairness solution and Shapley value solution with respect to the above objectives of LSC.