Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7–8, 2016, Proceedings

Research Article

MSP: A Routing Metric for Cognitive Radio Networks

Download
195 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-60717-7_15,
        author={Neng Zhang and Jianfeng Guan and Shengjie Yin},
        title={MSP: A Routing Metric for Cognitive Radio Networks},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7--8, 2016, Proceedings},
        proceedings_a={QSHINE},
        year={2017},
        month={8},
        keywords={Routing metrics Cognitive radio networks Optimality},
        doi={10.1007/978-3-319-60717-7_15}
    }
    
  • Neng Zhang
    Jianfeng Guan
    Shengjie Yin
    Year: 2017
    MSP: A Routing Metric for Cognitive Radio Networks
    QSHINE
    Springer
    DOI: 10.1007/978-3-319-60717-7_15
Neng Zhang1,*, Jianfeng Guan1,*, Shengjie Yin1,*
  • 1: Beijing University of Posts and Telecommunications
*Contact email: zn@bupt.edu.cn, jfguan@bupt.edu.cn, 1604942836@qq.com

Abstract

The current routing metrics mainly face two inevitable restrictions for Cognitive Radio Networks (CRN) that they are often designed based on routing condition but seldom considering node mobility, and they are always assumed to adapt dynamic spectrum access without considering primary user’s activity. In this paper, a novel routing metric called Mobility Success Probability (MSP) is proposed which considers both the mobility model and spectrum available time. Through spectrum access and selection path with mobility success probability, the routing protocol also meets the most essential requirements of optimality. Combined with Dijkstra based routing protocols, optimal expression of the MSP is analytically derived and rigorously proved through CR algebra. The simulation results reveal a good routing performance of adopting MSP for CRNs.