• Corpus ID: 11481798

Capacity of Three-Dimensional Erasure Networks

  title={Capacity of Three-Dimensional Erasure Networks},
  author={Cheol Jeong and Won-Yong Shin},
In this paper, we introduce a large-scale three-dimensional (3D) erasure network, where $n$ wireless nodes are randomly distributed in a cuboid of $n^{\lambda}\times n^{\mu}\times n^{\nu}$ with $\lambda+\mu+\nu=1$ for $\lambda,\mu,\nu>0$, and completely characterize its capacity scaling laws. Two fundamental path-loss attenuation models (i.e., exponential and polynomial power-law models) are used to suitably model an erasure probability for packet transmission. Then, under the two erasure… 

Figures from this paper



On Capacity Scaling in Arbitrary Wireless Networks

This paper considers the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement, and proposes a more general novel cooperative communication scheme that works for arbitrarily placed nodes and establishes order optimality of these schemes under adversarial node placement for alpha > 3.

Capacity of wireless erasure networks

The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained and it turns out that the capacity region has a nice max-flow min-cut interpretation.

Capacity Bounds of Three-Dimensional Wireless Ad Hoc Networks

This paper investigates the throughput capacity of 3-D regular ad hoc networks (RANETs) and of3-D nonhomogeneous ad hoc Networks (NANets), respectively, by employing a generalized physical model and finds both lower and upper bounds in both types of networks in a broad power propagation regime.

The Capacity of Wireless Networks in Nonergodic Random Fading

We find the exact per-node capacity scaling in an extended, distributed wireless network where the node locations are random, the channel attenuation between pairs of nodes exhibits independent

A Lower Bound on the Capacity of Wireless Erasure Networks

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 unit area square and it is shown somewhat surprisingly that variability in erasure probabilities increases network capacity.

Capacity of a wireless ad hoc network with infrastructure

This paper considers a one-dimensional network model and a two-dimensional strip model to investigate the impact of network dimensionality and geometry on the capacity of wireless ad hoc networks and finds that different network dimensions lead to significantly different capacity scaling laws.

A Geometry Study on the Capacity of Wireless Networks via Percolation

The whole study shows that geometric symmetry plays a significant role in the percolation and the capacity, thereby shedding a light on the network design and the scheduling, and combining the achievable rate of the former networks to attribute the variance between them to their symmetry discrepancies.

The Capacity of Wireless Ad Hoc Networks Using Directional Antennas

The throughput capacity of random directional networks with multihop relay schemes is studied, and the capacity gain compared to random omnidirectional networks is tighter than previous results, and it is found that without side lobe directional antenna gain, arbitrary directional networks can also scale.

Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that

Capacity and delay tradeoffs for ad hoc mobile networks

The capacity-achieving algorithm is a modified version of the Grossglauser-Tse two-hop relay algorithm and provides O(N) delay, and it is shown that redundancy cannot increase capacity, but can significantly improve delay.