اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPartial Zero-Forcing for Multi-Way Relay Networks
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The ever increasing demands for mobile network access have resulted in a significant increase in bandwidth usage. By improving the system spectral efficiency, multi-way relay networks (MWRNs) provide promising approaches to address this challenge. In this paper, we propose a novel linear beamforming design, namely partial zero-forcing (PZF), for MWRNs with a multiple-input-multiple-output (MIMO) relay. Compared to zero-forcing (ZF), PZF relaxes the constraints on the relay beamforming matrix such that only partial user-interference, instead of all, is canceled at the relay. The users eliminate the remaining interferences through self-interference and successive interference cancellation. A sum-rate maximization problem is formulated and solved to exploit the extra degrees-of-freedom resulted from PZF. Simulation results show that the proposed PZF relay beamforming design achieves significantly higher network sum-rates than the existing linear beamforming designs.
قيم البحث
اقرأ أيضاً
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning r
igid linkage and thus a vital linkage. A related generalization of zero forcing that produces a rigid linkage via a coloring process is developed. One of the motivations for introducing zero forcing is to provide an upper bound on the maximum multiplicity of an eigenvalue among the real symmetric matrices described by a graph. Rigid linkages and a related notion of rigid shortest linkages are utilized to obtain bounds on the multiplicities of eigenvalues of this family of matrices.
Recently, three useful secrecy metrics based on the partial secrecy regime were proposed to analyze secure transmissions on wireless systems over quasi-static fading channels, namely: generalized secrecy outage probability, average fractional equivoc
ation, and average information leakage. These metrics were devised from the concept of fractional equivocation, which is related to the decoding error probability at the eavesdropper, so as to provide a comprehensive insight on the practical implementation of wireless systems with different levels of secrecy requirements. Considering the partial secrecy regime, in this paper we examine the secrecy performance of an amplify-and-forward relaying network with an untrusted relay node, where a destination-based jamming is employed to enable secure transmissions. In this regard, a closed-form approximation is derived for the generalized secrecy outage probability, and integral-form expressions are obtained for the average fractional equivocation and the average information leakage rate. Additionally, equal and optimal power allocation schemes are investigated and compared for the three metrics. From this analysis, we show that different power allocation approaches lead to different system design criteria. The obtained expressions are validated via Monte Carlo simulations.
In this paper, we analyze the symbol error rate (SER) performance of the simultaneous wireless information and power transfer (SWIPT) enabled three-node differential decode-and-forward (DDF) relay networks, which adopt the power splitting (PS) protoc
ol at the relay. The use of non-coherent differential modulation eliminates the need for sending training symbols to estimate the instantaneous channel state information (CSI) at all network nodes, and therefore improves the power efficiency, as compared with the coherent modulation. However, performance analysis results are not yet available for the state-of-the-art detectors such as the maximum-likelihood detector (MLD) and approximate MLD. Existing works rely on the Monte-Carlo simulation method to show the existence of an optimal PS ratio that minimizes the overall SER. In this work, we propose a near-optimal detector with linear complexity with respect to the modulation size. We derive an approximate SER expression and prove that the proposed detector achieves the full diversity order. Based on our expression, the optimal PS ratio can be accurately estimated without requiring any Monte-Carlo simulation. We also extend the proposed detector and its SER analysis for adopting the time switching (TS) protocol at the relay. Simulation results verify the effectiveness of our proposed detector and the accuracy of our SER results in various network scenarios for both PS and TS protocols.
Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few unforced moves as possible. This leads to a parameter known as the zero forcing number which can be used t
o give an upper bound for the maximum nullity of a matrix associated with the graph. We introduce a new variation on the zero forcing game which can be used to give an upper bound for the maximum nullity of a matrix associated with a graph that has $q$ negative eigenvalues. This gives some limits to the number of positive eigenvalues that such a graph can have and so can be used to form lower bounds for the inertia set of a graph.
We consider the relaying application of unmanned aerial vehicles (UAVs), in which UAVs are placed between two transceivers (TRs) to increase the throughput of the system. Instead of studying the placement of UAVs as pursued in existing literature, we
focus on investigating the placement of a jammer or a major source of interference on the ground to effectively degrade the performance of the system, which is measured by the maximum achievable data rate of transmission between the TRs. We demonstrate that the optimal placement of the jammer is in general a non-convex optimization problem, for which obtaining the solution directly is intractable. Afterward, using the inherent characteristics of the signal-to-interference ratio (SIR) expressions, we propose a tractable approach to find the optimal position of the jammer. Based on the proposed approach, we investigate the optimal positioning of the jammer in both dual-hop and multi-hop UAV relaying settings. Numerical simulations are provided to evaluate the performance of our proposed method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
