*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Speaker: Asaf Cohen, Ben-Gurion University
Title: Network Coding Based Information Spreading in Dynamic Networks with Correlated Data
Abstract:
In this work, 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.
Speaker Bio:
Asaf Cohen is with the Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Israel. Before that, he was a post-doctoral scholar at the California Institute of Technology (Caltech). He received the B.Sc., M.Sc. (both with high honors) and Ph.D. from the Department of Electrical Engineering, Technion, Israel Institute of Technology, in 2001, 2003 and 2007, respectively. From 1998 to 2000 he was with the IBM Research Laboratory in Haifa where he worked on distributed computing. His areas of interest span a wide spectrum in information theory, learning and coding. In particular: network information theory and network coding; network security; sequential decision making, with applications to detection and estimation; statistical signal processing. Dr. Cohen received several honors and awards, including the Viterbi postdoctoral scholarship, a student paper award at IEEE Israel 2006 and the Dr. Philip Marlin Prize for Computer Engineering, 2000. He served on the program committees of ISIT and VTC.
