We study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.Expand

We provide a systematic study of the problem of finding the source of a rumor in a network with the popular susceptible-infected model and then construct an estimator for the rumor source.Expand

This paper provides a definition of delay in ad hoc networks and obtains optimal throughput-delay trade-off in fixed and mobile wireless networks.Expand

We show that the optimal throughput-delay tradeoff is given by D(n)=Theta(nT(n)), where T(n) and D( n) are the throughput and delay scaling, respectively.Expand

We study distributed asynchronous algorithms, also known as gossip algorithms, for computation and information exchange in an arbitrarily connected network of nodes, and show that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.Expand

We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment.Expand

Crowdsourcing systems, in which tasks are electronically distributed to numerous "information piece-workers", have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image classification, data entry, optical character recognition, and proofreading.Expand

We design an efficient Aloha-like algorithm for a network of queues where contention is modeled through independent-set constraints over the network graph.Expand