About: Optimization of SINR-based Neighbor Cell List for Networks with Small Cells

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Optimization of SINR-based Neighbor Cell List for Networks with Small Cells Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/68407700:21230/13:00213169!RIV14-GA0-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GPP102/12/P613)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Bečvář, Zdeněk Mach, Pavel Vondra, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	94487
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00213169
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	neighbor cell list; handover; small cells; optimization; probability (en)
http://linked.open.../riv/klicoveSlovo	optimization probability small cells handover neighbor cell list
http://linked.open...ontrolniKodProRIV	[E4924CC1E74A]
http://linked.open...v/mistoKonaniAkce	London
http://linked.open...i/riv/mistoVydani	Pomona, California
http://linked.open...i/riv/nazevZdroje	IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
http://linked.open...in/vavai/riv/obor	JA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Prediction Algorithms for Efficient Mobility Management in Wireless Networks
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Bečvář, Zdeněk Mach, Pavel Vondra, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-09-08 (xsd:date)
issn	2166-9570
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/PIMRC.2013.6666537
http://purl.org/ne...btex#hasPublisher	IEEE Communications Society
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 32 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software