Back to search

ACM MobiHoc

Throughput Stability and Flows in Large-Scale Random Networks

Abstract

dc:description.abstract

The rate of growth of the maximum stable throughput in large-scale random networks as a function of network size is studied in this thesis. The problem is formulated as one of determining the value of the maximum multicommodity flow on the corresponding random unit-disk graph and shown to be equivalent. In this way, using simple flow techniques and probability tools, a tight bound is derived on the rate of growth of the maximum stable throughput with a fairness constraint. As an application of these techniques, similar bounds are computed for different cases of highly dense wireless networks when directional antennas are being used and the results are compared to the omnidirectional case.

Degree

thesis:*
Grantor dc:publisher
ACM MobiHoc
Year dc:date.issued
2005

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Peraki, Christina

Subjects

dc:subject × 9

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
6475998
Dc Identifier Citation
On the Maximum Stable Throughput Problem in Random Networks with Directional Antennas

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Peraki, Christina. Throughput Stability and Flows in Large-Scale Random Networks. ACM MobiHoc, 2005. https://hdl.handle.net/1813/1168