Analytical Evaluation of D2D Connectivity Potential in 5G Wireless Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F16%3APU120366" target="_blank" >RIV/00216305:26220/16:PU120366 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-46301-8_33" target="_blank" >http://dx.doi.org/10.1007/978-3-319-46301-8_33</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-46301-8_33" target="_blank" >10.1007/978-3-319-46301-8_33</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Analytical Evaluation of D2D Connectivity Potential in 5G Wireless Systems

Popis výsledku v původním jazyce

Constantly growing number of wireless devices leads to the increasing complexity of maintenance and requirements of mobile access services. Following this, the paper discusses perspectives, challenges and services of 5th generation wireless systems, as well as direct device-to-device communication technology, which can provide energy efficient, high throughput and low latency transmission services between end-users. Due to these expected benefits, the part of network traffic between mobile terminals can be transmitted directly between the terminals via established D2D connection without utilizing an infrastructure link. In order to analyse how frequently can be such direct connectivity implemented, it is important to estimate the probability of D2D communication for arbitrary pair of mobile nodes. In this paper, we present the results of the network modelling when the random graph model is used. The model was implemented as a simulation program in C# which generates random graph with a given number of vertexes and creates the minimal spanning tree (mst) by using the Prime’s algorithm. All our result and practical findings are summarized at the end of this manuscript.

Název v anglickém jazyce

Analytical Evaluation of D2D Connectivity Potential in 5G Wireless Systems

Popis výsledku anglicky

Constantly growing number of wireless devices leads to the increasing complexity of maintenance and requirements of mobile access services. Following this, the paper discusses perspectives, challenges and services of 5th generation wireless systems, as well as direct device-to-device communication technology, which can provide energy efficient, high throughput and low latency transmission services between end-users. Due to these expected benefits, the part of network traffic between mobile terminals can be transmitted directly between the terminals via established D2D connection without utilizing an infrastructure link. In order to analyse how frequently can be such direct connectivity implemented, it is important to estimate the probability of D2D communication for arbitrary pair of mobile nodes. In this paper, we present the results of the network modelling when the random graph model is used. The model was implemented as a simulation program in C# which generates random graph with a given number of vertexes and creates the minimal spanning tree (mst) by using the Prime’s algorithm. All our result and practical findings are summarized at the end of this manuscript.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

<a href="/cs/project/LO1401" target="_blank" >LO1401: Interdisciplinární výzkum bezdrátových technologií</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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 statě ve sborníku

Internet of Things, Smart Spaces, and Next Generation Networks and Systems

ISBN

978-3-319-46300-1

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

395-403

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

St. Petersburg

Datum konání akce

26. 9. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000389503600033