• 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

    Completion time reduction in instantly decodable network coding through decoding delay control

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Douik, Ahmed S. cc
    Sorour, Sameh
    Alouini, Mohamed-Slim cc
    Al-Naffouri, Tareq Y. cc
    KAUST Department
    Communication Theory Lab
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Date
    2014-12
    Preprint Posting Date
    2014-04-14
    Permanent link to this record
    http://hdl.handle.net/10754/565007
    
    Metadata
    Show full item record
    Abstract
    For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
    Citation
    Douik, A., Sorour, S., Alouini, M.-S., & Al-Naffouri, T. Y. (2014). Completion time reduction in instantly decodable network coding through decoding delay control. 2014 IEEE Global Communications Conference. doi:10.1109/glocom.2014.7037599
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2014 IEEE Global Communications Conference
    Conference/Event name
    2014 IEEE Global Communications Conference, GLOBECOM 2014
    ISBN
    9781479935116
    DOI
    10.1109/GLOCOM.2014.7037599
    arXiv
    1404.3677
    Additional Links
    http://arxiv.org/abs/arXiv:1404.3677v1
    ae974a485f413a2113503eed53cd6c53
    10.1109/GLOCOM.2014.7037599
    Scopus Count
    Collections
    Conference Papers; Electrical and Computer Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  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.