Computing throughput capacity for realistic wireless multihop networks

Authors:
Patrick Stuedi;Gustavo Alonso
Affiliations:
Federal Institute of Technology (ETH Zurich), Zurich, Switzerland;Federal Institute of Technology (ETH Zurich), Zurich, Switzerland
Venue:
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Year:
2006

Citing 8
Cited 4

Introduction to algorithms

Introduction to algorithms
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Effects of wireless physical layer modeling in mobile ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Models and approximation algorithms for channel assignment in radio networks

Wireless Networks
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Capacity of multi-channel wireless networks: impact of number of channels and interfaces

Proceedings of the 11th annual international conference on Mobile computing and networking
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
The capacity of wireless networks

IEEE Transactions on Information Theory

A fast algorithm for computing minimum routing cost spanning trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Throughput-optimal configuration of fixed wireless networks

IEEE/ACM Transactions on Networking (TON)
Scheduling Constraints and Interference Graph Properties for Graph-based Interference Coordination in Cellular OFDMA Networks

Mobile Networks and Applications
Maximum achievable throughput in a wireless sensor network using in-network computation for statistical functions

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (isotropic radio propagation, unidirectional links, perfect scheduling, perfect routing, etc.) and either provide asymptotic bounds or are based on integer linear programming solvers. In this paper we present a probabilistic approach to capacity calculation by linking the normalized throughput of a communication pair in an ad hoc network to the connection probability of the two nodes in a so called schedule graph GT(N,E). The effective throughput of a random network is modelled as a random variable and expected values of it are computed using Monte-Carlo methods. A schedule graph GT(N,E) for a given network directly emerges from the physical properties of the network, like node distribution, radio propagation or channel assignment. The modularity of the approach allows for capacity analysis under more realistic network models. In the paper throughput capacity is computed for various forms of network configurations and the results are compared to simulation results obtained with ns-2.