Open AccessImpact of connecting to the n th nearest node in dedicated device‐to‐device communications
Author(s) -
Rajabi S.,
Ghorashi S.A.,
ShahMansouri V.
Publication year - 2018
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2017.3648
Subject(s) - node (physics) , computer network , computer science , channel (broadcasting) , neighbor discovery protocol , base station , transmission (telecommunications) , connection (principal bundle) , k nearest neighbors algorithm , base (topology) , data transmission , topology (electrical circuits) , telecommunications , engineering , mathematics , electrical engineering , the internet , operating system , artificial intelligence , internet protocol suite , mathematical analysis , structural engineering
Device‐to‐device (D2D) communication is a proximity‐based data transmission technique where users communicate directly with each other, when bypassing evolved node base station. The most common assumption in the literature is that every D2D user connects to its nearest node. However, in many situations connection to the first nearest node for a D2D user is not possible due to the channel conditions or user's decline in joining in a D2D connection. The impact of connecting to the n th nearest node in a dedicated D2D enabled network is investigated. The coverage probability and average data rate of a typical D2D link in the network, where users connect to their n th nearest node are studied. The results show that considering the first nearest node is an ideal assumption and investigating the connection to the other farther nodes is of great importance.