Reference : Cooperative cognitive networks: Optimal, distributed and low-complexity algorithms
Scientific journals : Article
Engineering, computing & technology : Computer science
Cooperative cognitive networks: Optimal, distributed and low-complexity algorithms
Zheng, Gan [> >]
Song, Shenghui [> >]
Wong, Kai-Kit [> >]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
IEEE Transactions on Signal Processing
[en] This paper considers the cooperation between a cognitive system and a primary system where multiple cognitive base stations (CBSs) relay the primary user's (PU) signals in exchange for more opportunity to transmit their own signals. The CBSs use amplify-and-forward (AF) relaying and coordinated beamforming to relay the primary signals and transmit their own signals. The objective is to minimize the overall transmit power of the CBSs given the rate requirements of the PU and the cognitive users (CUs). We show that the relaying matrices have unity rank and perform two functions: Matched filter receive beamforming and transmit beamforming. We then develop two efficient algorithms to find the optimal solution. The first one has a linear convergence rate and is suitable for distributed implementation, while the second one enjoys superlinear convergence but requires centralized processing. Further, we derive the beamforming vectors for the linear conventional zero-forcing (CZF) and prior zero-forcing (PZF) schemes, which provide much simpler solutions. Simulation results demonstrate the improvement in terms of outage performance due to the cooperation between the primary and cognitive systems.
Researchers ; Professionals ; Students ; Others

File(s) associated to this reference

Fulltext file(s):

Limited access
Cooperative cognitive networks Optimal, distributed and low-complexity algorithms.pdfPublisher postprint2.68 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.