Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks
文献类型：期刊论文
| 作者 | Yang B(杨博); Liang W(梁炜) ; Zheng M(郑萌); Liang YC(梁应敞)
|
| 刊名 | IEEE Transactions on Vehicular Technology
 |
| 出版日期 | 2016 |
| 卷号 | 65期号:10页码:8629-8643 |
| 关键词 | Cognitive radio networks channel rendezvous heterogeneous networks sunflower sets |
| ISSN号 | 0018-9545 |
| 产权排序 | 1 |
| 通讯作者 | 梁炜 |
| 中文摘要 | Channel rendezvous is a vital step to form a cognitive radio network (CRN). It is intractable to guarantee rendezvous for secondary users (SUs) within a short finite time in asynchronous, heterogeneous and anonymous CRNs. However, most previous heterogeneous algorithms rely on explicit SUs’ identifiers (IDs) to guide rendezvous, which is not fully distributed. In this paper, we exploit the mathematical construction of sunflower sets to develop a Single-radio Sunflower- Sets-based (SSS) pairwise rendezvous algorithm. We propose an approximation algorithm to construct disjoint sunflower sets. Then SSS leverages the variant permutations of elements in sunflower sets to adjust the order of accessing channels instead of SUs’ IDs, which is more favorable for anonymous SUs in distributed environments. We also propose a Multi-radio Sunflower-Sets-based (MSS) pairwise rendezvous algorithm in order to bring additional rendezvous diversity and accelerate the rendezvous process. Moreover, for the case with more than two SUs, we propose a multi-user collaborative scheme in which SUs cooperatively exchange and update their channel-hopping sequences until rendezvous. We derive the theoretical upper and lower bounds of rendezvous latency of the proposed algorithms. Extensive simulation comparisons with the state-of-the-art blind rendezvous algorithms are conducted incorporating the metrics of maximum and expected time-to-rendezvous. The simulation results show that our algorithms can achieve rendezvous faster than previous works. |
| WOS标题词 | Science & Technology ; Technology |
| 类目[WOS] | Engineering, Electrical & Electronic ; Telecommunications ; Transportation Science & Technology |
| 研究领域[WOS] | Engineering ; Telecommunications ; Transportation |
| 关键词[WOS] | RADIO NETWORKS ; SEQUENCE APPROACH |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000386658000064 |
| 源URL | [http://ir.sia.cn/handle/173321/17694]  |
| 专题 | 沈阳自动化研究所_工业控制网络与系统研究室 |
| 推荐引用方式 GB/T 7714 | Yang B,Liang W,Zheng M,et al. Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks[J]. IEEE Transactions on Vehicular Technology,2016,65(10):8629-8643. |
| APA | Yang B,Liang W,Zheng M,&Liang YC.(2016).Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks.IEEE Transactions on Vehicular Technology,65(10),8629-8643. |
| MLA | Yang B,et al."Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks".IEEE Transactions on Vehicular Technology 65.10(2016):8629-8643. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。