Coded cooperative data exchange for multiple unicasts

Shahriar Etemadi Tajbakhsh; Parastoo Sadeghi

doi:10.1109/ITW.2012.6404743

Coded cooperative data exchange for multiple unicasts

Shahriar Etemadi Tajbakhsh^*, Parastoo Sadeghi

^*Corresponding author for this work

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

26 Citations (Scopus)

Abstract

The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client c_i is interested in a specific message x_i and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.

Original language	English
Title of host publication	2012 IEEE Information Theory Workshop, ITW 2012
Pages	587-591
Number of pages	5
DOIs	https://doi.org/10.1109/ITW.2012.6404743
Publication status	Published - 2012
Event	2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland Duration: 3 Sept 2012 → 7 Sept 2012

Publication series

Name	2012 IEEE Information Theory Workshop, ITW 2012

Conference

Conference	2012 IEEE Information Theory Workshop, ITW 2012
Country/Territory	Switzerland
City	Lausanne
Period	3/09/12 → 7/09/12

Access to Document

10.1109/ITW.2012.6404743

Cite this

@inproceedings{5bd07dd4bd71457b90301c6e6b3b5106,

title = "Coded cooperative data exchange for multiple unicasts",

abstract = "The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client ci is interested in a specific message xi and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.",

author = "Tajbakhsh, {Shahriar Etemadi} and Parastoo Sadeghi",

year = "2012",

doi = "10.1109/ITW.2012.6404743",

language = "English",

isbn = "9781467302234",

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

pages = "587--591",

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

note = "2012 IEEE Information Theory Workshop, ITW 2012 ; Conference date: 03-09-2012 Through 07-09-2012",

}

TY - GEN

T1 - Coded cooperative data exchange for multiple unicasts

AU - Tajbakhsh, Shahriar Etemadi

AU - Sadeghi, Parastoo

PY - 2012

Y1 - 2012

N2 - The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client ci is interested in a specific message xi and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.

AB - The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among the clients (which are faster, cheaper and more reliable) is an alternative for retransmissions by the base station. In this paper, we extend the problem of cooperative data exchange to the case of multiple unicasts to a set of n clients, where each client ci is interested in a specific message xi and the clients cooperate with each others to compensate the errors occurred over the downlink. Moreover, our proposed method maintains the secrecy of individuals' messages at the price of a substantially small overhead.

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

U2 - 10.1109/ITW.2012.6404743

DO - 10.1109/ITW.2012.6404743

M3 - Conference contribution

SN - 9781467302234

T3 - 2012 IEEE Information Theory Workshop, ITW 2012

SP - 587

EP - 591

BT - 2012 IEEE Information Theory Workshop, ITW 2012

T2 - 2012 IEEE Information Theory Workshop, ITW 2012

Y2 - 3 September 2012 through 7 September 2012

ER -

Coded cooperative data exchange for multiple unicasts

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this