6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

Spectrum Sharing with Interference Coordination under Outage Probability Constraint

Download518 downloads
  • @INPROCEEDINGS{10.4108/icst.crowncom.2011.245886,
        author={Jing  Wang and Peili  Cai and Ping  Zhang and Guixia  Kang},
        title={Spectrum Sharing with Interference Coordination under Outage Probability Constraint},
        proceedings={6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        publisher={IEEE},
        proceedings_a={CROWNCOM},
        year={2012},
        month={5},
        keywords={},
        doi={10.4108/icst.crowncom.2011.245886}
    }
    
  • Jing Wang
    Peili Cai
    Ping Zhang
    Guixia Kang
    Year: 2012
    Spectrum Sharing with Interference Coordination under Outage Probability Constraint
    CROWNCOM
    IEEE
    DOI: 10.4108/icst.crowncom.2011.245886
Jing Wang1,*, Peili Cai2, Ping Zhang1, Guixia Kang1
  • 1: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, China
  • 2: Department of Electrical and Computer Engineering, Texas A&M University College Station, TX, USA
*Contact email: wjcici@gmail.com

Abstract

In this paper we consider a cognitive radio (CR) communication system based on spectrum sharing schemes, where we have a secondary user (SU) link with multiple transmitting antennas and a single receiving antenna, coexisting with a primary user (PU) link with a single receiving antenna. At the SU transmitter (SU-Tx), the channel state information (CSI) of the SU link is assumed to be perfectly known; while the interference channel from the SU-Tx to the PU receiver (PURx) is not perfectly known due to less cooperation between the SU and the PU. Considering a SU transmit power constraint, our design objective is to determine the transmit covariance matrix that maximizes the SU rate, while we protect the PU by enforcing both a PU average interference constraint and a PU outage probability constraint. This problem is formulated as a nonconvex optimization problem with a non-explicit probabilistic constraint, which is then approximated as a mixed binary integer programming (MBIP) problem and solved with the Branch and Bound (BB) algorithm. The complexity of the BB algorithm is analyzed and numerical results are presented to show the performance of the CR system under consideration with our optimal solution.