作者: Chao-Fang Shih , Wanjiun Liao , Hsi-Lu Chao
DOI: 10.1109/TWC.2011.072011.101249
关键词:
摘要: In this paper, we introduce the concept of "route robustness" for path selection in multi-hop cognitive radio networks. We demonstrate that aggregate throughput and robustness routes determined by proposed route strategy are superior to existing rate-based strategies. The rationale behind our approach is guarantee a basic level set (referred as skeletons paper). Then, select some from robust determine spectrum be allocated on each link along these such system maximized. also design polynomial time algorithm problem, evaluate mechanism via simulations. results show indeed achieves near optimal solution problem overlay CR