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
Optimization of WLAN associations considering handover costs
Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (DISCO)
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. (DISCO)ORCID iD: 0000-0002-9446-8143
Telekom Innovation Laboratories.
Telekom Innovation Laboratories.
Show others and affiliations
2012 (English)In: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, Vol. 255Article in journal (Refereed) Published
Abstract [en]

In Wireless Local Area Network (WLAN) hotspots the coverage areas of Access Points (APs) often overlap considerably. Current state of the art optimization models find the optimal AP for each user station by balancing the load across the network. Recent studies have shown that in typical commercial WLAN hotspots the median connection duration is short. In such dynamic network settings the mentioned optimization models might cause many handovers between APs to accommodate for user arrivals or mobility. We introduce a new mixed integer linear optimization problem that allows to optimize handovers but takes into account the costs of handovers such as signaling and communication interruption. Using our model and extensive numeric simulations we show that disregarding the handover costs leads to low performance. Based on this insight we design a new optimization scheme that uses estimates of future station arrivals and mobility patterns. We show that our scheme outperforms current optimization mechanisms and is robust against estimation errors

Place, publisher, year, edition, pages
Springer , 2012. Vol. 255
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kau:diva-16125DOI: 10.1186/1687-1499-2012-255ISI: 000314030600001OAI: oai:DiVA.org:kau-16125DiVA: diva2:575701
Available from: 2012-12-11 Created: 2012-12-11 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Dely, PeterKassler, Andreas

Search in DiVA

By author/editor
Dely, PeterKassler, Andreas
By organisation
Centre for HumanITDepartment of Computer Science
In the same journal
EURASIP Journal on Wireless Communications and Networking
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 317 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