Instantly decodable network coding for real-time device-to-device communications

Handle URI:
http://hdl.handle.net/10754/593177
Title:
Instantly decodable network coding for real-time device-to-device communications
Authors:
Douik, Ahmed; Sorour, Sameh; Al-Naffouri, Tareq Y. ( 0000-0003-2843-5084 ) ; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
This paper studies the delay reduction problem for instantly decodable network coding (IDNC)-based device-to-device (D2D) communication-enabled networks. Unlike conventional point-to-multipoint (PMP) systems in which the wireless base station has the sufficient computation abilities, D2D networks rely on battery-powered operations of the devices. Therefore, a particular emphasis on the computation complexity needs to be addressed in the design of delay reduction algorithms for D2D networks. While most of the existing literature on IDNC directly extend the delay reduction PMP schemes, known to be NP-hard, to the D2D setting, this paper proposes to investigate and minimize the complexity of such algorithms for battery-powered devices. With delay minimization problems in IDNC-based systems being equivalent to a maximum weight clique problems in the IDNC graph, the presented algorithms, in this paper, can be applied to different delay aspects. This paper introduces and focuses on the reduction of the maximum value of the decoding delay as it represents the most general solution. The complexity of the solution is reduced by first proposing efficient methods for the construction, the update, and the dimension reduction of the IDNC graph. The paper, further, shows that, under particular scenarios, the problem boils down to a maximum clique problem. Due to the complexity of discovering such maximum clique, the paper presents a fast selection algorithm. Simulation results illustrate the performance of the proposed schemes and suggest that the proposed fast selection algorithm provides appreciable complexity gain as compared to the optimal selection one, with a negligible degradation in performance. In addition, they indicate that the running time of the proposed solution is close to the random selection algorithm.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Instantly decodable network coding for real-time device-to-device communications 2016, 2016 (1) EURASIP Journal on Advances in Signal Processing
Publisher:
Springer Science + Business Media
Journal:
EURASIP Journal on Advances in Signal Processing
Issue Date:
4-Jan-2016
DOI:
10.1186/s13634-015-0293-z
Type:
Article
ISSN:
1687-6180
Additional Links:
http://asp.eurasipjournals.com/content/2016/1/1
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmeden
dc.contributor.authorSorour, Samehen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2016-01-10T10:18:15Zen
dc.date.available2016-01-10T10:18:15Zen
dc.date.issued2016-01-04en
dc.identifier.citationInstantly decodable network coding for real-time device-to-device communications 2016, 2016 (1) EURASIP Journal on Advances in Signal Processingen
dc.identifier.issn1687-6180en
dc.identifier.doi10.1186/s13634-015-0293-zen
dc.identifier.urihttp://hdl.handle.net/10754/593177en
dc.description.abstractThis paper studies the delay reduction problem for instantly decodable network coding (IDNC)-based device-to-device (D2D) communication-enabled networks. Unlike conventional point-to-multipoint (PMP) systems in which the wireless base station has the sufficient computation abilities, D2D networks rely on battery-powered operations of the devices. Therefore, a particular emphasis on the computation complexity needs to be addressed in the design of delay reduction algorithms for D2D networks. While most of the existing literature on IDNC directly extend the delay reduction PMP schemes, known to be NP-hard, to the D2D setting, this paper proposes to investigate and minimize the complexity of such algorithms for battery-powered devices. With delay minimization problems in IDNC-based systems being equivalent to a maximum weight clique problems in the IDNC graph, the presented algorithms, in this paper, can be applied to different delay aspects. This paper introduces and focuses on the reduction of the maximum value of the decoding delay as it represents the most general solution. The complexity of the solution is reduced by first proposing efficient methods for the construction, the update, and the dimension reduction of the IDNC graph. The paper, further, shows that, under particular scenarios, the problem boils down to a maximum clique problem. Due to the complexity of discovering such maximum clique, the paper presents a fast selection algorithm. Simulation results illustrate the performance of the proposed schemes and suggest that the proposed fast selection algorithm provides appreciable complexity gain as compared to the optimal selection one, with a negligible degradation in performance. In addition, they indicate that the running time of the proposed solution is close to the random selection algorithm.en
dc.language.isoenen
dc.publisherSpringer Science + Business Mediaen
dc.relation.urlhttp://asp.eurasipjournals.com/content/2016/1/1en
dc.rightsThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.en
dc.subjectDevice-to-device communicationsen
dc.subjectInstantly decodable network codingen
dc.subjectMaximum weight cliqueen
dc.titleInstantly decodable network coding for real-time device-to-device communicationsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalEURASIP Journal on Advances in Signal Processingen
dc.eprint.versionPublisher's Version/PDFen
dc.contributor.institutionCalifornia Institute of Technology (Caltech), Pasadena, California, USAen
dc.contributor.institutionKing Fahd University of Petroleum and Minerals (KFUPM), Dhahran, Eastern Province, Saudi Arabiaen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorAl-Naffouri, Tareq Y.en
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.