All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Distance-Based Neighborhood Scanning for Handover Purposes in Network 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%2F16%3A00227210" target="_blank" >RIV/68407700:21230/16:00227210 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7039282" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7039282</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TVT.2015.2402753" target="_blank" >10.1109/TVT.2015.2402753</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Distance-Based Neighborhood Scanning for Handover Purposes in Network with Small Cells

  • Original language description

    Deployment of small cells into existing mobile networks can improve throughput and users’ quality of service. However, the new tier composed of small cells raises problems related to management of user mobility. Moving users must be able to discover cells in their neighborhood. For this purpose, the users perform neighborhood scanning. The scanning process should be frequent enough to avoid situations where the user is not aware of a close cell that has not been scanned. However, the frequent scanning of a high number of neighboring cells leads to wasting battery power for the user equipment and reducing the throughput of users. On the contrary, rare scanning can lead to a situation where a small cell is missing in the list of scanned cells, and thus, handover is not performed. This results in underutilization of the small cells and consequent overloading of macrocells. In this paper, we propose an efficient scanning algorithm suitable for future mobile networks. The objective of the proposed scheme is to maximize utilization of the small cells and to minimize energy consumption due to scanning. The proposal exploits graph theory to represent a principle of obstructed paths in combination with knowledge of the previously visited cell and the estimated distance between cells. As the results presented in this paper show, our algorithm reduces energy consumption due to scanning and enables higher exploitation of small cells by offloading macrocells.

  • 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

    2016

  • 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

    IEEE Transactions on Vehicular Technology

  • ISSN

    0018-9545

  • e-ISSN

  • Volume of the periodical

    65

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    13

  • Pages from-to

    883-895

  • UT code for WoS article

    000370754000032

  • EID of the result in the Scopus database