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

A Probability-Based Fast Blind Rendezvous Channel-Hopping Algorithm in Cognitive Radio Sensor Networks

基于传统的会合(Rendezvous)机制,提出了一种简单快速的跳频算法SRPX(sender-receiver-parameter-X,SRPX),算法将节点状态划分为发送状态和接收状态,通过调整步长和信道使用概率参数生成信道跳频序列,实现节点间的通信.算法有效解决了CRSN中公共控制信道的瓶颈问题,支持信道集的对称模型和非对称模型,满足多用户/多跳应用场景,实现了信道的有效相遇(Rendezvous).通过理论证明和实验对比分析,验证了SRPX算法在最大相遇时间(MTTR)和平均相遇时间(ATTR)上优于其它相关算法.

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).