Multi-objective optimization of WLAN associations with improved handover costs
View/Open
06905782_zola.pdf (491,2Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/27579
Document typeArticle
Defense date2014-11-01
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
The deployment of a large number of access points in public areas presents a new paradigm in which a given station may be served by more than one access point at a time. Recently, a network model has been proposed to derive the optimal association strategy for the stations by solving a linear optimization problem. According to that model, a station cannot download data while performing a handover. In this letter, we demonstrate that, even in static conditions (i.e., no mobility and constant load in the cell), an association strategy can force a handover. We thus propose a multi-objective optimization function that maximizes the download rates and minimizes the number of handovers. As a handover implies an extra cost due to necessary signaling to be exchanged, we propose a new handover cost function that takes into account the extra bandwidth. Using the new strategy, the system throughput slightly decreases, and the number of handovers is reduced.
CitationZola, E.; Barcelo, F.; Kassler, A.J. Multi-objective optimization of WLAN associations with improved handover costs. "IEEE communications letters", 01 Novembre 2014, vol. 18, núm. 11, p. 2007-2010.
ISSN1089-7798
Files | Description | Size | Format | View |
---|---|---|---|---|
06905782_zola.pdf![]() | 491,2Kb | Restricted access |