The Capacity of Ad hoc Networks under Random Packet Losses
| dc.creator | Mhatre, Vivek P. | |
| dc.creator | Rosenberg, Catherine P. | |
| dc.creator | Mazumdar, Ravi R. | |
| dc.date | 2008-11-21 | |
| dc.date.accessioned | 2026-07-07T10:20:09Z | |
| dc.date.available | 2026-07-07T10:20:09Z | |
| dc.description | We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to Interference and Noise Ratio (SINR) is above a certain threshold, then every transmitted packet is received error-free by the receiver thereby. Using this model, the per node capacity of the network was shown to be $Θ(\frac{1}{\sqrt{n\log{n}}})$. In reality, for any finite link SINR, there is a non-zero probability of erroneous reception of the packet. We show that in a large network, as the packet travels an asymptotically large number of hops from source to destination, the cumulative impact of packet losses over intermediate links results in a per-node throughput of only $O(\frac{1}{n})$. We then propose a new scheduling scheme to counter this effect. The proposed scheme provides tight guarantees on end-to-end packet loss probability, and improves the per-node throughput to $Ω(\frac{1}{\sqrt{n} ({\log{n}})^{\frac{α{+2}}{2(α-2)}}})$ where $α>2$ is the path loss exponent. | |
| dc.description | 12 pages, earlier version in ISIT 2006 | |
| dc.identifier | https://arxiv.org/abs/0811.3585 | |
| dc.identifier | http://arxiv.org/abs/0811.3585 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174758 | |
| dc.subject | Information Theory | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | The Capacity of Ad hoc Networks under Random Packet Losses | |
| dc.type | text |