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

Distributed Beamforming for Physical-Layer Security of Two-Way Relay networks

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第7期60卷 3532-3545页

作者： Wang, Hui-Ming Yin, Qinye Xia, Xiang-Gen Xi An Jiao Tong Univ Sch Elect & Informat Engn Minist Educ Key Lab Intelligent Networks & Network Secur Xian 710049 Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA Chonbuk Natl Univ Jeonju South Korea

In this paper, we address the security of a two-way relay network in the presence of an eavesdropper, where each node is only equipped with single antenna. We propose two-phase distributed analog network coding, or distributed beamforming and power allocation to enhance the secrecy sum rate of the data exchange. In the first phase, the two terminals broadcast their information data simultaneously to all the relay nodes. In the second phase, three different security schemes are proposed: optimal beamforming, null-space beamforming, and artificial noise beamforming. In the first scheme, the objective is to achieve the maximum secrecy sum rate of the two terminals. Mathematically, the objective function is difficult to optimize. In the second scheme, we maximize the total information exchanged while we eliminate the information leakage completely, subject to the total transmission power constraint. We show that the problem has a unique and global optimum, which can be solved using bisection method. When the instantaneous channel state information of the eavesdropper is not available, we propose an artificial noise beamforming in the third scheme. We minimize the information transmission power so that the artificial noise power is maximized to eliminate information leakage, under the constraints of quality of service (QoS) required by terminals. It is a second-order convex cone programming (SOCP) problem, thus can be efficiently solved using interior point methods. Numerical results are provided and analyzed to show the properties and efficiency of the proposed designs.

关键词： analog network coding distributed beamforming physical layer security second-order cone programming secrecy rate two-way relay networks

来源：评论

学校读者我要写书评

暂无评论

Joint impact of nodes-mobility and channel estimation error on the performance of two-way relay systems

引用

PHYSICAL COMMUNICATION 2017年 23卷 103-113页

作者： Meshram, Ashish K. Gurjar, Devendra S. Upadhyay, Prabhat K. Indian Inst Technol Indore Discipline Elect Engn Indore 453552 Madhya Pradesh India

This paper presents the performance analysis of a two-way relay system with nodes-mobility (NM) and channel estimation errors (CEE) under time-varying Rayleigh fading. Herein, analog network coding protocol is employed at the relay node. All the participating nodes are half-duplex and equipped with single-antenna devices. Specifically, we utilize first-order Markovian model to characterize the impact of NM in the channel. Along with the NM, we also consider that the CEE may exist in practical scenarios, where nodes require to estimate the channel state information. By incorporating these factors, we first derive the instantaneous end-to-end (e2e) signal-to-noise ratios (SNRs) at two source nodes. Then, we obtain the exact closed-form expressions for distribution and density functions of the two e2e SNRs. After that, we derive the accurate expressions of various performance metrics, viz., sum-bit error rate, overall outage probability, and ergodic sum-rate. Further, to attain more insights into the considered system, we deduce the asymptotic behavior of these performance metrics. Finally, numerical and Monte-Carlo simulation results are provided to validate our theoretical analysis and to illustrate the impact of NM and CEE on the performance measures of the considered system. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Two-way relaying analog network coding Time-varying channel Nodes-mobility Imperfect channel state information

来源：评论

学校读者我要写书评

暂无评论

Generalized Wireless network coding Schemes for Multihop Two-Way Relay Channels

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第9期13卷 5132-5147页

作者： Wang, Gengkun Xiang, Wei Yuan, Jinhong Univ So Queensland Fac Hlth Engn & Sci Sch Mech & Elect Engn Toowoomba Qld 4350 Australia Univ New S Wales Fac Engn Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

Due to the overwhelming complexity of multihop transmission and intermessage interference, only a limited amount of research has been carried out in the implementation of wireless network coding (WNC) for generalized multihop two-way relay channels (MH-TRCs), let alone the generalization of multihop WNC (MH-WNC) schemes. Our recent paper has showed that the MH-WNC scheme with fixed two transmission time intervals (TTIs) was unable to always outperform conventional non-NC schemes in outage performance for the MH-TRC with an arbitrary number of nodes. In view of this fact, a generalized MH-WNC scheme with multiple TTIs is designed for the L-node K-message MH-TRC in this paper. Closed-form expressions for the upper bound of the outage probability for two prominent relaying network coding strategies (i.e., analog network coding and compute-and-forward network coding) are derived. Moreover, by investigating the relationships between the outage probability and the numbers of nodes, messages, and TTIs, we obtain an optimal MH-WNC scheme that can achieve the best outage probability and always outperform non-NC in the MH-TRC with an arbitrary number of nodes.

关键词： Multi-hop wireless network coding multi-hop two-way relay channels outage probability analog network coding compute-and-forward network coding

来源：评论

学校读者我要写书评

暂无评论

Optimal Graph-Filter Design and Applications to Distributed Linear network Operators

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2017年第15期65卷 4117-4131页

作者： Segarra, Santiago Marques, Antonio G. Ribeiro, Alejandro MIT Inst Data Syst & Soc 77 Massachusetts Ave Cambridge MA 02139 USA King Juan Carlos Univ Dept Signal Theory & Commun Madrid 28943 Spain Univ Penn Dept Elect & Syst Engn Philadelphia PA 19104 USA

We study the optimal design of graph filters (GFs) to implement arbitrary linear transformations between graph signals. GFs can be represented by matrix polynomials of the graph-shift operator (GSO). Since this operator captures the local structure of the graph, GFs naturally give rise to distributed linear network operators. In most setups, the GSO is given so that GF design consists fundamentally in choosing the (filter) coefficients of the matrix polynomial to resemble desired linear transformations. We determine spectral conditions under which a specific linear transformation can be implemented perfectly using GFs. For the cases where perfect implementation is infeasible, we address the optimization of the filter coefficients to approximate the desired transformation. Additionally, for settings where the GSO itself can be modified, we study its optimal design as well. After this, we introduce the notion of a node-variant GF, which allows the simultaneous implementation of multiple (regular) GFs in different nodes of the graph. This additional flexibility enables the design of more general operators without undermining the locality in implementation. Perfect and approximate designs are also studied for this new type of GFs. To showcase the relevance of the results in the context of distributed linear network operators, this paper closes with the application of our framework to two particular distributed problems: finite-time consensus and analog network coding.

关键词： Graph signal processing graph filter (GF) design distributed linear transformation network operator finite-time consensus analog network coding

来源：评论

学校读者我要写书评

暂无评论

Two-Way Relaying Cooperative Wireless networks: Resource Allocation and Performance Analysis

引用

INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS 2013年第3期59卷 229-235页

作者： Abrar, Muhammad Gui, Xiang Punchihewa, Amal Massey Univ Sch Engn & Adv Technol Palmerston North New Zealand Asia Pacific Broadcasting Union Kuala Lumpur Malaysia

Relay-based cooperative wireless networks have been widely considered one of the cost-effective solutions to meet the demands in future wireless networks. In order to maximize the overall sum-rate while maintaining proportional fairness among users, we investigate different resource allocation algorithms in two-way relay networks with analog network coding (ANC) protocol and time division broadcast (TDBC) protocol. The algorithms investigated are different from traditional proportional fairness schemes in terms of fairness and computational complexity as we have applied Access Proportional Fairness (APF) and Minimum Rate Proportional Fairness (MRPF) along with load balancing at the relays. A MATLAB simulation has been performed and simulation results show the effectiveness of these algorithms.

关键词： relay network relay protocol resource allocation two-way relaying bidirectional relaying analog network coding Time Division Broadcast

来源：评论

学校读者我要写书评

暂无评论

Time-Reversal Space-Time Codes in Asynchronous Two-Way Relay networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第3期15卷 1729-1741页

作者： Liu, Yun Zhang, Wei Ching, P. C. Huawei Technol Co Ltd Shenzhen Guangdong Peoples R China Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Chinese Univ Hong Kong Dept Elect Engn Shatin Hong Kong Peoples R China

We consider an asynchronous two-way relay network in which a few distributed relays assist in the communication between two single-antenna terminals through analog network coding. The asynchronous transmission between relays and terminals causes symbol misalignments and results in diversity loss in space-time codes (STCs). We propose a family of zero-padded time-reversal STC that can achieve full diversity with low-complexity maximum likelihood (ML) decoding, given a bound for the path delay difference. With ML decoding, the proposed code is decomposed into several independent parts, which greatly facilitate the decoding process. For two-relay scenarios, three code designs based on Alamouti code, quasi-orthogonal spacetime block code, and multigroup decodable STC are provided for each relay with one, two, and four antennas, respectively. For three-relay scenarios, one code design based on quasi-orthogonal space-time block code is provided for each relay with one antenna. Proof of full diversity is established, and the decoding complexity order is analyzed for all four designs. Simulations confirm the full diversity gain of all designs. The bit-error-rate performance in asynchronous scenarios is almost similar to that in synchronous scenarios.

关键词： Asynchronous two-way relay network analog network coding space-time code full diversity maximum likelihood decoding

来源：评论

学校读者我要写书评

暂无评论

Performance of 3T-ANC based orthogonal frequency-division-multiplexed optical wireless link with pointing error

引用

JOURNAL OF OPTICS-INDIA 2019年第3期48卷 400-411页

作者： Kumar, Pravindra Thakor, Satyajit TIET Patiala Punjab India Indian Inst Technol Mandi SCEE Mandi Himachal Prades India

The average channel capacity, achievable rate, and bit error rate (BER) for orthogonal frequency-division multiplexing-based optical wireless (OFDM-OW) links over Gamma-Gamma-distributed atmospheric channel, with pointing errors, are investigated from an information theory perspective. Building sway, heavy wind, ground motion, or differential heating and cooling could result in misalignment (pointing errors) between transmitter and receiver. A relay-assisted OW communication system, with three-time-slotted analog network coding (3T-ANC) scheme, can be used in non-light-of-sight (NLoS) link situation to make successful communication between the users with improved performance in terms of throughput and BER. In the analysis, we show that the 3T-ANC-based OFDM-OW link gives better BER performance and increased achievable rate with narrow beam width and less normalized jitter value.

关键词： OFDM-OW system Gamma-Gamma distribution Pointing error analog network coding

来源：评论

学校读者我要写书评

暂无评论

Throughput Analysis of Full-Duplex network coding in Two-Way Relay Channel 17

Throughput Analysis of Full-Duplex Network Coding in Two-Way...

引用

IEEE 17th International Conference on Communication Technology (ICCT)

作者： Li Weizheng Tu Xiumei Nanjing Univ Technol Comp Sci & Tech Coll Nanjing Jiangsu Peoples R China ZTE Nanjing R&D Ctr Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781509039449

In two-way relay channel (TWRC), terminal nodes exchange information assisted by a relay node. To exchange 1bit information over TWRC, the traditional save-and-forward scheme takes 4 time slots. The traditional network coding scheme can reduce the number of time slots to 3 since its relay node can mix the information from tow terminal nodes and then broadcast them in 1 time slot. Further, the physical network coding (PNC) and analog network coding (ANC) schemes, which allow terminal nodes send the signal simultaneously, only need 2 time slots to complete the information exchange. In this paper, by combining physical network coding and full-duplex (FD) techniques, the proposed scheme full-duplex physical network coding (FD-PNC) and full-duplex analog network coding (FD-ANC) can nearly reduce the required time slots to 1. Therein, full-duplex technology can make the nodes send and receive the signal at the same time and in the same frequency band by eliminating the self interference signal. Considering the channel error, we analyze their achievable throughput under the symmetric channel. We believe that taking full-duplex technology into network coding research may open many possibilities for future work.

关键词： full-duplex physical network coding analog network coding symmetric channel

来源：评论

学校读者我要写书评

暂无评论

Prioritized analog Cooperative Relaying in Multiple Access Relay networks

Prioritized Analog Cooperative Relaying in Multiple Access R...

引用

MILCOM Military Communications Conference

作者： Khalaf, Taha Kim, Sang Wu Greenstein, Larry J. Iowa State Univ Dept Elect & Comp Engn Ames IA 50014 USA Rutgers State Univ WINLAB New York 08902 NY USA

ISBN: (纸本)9781424481804

We consider a multiple access relay network where multiple sources send independent data simultaneously to a common destination through multiple relay nodes. We present three prioritized analog cooperative relaying schemes that provide different quality of service (QoS) to different sources while being relayed at the same time in the same frequency band. The three schemes take the channel variations into account in determining the relay encoding (combining) rule, but differ in terms of whether or how relays cooperate. Simulation results on the symbol error probability and outage probability are provided to show the effectiveness of the proposed schemes.

关键词： Prioritized relaying analog network coding cooperation multiple access relay network

来源：评论

学校读者我要写书评

暂无评论

Parallel Two-Way Relaying in Cooperative OFDMA Cellular Systems 26

Parallel Two-Way Relaying in Cooperative OFDMA Cellular Syst...

引用

26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Jin, Sai Ping, Li City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781467367820

Consider a parallel two-way relaying orthogonal frequency division multiple access (PTWR-OFDMA) scheme in which mobile terminals (MTs) are divided into near-nodes (NNs) and far-nodes (FNs). An NN communicates with the base station (BS) directly while an FN communicates indirectly via NNs. We study the design and analysis issues for PTWR-OFDMA. The scheme has some noticeable advantages. First, its throughput increases like lnK, much higher than that of lnlnK in conventional OFDMA (K being the number of MTs). Second, PTWR-OFDMA can provide much better fairness than conventional OFDMA. Third, the power overhead per NN reduces quickly when K increases if there is a peak rate limitation, implying that there is no strong incentive for some users to avoid providing relaying.

关键词： cooperative communication two-way relaying analog network coding OFDMA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：