2013
Arkoulis, S.; Anifantis, E.; Karyotis, V.; Papavassiliou, S.; Mitrou, N.
On the optimal, fair and channel-aware cognitive radio network reconfiguration Journal Article
In: Computer Networks, vol. 57, no. 8, pp. 1739-1757, 2013, ISSN: 13891286, (cited By 16).
Abstract | Links | BibTeX | Tags: Channel assignment and routing; Channel switching; Cognitive radio network; Fairness; MILP; Network re-configuration; problem, Cognitive radio; Heuristic methods; Integer programming; Optimization; Radio systems, Network routing
@article{Arkoulis20131739,
title = {On the optimal, fair and channel-aware cognitive radio network reconfiguration},
author = {S. Arkoulis and E. Anifantis and V. Karyotis and S. Papavassiliou and N. Mitrou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84878115702&doi=10.1016%2fj.comnet.2013.03.004&partnerID=40&md5=f0b5125bfb88b55dda37a775e106f7ff},
doi = {10.1016/j.comnet.2013.03.004},
issn = {13891286},
year = {2013},
date = {2013-01-01},
journal = {Computer Networks},
volume = {57},
number = {8},
pages = {1739-1757},
abstract = {In this work, we focus on the Joint Channel Assignment and Routing (JCAR) problem in Cognitive Radio Networks (CRNs) and especially on the optimal reconfiguration of secondary networks under the presence of primary users. Secondary CRN users need to adapt their transmission channels promptly, while effectively limit additional or escalating system modifications triggered by the intertweaved primary user activity. Our approach takes into consideration the underlying spectrum switching dynamics and concurrently aims at a fair resource allocation among the active network flows. We take an optimization perspective and formulate the JCAR and network reconfiguration problems as mixed integer linear programs, addressing fairness concerns as well. We propose a heuristic approach which is based on a sequential reduced search space methodology, in order to obtain efficiently solutions of otherwise tough and demanding reconfiguration problems. The operation, effectiveness and performance of the proposed mechanisms are evaluated through analysis and simulations under various working conditions. The obtained numerical results indicate the benefits of the proposed schemes in terms of overhead performance and their scaling properties with respect to more realistic and thus demanding topologies. © 2013 Elsevier B.V. All rights reserved.},
note = {cited By 16},
keywords = {Channel assignment and routing; Channel switching; Cognitive radio network; Fairness; MILP; Network re-configuration; problem, Cognitive radio; Heuristic methods; Integer programming; Optimization; Radio systems, Network routing},
pubstate = {published},
tppubtype = {article}
}
In this work, we focus on the Joint Channel Assignment and Routing (JCAR) problem in Cognitive Radio Networks (CRNs) and especially on the optimal reconfiguration of secondary networks under the presence of primary users. Secondary CRN users need to adapt their transmission channels promptly, while effectively limit additional or escalating system modifications triggered by the intertweaved primary user activity. Our approach takes into consideration the underlying spectrum switching dynamics and concurrently aims at a fair resource allocation among the active network flows. We take an optimization perspective and formulate the JCAR and network reconfiguration problems as mixed integer linear programs, addressing fairness concerns as well. We propose a heuristic approach which is based on a sequential reduced search space methodology, in order to obtain efficiently solutions of otherwise tough and demanding reconfiguration problems. The operation, effectiveness and performance of the proposed mechanisms are evaluated through analysis and simulations under various working conditions. The obtained numerical results indicate the benefits of the proposed schemes in terms of overhead performance and their scaling properties with respect to more realistic and thus demanding topologies. © 2013 Elsevier B.V. All rights reserved.