Padded-Dyck-Path-Based Rendezvous Algorithms for Heterogeneous Cognitive Radio Networks
文献类型:会议论文
作者 | Yang B(杨博); Zheng M(郑萌)![]() ![]() |
出版日期 | 2015 |
会议名称 | 2015 24th International Conference on Computer Communication and Networks (ICCCN) |
会议日期 | Augest 3-6, 2015 |
会议地点 | Las Vegas, NV |
关键词 | Cognitive radio networks channel rendezvous heterogeneous networks Dyck path |
页码 | 1-8 |
中文摘要 | Rendezvous is a vital step for secondary users who want to initiate a communication in cognitive radio networks. In this paper, we propose a novel Padded-Dyck-Path-based (PDP) rendezvous algorithm that generates channel hopping sequences utilizing global channels. PDP is designed according to the roundabout Dyck path so as to increase rendezvous opportunities. As the global channels may not be shared in distributed environments, we also propose a local PDP (L-PDP) heterogeneous rendezvous algorithm that generates channel hopping sequences utilizing only local available channels. L-PDP can significantly reduce rendezvous latency and allow for distributed implementations. We prove that both PDP and L-PDP can provide guaranteed rendezvous and derive their upper bounds of rendezvous latency. Analytical and simulation results show that PDP and L-PDP outperform existing algorithms in terms of time-to-rendezvous in global and local scenarios, respectively. |
收录类别 | EI ; CPCI(ISTP) |
产权排序 | 1 |
会议录 | 2015 24th International Conference on Computer Communication and Networks (ICCCN)
![]() |
会议录出版者 | IEEE |
会议录出版地 | Piscataway, NJ, USA |
语种 | 英语 |
ISBN号 | 978-1-4799-9964-4 |
WOS记录号 | WOS:000380482500075 |
源URL | [http://ir.sia.cn/handle/173321/17391] ![]() |
专题 | 沈阳自动化研究所_工业控制网络与系统研究室 |
推荐引用方式 GB/T 7714 | Yang B,Zheng M,Liang W. Padded-Dyck-Path-Based Rendezvous Algorithms for Heterogeneous Cognitive Radio Networks[C]. 见:2015 24th International Conference on Computer Communication and Networks (ICCCN). Las Vegas, NV. Augest 3-6, 2015. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。