Relay-orchestrated dual-hop ternary noise-domain NOMA for low-complexity IoT downlinks


YAHYA H.

AEU - International Journal of Electronics and Communications, cilt.218, 2027 (SCI-Expanded, Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 218
  • Basım Tarihi: 2027
  • Doi Numarası: 10.1016/j.aeue.2026.156685
  • Dergi Adı: AEU - International Journal of Electronics and Communications
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Applied Science & Technology Source, Compendex, INSPEC, Academic Search Ultimate (EBSCO), Engineering Source (EBSCO), Technology Collection (ProQuest)
  • Anahtar Kelimeler: Amplify-and-forward relaying, Internet of things, Noise modulation, Non-orthogonal multiple access, Relay selection, Ternary signaling
  • İstanbul Gelişim Üniversitesi Adresli: Evet

Özet

Noise-domain non-orthogonal multiple access (ND-NOMA) provides low-complexity multiuser transmission by embedding independent data streams in statistical properties of a common random waveform. Existing designs, however, mainly consider a single hop, binary statistical alphabets, and a fixed access point. This paper develops a relay-orchestrated dual-hop downlink system in which a base station serves two low-complexity Internet-of-Things users through one of several half-duplex amplify-and-forward relays. One user's bits are conveyed by the mean of a Gaussian waveform, while the other user's data are mapped to two consecutive silent, low-variance, or high-variance states. The relay preserves this statistical superposition without decoding. Exact finite-sample laws are established for the sample mean and centered sample variance after relay-noise amplification, and a constrained maximum-likelihood detector is derived for the eight valid ternary pairs. A relay-selection rule based on the weakest Bhattacharyya separation among the user statistics is then proposed and embedded in an energy-latency-reliability design framework. Simulations verify the exact analysis and show that the proposed selection reduces weighted bit error rate relative to first-hop-only selection. The results also quantify the fundamental tradeoffs among observation length, successful-delivery energy, variance calibration, and inter-user power allocation.