Distributed spectrim allocation algorithm based on Nash Bargaunung Solutuion

2010 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    7
    References
    0
    Citations
    NaN
    KQI
    []