首页> 外文OA文献 >Energy-efficient cooperative cognitive relaying schemes for cognitive radio networks
【2h】

Energy-efficient cooperative cognitive relaying schemes for cognitive radio networks

机译:认知无线电网络的节能合作认知中继方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We investigate a cognitive radio network in which a primary user (PU) maycooperate with a cognitive radio user (i.e., a secondary user (SU)) fortransmissions of its data packets. The PU is assumed to be a buffered nodeoperating in a time-slotted fashion where the time is partitioned intoequal-length slots. We develop two schemes which involve cooperation betweenprimary and secondary users. To satisfy certain quality of service (QoS)requirements, users share time slot duration and channel frequency bandwidth.Moreover, the SU may leverage the primary feedback message to further increaseboth its data rate and satisfy the PU QoS requirements. The proposedcooperative schemes are designed such that the SU data rate is maximized underthe constraint that the PU average queueing delay is maintained less than theaverage queueing delay in case of non-cooperative PU. In addition, the proposedschemes guarantee the stability of the PU queue and maintain the average energyemitted by the SU below a certain value. The proposed schemes also provide morerobust and potentially continuous service for SUs compared to the conventionalpractice in cognitive networks where SUs transmit in the spectrum holes andsilence sessions of the PUs. We include primary source burstiness, sensingerrors, and feedback decoding errors to the analysis of our proposedcooperative schemes. The optimization problems are solved offline and require asimple 2-dimensional grid-based search over the optimization variables.Numerical results show the beneficial gains of the cooperative schemes in termsof SU data rate and PU throughput, average PU queueing delay, and average PUenergy savings.
机译:我们研究了认知无线电网络,其中主要用户(PU)可以与认知无线电用户(即次要用户(SU))合作以传输其数据包。假定PU是以时隙方式操作的缓冲节点,其中将时间划分为等长时隙。我们开发了两种方案,涉及主要用户和次要用户之间的合作。为了满足一定的服务质量(QoS)要求,用户共享时隙持续时间和信道频率带宽。此外,SU可以利用主反馈消息进一步提高其数据速率并满足PU QoS要求。设计所提出的合作方案,以便在保持PU平均排队延迟小于非合作PU情况下的平均排队延迟的约束下,使SU数据速率最大化。此外,所提出的方案保证了PU队列的稳定性,并将SU所发出的平均能量保持在一定值以下。与在SU中在PU的频谱空洞和无声会话中进行传输的认知网络中的常规做法相比,所提出的方案还为SU提供了更强大和潜在的连续服务。我们将主要源突发性,感知错误和反馈解码错误包括在内,以分析我们提出的合作方案。优化问题可以脱机解决,并且需要对优化变量进行简单的基于二维网格的搜索。数值结果表明,在SU数据速率和PU吞吐量,平均PU排队延迟和平均PU节能方面,该合作方案具有有益的收益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号