一种用于认知网络的短交会跳频算法

Short rendezvous channel-hopping algorithm for cognitive radio networks

根据网络拓扑结构认知网络可分为有中心控制设施的网络和认知Ad-hoc网络(CR Ad-Hoc Networks,CRAHNs).在CRAHNs中,由于无法预知主要用户(Primary User,PU)何时占用信道次要用户(Secondary User,SU)不能使用固定的公共控制信道(Common Control Channel,CCC).针对这种情况,提出一种交会跳频算法通过设计分布式的CCC方案使次要用户短时间内交会在共同的可用信道上,并建立通信链路.将文中提出的算法与其他同类算法比较后发现,文中算法提供的交会时间(Time To Rendezvous,TTR)最小.

According to the network topology structure , cognitive networks can be divided into the network with a centralized controller and CRAHNs （ CR Ad‐Hoc Networks , CRAHNs ） . Because it is difficult to predict when primary users（ PU ） appear , secondary users（ SU ） can not use the fixed common control channel（CCC） . This paper presents a short rendezvous channel‐hopping algorithm for CRAHNs . By the distributed CCC scheme , secondary users rendezvous on the available channels in common and establish a link in a short time . Compared with previous guaranteed algorithms , our algorithm outperforms the state of the art in terms of TTR（ Time To Rendezvous） .