On the Optimal Assisted Rate Allocation in N-Tier Multi-RAT Heterogeneous Networks
Wang, Qiao (2014)
2014
Master's Degree Programme in Information Technology
Tieto- ja sähkötekniikan tiedekunta - Faculty of Computing and Electrical Engineering
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Hyväksymispäivämäärä
2014-10-08
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tty-201409291459
https://urn.fi/URN:NBN:fi:tty-201409291459
Tiivistelmä
Telecommunication industry is facing a brand new era nowadays. As the number of mobile devices increases dramatically, people need to figure out an efficient way to allocate wireless resourses and under this background, the resource allocation in heterogeneous network has drawn much attetion. Heterogeneous network is the network combines large cellular cells with smaller ones by various radio access technologies (RATs). Subscribers or users may be located in random places within the coverage of a heterogeneous network. So how to fairly provide wireless access service for the users is the main subject of resource allocation.
This thesis is to achieve the above objective. More specifically, our research formulated heterogeneous networks resource allocation problem as a network flow problem, where each subscriber is considered as a traffic demand and heterogeneous network performs as a shared link that offers traffic for them. The main method
to realize fairness is through max-min fairness (MMF) criterion and to make the results more convincing, 50 topologies have been established although only 5 of them are chosen for illustration. The algorithm adopted is based on non-blocking test. With these topologies, the author carefully built the mathematical model in
AMPL software, which is the critical implementation tool for this thesis.
After accurate formulation and modeling, the author has concluded that N-tier heterogeneous network resource allocation problem can be efficiently solved by considering it as a network flow problem.
This thesis is to achieve the above objective. More specifically, our research formulated heterogeneous networks resource allocation problem as a network flow problem, where each subscriber is considered as a traffic demand and heterogeneous network performs as a shared link that offers traffic for them. The main method
to realize fairness is through max-min fairness (MMF) criterion and to make the results more convincing, 50 topologies have been established although only 5 of them are chosen for illustration. The algorithm adopted is based on non-blocking test. With these topologies, the author carefully built the mathematical model in
AMPL software, which is the critical implementation tool for this thesis.
After accurate formulation and modeling, the author has concluded that N-tier heterogeneous network resource allocation problem can be efficiently solved by considering it as a network flow problem.