Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Access selection in partially Backhaul-limited multi-operator IEEE 802.11 networks
KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
2006 (English)In: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, Helsinki, 2006Conference paper, Published paper (Refereed)
Abstract [en]

Radio resource management (RRM) across multiple, potentially competing, wireless networks has emerged as a salient feature for future generation system. Besides increased overhead, it will incur more complicated architectures and the question then becomes whether the gains of cooperative RRM (increased throughput, reliability, etc.) can justify these disadvantages. Herein we study potential gains that can be achieved by utilizing sophisticated algorithms in a scenario with two cooperating IEEE 802.11a networks, limited by either the wireless or wired link. Both best-effort (BE) and minimum bitrate (MBR) are treated and throughout the paper we use the rudimentary minimum path-loss (MPL) allocation as reference. Our results indicate that sophisticated access selection methods that besides path-loss, also account for AP load and potential constraints in the wired connection, can increase performance significantly. The maximum gain varies between 30-60% and 100-150% for BE and MBR traffic respectively and is typically obtained when there, on average, is one user per AP. We also studied the case where APs with constrained wired capacity connected (using the MPL criteria) to high-capacity APs in order to reroute traffic. Contrary to the approach in which advanced allocation principles is used, "loose" network integration is sufficient and even though it gave lower gains for BE data, the achievable rates for MBR data could be improved substantially.

Place, publisher, year, edition, pages
Helsinki, 2006.
Keyword [en]
Computer networks, Information management, Integer programming, Knowledge management, Management, Metropolitan area networks, Network architecture, Network protocols, Resource allocation, Standards, Wireless telecommunication systems, (U, V) operator, access selection, Achievable rates, Best-effort (BE), High capacity (Transmission Data Rate), IEEE 802.11 networks, IEEE 802.11a networks, In order, International symposium, maximum gain, Mobile radio communications, Network integration, Path loss (PL), Potential constraints, Radio resource management (RRM), Salient features, Wired connection, Wireless networks
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-25999DOI: 10.1109/PIMRC.2006.254289Scopus ID: 2-s2.0-44949265165ISBN: 1424403294; 9781424403295 (print)OAI: oai:DiVA.org:kth-25999DiVA: diva2:361255
Note
QC 20101108Available from: 2010-11-08 Created: 2010-11-08 Last updated: 2010-11-09Bibliographically approved
In thesis
1. Access selection in multi-system architectures: cooperative and competitive contexts
Open this publication in new window or tab >>Access selection in multi-system architectures: cooperative and competitive contexts
2007 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
Stockholm: KTH, 2007. xv, 180 p.
Series
Trita-ICT-COS, ISSN 1653-6347 ; 0701
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-4286 (URN)
Presentation
2007-03-09, Sal NA2, KTH-Electrum, Isafjordsgatan 28 b v, Kista, 14:00
Opponent
Supervisors
Note
QC 20101109Available from: 2007-02-27 Created: 2007-02-27 Last updated: 2010-11-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949265165&partnerID=40&md5=494ed1fd645a1c2835127c5856b9b346

Search in DiVA

By author/editor
Berg, MiguelHultell, Johan
By organisation
Center for Wireless Systems, Wireless@kth
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf