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

Authors:
A. Kherani;R. El-Khoury;R. El-Azouzi;E. Altman
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, India;LIA/CERI, Univesité d'Avignon, Agroparc, BP 1228, 84911 Avignon, France;LIA/CERI, Univesité d'Avignon, Agroparc, BP 1228, 84911 Avignon, France;INRIA, 2004 Route des Lucioles, 06902 Sophia Antipolis Cedex, France
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2008

Citing 9
Cited 1

On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Some game-theoretic problems in wireless ad-hoc networks

NGI'04 Proceedings of the First international conference on Wireless Systems and Mobility in Next Generation Internet
Scheduling and performance limits of networks with constantly changing topology

IEEE Transactions on Information Theory
Stability of N interacting queues in random-access systems

IEEE Transactions on Information Theory
The capacity of wireless networks

IEEE Transactions on Information Theory
The stability region of the finite-user slotted ALOHA protocol

IEEE Transactions on Information Theory
On the stability of interacting queues in a multiple-access system

IEEE Transactions on Information Theory - Part 1
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications

An improved AODV routing protocol for MANETs

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

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 focus on a wireless network with static nodes, such as community wireless networks. Our main result is characterization of stability condition and the end-to-end throughput using the balance rate. We also investigate the impact of routing on end-to-end throughput and stability of intermediate nodes. We show 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 show 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. Numerical results are given and support the results of the analysis. Finally, we perform extensive simulation and verify that the analytical results closely match the results obtained from simulations.