Network Coding Based Information Spreading in Dynamic Networks With Correlated Data

被引:6
作者
Cohen, Asaf [1 ]
Haeupler, Bernhard [2 ]
Avin, Chen [1 ]
Medard, Muriel [3 ,4 ]
机构
[1] Ben Gurion Univ Negev, Dept Commun Syst Engn, IL-84105 Beer Sheva, Israel
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[3] MIT, Dept Elect Engn, Cambridge, MA 02139 USA
[4] MIT, Elect Res Lab, Cambridge, MA 02139 USA
关键词
Dynamic networks; information dissemination; spreading; gossip; network coding; correlated data; GOSSIP;
D O I
10.1109/JSAC.2014.2384293
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In 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.
引用
收藏
页码:213 / 224
页数:12
相关论文
共 40 条
[11]   Tight Bounds for Algebraic Gossip on Graphs [J].
Borokhovich, Michael ;
Avin, Chen ;
Lotker, Zvi .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :1758-1762
[12]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[13]   Fast flooding over Manhattan [J].
Clementi, Andrea ;
Monti, Angelo ;
Silvestri, Riccardo .
DISTRIBUTED COMPUTING, 2013, 26 (01) :25-38
[14]   Information Spreading in Stationary Markovian Evolving Graphs [J].
Clementi, Andrea ;
Monti, Angelo ;
Pasquale, Francesco ;
Silvestri, Riccardo .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (09) :1425-1432
[15]   Flooding Time in edge-Markovian Dynamic Graphs [J].
Clementi, Andrea E. F. ;
Macci, Claudio ;
Monti, Angelo ;
Pasquale, Francesco ;
Silvestri, Riccardo .
PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, :213-+
[16]   On Networks with Side Information [J].
Cohen, Asaf ;
Avestimehr, Salman ;
Effros, Michelle .
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :1343-1347
[17]   TOWARDS A GENERAL-THEORY OF SOURCE NETWORKS [J].
CSISZAR, I ;
KORNER, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) :155-165
[18]   Algebraic gossip:: A network coding approach to optimal multiple rumor mongering [J].
Deb, Supratim ;
Medard, Muriel ;
Choute, Clifford .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2486-2507
[19]  
Feizi Soheil, 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P1048
[20]  
Gu W.-H., 2005, P DAT COMPR C SNOWB