Full metadata record
DC FieldValueLanguage
dc.contributor.authorShih, Chao-Fangen_US
dc.contributor.authorLiao, Wanjiunen_US
dc.contributor.authorChao, Hsi-Luen_US
dc.date.accessioned2014-12-08T15:20:48Z-
dc.date.available2014-12-08T15:20:48Z-
dc.date.issued2011-09-01en_US
dc.identifier.issn1536-1276en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TWC.2011.072011.101249en_US
dc.identifier.urihttp://hdl.handle.net/11536/14793-
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.subjectCognitive radioen_US
dc.subjectroutingen_US
dc.subjectrobustnessen_US
dc.subjectspectrum allocationen_US
dc.titleJoint Routing and Spectrum Allocation for Multi-Hop Cognitive Radio Networks with Route Robustness Considerationen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TWC.2011.072011.101249en_US
dc.identifier.journalIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONSen_US
dc.citation.volume10en_US
dc.citation.issue9en_US
dc.citation.spage2940en_US
dc.citation.epage2949en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000297246300019-
dc.citation.woscount8-
Appears in Collections:Articles


Files in This Item:

  1. 000297246300019.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.