7th International Conference on Communications and Networking in China

Research Article

A Distributed Routing and Time-slot Assignment Algorithm for Cognitive Radio Ad Hoc Networks with Primary-User Protection

  • @INPROCEEDINGS{10.1109/ChinaCom.2012.6417529,
        author={chen hao and Pinyi Ren and Li Sun and Qinghe Du},
        title={A Distributed Routing and Time-slot Assignment Algorithm for Cognitive Radio Ad Hoc Networks with Primary-User Protection},
        proceedings={7th International Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2012},
        month={10},
        keywords={cognitive radio distributed routing time-slot assignment primary-user protection},
        doi={10.1109/ChinaCom.2012.6417529}
    }
    
  • chen hao
    Pinyi Ren
    Li Sun
    Qinghe Du
    Year: 2012
    A Distributed Routing and Time-slot Assignment Algorithm for Cognitive Radio Ad Hoc Networks with Primary-User Protection
    CHINACOM
    IEEE
    DOI: 10.1109/ChinaCom.2012.6417529
chen hao1, Pinyi Ren1,*, Li Sun1, Qinghe Du1
  • 1: School of Electronic and Information Engineering,Xi'an Jiaotong University
*Contact email: pyren@mail.xjtu.edu.cn

Abstract

Cognitive Radio (CR) technology enables Secondary Users (SUs) to transparently utilize the licensed spectrum bands while causing limited interference to Primary Users (PUs). In this paper, a distributed routing and time-slot assignment (DRTSA) algorithm is proposed to address the PU protection issue. Specifically, we first design a proper routing metric for distributed path selection and then we propose a time-slot assignment algorithm to improve SUs' capacity and reduce the interference to PU as well. Theoretical analysis shows that the complexity of DRTSA is no more than $O(NTlogN)$, where $N$ and $T$ denote the number of nodes and the time-slot period in the network respectively. Simulation results show that, under various network scenarios, the performance of the proposed distributed algorithm can approach that of the centralized alternatives.