An optimal scheduling framework for concurrent transmissions in wireless cognitive radio networks
This paper investigates the problem of optimal scheduling for cognitive radio network links in order to maximize the aggregated cognitive radio network throughput. The problem is formulated as an integer linear programming (ILP) problem, which schedules cognitive radio links to maximize the aggregat...
Saved in:
| Published in | Telecommunication systems Vol. 60; no. 1; pp. 169 - 177 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.09.2015
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1018-4864 1572-9451 |
| DOI | 10.1007/s11235-014-9931-2 |
Cover
| Summary: | This paper investigates the problem of optimal scheduling for cognitive radio network links in order to maximize the aggregated cognitive radio network throughput. The problem is formulated as an integer linear programming (ILP) problem, which schedules cognitive radio links to maximize the aggregated network throughput subject to primary and cognitive network protection. The proposed model is capable of scheduling multiple concurrent cognitive radio links which can coexist with a set of primary links. This approach can significantly increase the aggregated network throughput and utilize the spectrum more efficiently by utilizing user location information. The ILP problem is optimally solved for specific network scenarios and numerical results are presented. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1018-4864 1572-9451 |
| DOI: | 10.1007/s11235-014-9931-2 |