Related papers: Information Transmission under Random Emission Con…
We consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially…
We investigate how the underlying graph of a network supports a flow between a source node and a destination node and propose to compute the expected number of nodes and links that contribute to transferring items in random graphs. Since…
We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…
We study networks of processes that all execute the same finite state protocol and that communicate through broadcasts. The processes are organized in a graph (a topology) and only the neighbors of a process in this graph can receive its…
Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…
Broadcasting and convergecasting are pivotal services in distributed systems, in particular, in wireless ad-hoc and sensor networks, which are characterized by time- varying communication graphs. We study the question of whether it is…
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of…
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each…
We consider $k$ mobile agents of limited energy that are initially located at vertices of an edge-weighted graph $G$ and have to collectively deliver data from a source vertex $s$ to a target vertex $t$. The data are to be collected by an…
We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in…
We investigate rumor spreading in a generalized Maki-Thompson model with spontaneous stifling, evolving on quasi-transitive networks. Individuals are either ignorants, spreaders, or stiflers; spreaders stop by contact with other spreaders…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…
In this paper we present the distribution of the telegraph meander, a random function obtained by conditioning the telegraph process to stay above the zero level. The reflection principle for finite-velocity random motions allows the law of…
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
We study message transport on a $1-d$ ring of nodes and randomly distributed hubs. Messages are deposited on the network at a constant rate. When the rate at which messages are deposited on the lattice is very high, messages start…