On the capacity of ad hoc networks under random packet losses

  • Authors:

  • Vivek P. Mhatre;Catherine P. Rosenberg;Ravi R. Mazumdar

  • Affiliations:

  • Motorola Inc., Arlington Heights, IL;Department of Electrical and Computer Engineering, University of Waterloo, ON, Canada;Department of Electrical and Computer Engineering, University of Waterloo, ON, Canada

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

  • Modeling CSMA/CA in VANET

    ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications

Quantified Score

Hi-index 754.84

Visualization

Abstract

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 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 Θ(1/√n log n). 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 O(1/n) 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 Ω(1/√n(log n) α+2/2(α-2)) where α 2 is the path loss exponent.