Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime

Simple item page
dc.creatorAeron, Shuchin
dc.creatorSaligrama, Venkatesh
dc.date2006-08-23
dc.date.accessioned2026-07-07T08:16:42Z
dc.date.available2026-07-07T08:16:42Z
dc.descriptionThis paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $ρ(n)$ of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations pairs operating in isolation. For fixed SNR networks, i.e., where the worst case SNR over the source-destination pairs is fixed independent of $n$, we show that collaborative strategies yield a scaling law of $ρ(n) = {\cal O}(\frac{1}{n^{1/3}})$ in contrast to multi-hop strategies which yield a scaling law of $ρ(n) = {\cal O}(\frac{1}{\sqrt{n}})$. While, networks where worst case SNR goes to zero, do not preclude the possibility of collaboration, multi-hop strategies achieve optimal throughput. The plausible reason is that the gains due to collaboration cannot offset the effect of vanishing receive SNR. This suggests that for fixed SNR networks, a network designer should look for network protocols that exploit collaboration. The fact that most current networks operate in a fixed SNR interference limited environment provides further motivation for considering this regime.
dc.description26 pages single column, submitted to Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0608089
dc.identifierhttp://arxiv.org/abs/cs/0608089
dc.identifierIEEE Transactions on Information Theory, Volume 53, No. 6, June 2007, pp. 2044-2059
dc.identifierdoi:10.1109/TIT.2007.896858
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133871
dc.subjectInformation Theory
dc.titleWireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime
dc.typetext

Files

Collections

arXiv