Access selection in multi-system architectures : cooperative and competitive contexts

Future wireless networks will be composed of multiple radio access technologies (RATs). To benefit from these, users must utilize the appropriate RAT, and access points (APs). In this thesis we evaluate the efficiency of selection criteria that, in addition to path-loss and system bandwidth, also co...

Full description

Bibliographic Details
Main Author: Hultell, Johan
Format: Others
Language:English
Published: KTH, Kommunikationssystem, CoS 2007
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4286
id ndltd-UPSALLA1-oai-DiVA.org-kth-4286
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-kth-42862013-01-08T13:10:34ZAccess selection in multi-system architectures : cooperative and competitive contextsengHultell, JohanKTH, Kommunikationssystem, CoSStockholm : KTH2007TelecommunicationTelekommunikationFuture wireless networks will be composed of multiple radio access technologies (RATs). To benefit from these, users must utilize the appropriate RAT, and access points (APs). In this thesis we evaluate the efficiency of selection criteria that, in addition to path-loss and system bandwidth, also consider load. The problem is studied for closed as well as open systems. In the former both terminals and infrastructure are controlled by a single actor (e.g., mobile operator), while the latter refers to situations where terminals, selfishly, decide which AP it wants to use (as in a common market-place). We divide the overall problem into the prioritization between available RATs and, within a RAT, between the APs. The results from our studies suggest that data users, in general, should be served by the RAT offering highest peak data rate. As this can be estimated by terminals, the benefits from centralized RAT selection is limited. Within a subsystem, however, load-sensitive AP selection criteria can increase data-rates. Highest gains are obtained when the subsystem is noise-limited, deployment unplanned, and the relative difference in number of users per AP significant. Under these circumstances the maximum supported load can be increased by an order of magnitude. However, also decentralized AP selection, where greedy autonomous terminal-based agents are in charge of the selection, were shown to give these gains as long they accounted for load. We also developed a game-theoretic framework, where users competed for wireless resources by bidding in a proportionally fair divisible auction. The framework was applied to a scenario where revenue-seeking APs competed for traffic by selecting an appropriate price. Compared to when APs cooperated, modelled by the Nash bargaining solution, our results suggest that a competitive access market, where infrastructure is shared implicitly, generally, offers users better service at a lower cost. Although AP revenues reduce, this reduction is, relatively, small and were shown to decrease with the concavity of demand. Lastly we studied whether data services could be offered in a discontinuous high-capacity network by letting a terminal-based agent pre-fetch information that its user potentially may request at some future time-instant. This decouples the period where the information is transferred, from the time-instant when it is consumed. Our results show that above some critical AP density, considerably lower than that required for continuous coverage, services start to perform well. QC 20101109Licentiate thesis, comprehensive summaryinfo:eu-repo/semantics/masterThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4286Trita-ICT-COS, 1653-6347 ; 0701application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
topic Telecommunication
Telekommunikation
spellingShingle Telecommunication
Telekommunikation
Hultell, Johan
Access selection in multi-system architectures : cooperative and competitive contexts
description Future wireless networks will be composed of multiple radio access technologies (RATs). To benefit from these, users must utilize the appropriate RAT, and access points (APs). In this thesis we evaluate the efficiency of selection criteria that, in addition to path-loss and system bandwidth, also consider load. The problem is studied for closed as well as open systems. In the former both terminals and infrastructure are controlled by a single actor (e.g., mobile operator), while the latter refers to situations where terminals, selfishly, decide which AP it wants to use (as in a common market-place). We divide the overall problem into the prioritization between available RATs and, within a RAT, between the APs. The results from our studies suggest that data users, in general, should be served by the RAT offering highest peak data rate. As this can be estimated by terminals, the benefits from centralized RAT selection is limited. Within a subsystem, however, load-sensitive AP selection criteria can increase data-rates. Highest gains are obtained when the subsystem is noise-limited, deployment unplanned, and the relative difference in number of users per AP significant. Under these circumstances the maximum supported load can be increased by an order of magnitude. However, also decentralized AP selection, where greedy autonomous terminal-based agents are in charge of the selection, were shown to give these gains as long they accounted for load. We also developed a game-theoretic framework, where users competed for wireless resources by bidding in a proportionally fair divisible auction. The framework was applied to a scenario where revenue-seeking APs competed for traffic by selecting an appropriate price. Compared to when APs cooperated, modelled by the Nash bargaining solution, our results suggest that a competitive access market, where infrastructure is shared implicitly, generally, offers users better service at a lower cost. Although AP revenues reduce, this reduction is, relatively, small and were shown to decrease with the concavity of demand. Lastly we studied whether data services could be offered in a discontinuous high-capacity network by letting a terminal-based agent pre-fetch information that its user potentially may request at some future time-instant. This decouples the period where the information is transferred, from the time-instant when it is consumed. Our results show that above some critical AP density, considerably lower than that required for continuous coverage, services start to perform well. === QC 20101109
author Hultell, Johan
author_facet Hultell, Johan
author_sort Hultell, Johan
title Access selection in multi-system architectures : cooperative and competitive contexts
title_short Access selection in multi-system architectures : cooperative and competitive contexts
title_full Access selection in multi-system architectures : cooperative and competitive contexts
title_fullStr Access selection in multi-system architectures : cooperative and competitive contexts
title_full_unstemmed Access selection in multi-system architectures : cooperative and competitive contexts
title_sort access selection in multi-system architectures : cooperative and competitive contexts
publisher KTH, Kommunikationssystem, CoS
publishDate 2007
url http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4286
work_keys_str_mv AT hultelljohan accessselectioninmultisystemarchitecturescooperativeandcompetitivecontexts
_version_ 1716511070061854720