• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Robust distributed cognitive relay beamforming

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Pandarakkottilil, Ubaidulla
    Aissa, Sonia
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Physical Science and Engineering (PSE) Division
    Date
    2012-05
    Permanent link to this record
    http://hdl.handle.net/10754/564549
    
    Metadata
    Show full item record
    Abstract
    In this paper, we present a distributed relay beamformer design for a cognitive radio network in which a cognitive (or secondary) transmit node communicates with a secondary receive node assisted by a set of cognitive non-regenerative relays. The secondary nodes share the spectrum with a licensed primary user (PU) node, and each node is assumed to be equipped with a single transmit/receive antenna. The interference to the PU resulting from the transmission from the cognitive nodes is kept below a specified limit. The proposed robust cognitive relay beamformer design seeks to minimize the total relay transmit power while ensuring that the transceiver signal-to-interference- plus-noise ratio and PU interference constraints are satisfied. The proposed design takes into account a parameter of the error in the channel state information (CSI) to render the performance of the beamformer robust in the presence of imperfect CSI. Though the original problem is non-convex, we show that the proposed design can be reformulated as a tractable convex optimization problem that can be solved efficiently. Numerical results are provided and illustrate the performance of the proposed designs for different network operating conditions and parameters. © 2012 IEEE.
    Citation
    Ubaidulla, P., & Aissa, S. (2012). Robust Distributed Cognitive Relay Beamforming. 2012 IEEE 75th Vehicular Technology Conference (VTC Spring). doi:10.1109/vetecs.2012.6239948
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2012 IEEE 75th Vehicular Technology Conference (VTC Spring)
    Conference/Event name
    IEEE 75th Vehicular Technology Conference, VTC Spring 2012
    ISBN
    9781467309905
    DOI
    10.1109/VETECS.2012.6239948
    ae974a485f413a2113503eed53cd6c53
    10.1109/VETECS.2012.6239948
    Scopus Count
    Collections
    Conference Papers; Physical Science and Engineering (PSE) Division; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.