Show simple item record

dc.contributor.authorPeraki, Christina
dc.date.accessioned2005-05-09T11:48:56Z
dc.date.available2005-05-09T11:48:56Z
dc.date.issued2005-05-09T11:48:56Z
dc.identifier.citationOn the Maximum Stable Throughput Problem in Random Networks with Directional Antennasen_US
dc.identifier.otherbibid: 6475998
dc.identifier.urihttps://hdl.handle.net/1813/1168
dc.descriptionSergio D. Servetto, Eva Tardosen_US
dc.description.abstractThe 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.en_US
dc.description.sponsorshipNational Science Foundationen_US
dc.format.extent385528 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherACM MobiHocen_US
dc.subjectthroughputen_US
dc.subjectflowsen_US
dc.subjectstabilityen_US
dc.subjectmulticommodityen_US
dc.subjectnetworksen_US
dc.subjectwirelessen_US
dc.subjectdirectionalen_US
dc.subjectantennasen_US
dc.subjectcapacityen_US
dc.titleThroughput Stability and Flows in Large-Scale Random Networksen_US
dc.typedissertation or thesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics