SCIENCE@home

On the Capacity of Ad Hoc Networks Under Random Packet Losses

Vivek P. Mhatre,C. Rosenberg,R. Mazumdar

Published 2008 in IEEE Transactions on Information Theory

ABSTRACT

We consider the problem of determining asymptotic bounds on the capacity of a random <i>ad</i> <i>hoc</i> 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 the transmitted packet is received error-free by the receiver thereby. Using this model, the per node capacity of the network was shown to be Theta(<sub>radic(n</sub> <sub>log</sub> <sub>n)</sub>/<sup>1</sup>). In reality, for any finite link SINR, there is a nonzero 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 <i>O</i>(<sub>radic(n)</sub>/<sup>1</sup>) under the previously proposed routing and scheduling strategy. 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 Omega(<sub>radic(n)(log</sub> <sub>n)</sub>/<sup>1</sup>2<sub>(alpha-2)</sub>/<sup>alpha+2</sup>) where <i>alpha</i> <i>></i> <i>2</i> is the path loss exponent.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-21 of 21 references · Page 1 of 1

CITED BY

Showing 1-24 of 24 citing papers · Page 1 of 1