cogcom 15(3): e5

Research Article

A New Mechanism of Dynamic Spectrum Access Based on Restless Bandit Allocation Indices

Download189 downloads
  • @ARTICLE{10.4108/icst.mobimedia.2015.259029,
        author={Zhu Jiang and Han Chao and Yang lei and Xiong hao},
        title={A New Mechanism of Dynamic Spectrum Access Based on Restless Bandit Allocation Indices},
        journal={EAI Endorsed Transactions on Cognitive Communications},
        volume={1},
        number={3},
        publisher={EAI},
        journal_a={COGCOM},
        year={2015},
        month={8},
        keywords={restless multi-armed bandit model, sense error, multi-bid auction, whittle’s index value},
        doi={10.4108/icst.mobimedia.2015.259029}
    }
    
  • Zhu Jiang
    Han Chao
    Yang lei
    Xiong hao
    Year: 2015
    A New Mechanism of Dynamic Spectrum Access Based on Restless Bandit Allocation Indices
    COGCOM
    EAI
    DOI: 10.4108/icst.mobimedia.2015.259029
Zhu Jiang1, Han Chao1,*, Yang lei1, Xiong hao1
  • 1: Chongqing key lab of Mobile Communications Technology,Chongqing University of Posts and Telecommunications
*Contact email: hancao.cool@163.com

Abstract

Based on the theory of Restless Multi-Armed Bandit model, a novel mechanism of dynamic spectrum access was proposed for the problem that how to coordinate multi-user access multi-channel which were idle. Firstly, take care of the sensing error must be exist in the practical network, the Whittle index policy which can deal with sensing error effectively was derived, in this policy, the users achieved one belief value for every channel based on the historical experience accumulation and chose the channels, which was need to sense and access, by considering the reward of immediate and future based on the belief values. Secondly, this paper used the multi-bid auction algorithm to deal with the collision among secondary users when they select the channels to improve the spectrum utilization. The simulation results demonstrate that, in the same environment, the cognitive users with the proposed mechanism have higher throughtput than the mechanism without dealing with sensing error or without multi-bid.