Tight Lower Bounds for Channel Hopping Schemes in Cognitive Radio Networks.
IEEE/ACM Transactions on Networking(2016)
摘要
In this paper, we consider the two-user multichannel rendezvous problem in a cognitive radio network (CRN) and derive tight lower bounds for maximum time-to-rendezvous (MTTR) and maximum conditional time-to-rendezvous (MCTTR) of various channel hopping (CH) schemes under a channel loading constraint. In the symmetric and synchronous setting, we propose a novel Cycle-Adjustable Channel Hopping (CAC...
更多查看译文
关键词
Loading,Measurement,Cognitive radio,IEEE transactions,Optimization,Search problems,Computer simulation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络