Related papers: On Capacity Scaling in Arbitrary Wireless Networks

Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of $\Theta(1)$ is achievable. El Gamal,…

In this paper we consider routing in random wireless-adhoc-networks (WANETs), where each node is equipped with a single antenna. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication…

We consider a wireless distributed computing system, in which multiple mobile users, connected wirelessly through an access point, collaborate to perform a computation task. In particular, users communicate with each other via the access…

In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low…

Coded caching has been shown to result in significant throughput gains, but its gains were proved only by assuming a placement phase with no transmission cost. A free placement phase is, however, an unrealistic assumption that could stand…

Our work is motivated by the need for impromptu (or "as-you-go") deployment of relay nodes (for establishing a packet communication path with a control centre) by fire-men/commandos while operating in an unknown environment. We consider a…

Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by Avestimehr et al. has approximated the capacity of this network up to an additive…

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…

A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of…

This paper studies spatial capacity in a stochastic wireless ad hoc network, where multi-stage probing and data transmission are sequentially performed. We propose a novel signal-to-interference-ratio (SIR) threshold based scheduling…

In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…

With the increasing number of user equipment (UE) and data demands, denser access points (APs) are being employed. Resource allocation problems have been extensively researched with interference treated as noise. It is well understood that…

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

This paper considers the problem of finding an optimal order for entanglement swapping in a heterogeneous path of quantum repeaters so as to maximize the path throughput defined as the delivery rate of end-to-end entanglements. The primary…

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…

Developing an efficient spectrum access policy enables cognitive radios to dramatically increase spectrum utilization while ensuring predetermined quality of service levels for primary users. In this paper, modeling, performance analysis,…

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…

Stochastic orders are binary relations defined on probability distributions which capture intuitive notions like being larger or being more variable. This paper introduces stochastic ordering of interference distributions in large-scale…

We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in…

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson…