期刊文献+

Energy Efficient Constrained Shortest Path First-Based Joint Resource Allocation and Route Selection for Multi-Hop CRNs 被引量:1

Energy Efficient Constrained Shortest Path First-Based Joint Resource Allocation and Route Selection for Multi-Hop CRNs
在线阅读 下载PDF
导出
摘要 Cognitive radio networks(CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users(SUs) to opportunistically access the licensed spectrum of primary users(PUs).In CRNs,source and destination SUs may achieve information interaction in an ad hoc manner.In the case that no direct transmission link between the SU transmission pairs is available,multi-hop relay SUs can be applied to forward information for the source and destination SUs,resulting in multi-hop CRNs.In this paper,we consider a multi-hop CRN consisting of multiple PUs,SU transmission pairs and relay SUs.Stressing the importance of transmission hops and the tradeoff between data rate and power consumption,we propose an energy efficient constrained shortest path first(CSPF)-based joint resource allocation and route selection algorithm,which consists of two sub-algorithms,i.e.,CSPF-based route selection sub-algorithm and energy efficient resource allocation sub-algorithm.More specifically,we first apply CSPF-based route selection sub-algorithm to obtain the shortest candidate routes(SCRs) between the SU pair under the transmission constraints.Then,an energy efficient resource allocation problem of the SCRs is formulated and solved by applying iterative algorithm and Lagrange dual method.Simu-lation results demonstrate the effectiveness of the proposed algorithm. Cognitive radio networks(CRNs) are expected to improve spectrum utilization efficiently by allowing secondary users(SUs) to opportunistically access the licensed spectrum of primary users(PUs).In CRNs,source and destination SUs may achieve information interaction in an ad hoc manner.In the case that no direct transmission link between the SU transmission pairs is available,multi-hop relay SUs can be applied to forward information for the source and destination SUs,resulting in multi-hop CRNs.In this paper,we consider a multi-hop CRN consisting of multiple PUs,SU transmission pairs and relay SUs.Stressing the importance of transmission hops and the tradeoff between data rate and power consumption,we propose an energy efficient constrained shortest path first(CSPF)-based joint resource allocation and route selection algorithm,which consists of two sub-algorithms,i.e.,CSPF-based route selection sub-algorithm and energy efficient resource allocation sub-algorithm.More specifically,we first apply CSPF-based route selection sub-algorithm to obtain the shortest candidate routes(SCRs) between the SU pair under the transmission constraints.Then,an energy efficient resource allocation problem of the SCRs is formulated and solved by applying iterative algorithm and Lagrange dual method.Simu-lation results demonstrate the effectiveness of the proposed algorithm.
出处 《China Communications》 SCIE CSCD 2017年第12期72-86,共15页 中国通信(英文版)
基金 supported by the National Science and Technology Specific Project of China(2016ZX03001010-004) National Natural Science Foundation of China(6140105361571073) the Joint Scientifi c Research Fund Ministry of Education and China Mobile(MCM20160105) the special fund of Chongqing key laboratory(CSTC) the project of Chongqing Municipal Education Commission(Kjzh11206)
关键词 COGNITIVE radio network MULTI-HOP RELAY resource ALLOCATION ROUTE selection energy efficiency cognitive radio network multihop relay resource allocation route selection energy efficiency
  • 相关文献

同被引文献1

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部