A probabilistic analysis for the range assignment problem in ad hoc networks

  • Authors:
  • Paolo Santi;Douglas M. Blough;Feodor Vainstein

  • Affiliations:
  • Istituto di Matematica Computazionale, Area della Ricerca del CNR, Via G. Moruzzi 1, 56124 Pisa - ITALY;School of ECE, Georgia Inst. of Technology, Atlanta GA;School of ECE, Georgia Inst. of Technology, 6001 Chatham Center Dr., Savannah GA

  • Venue:
  • MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.06

Visualization

Abstract

In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1≤d≤3, and assume that all the nodes have the same transmitting range r; how large must r be to ensure that the resulting network is strongly connected? We study this problem by means of a probabilistic approach, and we establish lower and upper bounds on the probability of connectedness. For the one-dimensional case, these bounds allow us to determine a suitable magnitude of r for a given number of nodes and displacement region size. In an alternate formulation, the bounds allow us to calculate how many nodes must be distributed should the transmitting range be fixed. Finally, we investigate the required magnitude of r in the two- and three-dimensional cases through simulation. Based on the bounds provided and on the simulation analysis, we conclude that, as compared to the deterministic case, a probabilistic solution to this range assignment problem achieves substantial energy savings. A number of other potential uses for our analyses are discussed as well