B Li, D Niu - Proceedings of the IEEE, 2011 - ieeexplore.ieee.org
With random network coding, network nodes between the source and receivers are able to not only relay and replicate data packets, but also code them using randomly generated …
B Hassanabadi, S Valaee - IEEE transactions on wireless …, 2014 - ieeexplore.ieee.org
Reliable local information dissemination is the primary concern for periodic safety broadcasting in VANETs. We propose a sublayer in the application layer of the WAVE stack …
We study how to spread k tokens of information to every node on an n-node dynamic network, the edges of which are changing at each round. This basic gossip problem can be …
B Haeupler - Proceedings of the forty-third annual ACM symposium …, 2011 - dl.acm.org
We introduce projection analysis-a new technique to analyze the stopping time of gossip protocols that are based on random linear network coding (RLNC). Projection analysis …
B Haeupler, D Karger - Proceedings of the 30th annual ACM SIGACT …, 2011 - dl.acm.org
We use network coding to improve the speed of distributed computation in the dynamic network model of Kuhn, Lynch and Oshman [STOC'10]. In this model an adversary …
K Censor Hillel, H Shachnai - Proceedings of the 29th ACM SIGACT …, 2010 - dl.acm.org
This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be …
X Zhang, G Neglia, J Kurose… - … /ACM Transactions on …, 2012 - ieeexplore.ieee.org
In this paper, we investigate the benefits of applying a form of network coding known as random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs) …
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Random walks are a …
K Censor-Hillel, H Shachnai - SIAM Journal on Computing, 2012 - SIAM
Gathering data from nodes in a network is at the heart of many distributed applications, most notably while performing a global task. We consider information spreading among n nodes …