A fast neighbor discovery algorithm for cognitive radio ad hoc networks

Zhang Jian-zhao, Zhao Hang-sheng, Yao Fu-qiang
{"title":"A fast neighbor discovery algorithm for cognitive radio ad hoc networks","authors":"Zhang Jian-zhao, Zhao Hang-sheng, Yao Fu-qiang","doi":"10.1109/ICCT.2010.5688847","DOIUrl":null,"url":null,"abstract":"Cognitive radio (CR) is a revolution in wireless communication and CR ad hoc network(CRAHN) is under extensive research recently. In CRAHN, no control network infrastructure can be utilized and CR users have to attain the first hand information for networking. Neighbor discovery is a fundamental work for cooperation among CR users. This paper addresses the distributed neighbor discovery in CRAHNs. A fast neighbor discovery algorithm based on the available channel comparability among neighboring nodes is proposed. The algorithm makes use of data transceiver to accelerate the discovery process without increasing hardware requirement for CR users. The correctness and efficiency of the algorithm is proved through analysis as well as simulation.","PeriodicalId":253478,"journal":{"name":"2010 IEEE 12th International Conference on Communication Technology","volume":"248 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 12th International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2010.5688847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Cognitive radio (CR) is a revolution in wireless communication and CR ad hoc network(CRAHN) is under extensive research recently. In CRAHN, no control network infrastructure can be utilized and CR users have to attain the first hand information for networking. Neighbor discovery is a fundamental work for cooperation among CR users. This paper addresses the distributed neighbor discovery in CRAHNs. A fast neighbor discovery algorithm based on the available channel comparability among neighboring nodes is proposed. The algorithm makes use of data transceiver to accelerate the discovery process without increasing hardware requirement for CR users. The correctness and efficiency of the algorithm is proved through analysis as well as simulation.
认知无线电自组网中一种快速邻居发现算法
认知无线电(CR)是无线通信领域的一场革命,近年来认知无线电自组织网络(CRAHN)得到了广泛的研究。在CRAHN中,没有控制网络基础设施可以利用,CR用户必须获得联网的第一手信息。邻居发现是CR用户间合作的基础工作。本文研究了crahn中的分布式邻居发现问题。提出了一种基于相邻节点间可用信道可比性的快速邻居发现算法。该算法在不增加CR用户硬件要求的前提下,利用数据收发器加速了发现过程。通过分析和仿真验证了该算法的正确性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信