Information-theoretic Capacity of Clustered Random Networks

2010/06/08 by Michele Garetto, Garetto, Michele, Alessandro Nordio +5
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1006.1592

openalex publication_date 2010/06/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.

Citations

• The capacity of wireless networks

Related

• Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell
• Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
• General Capacity for Deterministic Dissemination in Wireless Ad Hoc Networks
• The Capacity of Random Ad hoc Networks under a Realistic Link Layer Model
• The Capacity of Ad hoc Networks under Random Packet Losses