中国科学院沈阳自动化研究所机构知识库
Advanced  
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
ISSN号: 0743-166X
ISBN号: 9781467399531
摘要: 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.
语种: 英语
产权排序: 1
内容类型: 会议论文
URI标识: http://ir.sia.cn/handle/173321/19172
Appears in Collections:工业控制网络与系统研究室_会议论文

Files in This Item: Download All
File Name/ File Size Content Type Version Access License
A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks.pdf(438KB)会议论文--开放获取View Download

Recommended Citation:
Yang B,Liang W,Zheng M. A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks[C]. 见:35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016. San Francisco, CA, United states. April 10-14, 2016.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[杨博]'s Articles
[梁炜]'s Articles
[郑萌]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[杨博]‘s Articles
[梁炜]‘s Articles
[郑萌]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
文件名: A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2016  中国科学院沈阳自动化研究所 - Feedback
Powered by CSpace