Journal
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 10, Issue 9, Pages 2940-2949Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2011.072011.101249
Keywords
Cognitive radio; routing; robustness; spectrum allocation
Funding
- National Taiwan University [97R0062-06]
- National Science Council (NSC), Taiwan [NSC99-2221-E-002-030-MY3]
Ask authors/readers for more resources
In this paper, we introduce the concept of route robustness for path selection in multi-hop cognitive radio networks. We demonstrate that the aggregate throughput and the robustness of routes determined by the proposed route selection strategy are superior to existing rate-based selection strategies. The rationale behind our approach is to guarantee a basic level of robustness for a set of routes (referred to as skeletons in this paper). Then, we select some routes from this robust route set and determine the spectrum to be allocated on each link along these routes such that the system throughput is maximized. We also design a polynomial time algorithm for this problem, and evaluate our proposed mechanism via simulations. The results show that our proposed algorithm indeed achieves a near optimal solution of this problem for multi-hop overlay CR networks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available