Αλγόριθμοι πρόσδεσης κινητών τερματικών σε συνεργατικά δίκτυα αναμετάδοσης

Σιβίλογλου, Ολυμπία Χ.

Algorithms in mobile stations association in cooperative relay networks

Master Thesis

Author

Σιβίλογλου, Ολυμπία Χ.

Date

2014-07-09

Abstract

The scope of this thesis is the investigation of algorithms that associate mobile stations to the telecommunication nodes in a cooperative relay network. Our system consists of a single base station, a number of relay nodes at the cell edge and a number of mobile stations uniformly distributed in the cell area. The search of the optimal solution that associates the mobile stations to the most appropriate node in a cooperative relay network is a NP Hard problem. We propose a heuristic cooperative algorithm to determine how the mobile stations should associate to the base station or relay nodes and compare it against three other conventional algorithms. The cooperative algorithm associates mobile stations with the node that consumes the least radio resources. The first conventional algorithm associate mobile stations with nodes that consume the least power, while the second conventional algorithm associates mobile stations with nodes that consume the most power. The third conventional algorithm associates mobile stations with nodes in a random manner. We compare the proposer cooperative algorithm against the other three conventional in terms of blocking probability and resource usage for different number of relay nodes and for different distances between the base station and the relay nodes. The simulation results show that cooperative algorithm behaves overall better than the other three algorithm.