Decoding delay reduction in network coded cooperative systems with intermittent status update

Mohammad S. Karim; Neda Aboutorab; Ali A. Nasir; Parastoo Sadeghi

doi:10.1109/ITW.2014.6970860

Decoding delay reduction in network coded cooperative systems with intermittent status update

Mohammad S. Karim, Neda Aboutorab, Ali A. Nasir, Parastoo Sadeghi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Citations (Scopus)

Abstract

In this paper, we study the problem of decoding delay reduction for instantly decodable network coding (IDNC) in broadcast cooperative systems, where a group of closely located clients cooperate with each other to obtain their missing packets. In such cooperative systems, one of the clients (referred to as the leader) decides the transmitting client and the packet combination for each transmission. We consider intermittent system status update (SSU) at the leader such that all other clients feed back their packet reception status to the leader after several cooperative transmissions. We first introduce an intermittent local IDNC (IL-IDNC) graph to represent all potential packet combinations for a transmitting client. We then formulate the joint client and packet selection problem that results in the minimum expected decoding delay in each cooperative transmission as a maximum weight clique problem over all the IL-IDNC graphs. Since solving the formulated problem is computationally complex, we propose a heuristic algorithm to select the transmitting client and the packet combination that can reduce the decoding delay. Simulation results show that the proposed heuristic algorithm can achieve a tolerable degradation compared to the full SSU performance while using a smaller number of SSUs.

Original language	English
Title of host publication	2014 IEEE Information Theory Workshop, ITW 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	391-395
Number of pages	5
ISBN (Electronic)	9781479959990
DOIs	https://doi.org/10.1109/ITW.2014.6970860
Publication status	Published - 1 Dec 2014
Event	2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia Duration: 2 Nov 2014 → 5 Nov 2014

Publication series

Name	2014 IEEE Information Theory Workshop, ITW 2014

Conference

Conference	2014 IEEE Information Theory Workshop, ITW 2014
Country/Territory	Australia
City	Hobart
Period	2/11/14 → 5/11/14

Access to Document

10.1109/ITW.2014.6970860

Cite this

Karim, M. S., Aboutorab, N., Nasir, A. A., & Sadeghi, P. (2014). Decoding delay reduction in network coded cooperative systems with intermittent status update. In 2014 IEEE Information Theory Workshop, ITW 2014 (pp. 391-395). Article 6970860 (2014 IEEE Information Theory Workshop, ITW 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2014.6970860

@inproceedings{f122fec7f16846b5a61915f8d33b8852,

title = "Decoding delay reduction in network coded cooperative systems with intermittent status update",

abstract = "In this paper, we study the problem of decoding delay reduction for instantly decodable network coding (IDNC) in broadcast cooperative systems, where a group of closely located clients cooperate with each other to obtain their missing packets. In such cooperative systems, one of the clients (referred to as the leader) decides the transmitting client and the packet combination for each transmission. We consider intermittent system status update (SSU) at the leader such that all other clients feed back their packet reception status to the leader after several cooperative transmissions. We first introduce an intermittent local IDNC (IL-IDNC) graph to represent all potential packet combinations for a transmitting client. We then formulate the joint client and packet selection problem that results in the minimum expected decoding delay in each cooperative transmission as a maximum weight clique problem over all the IL-IDNC graphs. Since solving the formulated problem is computationally complex, we propose a heuristic algorithm to select the transmitting client and the packet combination that can reduce the decoding delay. Simulation results show that the proposed heuristic algorithm can achieve a tolerable degradation compared to the full SSU performance while using a smaller number of SSUs.",

keywords = "Cooperative Systems, Decoding Delay, Instantly Decodable Network Coding, Wireless Networks",

author = "Karim, {Mohammad S.} and Neda Aboutorab and Nasir, {Ali A.} and Parastoo Sadeghi",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 IEEE Information Theory Workshop, ITW 2014 ; Conference date: 02-11-2014 Through 05-11-2014",

year = "2014",

month = dec,

day = "1",

doi = "10.1109/ITW.2014.6970860",

language = "English",

series = "2014 IEEE Information Theory Workshop, ITW 2014",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "391--395",

booktitle = "2014 IEEE Information Theory Workshop, ITW 2014",

address = "United States",

}

Karim, MS, Aboutorab, N, Nasir, AA & Sadeghi, P 2014, Decoding delay reduction in network coded cooperative systems with intermittent status update. in 2014 IEEE Information Theory Workshop, ITW 2014., 6970860, 2014 IEEE Information Theory Workshop, ITW 2014, Institute of Electrical and Electronics Engineers Inc., pp. 391-395, 2014 IEEE Information Theory Workshop, ITW 2014, Hobart, Australia, 2/11/14. https://doi.org/10.1109/ITW.2014.6970860

Decoding delay reduction in network coded cooperative systems with intermittent status update. / Karim, Mohammad S.; Aboutorab, Neda; Nasir, Ali A. et al.
2014 IEEE Information Theory Workshop, ITW 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 391-395 6970860 (2014 IEEE Information Theory Workshop, ITW 2014).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Decoding delay reduction in network coded cooperative systems with intermittent status update

AU - Karim, Mohammad S.

AU - Aboutorab, Neda

AU - Nasir, Ali A.

AU - Sadeghi, Parastoo

PY - 2014/12/1

Y1 - 2014/12/1

N2 - In this paper, we study the problem of decoding delay reduction for instantly decodable network coding (IDNC) in broadcast cooperative systems, where a group of closely located clients cooperate with each other to obtain their missing packets. In such cooperative systems, one of the clients (referred to as the leader) decides the transmitting client and the packet combination for each transmission. We consider intermittent system status update (SSU) at the leader such that all other clients feed back their packet reception status to the leader after several cooperative transmissions. We first introduce an intermittent local IDNC (IL-IDNC) graph to represent all potential packet combinations for a transmitting client. We then formulate the joint client and packet selection problem that results in the minimum expected decoding delay in each cooperative transmission as a maximum weight clique problem over all the IL-IDNC graphs. Since solving the formulated problem is computationally complex, we propose a heuristic algorithm to select the transmitting client and the packet combination that can reduce the decoding delay. Simulation results show that the proposed heuristic algorithm can achieve a tolerable degradation compared to the full SSU performance while using a smaller number of SSUs.

AB - In this paper, we study the problem of decoding delay reduction for instantly decodable network coding (IDNC) in broadcast cooperative systems, where a group of closely located clients cooperate with each other to obtain their missing packets. In such cooperative systems, one of the clients (referred to as the leader) decides the transmitting client and the packet combination for each transmission. We consider intermittent system status update (SSU) at the leader such that all other clients feed back their packet reception status to the leader after several cooperative transmissions. We first introduce an intermittent local IDNC (IL-IDNC) graph to represent all potential packet combinations for a transmitting client. We then formulate the joint client and packet selection problem that results in the minimum expected decoding delay in each cooperative transmission as a maximum weight clique problem over all the IL-IDNC graphs. Since solving the formulated problem is computationally complex, we propose a heuristic algorithm to select the transmitting client and the packet combination that can reduce the decoding delay. Simulation results show that the proposed heuristic algorithm can achieve a tolerable degradation compared to the full SSU performance while using a smaller number of SSUs.

KW - Cooperative Systems

KW - Decoding Delay

KW - Instantly Decodable Network Coding

KW - Wireless Networks

UR - http://www.scopus.com/inward/record.url?scp=84929379880&partnerID=8YFLogxK

U2 - 10.1109/ITW.2014.6970860

DO - 10.1109/ITW.2014.6970860

M3 - Conference contribution

T3 - 2014 IEEE Information Theory Workshop, ITW 2014

SP - 391

EP - 395

BT - 2014 IEEE Information Theory Workshop, ITW 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE Information Theory Workshop, ITW 2014

Y2 - 2 November 2014 through 5 November 2014

ER -

Decoding delay reduction in network coded cooperative systems with intermittent status update

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this