A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model

Abstract

International audienceUnder use of the regulated radio spectrum is being addressed using a cognitive radio network approach termed dynamic spectrum access. Primary users have priority over the regulated radio spectrum. Secondary users may use the residual air time. We focus on the problem of meeting on a common channel by a group of secondary users. Under the asymmetric model, the secondary users have different sets of available channels. If the sets are not disjoint, they can eventually make rendezvous. The goal is to make the secondary users rendezvous on a common channel in a minimum amount of time. The jump-stay rendezvous algorithm has been created by Lin et al. to solve this problem. We develop a new analysis for the two-user expected time to rendezvous in the jump-stay rendezvous algorithm, under the asymmetric model, that better reflects its performanc

A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks

“…In each period, JS continuously switches channels during the jump pattern (2P time slots) and then stays on a specific channel during the stay pattern (P time slots). The EJS algorithm [13] [14] is an enhanced version of JS, in which the jump pattern is prolonged to 3P time slots. EJS achieves shorter MTTR/ETTR than JS when SUs perceive asymmetric available channels.…”

Channel selection using a multiple radio model

“…It is based on ideas initially introduced by DaSilva and Guerreiro [10]. It is analogous to the jump-stay rendezvous algorithm, but the stay pattern is not performed [22]. Two-node rendezvous is guaranteed when they scan using different step increments.…”

基于Galois域的异构认知无线网络信道跳频汇合算法

“…Jump-Stay 算法 [10] 的周期序列由 "跳" 和 "等" 两个 阶段组成, "跳" 阶段的每个时隙都进行信道切换可遍历所有信道, "等" 阶段仅在某信道停留以期望 汇合, 但在非对称模型下其汇合时间较长. Enhanced-Jump-Stay 算法 [11,12] 适当延长了 "跳" 阶段的 时长, 这样可以缩短非对称模型下的汇合时间. SARCH 算法 [5] 按逆时针、顺时针相反的方向交错式 地构建序列, 并将循环轮转后的序列按序成对地拼接在一起, 但需要区分次用户的收 / 发角色.…”