In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived
in closed form in the case where n nodes are uniformly and independently distributed in the …

This paper determines the unicast capacity of a class of erasure networks which incorporate
receiver interference. The networks under consideration are conglomerations of multiple …

In this paper, a special class of wireless networks, called wireless erasure networks, is
considered. In these networks, each node is connected to a set of nodes by possibly …

The transport capacity of a class of erasure networks with broadcast and interference
constraints is studied in this paper. A memoryless network model is considered, with …

We determine the capacity of a certain class of wireless erasure relay networks. We first find
a suitable definition for the" cut-capacity" of erasure networks with broadcast at transmission …

In this paper, we consider a special class of wireless networks, called wireless erasure
networks. In these networks, each node is connected to a set of nodes by independent …

A capacity scaling law is studied for a hybrid erasure network where a number of wireless
nodes and infrastructure nodes, or equivalently base stations, exist. A polynomial decay …

This paper determines upper and lower bounds on the order behavior (as the number of
nodes increases) of throughput in an erasure network with transmit and receive-side …

We have investigated, in various multiple senses, the" capacity" of several models of erasure
networks. The defining characteristic of a memoryless erasure network is that each channel …

Prcviously in 111 we used crasurc networks to modcl ad-hoc nctworks and cxplorcd the
capacity relationship between a network with erasures and its underlying network without …