首页> 外文期刊>Journal of network and computer applications >A fairness-based MAC protocol for 5G Cognitive Radio Ad Hoc Networks
【24h】

A fairness-based MAC protocol for 5G Cognitive Radio Ad Hoc Networks

机译:用于5G认知无线电自组织网络的基于公平性的MAC协议

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Fifth Generation (5G) technique alms at achieving high data rate and capacity for large numbers of users. Cognitive Radio (CR) is a promising technical to boost the development of 5G networks, which can significantly increase the spectrum efficiency by letting unlicensed Secondary Users (SUs) utilize the idle licensed spectrum without interfering licensed Primary Users (PUs) dynamically. Owing to dynamic available channels, SUs need firstly meet with their target SUs on common available channels to realize communications rapidly in CR Ad Hoc Networks (CRAHNs). Channel Hopping (CH) is a superior technique for achieving rendezvous in CRAHNs. Most of existing researches on CH problem focus on designing CH sequences that can make SUs rendezvous with each other quickly. For reducing congestion, the CH protocols spread the rendezvous in time and channel In general. However, the handshaking process for data link establishment is barely considered. Besides, there is few research on handshaking process in CRAHNs considering fair data link allocation among SUs. In this paper, we first propose novel structures for Request To Send (RTS) frame and Clear To Send (CTS) frame, which combined the characteristics of CRAHN. Then, we present a Fairness-based MAC (FMAC) protocol, which considers fair data link allocation among SUs. Simulation results demonstrate that our proposed protocol gains better performance in terms of time and fairness.
机译:第五代(5G)技术可以为大量用户实现高数据速率和容量。认知无线电(CR)是一项有前途的技术,可促进5G网络的发展,该技术可以通过让无执照的次要用户(SU)利用闲置的经许可频谱来显着提高频谱效率,而不会动态干扰受执照的主用户(PU)。由于动态可用信道,SU必须首先在公共可用信道上与目标SU满足,才能在CR Ad Hoc网络(CRAHN)中快速实现通信。信道跳频(CH)是在CRAHN中实现集合的一种高级技术。现有的有关CH问题的研究大多集中在设计CH序列上,这些序列可以使SU相互快速会合。为了减少拥塞,CH协议通常会在时间和信道上扩展集合点。但是,几乎没有考虑用于数据链接建立的握手过程。此外,关于CRAHN中握手过程的研究很少,考虑到SU之间的公平数据链路分配。在本文中,我们首先提出了新颖的请求发送(RTS)帧和清除发送(CTS)帧的结构,这些结构结合了CRAHN的特性。然后,我们提出了一种基于公平性的MAC(FMAC)协议,该协议考虑了SU之间的公平数据链路分配。仿真结果表明,我们提出的协议在时间和公平性方面获得了更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号