Skip navigation
Skip navigation

A Generalized Model for Cost and Fairness Analysis in Coded Cooperative Data Exchange

Etemadi Tajbakhsh , Shahriar; Sadeghi, Parastoo; Shams, Ramtin

Description

We consider the issues of cost and fairness in the problem of cooperative data exchange among a group of wireless clients. In this problem, each client initially holds a subset of packets and needs to obtain the full set of packets through cooperation with other clients via a shared broadcast channel. To find minimum cost transmission schemes, we propose a general model for the problem which is based on network information flow with side information available to the sinks. As a special case of...[Show more]

dc.contributor.authorEtemadi Tajbakhsh , Shahriar
dc.contributor.authorSadeghi, Parastoo
dc.contributor.authorShams, Ramtin
dc.coverage.spatialBeijing China
dc.date.accessioned2015-12-10T23:12:55Z
dc.date.createdJuly 25-27 2011
dc.identifier.isbn9781612841403
dc.identifier.urihttp://hdl.handle.net/1885/64190
dc.description.abstractWe consider the issues of cost and fairness in the problem of cooperative data exchange among a group of wireless clients. In this problem, each client initially holds a subset of packets and needs to obtain the full set of packets through cooperation with other clients via a shared broadcast channel. To find minimum cost transmission schemes, we propose a general model for the problem which is based on network information flow with side information available to the sinks. As a special case of minimum cost solutions, the minimum number of required transmissions is studied in detail. We show that packet splitting is a natural consequence of solving the linear programming associated with the mentioned network flow problem. Our main observation is that splitting the packets not only minimizes the number of transmissions, but also it results in considerably more fairness compared to the case where splitting is not allowed. Hence, incentive-based long-term cooperation among users can be sustained.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesInternational Symposium on Network Coding (NetCod 2011)
dc.sourceInternational Symposium on Network Coding (NetCod 2011) proceedings
dc.subjectKeywords: Broadcast channels; General model; Generalized models; Minimum cost; Multicasts; Natural consequences; Network flow problems; Network information flow; Side information; Transmission schemes; Wireless client; Cost benefit analysis; Electronic data interch cooperative data exchange; linear programming; multicast; network coding; side information
dc.titleA Generalized Model for Cost and Fairness Analysis in Coded Cooperative Data Exchange
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2011
local.identifier.absfor090609 - Signal Processing
local.identifier.ariespublicationu4334215xPUB899
local.type.statusPublished Version
local.contributor.affiliationEtemadi Tajbakhsh , Shahriar, College of Engineering and Computer Science, ANU
local.contributor.affiliationSadeghi, Parastoo, College of Engineering and Computer Science, ANU
local.contributor.affiliationShams, Ramtin, College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.startpage1
local.bibliographicCitation.lastpage6
local.identifier.doi10.1109/ISNETCOD.2011.5979066
local.identifier.absseo970109 - Expanding Knowledge in Engineering
dc.date.updated2016-02-24T11:04:06Z
local.identifier.scopusID2-s2.0-80053030424
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Etemadi Tajbakhsh _A_Generalized_Model_for_Cost_2011.pdf659.28 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator