• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Communication Technology >Neighbor discovery based on group frequency hopping without common control channel for cognitive radio ad hoc networks
【24h】

Neighbor discovery based on group frequency hopping without common control channel for cognitive radio ad hoc networks

机译：认知无线电自组织网络中基于不具有公共控制信道的组跳频的邻居发现

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In traditional cognitive radio ad hoc networks (CRAHNs), each unlicensed node senses and attains its own idle frequency channel. Considering that the available channels at different nodes may be different, a dedicated common control channel (CCC) facilitates the exchange of the spectrum availability information of each node, and then forthcoming communication nodes tune to the same frequency channel and finish the communication. However, when CCC is unavailable, the problem of neighbor discovery becomes very challenging. In this paper, an asynchronous neighbor discovery algorithm based on group frequency hopping without CCC is proposed for CRAHNs, which is divided into preliminary discovery and further discovery. The former perceives the presence of the neighbor node and achieves a coarse discovery, while the latter makes the neighbor successfully meet to each other. Simulation results show that the proposed algorithm takes very little time to successfully discover the neighbor.
机译：在传统的认知无线电自组织网络（CRAHN）中，每个未许可节点感知并获得其自己的空闲频率信道。考虑到不同节点处的可用信道可能不同，专用公共控制信道（CCC）有助于交换每个节点的频谱可用性信息，然后即将来临的通信节点调谐到相同的频率信道并完成通信。然而，当CCC不可用时，邻居发现的问题变得非常具有挑战性。针对CRAHN，提出了一种基于不带CCC的组跳频的异步邻居发现算法，该算法分为初步发现和进一步发现。前者感知邻居节点的存在并实现粗略发现，而后者使邻居成功地相遇。仿真结果表明，所提出的算法仅花费很少的时间就可以成功地发现邻居。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号