Single-source multi-sink maximum flow problem for a wireless network: single-path and multi-path cases
Material type:
TextPublication details: Islamabad. Department of Mathematics (Air University Main Campus) 2014.Description: vi;52p. CDSummary: In this thesis, we address the problem of maximizing a Single-Source Multi-Sink network flow for a wireless network. Previous research on maximum flow problems has focused primarily on static network in which link capacities remain constant. We formulate the Single- Source Multi-Sink maximum Flow Problem for realistic , multi-rate radios, time varying link quality and capacity and interference on the wireless channel. For small network size, exact solutions are obtained. We formulate models and solve the problem for Single- Path and Multi-Path cases.
| Item type | Current library | Call number | Status | Barcode | |
|---|---|---|---|---|---|
Thesis
|
Air University Central Library Thesis Repository (5th Floor) Mechanical Engineering | 621 RU MS (Browse shelf(Opens below)) | Available | TH0998 |
In this thesis, we address the problem of maximizing a Single-Source Multi-Sink network flow for a wireless network. Previous research on maximum flow problems has focused primarily on static network in which link capacities remain constant. We formulate the Single- Source Multi-Sink maximum Flow Problem for realistic , multi-rate radios, time varying link quality and capacity and interference on the wireless channel. For small network size, exact solutions are obtained. We formulate models and solve the problem for Single- Path and Multi-Path cases.
MS Mathematics
There are no comments on this title.