We consider the problem of increasing the availability of shared data in peer-to-peer (P2P) systems so that users can access any content, regardless of the current subset of onlin...
Francisco Matias Cuenca-Acuna, Richard P. Martin, ...
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...