Beyond Nearest-Neighbor Connections in Device-to-Device Cellular Networks

Device-to-device (D2D) communication enhances network efficiency by enabling direct, low-latency links between nearby users or devices. While most existing research assumes that D2D connections occur with the nearest neighbor, this assumption often fails in real-world scenarios—such as dense indoor environments, smart buildings, and industrial IoT deployments—due to factors like channel variability, physical obstructions, or limited user participation. In this paper, we investigate the performance implications of connecting to the n-th nearest neighbor in a cellular network supporting underlay D2D communication. Using a stochastic geometry framework, we derive and analyze key performance metrics, including the coverage probability and average data rate, for both D2D and cellular links under proximity-aware connection strategies. Our results reveal that non-nearest-neighbor associations are not only common but sometimes necessary for maintaining reliable connectivity in highly dense or constrained spaces. These findings are directly relevant to IoT-enhanced localization systems, where fallback mechanisms and adaptive pairing are essential for communication resilience. This work contributes to the development of proximity-aware and spatially adaptive D2D frameworks for next-generation smart environments and 5G-and-beyond wireless networks.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2025-08-22
DOI
https://doi.org/10.3390/electronics14173344
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Beyond Nearest-Neighbor Connections in Device-to-Device Cellular Networks

Reza Shahbazian, Seyed Ali Ghorashi, Siavash Rajabi
Electronics
Advanced MIMO Systems Optimization
article

Beyond Nearest-Neighbor Connections in Device-to-Device Cellular Networks

Reza Shahbazian, Seyed Ali Ghorashi, Siavash Rajabi
article en

Abstract

Device-to-device (D2D) communication enhances network efficiency by enabling direct, low-latency links between nearby users or devices. While most existing research assumes that D2D connections occur with the nearest neighbor, this assumption often fails in real-world scenarios—such as dense indoor environments, smart buildings, and industrial IoT deployments—due to factors like channel variability, physical obstructions, or limited user participation. In this paper, we investigate the performance implications of connecting to the n-th nearest neighbor in a cellular network supporting underlay D2D communication. Using a stochastic geometry framework, we derive and analyze key performance metrics, including the coverage probability and average data rate, for both D2D and cellular links under proximity-aware connection strategies. Our results reveal that non-nearest-neighbor associations are not only common but sometimes necessary for maintaining reliable connectivity in highly dense or constrained spaces. These findings are directly relevant to IoT-enhanced localization systems, where fallback mechanisms and adaptive pairing are essential for communication resilience. This work contributes to the development of proximity-aware and spatially adaptive D2D frameworks for next-generation smart environments and 5G-and-beyond wireless networks.

ElectronicsVol. 14(17)
University of East London (GB), Hamedan University of Technology (IR), University of Palermo (IT)
Openalex Percentile: Top 80%
Advanced MIMO Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.