A precoding scheme with generation crossing for network coding

D. Y. Hu; M. Z. Wang; Chung Ming Lau; Q. C. Peng

doi:10.1109/APCC.2009.5375492

A precoding scheme with generation crossing for network coding

D. Y. Hu, M. Z. Wang, Chung Ming Lau, Q. C. Peng

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call "generation crossing". We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.

Original language	English
Title of host publication	2009 15th Asia-Pacific Conference on Communications, APCC 2009
Pages	754-757
Number of pages	4
DOIs	https://doi.org/10.1109/APCC.2009.5375492
Publication status	Published - 1 Dec 2009
Event	2009 15th Asia-Pacific Conference on Communications, APCC 2009 - Shanghai, China Duration: 8 Oct 2009 → 10 Oct 2009

Conference

Conference	2009 15th Asia-Pacific Conference on Communications, APCC 2009
Country/Territory	China
City	Shanghai
Period	8/10/09 → 10/10/09

Keywords

Generation
Overlap
Random network coding

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Electrical and Electronic Engineering
Communication

More information

10.1109/APCC.2009.5375492

Cite this

@inproceedings{c4e8a53e9897464a81fa9e358d0a941c,

title = "A precoding scheme with generation crossing for network coding",

abstract = "Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call {"}generation crossing{"}. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.",

keywords = "Generation, Overlap, Random network coding",

author = "Hu, {D. Y.} and Wang, {M. Z.} and Lau, {Chung Ming} and Peng, {Q. C.}",

year = "2009",

month = dec,

day = "1",

doi = "10.1109/APCC.2009.5375492",

language = "English",

isbn = "9781424447855",

pages = "754--757",

booktitle = "2009 15th Asia-Pacific Conference on Communications, APCC 2009",

note = "2009 15th Asia-Pacific Conference on Communications, APCC 2009 ; Conference date: 08-10-2009 Through 10-10-2009",

}

TY - GEN

T1 - A precoding scheme with generation crossing for network coding

AU - Hu, D. Y.

AU - Wang, M. Z.

AU - Lau, Chung Ming

AU - Peng, Q. C.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call "generation crossing". We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.

AB - Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call "generation crossing". We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.

KW - Generation

KW - Overlap

KW - Random network coding

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

U2 - 10.1109/APCC.2009.5375492

DO - 10.1109/APCC.2009.5375492

M3 - Conference article published in proceeding or book

SN - 9781424447855

SP - 754

EP - 757

BT - 2009 15th Asia-Pacific Conference on Communications, APCC 2009

T2 - 2009 15th Asia-Pacific Conference on Communications, APCC 2009

Y2 - 8 October 2009 through 10 October 2009

ER -

A precoding scheme with generation crossing for network coding

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this