Distributed spectrim allocation algorithm based on Nash Bargaunung Solutuion

Author

Yan, Li ; Zhen, Yang

Author_Institution

Inst. of Signal Process. & Transm., Nanjing Univ. of Posts & Telecommun., Nanjing, China

Volume

3

fYear

2010

fDate

21-24 May 2010

Abstract

In this paper, we develop a cooperative game theory model of the spectrum sharing problem, and then present a distributed algorithm in cognitive radio networks which achieves a spectrum allocation that approximates the Nash Bargaining Solution (NBS). By analyzing the utility space, we can propose the distributed spectrum sharing mechanism ensures efficient and fair access. This algorithm can approximate the maximization of the Nash Product (NP) without centralized control local but only local information. Finally, the simulation results show that it has good utility space efficiency and can converge quickly to a value close to the NBS.

Keywords

cognitive radio; distributed algorithms; game theory; optimisation; Nash bargaining solution; Nash product; cognitive radio networks; cooperative game theory; distributed spectrum allocation; distributed spectrum sharing; maximization; spectrum sharing problem; Approximation algorithms; Centralized control; Cognitive radio; Context modeling; Distributed algorithms; Game theory; NIST; Signal processing algorithms; Technological innovation; Wireless networks; Nash bargaining solution; cooperative game theory; distributed algorithm; spectrim allocation;

fLanguage

English

Publisher

ieee

Conference_Titel

Future Computer and Communication (ICFCC), 2010 2nd International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5821-9

Type

conf

DOI

10.1109/ICFCC.2010.5497523

Filename

5497523