Radio spectrum has become increasingly scarce due to the proliferation of new wireless communication services. This problem has been exacerbated by fixed bandwidth licensing policies that often lead to spectral underutilization. Cognitive radio networks (CRN) can address this issue using flexible spectrum management that permits unlicensed (secondary) users to access the licensed spectrum. Supporting real-time quality-of-service (QoS) in CRNs however, is very challenging, due to the random spectrum availability induced by the licensed (primary) user activity. This thesis considers the problem of real-time voice transmission in CRNs with an emphasis on secondary network ``friendliness''. Friendliness is measured by the secondary real-time voice capacity, defined as the number of connections that can be supported, subject to typical QoS constraints.
The constant bit rate (CBR) air interface case is first assumed. An offline scheduler that maximizes friendliness is derived using an integer linear program (ILP) that can be solved using a minimum cost flow graph construction. Two online primary scheduling algorithms are then introduced. The first algorithm is based on shaping the primary spectral hole patterns subject to primary QoS constraints. The second applies real-time scheduling to both primary traffic and virtual secondary calls. The online scheduling algorithms are found to perform well compared to the friendliness upper bound. Extensive simulations of the primary friendly schedulers show the achievable secondary voice capacity for a variety of parameters compared to non-friendly primary scheduling.
The thesis then considers the variable bit rate (VBR) air interface option for primary transmissions. Offline and online approaches are taken to generate a primary VBR traffic schedule that is friendly to secondary voice calls. The online VBR schedulers are found to perform well compared to the friendliness upper bound. Simulation results are presented that show the effect of the primary traffic load and primary network delay tolerance on the primary network friendliness level towards potential secondary voice traffic.
Finally, secondary user friendliness is considered from an infrastructure deployment point of view. A cooperative framework is proposed, which allows the primary traffic to be relayed by helper nodes using decode-and-forward (DF) relaying. This approach decreases the primary traffic channel utilization, which, in turn, increases the capacity available to potential secondary users. A relay selection optimization problem is first formulated that minimizes the primary channel utilization. A greedy algorithm that assigns relay nodes to primary data flows is introduced and found to perform well compared to the optimum bound. Results are presented that show the primary network friendliness for different levels of primary channel utilization. / Dissertation / Doctor of Philosophy (PhD)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/20661 |
| Date | January 2016 |
| Creators | Hassanein, Hanan |
| Contributors | Todd, Terry, Electrical and Computer Engineering |
| Source Sets | McMaster University |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0018 seconds