000 | 01035nam a22001457a 4500 | ||
---|---|---|---|
005 | 20240916175619.0 | ||
008 | 150216t xxu||||| |||| 00| 0 eng d | ||
100 |
_aIrum, Saba _92501 |
||
245 | _aSingle-source multi-sink maximum flow problem for a wireless network: single-path and multi-path cases | ||
260 |
_aIslamabad. _bDepartment of Mathematics (Air University Main Campus) _c2014. |
||
300 |
_avi;52p. _eCD |
||
520 | _aIn 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. | ||
526 | _aMS Mathematics | ||
942 |
_2ddc _cSP |
||
999 |
_c14063 _d14063 |