• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • 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

    An optimal probabilistic multiple-access scheme for cognitive radios

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Hamza, Doha R.
    Aïssa, Sonia
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Physical Science and Engineering (PSE) Division
    Date
    2012-09
    Permanent link to this record
    http://hdl.handle.net/10754/562307
    
    Metadata
    Show full item record
    Abstract
    We study a time-slotted multiple-access system with a primary user (PU) and a secondary user (SU) sharing the same channel resource. The SU senses the channel at the beginning of the slot. If found free, it transmits with probability 1. If busy, it transmits with a certain access probability that is a function of its queue length and whether it has a new packet arrival. Both users, i.e., the PU and the SU, transmit with a fixed transmission rate by employing a truncated channel inversion power control scheme. We consider the case of erroneous sensing. The goal of the SU is to optimize its transmission scheduling policy to minimize its queueing delay under constraints on its average transmit power and the maximum tolerable primary outage probability caused by the miss detection of the PU. We consider two schemes regarding the secondary's reaction to transmission errors. Under the so-called delay-sensitive (DS) scheme, the packet received in error is removed from the queue to minimize delay, whereas under the delay-tolerant (DT) scheme, the said packet is kept in the buffer and is retransmitted until correct reception. Using the latter scheme, there is a probability of buffer loss that is also constrained to be lower than a certain specified value. We also consider the case when the PU maintains an infinite buffer to store its packets. In the latter case, we modify the SU access scheme to guarantee the stability of the PU queue. We show that the performance significantly changes if the realistic situation of a primary queue is considered. In all cases, although the delay minimization problem is nonconvex, we show that the access policies can be efficiently obtained using linear programming and grid search over one or two parameters. © 1967-2012 IEEE.
    Citation
    Hamza, D., & Aissa, S. (2012). An Optimal Probabilistic Multiple-Access Scheme for Cognitive Radios. IEEE Transactions on Vehicular Technology, 61(7), 3002–3014. doi:10.1109/tvt.2012.2200051
    Sponsors
    This work was supported by King Abdullah University of Science and Technology (KAUST).
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Vehicular Technology
    DOI
    10.1109/TVT.2012.2200051
    ae974a485f413a2113503eed53cd6c53
    10.1109/TVT.2012.2200051
    Scopus Count
    Collections
    Articles; Physical Science and Engineering (PSE) Division; Electrical and Computer Engineering Program; 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.