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
On Selfish Distributed Access Selection Algorithms in 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 VTS VEH TECHNOL CONF, 2006, 1097-1102 p.Conference paper, Published paper (Refereed)
Abstract [en]

An important question for future wireless networks is whether the prioritization between different accesses should be controlled by the networks or terminals. Herein we evaluate the performance of distributed access-selection algorithms where terminals are responsible for both AP selection and the necessary measurements. In particular, we focus on determining whether selfish distributed algorithms call perform as well as centralized ones (for comparison we include max-sum, max-min, proportional fair and minimum delay allocations). The study is conducted by time-dynamic simulations in a IEEE 802.11a network and its performance measures we use file transfer delay and supportable load at a maximum tolerable delay. Our results show that selfish algorithms can offer similar performance. both in terms of throughput and fairness, as the centralized schemes as long as they account for both path-loss and access point load. This is an important result and it suggests that terminal-controlled algorithms are Just as efficient as centralized schemes, which besides extensive measurements also require that AP exchange information, for improving the efficiency in WLAN networks. Compared with a minimum path-loss selection criteria, which is standard in the IEEE 802.11 family today, our distributed load-aware algorithm increases the maximum supportable load with more than 200 percent even after accounting for measurement time and estimation errors. With fast reselection during ongoing sessions the gains call be further increased with, typically, 20 percent.

Place, publisher, year, edition, pages
2006. 1097-1102 p.
Series
IEEE VTS Vehicular Technology Conference Proceedings, ISSN 1090-3038
Keyword [en]
Algorithms, Delay circuits, Distributed computer systems, Error analysis, Information retrieval systems, Motion planning
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-26000DOI: 10.1109/VTCF.2006.236ISI: 000260569400222Scopus ID: 2-s2.0-34548861524ISBN: 978-1-4244-0062-1 (print)OAI: oai:DiVA.org:kth-26000DiVA: diva2:361257
Conference
64th IEEE Vehicular Technology Conference Montreal, CANADA, SEP 25-28, 2006
Note
QC 20101108Available from: 2010-11-08 Created: 2010-11-08 Last updated: 2011-10-10Bibliographically 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 textScopus

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: 67 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