SIA OpenIR  > 工业控制网络与系统研究室
A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks
Yang B(杨博); Liang W(梁炜); Zheng M(郑萌)
作者部门工业控制网络与系统研究室
会议名称35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
会议日期April 10-14, 2016
会议地点San Francisco, CA, United states
会议录名称Proceedings - IEEE INFOCOM
出版者IEEE
2016
页码1-9
收录类别EI ; CPCI(ISTP)
EI收录号20163502747078
WOS记录号WOS:000390154400227
产权排序1
ISSN号0743-166X
ISBN号978-1-4673-9953-1
摘要Channel rendezvous is a prerequisite for secondary users (SUs) to set up communications in cognitive radio networks (CRNs). It is expected that the rendezvous can be achieved within a short finite time for delay-sensitive applications and over all available channels to increase the robustness to unstable channels. Some existing works suffer from a small number of rendezvous channels and can only guarantee rendezvous under the undesired requirements such as synchronous clock, homogeneous available channels, predetermined roles and explicit SUs' identifiers (IDs). In this paper, to address these limitations, we employ the notion of Disjoint Set Cover (DSC) and propose a DSC-based Rendezvous (DSCR) algorithm. We first present an approximation algorithm to construct one DSC. The variant permutations of elements in the ingeniously constructed DSC are then utilized to regulate the order of accessing channels, enabling SUs to rendezvous on all available channels within a short duration. We derive the theoretical maximum and expected rendezvous latency and prove the full rendezvous degree of the DSCR algorithm. Extensive simulations show that the DSCR algorithm can significantly reduce the rendezvous latency compared to existing algorithms.
语种英语
引用统计
文献类型会议论文
条目标识符http://ir.sia.cn/handle/173321/19172
专题工业控制网络与系统研究室
通讯作者Liang W(梁炜)
作者单位1.Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang, 110016, China
2.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, 110016, China
3.University of Chinese Academy of Sciences, Beijing, 100049, China
推荐引用方式
GB/T 7714
Yang B,Liang W,Zheng M. A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks[C]:IEEE,2016:1-9.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
A time-efficient ren(438KB)会议论文 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
百度学术
百度学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
必应学术
必应学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。