Show simple item record

dc.contributor.authorCohen, Asaf
dc.contributor.authorHaeupler, Bernhard
dc.contributor.authorAvin, Chen
dc.contributor.authorMedard, Muriel
dc.date.accessioned2016-01-20T18:16:15Z
dc.date.available2016-01-20T18:16:15Z
dc.date.issued2015-03
dc.date.submitted2014-11
dc.identifier.issn0733-8716
dc.identifier.urihttp://hdl.handle.net/1721.1/100956
dc.description.abstractIn this paper, we design and analyze information spreading algorithms for dynamic networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both are correlated. Moreover, nodes' availability and connectivity is dynamic - a scenario typical for wireless networks. Our contribution is twofold. First, although coding schemes for correlated data have been studied extensively, the focus has been on characterizing the rate region in static networks. In an information spreading scheme, however, nodes may communicate by continuously exchanging packets according to some underlying communication model. The main figure of merit is the stopping time - the time required until nodes can successfully decode. While information spreading schemes, such as gossip, are practical, distributed, and scalable, they have only been studied for uncorrelated data. We close this gap by providing techniques to analyze network-coded information spreading in dynamic networks with correlated data. Second, we give a clean framework for oblivious dynamic network models that in particular applies to a multitude of wireless network and communication scenarios. We specify a general setting for the data model and give tight bounds on the stopping times of network-coded protocols in this wide range of settings. En route, we analyze the capacities seen by nodes under a network-coded information spreading protocol, a previously unexplored question. We conclude with extensive simulations, clearly validating the key trends and phenomena predicted in the analysis.en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (Contract N66001-11-C-4003)en_US
dc.description.sponsorshipOffice of the Chief Scientist of Israel (RESCUE)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/JSAC.2014.2384293en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceOther univ. web domainen_US
dc.titleNetwork Coding Based Information Spreading in Dynamic Networks With Correlated Dataen_US
dc.typeArticleen_US
dc.identifier.citationCohen, Asaf, Bernhard Haeupler, Chen Avin, and Muriel Medard. “Network Coding Based Information Spreading in Dynamic Networks With Correlated Data.” IEEE Journal on Selected Areas in Communications 33, no. 2 (February 2015): 213–224. doi:10.1109/jsac.2014.2384293.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronicsen_US
dc.contributor.mitauthorMedard, Murielen_US
dc.relation.journalIEEE Journal on Selected Areas in Communicationsen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsCohen, Asaf; Haeupler, Bernhard; Avin, Chen; Medard, Murielen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-4059-407X
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record