2022/02/18 by Eugene Perevalov, Rick S. Blum, Perevalov, Eugene +4
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Electrical engineering #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2202.09423
openalex publication_date 2022/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically.