• 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

    A lossy graph model for delay reduction in generalized instantly decodable network coding

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Douik, Ahmed S. cc
    Sorour, Sameh
    Al-Naffouri, Tareq Y. cc
    Alouini, Mohamed-Slim cc
    KAUST Department
    Communication Theory Lab
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Date
    2014-06
    Preprint Posting Date
    2013-11-03
    Permanent link to this record
    http://hdl.handle.net/10754/563580
    
    Metadata
    Show full item record
    Abstract
    The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in. In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all lossy feedback situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability. © 2012 IEEE.
    Citation
    Douik, A., Sorour, S., Al-Naffouri, T. Y., & Alouini, M.-S. (2014). A Lossy Graph Model for Delay Reduction in Generalized Instantly Decodable Network Coding. IEEE Wireless Communications Letters, 3(3), 281–284. doi:10.1109/wcl.2014.022814.140067
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Wireless Communications Letters
    DOI
    10.1109/WCL.2014.022814.140067
    arXiv
    1311.0459
    Additional Links
    http://arxiv.org/abs/arXiv:1311.0459v1
    ae974a485f413a2113503eed53cd6c53
    10.1109/WCL.2014.022814.140067
    Scopus Count
    Collections
    Articles; 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.