Generalized Path-Permutation Codes for Reliable End-to-End Networking of Opportunistic Links

I. Wei Lai*, Jhih Wei Shih, Kwang Cheng Chen, Ezio Biglieri

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

2 引文 斯高帕斯(Scopus)

摘要

Opportunistic links are emerging as a novel technology for state-of-the-art wireless networks, such as cognitive radio networks, energy-harvesting networks, and low-latency vehicular networks. To increase the reliability of these networks, path-permutation codes (PPCs) were advocated in [1]. These codes are based on a virtual multiple-input multiple-output (MIMO) model on the session/network layer, and have been tailored for increased reliability of opportunistic links. By exploiting multipath-multihop routes, PPCs access one relay path at a time while repeatedly transmitting the same QAM symbol. In this paper, we introduce a generalized PPC scheme which simultaneously accesses multiple relay paths and comprises multiple QAM symbols in the packet. Phase rotations are also introduced in the PPC codewords for additional performance improvement. Numerical simulation results validate our analyses and demonstrate the superior performance of this novel coding scheme, i.e., better error rate performance, higher throughput, and stronger robustness to transmission outages.

原文英語
文章編號9070172
頁(從 - 到)4579-4593
頁數15
期刊IEEE Transactions on Wireless Communications
19
發行號7
DOIs
出版狀態已發佈 - 2020 七月

ASJC Scopus subject areas

  • 電腦科學應用
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「Generalized Path-Permutation Codes for Reliable End-to-End Networking of Opportunistic Links」主題。共同形成了獨特的指紋。

引用此