删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

一种基于CRSN的简单有效Rendezvous算法

本站小编 Free考研考试/2021-12-21

本文二维码信息
二维码(扫一下试试看!)
一种基于CRSN的简单有效Rendezvous算法
A Probability-Based Fast Blind Rendezvous Channel-Hopping Algorithm in Cognitive Radio Sensor Networks
投稿时间:2018-08-20
DOI:10.15918/j.tbit1001-0645.2019.08.009
中文关键词:认知无线电会合机制认知无线传感网公共控制信道
English Keywords:cognitive radioRendezvous mechanismcognitive radio sensor networkcommon control channel
基金项目:国家自然科学基金资助项目(81273649);黑龙江省自然科学基金面上项目(F201434)
作者单位E-mail
谭龙黑龙江大学 计算机科学技术学院, 黑龙江, 哈尔滨 150080
张晓琪黑龙江大学 计算机科学技术学院, 黑龙江, 哈尔滨 150080
李建中黑龙江大学 计算机科学技术学院, 黑龙江, 哈尔滨 150080Lijzh@hit.edu.cn
摘要点击次数:670
全文下载次数:270
中文摘要:
基于传统的会合(Rendezvous)机制,提出了一种简单快速的跳频算法SRPX(sender-receiver-parameter-X,SRPX),算法将节点状态划分为发送状态和接收状态,通过调整步长和信道使用概率参数生成信道跳频序列,实现节点间的通信.算法有效解决了CRSN中公共控制信道的瓶颈问题,支持信道集的对称模型和非对称模型,满足多用户/多跳应用场景,实现了信道的有效相遇(Rendezvous).通过理论证明和实验对比分析,验证了SRPX算法在最大相遇时间(MTTR)和平均相遇时间(ATTR)上优于其它相关算法.
English Summary:
To solve the limitation of common control channel in cognitive radio sensor networks (CRSN), a simple and fast channel hopping algorithm SRA (sender-receiver-X) was proposed based on the traditional Rendezvous mechanism for reducing channel conflicts and improving the spectral adaptability of sensor nodes without using common control channels. In the SRA, node states were assorted into sending and receiving states firstly. And then, the channel hopping sequence was generated to realize the communication between nodes by adjusting the step size and the probability parameters. Finally, some theoretical and experimental analyses were carried out. Results show that, the algorithm can effectively solve the bottleneck problem of common control channel in CRSN, support symmetric and asymmetric models, satisfy multi-user/multi-hop application scenarios and realize guaranteed Rendezvous. Compared with other related algorithms, the SRPX algorithm is superior on maximum time to Rendezvous (MTTR) and average time to Rendezvous (ATTR).
查看全文查看/发表评论下载PDF阅读器
相关话题/黑龙江大学 计算机科学 黑龙江 公共 控制