首页> 外文期刊>Wireless Networks >Joint spectrum load balancing and handoff management in cognitive radio networks: a non-cooperative game approach
【24h】

Joint spectrum load balancing and handoff management in cognitive radio networks: a non-cooperative game approach

机译:认知无线电网络中的联合频谱负载平衡和切换管理:一种非合作博弈方法

获取原文
获取原文并翻译 | 示例
           

摘要

We propose a non-cooperative game theory based algorithm for spectrum management problem in cognitive radio networks taking into account the spectrum handoff effects. The objective is to minimize the spectrum access time of Secondary Users (SUs) which are competing for spectrum opportunities in heterogeneous environment. In this paper, the preemptive resume priority (PRP) M/G/1 queuing model is used to characterize the multiple handoff and data delivery time of SUs. Also an explicit solution for channels selection probabilities of each SU is extracted for PRP M/M/1 model specifically. The effect of handoffs is considered as the interrupted packets which return to the SUs' low priority queue when the high priority Primary User's packets are arrived to take service. The queuing delay of SUs' and the effect of these returned packets are considered in order to balance the load of SUs on channels so that the minimum spectrum access time is sensed by each SU. The non-cooperative spectrum load balancing with handoff management game is proposed to find a distributed solution for each SU. It is shown that this game has a unique Nash equilibrium point which can be achieved by SUs as decision makers. At this equilibrium, each SU incurs the minimum delay on all channels while the free spectrum holes of channels are utilized efficiently. Simulation results are provided to evaluate the performance of the proposed scheme in terms of spectrum access delay, fairness, and channels spectrum holes utilization.
机译:考虑到频谱切换效应,我们针对认知无线电网络中的频谱管理问题提出了一种基于非合作博弈论的算法。目的是最小化在异构环境中竞争频谱机会的次要用户(SU)的频谱访问时间。本文采用抢占式恢复优先级(PRP)M / G / 1排队模型来表征SU的多次切换和数据传递时间。专门针对PRP M / M / 1模型,还提取了每个SU的信道选择概率的明确解决方案。越区切换的效果被认为是中断的数据包,这些数据包在到达高优先级主用户的数据包进行服务时返回到SU的低优先级队列。考虑SU的排队延迟和这些返回分组的影响,以便平衡SU在信道上的负载,从而每个SU感测到最小的频谱访问时间。提出了具有切换管理博弈的非合作频谱负载均衡技术,以找到每个SU的分布式解决方案。结果表明,该游戏具有独特的纳什均衡点,可以由SU作为决策者来实现。在这种平衡下,每个SU在所有通道上产生最小的延迟,同时有效利用通道的自由频谱孔。提供了仿真结果,以根据频谱访问延迟,公平性和信道频谱空洞利用率评估所提出方案的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号