O2-GIDNC: Beyond instantly decodable network coding

Handle URI:
http://hdl.handle.net/10754/564732
Title:
O2-GIDNC: Beyond instantly decodable network coding
Authors:
Aboutorab, Neda; Sorour, Sameh; Sadeghi, Parastoo
Abstract:
In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2013 International Symposium on Network Coding (NetCod)
Conference/Event name:
2013 International Symposium on Network Coding, NetCod 2013
Issue Date:
Jun-2013
DOI:
10.1109/NetCod.2013.6570817
Type:
Conference Paper
ISBN:
9781479908233
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAboutorab, Nedaen
dc.contributor.authorSorour, Samehen
dc.contributor.authorSadeghi, Parastooen
dc.date.accessioned2015-08-04T07:14:07Zen
dc.date.available2015-08-04T07:14:07Zen
dc.date.issued2013-06en
dc.identifier.isbn9781479908233en
dc.identifier.doi10.1109/NetCod.2013.6570817en
dc.identifier.urihttp://hdl.handle.net/10754/564732en
dc.description.abstractIn this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleO2-GIDNC: Beyond instantly decodable network codingen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journal2013 International Symposium on Network Coding (NetCod)en
dc.conference.date7 June 2013 through 9 June 2013en
dc.conference.name2013 International Symposium on Network Coding, NetCod 2013en
dc.conference.locationCalgary, ABen
dc.contributor.institutionResearch School of Information Sciences and Engineering, Australian National University, Australiaen
kaust.authorSorour, Samehen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.