A Theory of Routing for Large-Scale Wireless Ad-Hoc Networks
Antonio J. Caama\~no, Juan J. Vinagre, Mark Wilby, Javier Ramos

TL;DR
This paper develops a theoretical framework using path integrals to analyze routing strategies in large-scale wireless ad-hoc networks, deriving path length distributions and capacity scaling laws.
Contribution
It introduces the effective radius as a key parameter to evaluate routing strategies and demonstrates their asymptotic behavior and capacity scaling in large networks.
Findings
Distribution of path lengths for various routing strategies
Identification of 'good' routing strategies based on effective radius
Finite effective radius strategies have capacity scaling as Θ(√N)
Abstract
In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these kinds of networks. Using this theoretical framework, we calculate the statistical distribution of the distances between any source to any destination in the network, hence we are able to deduce a length parameter that is unique for each routing strategy. This parameter, defined as the {\it effective radius}, effectively encodes the routing information required by a node. Analysing the aforementioned statistical distribution for different routing strategies, we obtain a threefold result for practical Large-Scale Wireless Ad-Hoc Networks: 1) We obtain the distribution of the lengths of all the paths in a network for any given routing strategy, 2) We are…
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
TopicsMobile Ad Hoc Networks · Energy Efficient Wireless Sensor Networks · Wireless Networks and Protocols
