Self-optimizing Neighbor Cell List with Dynamic Threshold for Handover Purposes in Networks with Small Cells
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00223194" target="_blank" >RIV/68407700:21230/15:00223194 - isvavai.cz</a>
Result on the web
<a href="http://onlinelibrary.wiley.com/doi/10.1002/wcm.2456/epdf" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1002/wcm.2456/epdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/wcm.2456" target="_blank" >10.1002/wcm.2456</a>
Alternative languages
Result language
angličtina
Original language name
Self-optimizing Neighbor Cell List with Dynamic Threshold for Handover Purposes in Networks with Small Cells
Original language description
To select a proper target cell for handover of mobile users, signal level of cells in user's neighborhood is scanned by a user equipment (UE). Cells assumed to be scanned are included in the so-called neighbor cell list (NCL). Conventionally, the NCL ismanaged according to the probability of handover of users to a target cell with fixed threshold. Nevertheless, the size of NCL could be significant if this approach is applied to networks with small cells. In this paper, we exploit knowledge of handoverprobability among cells derived from a handover history to reduce the amount of scanned cells. We introduce dynamic adaptation of the amount of cells to be scanned according to the quality of signal of a serving cell, measured by the UE. We also investigate impact of relation between the handover probability and the signal level to maximize efficiency of this approach. Further, the NCL management considering either summarized handover history of all UE or individual history of each user
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GPP102%2F12%2FP613" target="_blank" >GPP102/12/P613: Prediction Algorithms for Efficient Mobility Management in Wireless Networks</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Wireless Communications and Mobile Computing
ISSN
1530-8669
e-ISSN
—
Volume of the periodical
15
Issue of the periodical within the volume
13
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
1729-1743
UT code for WoS article
000359808700004
EID of the result in the Scopus database
2-s2.0-84939464600