标题:Guaranteed rendezvous for cognitive radio networks based on cycle length
作者:Gou, Li ;Xu, Xiaohua ;Zhang, Chongqing ;Song, Min
作者机构:[Gou, Li ;Song, Min ] Department of Computer Science, Michigan Technological University, Houghton; MI; 49931, United States;[Zhang, Chongqing ] Colleg 更多
会议名称:2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
会议日期:October 22, 2017 - October 24, 2017
来源:2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
出版年:2018
卷:2018-January
页码:1-6
DOI:10.1109/ICCChina.2017.8330399
摘要:Rendezvous is a blind process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed rendezvous algorithm for cognitive radio networks, based on the prime cycle length. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed in Ti ∗Tj+δ time slots, where Ti is the cycle length of node i and Tjis that of node j. When Ti= Tj, combining with the deadlock checking and the binary ID of each node, each node will independently change its cycle length bit by bit, by which the rendezvous can still be guaranteed in T0i∗ Tc+ [log max{IDi, IDj}] ∗ (Ti0∗ Ti1+ δ) time slots under all the possible time skew δ [O, Ti), where Tcis some constant, and T0and T1are two prime numbers defined for Ti. We conduct simulations on three metrics to demonstrate the efficiency of the proposed method.
© 2017 IEEE.
收录类别:EI
资源类型:会议论文
TOP