z-logo
open-access-imgOpen Access
Multi‐user two‐way relaying in the presence of co‐channel interference
Author(s) -
Ozduran Volkan,
SoleimaniNasab Ehsan
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0170
Subject(s) - computer science , relay , interference (communication) , channel (broadcasting) , transmission (telecommunications) , selection (genetic algorithm) , single antenna interference cancellation , coding (social sciences) , computer network , monte carlo method , wireless , co channel interference , diversity gain , telecommunications , topology (electrical circuits) , fading , mathematics , physics , statistics , electrical engineering , engineering , power (physics) , quantum mechanics , artificial intelligence
This study investigates the impact of co‐channel interference caused by external terminals on multi‐user bi‐directional amplify‐and‐forward based wireless relaying network. The investigation considers multi‐user pair and a single bi‐directional relay terminal and a finite number of co‐channel interference in the system model. A lower bound on the end‐to‐end outage probability is derived for the simultaneous transmission and the opportunistic source‐pair selection strategy. According to analytical, asymptotic, and Monte‐Carlo based computer simulation results, the opportunistic source‐pair selection strategy achieves a near‐optimal performance for the inter‐cell interference caused by other user‐pairs within the system. Results also show that the opportunistic source‐pair selection strategy also achieves optimal diversity order, which is equal to N , in high signal‐to‐noise ratio regimes. Results also show that the co‐channel interference degrades the achievable diversity order from N to 0 while also affecting the system coding gain.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here