Stability-Throughput tradeoff and routing in multi-hop wireless ad-hoc networks

  • Authors:
  • Arzad Alam Kherani;Rachid El Azouzi;Eitan Altman

  • Affiliations:
  • Department of computer science and engineering, Indian Institute of technology Delhi, New Delhi, India;LIA/CERI, Univesité d’Avignon, Avignon, France;NRIA, Sophia Antipolis, France

  • Venue:
  • NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the throughput of multi-hop routes and stability of forwarding queues in a wireless Ad-Hoc network with random access channel. We focuse on wireless with stationary nodes, such as community wireless networks. Our main result is charactrerization of stability condition and the end-to-end throughput using the balance. We also investigate the impact of routing on end-to-end throughput and stability of intermediate nodes. We find that i) as long as the intermediate queues in the network are stable, the end-to-end throughput of a connection does not depend on the load on the intermediate nodes, ii) we showed that if the weight of a link originating from a node is set to the number of neighbors of this node, then shortest path routing maximizes the minimum probability of end-to-end packet delivery in a network of weighted fair queues with coupled servers. Numerical results are given and support the results of the analysis.