About: Dynamic Optimization of Neighbor Cell List for Femtocells     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)

AttributesValues
rdf:type
Description
  • To select appropriate target cell for handover if a user is moving, cells in user's neighborhood must be scanned and their signal quality must be measured by a User Equipment (UE). The cells intended to be scanned are listed in a Neighbor Cell List (NCL). The NCL is defined for each cell in the network and it is distributed to the users. A size of the NCL can be negatively influenced by dense deployment of cells with small radius, such as femtocells. In this paper, we investigate potential reduction of an amount of cells in the NCL to minimize signaling overhead and time required for scanning in networks with femtocells. Contrary to a conventional management of the NCL, we reduce the NCL for each UE individually. The lower number of cells in the UEs' NCL is achieved by consideration of mobility patterns of individual user. To avoid situation when a real target cell is missing in the NCL, we propose a dynamic adaptation of the UE's NCL according to the quality of signal measured by the UE from a serving cell. As the results show, the proposed approach with dynamic threshold significantly reduces amount of scanned cells comparing to competitive algorithms. Simultaneously, the outage probability and call drop rates are still kept at minimum level by our proposal.
  • To select appropriate target cell for handover if a user is moving, cells in user's neighborhood must be scanned and their signal quality must be measured by a User Equipment (UE). The cells intended to be scanned are listed in a Neighbor Cell List (NCL). The NCL is defined for each cell in the network and it is distributed to the users. A size of the NCL can be negatively influenced by dense deployment of cells with small radius, such as femtocells. In this paper, we investigate potential reduction of an amount of cells in the NCL to minimize signaling overhead and time required for scanning in networks with femtocells. Contrary to a conventional management of the NCL, we reduce the NCL for each UE individually. The lower number of cells in the UEs' NCL is achieved by consideration of mobility patterns of individual user. To avoid situation when a real target cell is missing in the NCL, we propose a dynamic adaptation of the UE's NCL according to the quality of signal measured by the UE from a serving cell. As the results show, the proposed approach with dynamic threshold significantly reduces amount of scanned cells comparing to competitive algorithms. Simultaneously, the outage probability and call drop rates are still kept at minimum level by our proposal. (en)
Title
  • Dynamic Optimization of Neighbor Cell List for Femtocells
  • Dynamic Optimization of Neighbor Cell List for Femtocells (en)
skos:prefLabel
  • Dynamic Optimization of Neighbor Cell List for Femtocells
  • Dynamic Optimization of Neighbor Cell List for Femtocells (en)
skos:notation
  • RIV/68407700:21230/13:00213172!RIV14-GA0-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GPP102/12/P613)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 70884
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/13:00213172
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • neighbor cell list; self-optimization; mobility pattern; handover statistics; femtocell (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [E38CE4BC874D]
http://linked.open...v/mistoKonaniAkce
  • Dresden
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • IEEE 77th Vehicular Technology Conference
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bečvář, Zdeněk
  • Mach, Pavel
  • Vondra, Michal
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000331081500149
http://linked.open.../riv/zahajeniAkce
issn
  • 1550-2252
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/VTCSpring.2013.6692526
http://purl.org/ne...btex#hasPublisher
  • IEEE Vehicular Technology 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:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software