This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://purl.org/net/nknouf/ns/bibtex#
n12http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F13%3A00213169%21RIV14-GA0-21230___/
n8http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00213169%21RIV14-GA0-21230___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
In this paper, we propose an optimization of Neighbor Cell List (NCL) management algorithm. The goal is to minimize a number of scanned cells for handover purposes while a call drop rate is not increased. To that end, the NCL is dynamically optimized according to the SINR observed by a User Equipment (UE) from its serving cell. If a UE is in the cell center, only the serving cell is scanned. Contrary, if the UE moves closer to the cell edge, also other cells are inserted to the list of scanned cells. The cells are included in the list based on the probability of handover to these cells. The optimization presented in this paper consists in derivation of the optimal value of the parameters that describes a relation between a handover probability threshold for scanning and SINR measured by the UE. First, we provide analytical analysis of the problem and then we confirm the derived optimal values by means of simulations. The results show the proposed optimization of the NCL management is able to reduce the number of scanned cells significantly while the call drops due to NCL can be eliminated. In this paper, we propose an optimization of Neighbor Cell List (NCL) management algorithm. The goal is to minimize a number of scanned cells for handover purposes while a call drop rate is not increased. To that end, the NCL is dynamically optimized according to the SINR observed by a User Equipment (UE) from its serving cell. If a UE is in the cell center, only the serving cell is scanned. Contrary, if the UE moves closer to the cell edge, also other cells are inserted to the list of scanned cells. The cells are included in the list based on the probability of handover to these cells. The optimization presented in this paper consists in derivation of the optimal value of the parameters that describes a relation between a handover probability threshold for scanning and SINR measured by the UE. First, we provide analytical analysis of the problem and then we confirm the derived optimal values by means of simulations. The results show the proposed optimization of the NCL management is able to reduce the number of scanned cells significantly while the call drops due to NCL can be eliminated.
dcterms:title
Optimization of SINR-based Neighbor Cell List for Networks with Small Cells Optimization of SINR-based Neighbor Cell List for Networks with Small Cells
skos:prefLabel
Optimization of SINR-based Neighbor Cell List for Networks with Small Cells Optimization of SINR-based Neighbor Cell List for Networks with Small Cells
skos:notation
RIV/68407700:21230/13:00213169!RIV14-GA0-21230___
n11:predkladatel
n14:orjk%3A21230
n4:aktivita
n18:P
n4:aktivity
P(GPP102/12/P613)
n4:dodaniDat
n7:2014
n4:domaciTvurceVysledku
n16:4588568 n16:2734796 n16:8495939
n4:druhVysledku
n9:D
n4:duvernostUdaju
n21:S
n4:entitaPredkladatele
n22:predkladatel
n4:idSjednocenehoVysledku
94487
n4:idVysledku
RIV/68407700:21230/13:00213169
n4:jazykVysledku
n13:eng
n4:klicovaSlova
neighbor cell list; handover; small cells; optimization; probability
n4:klicoveSlovo
n5:handover n5:small%20cells n5:optimization n5:neighbor%20cell%20list n5:probability
n4:kontrolniKodProRIV
[E4924CC1E74A]
n4:mistoKonaniAkce
London
n4:mistoVydani
Pomona, California
n4:nazevZdroje
IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
n4:obor
n6:JA
n4:pocetDomacichTvurcuVysledku
3
n4:pocetTvurcuVysledku
3
n4:projekt
n10:GPP102%2F12%2FP613
n4:rokUplatneniVysledku
n7:2013
n4:tvurceVysledku
Vondra, Michal Mach, Pavel Bečvář, Zdeněk
n4:typAkce
n19:WRD
n4:zahajeniAkce
2013-09-08+02:00
s:issn
2166-9570
s:numberOfPages
6
n8:doi
10.1109/PIMRC.2013.6666537
n15:hasPublisher
IEEE Communications Society
n12:organizacniJednotka
21230