ترغب بنشر مسار تعليمي؟ اضغط هنا

Sum Secret Key Rate Maximization for TDD Multi-User Massive MIMO Wireless Networks

319   0   0.0 ( 0 )
 نشر من قبل You Chen
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas. However, the fifth generation (5G) wireless communications employ massive multiple-input multiple-output (MIMO) to support multiple users simultaneously, bringing serious overhead of reciprocal channel acquisition. This paper presents a multi-user secret key generation in massive MIMO wireless networks. We provide a beam domain channel model, in which different elements represent the channel gains from different transmit directions to different receive directions. Based on this channel model, we analyze the secret key rate and derive a closed-form expression under independent channel conditions. To maximize the sum secret key rate, we provide the optimal conditions for the Kronecker product of the precoding and receiving matrices and propose an algorithm to generate these matrices with pilot reuse. The proposed optimization design can significantly reduce the pilot overhead of the reciprocal channel state information acquisition. Furthermore, we analyze the security under the channel correlation between user terminals (UTs), and propose a low overhead multi-user secret key generation with non-overlapping beams between UTs. Simulation results demonstrate the near optimal performance of the proposed precoding and receiving matrices design and the advantages of the non-overlapping beam allocation.



قيم البحث

اقرأ أيضاً

77 - You Chen , Guyue Li , Chen Sun 2020
Physical-layer key generation (PKG) in multi-user massive MIMO networks faces great challenges due to the large length of pilots and the high dimension of channel matrix. To tackle these problems, we propose a novel massive MIMO key generation scheme with pilot reuse based on the beam domain channel model and derive close-form expression of secret key rate. Specifically, we present two algorithms, i.e., beam-domain based channel probing (BCP) algorithm and interference neutralization based multi-user beam allocation (IMBA) algorithm for the purpose of channel dimension reduction and multi-user pilot reuse, respectively. Numerical results verify that the proposed PKG scheme can achieve the secret key rate that approximates the perfect case, and significantly reduce the dimension of the channel estimation and pilot overhead.
In this paper, based on directional modulation (DM), robust beamforming matrix design for sum secrecy rate maximization is investigated in multi-user systems. The base station (BS) is assumed to have the imperfect knowledge of the direction angle tow ard each eavesdropper, with the estimation error following the Von Mises distribution. To this end, a Von Mises distribution-Sum Secrecy Rate Maximization (VMD-SSRM) method is proposed to maximize the sum secrecy rate by employing semi-definite relaxation and first-order approximation based on Taylor expansion to solve the optimization problem. Then in order to optimize the sum secrecy rate in the case of the worst estimation error of direction angle toward each eavesdropper, we propose a maximum angle estimation error-SSRM (MAEE-SSRM) method. The optimization problem is constructed based on the upper and lower bounds of the estimated eavesdropping channel related coefficient and then solved by the change of the variable method. Simulation results show that our two proposed methods have better sum secrecy rate than zero-forcing (ZF) method and signal-to-leakage-and-noise ratio (SLNR) method. Furthermore, the sum secrecy rate performance of our VMD-SSRM method is better than that of our MAEE-SSRM method.
91 - J. Harshan , Rohit Joshi , 2018
It is well known that physical-layer Group Secret-Key (GSK) generation techniques allow multiple nodes of a wireless network to synthesize a common secret-key, which can be subsequently used to keep their group messages confidential. As one of its sa lient features, the wireless nodes involved in physical-layer GSK generation extract randomness from a subset of their wireless channels, referred as the common source of randomness (CSR). Unlike two-user key generation, in GSK generation, some nodes must act as facilitators by broadcasting quantiz
361 - Xing Li , Seungil You , Lijun Chen 2016
MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channe ls (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm and the polite water-filling (PWF) algorithm. The WMMSE algorithm is provably convergent, while the PWF algorithm takes the advantage of the optimal transmit signal structure and converges the fastest in most situations but is not guaranteed to converge in all situations. It is highly desirable to design an algorithm that has the advantages of both algorithms. The dual link algorithm is such an algorithm. Its fast and guaranteed convergence is important to distributed implementation and time varying channels. In addition, the technique and a scaling invariance property used in the convergence proof may find applications in other non-convex problems in communication networks.
The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is assumed, for which a practical capacity-approaching scheme is developed. By applying judiciously chosen unitary operations at the transmit and receive nodes, the channel matrices are triangularized so that the resulting matrices have equal diagonals, up to a possible multiplicative scalar factor. This, along with the utilization of successive interference cancellation, reduces the coding and decoding tasks to those of coding and decoding over the single-antenna additive white Gaussian noise channel. Over the resulting effective channel, any off-the-shelf code may be used. For the two-user case, it was recently shown that such joint unitary triangularization is always possible. In this paper, it is shown that for more than two users, it is necessary to carry out the unitary linear processing jointly over multiple channel uses, i.e., space-time processing is employed. It is further shown that exact triangularization, where all resulting diagonals are equal, is still not always possible, and appropriate conditions for the existence of such are established for certain cases. When exact triangularization is not possible, an asymptotic construction is proposed, that achieves the desired property of equal diagonals up to edge effects that can be made arbitrarily small, at the price of processing a sufficiently large number of channel uses together.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا