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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/GPP102%2F12%2FP613" target="_blank" >GPP102/12/P613: Predikční algoritmy pro efektivní řízení mobility uživatelů v bezdrátových sítích</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Transactions on Vehicular Technology

ISSN

0018-9545

e-ISSN

—

Svazek periodika

65

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

883-895

Kód UT WoS článku

000370754000032

EID výsledku v databázi Scopus

—