检索结果-内蒙古大学图书馆

Improving the Security and Reliability of Energy-Constrained Two-Way Relay Systems With Nonlinear Energy Harvesting

IEEE ACCESS 2023年 11卷 136793-136808页

作者： Li, Enyu Wang, Ye Liang, Zanyang Zheng, Meijuan Qingdao Univ Technol Sch Informat & Control Engn Qingdao 266520 Peoples R China

This paper presents a novel three-time slot transmission protocol designed for energy-constrained two-way relay systems. In a departure from traditional energy sources, our approach serves a dual purpose by not only providing power to the system but also significantly enhancing its security. We leverage both physical-layer network coding (PNC) and bit-level Exclusive OR (XOR) technology to amplify system capacity and bolster security. Given the unavailability of exact closed-form solutions, we utilize tight upper bounds for the signal-to-noise ratio (SNR) to derive approximate closed-form results, specifically focusing on outage and intercept performance under Rayleigh channel conditions. We also provide performance bounds for outage and intercept probabilities in the high SNR regime. Our simulation results validate the accuracy of our derived probabilities, demonstrating consistency with Monte Carlo simulations. Furthermore, our investigation reveals that the time allocation factor has minimal impact on the security and reliability of the proposed protocol, particularly under high SNR conditions. In addition, we conduct a comparative analysis between the XOR scheme introduced in this article and non-XOR (NXOR) systems. This analysis underscores the superior security-reliability tradeoff of our approach, particularly in scenarios characterized by poor channel conditions between the energy source user and potential eavesdroppers.

关键词： Relays NOMA Protocols Signal to noise ratio Reliability Cryptography Resource management Two-way relay energy harvesting physical-layer network coding cooperative communications Rayleigh channel

来源：评论

学校读者我要写书评

暂无评论

Outage Probability Analysis of Asymmetrical Bi-directional Multi-Relay System with network coding

Outage Probability Analysis of Asymmetrical Bi-directional M...

引用

4th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Tian Hua Liang Wenwen Xu Youyun Xu Kui Wu Lianguo PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9781467358293;9781467358309

In this paper, we construct a practical asymmetrical bi-directional multi-relay system model with considering the effect of distance between source nodes and destination nodes. Then an outage probability expression of the system based on network coding is given. The theoretical analysis is proved to be correct by Monte Carlo simulations. Also we analyze the system average outage probability with different situations of power allocation coefficient, locations of the relay nodes, SNR and the number of relay nodes, indicating the inherent relationship between power allocation coefficient and total system power as well as the number of relay nodes. Simulation results indicate that the optimal power allocation coefficient of the system based on network coding varies with respect to the distance between source nodes and destination nodes. Meanwhile, simulation results show that the system outage probability performance improves with the number of relay nodes increasing.

关键词： Asymmetrical Bi-directional Multi-relay System Outage Probability network coding physical-layer network coding Power Allocation Coefficient

来源：评论

学校读者我要写书评

暂无评论

Sign-Compute-Resolve for Tree Splitting Random Access

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第7期64卷 5261-5276页

作者： Goseling, Jasper Stefanovic, Cedomir Popovski, Petar Univ Twente Dept Appl Math NL-7522 Enschede Netherlands Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark

We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes, and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode, i.e., compute, the sum of the packets that were transmitted by the individual users. For each user, the packet consists of the user's signature, as well as the data that the user wants to communicate. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. This framework for creating and transmitting packets can be used as a fundamental building block in random access algorithms, since it helps to deal efficiently with the uncertainty of the set of contending terminals. In this paper, we show how to apply the framework in conjunction with a tree-splitting algorithm, which is required to deal with the case that more than K users collide. We demonstrate that our approach achieves throughput that tends to 1 rapidly as K increases. We also present results on net data-rate of the system, showing the impact of the overheads of the constituent elements of the proposed protocol. We compare the performance of our scheme with an upper bound that is obtained under the assumption that the active users are a priori known. Also, we consider an upper bound on the net data-rate for any PLNC-based strategy in which one linear equation per slot is decoded. We show that already at modest packet lengths, the net data-rate of our scheme becomes close to the second upper bound, i.e., the overhead of the contention resolution algorithm and the signature codes vanishes.

关键词： Access protocols multiaccess communication wireless communication compute-and-forward physical-layer network coding

来源：评论

学校读者我要写书评

暂无评论

Cooperative Compute-and-Forward

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第1期15卷 14-27页

作者： Nokleby, Matthew Aazhang, Behnaam Rice Univ Houston TX 77005 USA Wayne State Univ Detroit MI 48202 USA Univ Oulu Ctr Wireless Commun Oulu 90014 Finland

We propose a class of signaling schemes that leverage transmitter cooperation in wireless networks employing compute-and-forward or physical-layer network coding. We devise a lattice-coding approach to superposition block Markov encoding from which we construct a cooperative lattice coding strategy. Transmitters broadcast lattice codewords, decode each other's messages, and then cooperatively transmit resolution information which aids relays in decoding finite-field linear combinations of the incoming messages. We show that cooperation provides a substantial improvement in achievable computation rate and outage probability over noncooperative strategies. Using this strategy, we derive a new achievability scheme for the multiway relay channel, the rates of which are near capacity in many regimes and enjoy a diversity advantage over noncooperation.

关键词： Cooperative communications compute-and-forward diversity gain lattice codes physical-layer network coding

来源：评论

学校读者我要写书评

暂无评论

Efficient Decoding Algorithms for the Compute-and-Forward Strategy

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第7期63卷 2475-2485页

作者： Mejri, Asma Rekaya-Ben Othman, Ghaya Telecom ParisTech Dept Commun & Elect F-75013 Paris France

We address in this paper decoding aspects of the Compute-and-Forward (CF) physical-layer network coding strategy. Under the CF framework, encoders use a special class of nested lattice codes and decoders are based on suboptimal minimum distance decoding of unknown performance gap with respect to optimal decoders. In this work, we develop and assess the performance of novel decoding algorithms for CF operating in the multiple access channel. Starting with the Gaussian channel, we investigate the maximum a posteriori (MAP) decoder. We derive a novel MAP decoding metric and develop practical decoding algorithms shown numerically to outperform the original one. For the fading channel, we analyze the ML decoder for integer-valued lattices and develop a novel Diophantine approximation-based near-ML decoding algorithm shown numerically to outperform the original CF decoder in the 1-D case using Z lattices.

关键词： physical-layer network coding compute-and-forward lattice decoding maximum a posteriori decoding

来源：评论

学校读者我要写书评

暂无评论

Blind Compute-and-Forward

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第4期64卷 1451-1463页

作者： Feng, Chen Silva, Danilo Kschischang, Frank R. Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada Univ British Columbia Sch Engn Kelowna PQ V1V 1V7 Canada Univ Fed Santa Catarina Dept Elect Engn BR-88040900 Florianopolis SC Brazil Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

Compute-and-forward (C&F) is a promising new approach to interference management, enjoying several advantages over other information-theoretic schemes. C&F usually requires channel state information (CSI) at the receivers so that an "optimal" scaling factor can be computed for the purposes of decoding. In this paper, a blind C&F scheme-i.e., one not requiring CSI-is developed. Rather than attempting to compute the optimal scaling factor, this new scheme seeks one or more "good" scalars, i.e., scalars that allow correct decoding despite possibly being suboptimal. The region of all such good scalars is characterized. To find a good scalar, a computationally efficient scheme is proposed which involves error-detection, a hierarchically organized list, as well as a use of the smoothing lemma from lattice theory. Simulation results show that our blind C&F scheme achieves-for a class of nested lattice codes-the same throughput as its CSI-enabled counterpart at the expense of, approximately, a two-fold increase in computational complexity in the high-throughput region. Moreover, our blind C&F scheme can be applied to multisource multirelay networks with a good performance/complexity tradeoff.

关键词： physical-layer network coding compute-and-forward nested lattice codes Smoothing Lemma

来源：评论

学校读者我要写书评

暂无评论

LDPC coded DBICM Scheme for Two Way Relay Channel with a Pipeline Decoding Structure 16

LDPC coded DBICM Scheme for Two Way Relay Channel with a Pip...

引用

16th IEEE International Conference on Communication Systems (IEEE ICCS)

作者： Du, Junyi Wang, Zhenghai Xiao, Lei Wang, Li Qiao, Wensheng Southwest China Inst Elect Technol CETC Key Lab Avion Informat Syst Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538678640

Low-density parity-check (LDPC) coded bit interleaved coded modulation (BICM) is a bandwidth efficient coded modulation scheme and has been successfully employed in the two-way relay channel (TWRC). However, LDPC-BICM scheme does not take the correlations between coded bits from the same modulated symbol into account so that it cannot achieve the maximum a-posteriori (MAP) decoding performance. The later proposed BICM with iterative decoding scheme or the joint channel and physical-layer network coding scheme indeed consider the correlations and improve the error correction performance, but suffer from implementation issues of higher computational complexity and larger latency. In this paper, we propose an LDPC-Delayed BICM (DBICM) scheme to make a successful tradeoff between the performance and the complexity. To this end, we add a delay module between the encoder and the modulator to introduce correlations between codewords. Based on it, we propose a pipeline decoding structure and feed back the decoding result of a codeword to the demodulator as the a priori information for the next codeword. The proposed LDPC-DBICM scheme thus can utilize the correlations without increasing latency too much. We verify the effectiveness of our proposed scheme by theoretical mutual information analysis and finite-length simulations.

关键词： Two-way relay channel physical-layer network coding low-density parity-check delayed bit interleaved coded modulation

来源：评论

学校读者我要写书评

暂无评论

On the Design of Efficient Lattice-Code based Multiple Access

On the Design of Efficient Lattice-Code based Multiple Acces...

引用

IEEE Conference on Global Communications (IEEE GLOBECOM) - Intelligent Communications for Shared Prosperity

作者： Yang, Tao Yu, Fangtao Chen, Qiuzhuo Liu, Rongke Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9798350310900

This paper studies a lattice-code based multiple-access (LCMA) system. In the uplink, K users encode their messages with the same 2(m)-ary ring code mapped to 2(m)-PAM, belonging to the ensemble of lattice codes. All users transmit simultaneously. The receiver attempts to compute K independent streams of integer-combinations (ICBs) of the users' messages. For this, 1) we establish and solve a new "bounded independent vectors problem" (BIVP) which identifies a near-optimal set of coefficient vectors w.r.t. the ICBs, outperforming existing LLL and HKZ lattice reduction methods;2) we put forth new LCMA soft detection algorithms, which calculate the a posteriori probability w.r.t. the ICB over the lattice. The per-user complexity is of order less than O(K), suitable for massive access of K being large. The soft detection outputs are forwarded to K ring-code decoders to recover the messages. With our developed techniques, LCMA is shown to support a significantly higher load of users and exhibits an improved frame error rate over state-of-the-art IDMA and SCMA schemes. Such advanced functionality are achieved with just parallel processing and K single-user decoding operations.

关键词： Multiple access MIMO lattice-codes compute-forward physical-layer network coding soft detection

来源：评论

学校读者我要写书评

暂无评论

A Comparative Analysis of Secrecy Rates of Wireless Two-Way Relay Systems 58

A Comparative Analysis of Secrecy Rates of Wireless Two-Way ...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Chang, Chih-Hua Chang, Ronald Y. Huang, Yu-Chih Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Acad Sinica Res Ctr Informat Technol Innovat Taipei Taiwan Natl Taipei Univ Dept Commun Engn New Taipei 23741 Taiwan

ISBN: (纸本)9781479959525

This paper studies the information-theoretic secrecy rates of wireless two-way relay systems where two users wish to exchange information through a single relay with an eavesdropper observing all communications. We formulate and compare the achievable secrecy rates of the system that employs one of the three common relay protocols: conventional decode-and-forward (DF), DF with network coding (NC), and compute-and-forward (CF) based on physical-layer network coding (PNC). We show that CF based on PNC achieves the highest secrecy rate at high signal-to-noise ratio (SNR), while, interestingly, the other two protocols have mixed performance depending on the power allocation scheme and network topology. Our study offers insights into designing wireless two-way relay protocols from a secrecy perspective.

关键词： Two-way relaying information-theoretic security physical-layer security network coding physical-layer network coding

来源：评论

学校读者我要写书评

暂无评论

Wireless MIMO Switching with Trusted and Untrusted Relays: Degrees of Freedom Perspective

Wireless MIMO Switching with Trusted and Untrusted Relays: D...

引用

IEEE International Conference on Communications (ICC)

作者： Wang, Fanggang Yuan, Xiaojun Lee, Jemin Quek, Tony Q. S. Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing Peoples R China ShanghaiTech Univ Sch Informat Sci & Technol Shanghai Peoples R China Singapore Univ Technol & Design Singapore Singapore

ISBN: (纸本)9781467364324

We investigate the degrees of freedom (DoF) and secrecy DoF for a general framework of multiway relay networks named wireless MIMO switching, where a number of users exchange information via a common relay. Each round of data exchange consists of one uplink transmission from users to relay and one downlink transmission from relay back to users. The data exchange model is unicast, i.e., every user transmits one message and intends to receive one message from one other user. We categorize unicast patterns using the notion of orbit borrowed from abstract algebra. Roughly speaking, an orbit is a minimum subset of users such that data exchange is closed within this subset. We analyze the achievable DoF of wireless MIMO switching with various numbers of orbits. Particularly, the DoF capacity for unicast with one and two orbits are established. Furthermore, we study communication secrecy with an untrusted relay in wireless MIMO switching. We present an achievable secrecy sum rate and the corresponding achievable secrecy DoF by assuming a non-regenerative relay. Then, we focus on unicast patterns with one and two orbits, and show that this achievable lower bound is actually the secrecy DoF capacity based on a novel genie-aided technique. Our results build a bridge between the DoF and the secrecy DoF in multiway relaying. The methodology of the proof can be generally applied to analyze the secrecy DoF in other relay networks.

关键词： Degrees of freedom MIMO switching physical-layer network coding multiway relay secrecy sum rate

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：