Back to search

National and Kapodistrian University of Athens

Distributed mechanisms for access network selection in heterogeneous wireless environments

Abstract

dc:description

Heterogeneous networks combine multiple radio access technologies (RATs) in the access part of the network. An important challenge introduced by this combination is the selection of the most appropriate RAT to serve every session. There are several approaches to tackle this challenge, like the use of mathematical functions, of fuzzy logic and/or neural networks, and of policy based schemes. This thesis proposes a novel mechanism to take such decisions. It is named UDS, in order to point out the three fundamental design choices incorporated: the mechanism is user (U) centric, it is distributed (D) amongst the user equipment (UE) and the core network, and it treats each session separately (S). The first design choice aims to involve the user to the final decision. The second one tries to have some pre-processing at the UE level, in order to minimise the messaging exchange over the radio interface. The third one involves the more flexible utilisation of the network resources.The main motivation to design the UDS mechanism was to propose a network selection solution that incorporates the user’s preferences into the final decision, without violating the network operator policies. This alone is a challenging task, since the aforementioned targets are often contradictory. At the same time, the mechanism has to be feasible to implement, easily extendable, and having no scalability problems. The outcome is a family of three UDS mechanisms, each forming an evolved version of the previous one.The first one, simple UDS (s‑UDS), has an algorithmic part running at the UE and a second one at the core network. The first part processes all combinations of sessions and RATs involved and it outputs a prioritised list of the RATs that may serve each one session (ongoing or new), according to the user’s preferences. This list is then sent to the core network, triggering the corresponding algorithm running there. This algorithm takes the final decision, combining the prioritised list of the user preferences with the network operator policies. The feasibility of the mechanism is demonstrated via SDL specification and simulation, along with a test-bed implementation. In order to evaluate the performance of the proposed solution, a simulation model was used and the mechanism is compared against a pure load balancing scheme. The simulation results show that the proposed mechanism maximises the users’ satisfaction and at the same time it minimises the messages’ exchange over the radio interface. The price to pay for these performance boosts is the considerable rise of the sessions’ blocking probabilities, when compared to the load balancing scheme.The second mechanism, hybrid UDS (h‑UDS), tries to combine the strong points of the s‑UDS and the load balancing mechanisms. It uses a threshold, so that when the total available resources drop below this, a hybrid load balancing is used. The latter functionality picks the least loaded RAT among the ones proposed in the user priority list. Thus, the final decision never violates the user preferences, while alleviating the session blocking probabilities and keeping the strong points of s‑UDS. The drawback of this mechanism is that the fixed threshold value is dependent on the network parameters, it is not the same in every case, and it is not known beforehand. This means that even when an optimum value of this threshold is selected, it cannot be used in a different case scenario.In order to alleviate the latter disadvantage, an evolved version is proposed, the adaptive UDS (a‑UDS). It comes to eliminate the threshold value problem of the previous case. Instead of a fixed value, this time, the threshold is adaptive to the network conditions and it is not required to be known beforehand. The a‑UDS also keeps all design choices of the aforementioned mechanism, keeping all their strong points. It maximises the users’ satisfaction, it minimises the messaging exchange at the radio interface, and it may keep the blocking probability very close to the load balancing mechanism. This is the final outcome of this thesis: a mechanism for the access network selection with all the aforementioned benefits and the provision for the network operators to fine-tune its functionality according to their policies. At the same time the final decision never violates the users’ preferences. The simulation results presented in this thesis lead to the same conclusion.

Degree

thesis:*
Grantor dc:publisher
National and Kapodistrian University of Athens
Year dc:date
2021

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Modeas, Ioannis
  • Μοδέας, Ιωάννης

Subjects

dc:subject × 16

Rights

dc:rights
Statement dc:rights
  • BY_NC_4_0
Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/49577

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Modeas, Ioannis; Μοδέας, Ιωάννης. Distributed mechanisms for access network selection in heterogeneous wireless environments. National and Kapodistrian University of Athens, 2021. http://hdl.handle.net/10442/hedi/49577