Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Transactions of Beijing Institute of Technology》 2019-08
Add to Favorite Get Latest Update

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

TAN Long;ZHANG Xiao-qi;LI Jian-zhong;College of Computer Science and Technology,Heilongjiang University;  
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).
【Fund】: 国家自然科学基金资助项目(81273649);; 黑龙江省自然科学基金面上项目(F201434)
【CateGory Index】: TP212.9;TN925
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved