Robustness of End-to-End Detection in Coherent MAC-based Practicable Cooperative Networks

This paper considers a coherent multiple access channel (MAC)-based practicable cooperative wireless network consisting of non-ideal nodes that can be in error with a finite probability. Considering a practicable cooperative wireless network, this work obtains an optimal Neyman-Pearson (NP) criterion-based decoding statistic at the destination. The closed-form expressions of the probabilities of detection, false alarm, and symbol error are derived for the proposed detector, considering all possible network states to characterize the end-to-end detection performance of the practicable wireless network. The obtained probabilities are then averaged over the channel state information (CSI) to obtain the average probabilities. The practicable wireless networks with non-ideal nodes can significantly reduce the detection performance over the Genie/ error-free nodes. The work quantifies this performance difference via. the derived closed-form expressions and demonstrate a concurrence between the simulated and their derived analytical counterparts in the practicable cooperative networks.

Authors

Institutions

Publication Details

Published
2024-12-15
DOI
https://doi.org/10.1109/ants63515.2024.10898680
Primary Topic
Molecular Communication and Nanonetworks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robustness of End-to-End Detection in Coherent MAC-based Practicable Cooperative Networks

Shruti Singh, Adarsh Patel, Anamika Kumari
Molecular Communication and Nanonetworks
article

Robustness of End-to-End Detection in Coherent MAC-based Practicable Cooperative Networks

Shruti Singh, Adarsh Patel, Anamika Kumari
article en

Abstract

This paper considers a coherent multiple access channel (MAC)-based practicable cooperative wireless network consisting of non-ideal nodes that can be in error with a finite probability. Considering a practicable cooperative wireless network, this work obtains an optimal Neyman-Pearson (NP) criterion-based decoding statistic at the destination. The closed-form expressions of the probabilities of detection, false alarm, and symbol error are derived for the proposed detector, considering all possible network states to characterize the end-to-end detection performance of the practicable wireless network. The obtained probabilities are then averaged over the channel state information (CSI) to obtain the average probabilities. The practicable wireless networks with non-ideal nodes can significantly reduce the detection performance over the Genie/ error-free nodes. The work quantifies this performance difference via. the derived closed-form expressions and demonstrate a concurrence between the simulated and their derived analytical counterparts in the practicable cooperative networks.

Indian Institute of Technology Mandi (IN)
Openalex Percentile: Top 75%
Molecular Communication and Nanonetworks
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.

Robustness of End-to-End Detection in Coherent MAC-based Practicable Cooperative Networks — Shruti Singh, Adarsh Patel, et al. · (2024) | TGRS Research Map | TGRS