Abstract

This paper studies the security aspect of a recently introduced “cell-free massive MIMO” network under a pilot spoofing attack. First, a simple method to recognize the presence of this type of an active eavesdropping attack to a particular user is shown. In order to deal with this attack, we consider the problem of maximizing the achievable data rate of the attacked user or its achievable secrecy rate. The corresponding problems of minimizing the power consumption subject to security constraints are also considered in parallel. Path-following algorithms are developed to solve the posed optimization problems under different power allocation to access points (APs). Under equip-power allocation to APs, these optimization problems admit closed-form solutions. Numerical results show their efficiency.

Highlights

  • We focus on solving optimization problems to provide specific solutions for cell-free systems in the case that a user is really suspected of being an eavesdropper

  • We have considered a cell-free MIMO network in the presence of an active eavesdropper

  • We have suggested maximization problems to maximize the achievable secrecy rate subject to quality-of-service constraints

Read more

Summary

Introduction

1) Cell-Free Massive MIMO Networks: Cell-free massive MIMO has been recently introduced in [1]–[3] These papers showed that by proper implementation, cell-free massive MIMO can provide a uniformly good service to all users in the network and outperform small-cell massive MIMO in terms of throughput, and handle the shadow fading correlation more efficiently. In a typical small-cell massive MIMO system, the channel from an access point (AP) to a user is a single scalar. In a cell-free Massive MIMO system, all APs can liaise with each other via a central processing unit (CPU) to perform beamforming transmission tasks, and the effective channel (from an AP to a user) will take. The associate editor coordinating the review of this paper and approving it for publication was I.

Objectives
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.