Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach

Ni Ding; Rodney A. Kennedy; Parastoo Sadeghi

doi:10.1109/ICT.2015.7124654

Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach

Ni Ding, Rodney A. Kennedy, Parastoo Sadeghi

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

5 Citations (Scopus)

Abstract

We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.

Original language	English
Title of host publication	2015 22nd International Conference on Telecommunications, ICT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	36-42
Number of pages	7
ISBN (Electronic)	9781479980789
DOIs	https://doi.org/10.1109/ICT.2015.7124654
Publication status	Published - 16 Jun 2015
Event	2015 22nd International Conference on Telecommunications, ICT 2015 - Sydney, Australia Duration: 27 Apr 2015 → 29 Apr 2015

Publication series

Name	2015 22nd International Conference on Telecommunications, ICT 2015

Conference

Conference	2015 22nd International Conference on Telecommunications, ICT 2015
Country/Territory	Australia
City	Sydney
Period	27/04/15 → 29/04/15

Access to Document

10.1109/ICT.2015.7124654

Cite this

Ding, N., Kennedy, R. A., & Sadeghi, P. (2015). Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach. In 2015 22nd International Conference on Telecommunications, ICT 2015 (pp. 36-42). Article 7124654 (2015 22nd International Conference on Telecommunications, ICT 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICT.2015.7124654

@inproceedings{e11226d9fff945a3b57bc5f37cc5fe0d,

title = "Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach",

abstract = "We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.",

author = "Ni Ding and Kennedy, {Rodney A.} and Parastoo Sadeghi",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 22nd International Conference on Telecommunications, ICT 2015 ; Conference date: 27-04-2015 Through 29-04-2015",

year = "2015",

month = jun,

day = "16",

doi = "10.1109/ICT.2015.7124654",

language = "English",

series = "2015 22nd International Conference on Telecommunications, ICT 2015",

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

pages = "36--42",

booktitle = "2015 22nd International Conference on Telecommunications, ICT 2015",

address = "United States",

}

Ding, N, Kennedy, RA & Sadeghi, P 2015, Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach. in 2015 22nd International Conference on Telecommunications, ICT 2015., 7124654, 2015 22nd International Conference on Telecommunications, ICT 2015, Institute of Electrical and Electronics Engineers Inc., pp. 36-42, 2015 22nd International Conference on Telecommunications, ICT 2015, Sydney, Australia, 27/04/15. https://doi.org/10.1109/ICT.2015.7124654

Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach. / Ding, Ni; Kennedy, Rodney A.; Sadeghi, Parastoo.
2015 22nd International Conference on Telecommunications, ICT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 36-42 7124654 (2015 22nd International Conference on Telecommunications, ICT 2015).

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

TY - GEN

T1 - Fairest constant sum-rate transmission for cooperative data exchange

T2 - 2015 22nd International Conference on Telecommunications, ICT 2015

AU - Ding, Ni

AU - Kennedy, Rodney A.

AU - Sadeghi, Parastoo

PY - 2015/6/16

Y1 - 2015/6/16

N2 - We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.

AB - We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.

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

U2 - 10.1109/ICT.2015.7124654

DO - 10.1109/ICT.2015.7124654

M3 - Conference contribution

T3 - 2015 22nd International Conference on Telecommunications, ICT 2015

SP - 36

EP - 42

BT - 2015 22nd International Conference on Telecommunications, ICT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 27 April 2015 through 29 April 2015

ER -

Ding N, Kennedy RA, Sadeghi P. Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach. In 2015 22nd International Conference on Telecommunications, ICT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 36-42. 7124654. (2015 22nd International Conference on Telecommunications, ICT 2015). doi: 10.1109/ICT.2015.7124654

Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this