The Capacity of Ad hoc Networks under Random Packet Losses

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, earlier version in ISIT 2006

Scientific paper

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 $\Theta(\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 $\Omega(\frac{1}{\sqrt{n} ({\log{n}})^{\frac{\alpha{{+2}}}{2(\alpha-2)}}})$ where $\alpha>2$ is the path loss exponent.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Capacity of Ad hoc Networks under Random Packet Losses does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Capacity of Ad hoc Networks under Random Packet Losses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Capacity of Ad hoc Networks under Random Packet Losses will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-163714

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.