In this thesis, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other’s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network’s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network’s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. Furthermore, with the use of fractional cooperation, the average recovery overhead is further reduced by around 5% for the primary network and around 10% for the secondary network when a high fractional cooperation probability is used.
| Identifer | oai:union.ndltd.org:kaust.edu.sa/oai:repository.kaust.edu.sa:10754/316697 |
| Date | 05 1900 |
| Creators | Moubayed, Abdallah J. |
| Contributors | Alouini, Mohamed-Slim, Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, Al-Naffouri, Tareq Y., Sultan Salem, Ahmed Kamal, Turkiyyah, George |
| Source Sets | King Abdullah University of Science and Technology |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0055 seconds