Capacity of Three-Dimensional Erasure Networks
Cheol Jeong, Won-Yong Shin

TL;DR
This paper characterizes the capacity scaling laws of large-scale 3D erasure networks, showing that 3D space allows higher throughput than 2D due to increased geographic diversity and percolation highways.
Contribution
It introduces a 3D erasure network model, analyzes its capacity scaling laws, and proposes a routing protocol that achieves near-optimal throughput scaling.
Findings
Achieves throughput scaling of n^{min{1-λ,1-μ,1-ν}} in 3D networks.
Demonstrates 3D networks can achieve n^{2/3} throughput, outperforming 2D networks.
Provides cut-set bounds confirming the order-optimality of the proposed scheme.
Abstract
In this paper, we introduce a large-scale three-dimensional (3D) erasure network, where wireless nodes are randomly distributed in a cuboid of with for , 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 models, we introduce a routing protocol using percolation highway in 3D space, and then analyze its achievable throughput scaling laws. It is shown that, under the two erasure models, the aggregate throughput scaling can be achieved in the 3D erasure network. This implies that the aggregate throughput scaling can be achieved in 3D cubic erasure networks…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Mobile Ad Hoc Networks · Advanced MIMO Systems Optimization
