On conditions for constant throughput in wireless networks

  • Authors:
  • Christina Fragouli;Tarik Tabet

  • Affiliations:
  • Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

  • Venue:
  • ACM Transactions on Sensor Networks (TOSN)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we propose a set of necessary and sufficient conditions under which the long-term averaged throughput in an ad hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by Θ(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, which does not represent the actual physical network but rather the available communication resources. This graph also allows one to translate the problem of maximizing the throughput in ad hoc networks to the multicommodity flow problem and directly apply related results.