Generalized path–permutation codes for reliable end-to-end networking of opportunistic links

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Lai, I-Wei
• dc.contributor.author Shih, Jhih-Wei
• dc.contributor.author Chen, Kwang-Cheng
• dc.contributor.author Biglieri, Ezio
• dc.date.accessioned 2020-07-21T09:51:11Z
• dc.date.issued 2020
• dc.description.abstract 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.en
• dc.description.sponsorship The work of I-Wei Lai was supported by Ministry of Science and Technology, Taiwan, under Grant MOST 108-2221-E-003-002-MY3. K.-C. Chen’s research is supported in part by the Cyber Florida. The work of Ezio Biglieri was supported by the H2020 Framework Programme/ERC grant 694974.en
• dc.format.mimetype application/pdf
• dc.identifier.citation Lai IW, Shih JW, Chen KC, Biglieri E. Generalized path–permutation codes for reliable end-to-end networking of opportunistic links. IEEE Trans Wirel Commun. 2020 Apr 17;19(7):4579-93. DOI: 10.1109/TWC.2020.2985361
• dc.identifier.doi http://dx.doi.org/10.1109/TWC.2020.2985361
• dc.identifier.issn 1536-1276
• dc.identifier.uri http://hdl.handle.net/10230/45145
• dc.language.iso eng
• dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
• dc.relation.ispartof IEEE Transactions on Wireless Communications. 2020 Apr 17;19(7):4579-93
• dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/694974
• dc.rights © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. http://dx.doi.org/10.1109/TWC.2020.2985361
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword Multiple-input multiple-output (MIMO)en
• dc.subject.keyword Virtual MIMOen
• dc.subject.keyword Low-latency vehicular networken
• dc.subject.keyword Cognitive radio networken
• dc.subject.keyword Energy-harvesting networken
• dc.subject.keyword Proactive open-loop communicationen
• dc.subject.keyword Ultra-low latencyen
• dc.subject.keyword Erasure channelsen
• dc.subject.keyword Path-permutation codesen
• dc.title Generalized path–permutation codes for reliable end-to-end networking of opportunistic linksen
• dc.type info:eu-repo/semantics/article
• dc.type.version info:eu-repo/semantics/acceptedVersion