We propose a novel pilot sequence design to mitigate pilot contamination in multi-cell multiuser massive multiple-input multiple-output networks. Our proposed design generates pilot sequences in the multi-cell network and devises power allocation at base stations (BSs) for downlink transmission. The pilot sequences together with the power allocation ensure that the user capacity of the network is achieved and the pre-defined signalto- interference-plus-noise ratio (SINR) requirements of all users are met. To realize our design, we first derive new closed-form expressions for the user capacity and the user capacity region. Built upon these expressions, we then develop a new algorithm to obtain the required pilot sequences and power allocation. We further determine the minimum number of antennas required at BSs to achieve certain SINR requirements of all users. Numerical results are presented to corroborate our analysis and to examine the impact of key parameters, such as the pilot sequence length and the total number of users, on the network performance. A pivotal conclusion is reached that our design achieves a larger user capacity region than the existing designs and needs less antennas at the BS to fulfill the pre-defined SINR requirements of all users in the network than the existing designs.

We propose a location-aware pilot allocation algorithm for a massive multiple-input multiple-output (MIMO) network with high-mobility users, where the wireless channels are subject to Rician fading. Pilot allocation in massive MIMO is a hard combinatorial problem and depends on the locations of users. As such, it is highly complex to achieve the optimal pilot allocation in real-time for a network with high-mobility users. Against this background, we propose a low-complexity pilot allocation algorithm, which exploits the behavior of line-of sight (LOS) interference among the users and allocate the same pilot sequence to the users with small LOS interference. Our examination demonstrates that our proposed algorithm significantly outperforms the existing algorithms, even with localization errors. Specifically, for the system considered in this work, our proposed algorithm provides up to 37.26% improvement in sum spectral efficiency (SE) and improves the sum SE of the worst interference-affected users by up to 2.57 bits/sec/Hz, as compared to the existing algorithms.

The acceptance and usability of context-aware systems have given them the edge of wide use in various domains and has also attracted the attention of researchers in the area of context-aware computing. Making user context information available to such systems is the center of attention. However, there is very little emphasis given to the process of context representation and context fusion which are integral parts of context-aware systems. Context representation and fusion facilitate in recognizing the dependency/relationship of one data source on another to extract a better understanding of user context. The problem is more critical when data is emerging from heterogeneous sources of diverse nature like sensors, user profiles, and social interactions and also at different timestamps. Both the processes of context representation and fusion are followed in one way or another; however, they are not discussed explicitly for the realization of context-aware systems. In other words most of the context-aware systems underestimate the importance context representation and fusion. This research has explicitly focused on the importance of both the processes of context representation and fusion and has streamlined their existence in the overall architecture of context-aware systems’ design and development. Various applications of context representation and fusion in context-aware systems are also highlighted in this research. A detailed review on both the processes is provided in this research with their applications. Future research directions (challenges) are also highlighted which needs proper attention for the purpose of achieving the goal of realizing context-aware systems.

Pilot contamination has been recognized as one of the main limiting factors in massive multiple-input multiple-output (MIMO) since it damages the acquisition of accurate channel state information (CSI) at base stations. In this work, we propose a novel pilot decontamination approach in a massive MIMO network where the time division duplex operation is assumed. In our proposed approach, user equipments are allowed to use superimposed (SP) pilots in combination with time-multiplexed (TM) pilots to estimate the CSI prior to downlink data transmission. Specifically, the contaminated channel estimates obtained by TM pilots are used to reduce the amount of interference caused by transmitting pilots together with uplink data, which is a typical problem in SP pilots-based channel estimation. Through numerical results, we show that the interference that emerges from transmitting pilots with data is substantially reduced by our proposed approach. This reduction, in combination with the reduced overhead in TM pilots transmission, leads to an improved spectral efficiency achieved in massive MIMO networks.

We propose a novel location-aware pilot assignment scheme to mitigate pilot contamination in massive multiple-input multiple-output (MIMO) networks, where the channels are subjected to Rician fading. Our proposed scheme utilizes the location information of users as the input to conduct pilot assignment in the network. Based on the location information, we first determine the line of sight (LOS) interference between the intended signal and the interfering signal. Our analysis reveals that the LOS interference converges to zero as the number of antennas at the base station (BS) goes to infinity, whereas for a finite number of antennas at the BS the LOS interference indeed depends on specific pilot allocation strategies. Following this revelation, we assign pilot sequences to all the users in the massive MIMO network such that the LOS interference is minimized for a finite number of antennas at the BS. Our proposed scheme outperforms the random pilot assignment in terms of achieving a much higher uplink sum rate for reasonable values of the Rician K-factor. Furthermore, we propose a new performance metric to measure the strength of the LOS interference and demonstrate its effectiveness to analyze the performance of pilot assignment schemes. Theoretical analysis is provided and verified through numerical simulations to support the proposed scheme.

In this paper, we analyze pilot contamination (PC) attacks on a multi-cell massive multiple-input multiple-output (MIMO) network with correlated pilots. We obtain correlated pilots using a user capacity-achieving pilot sequence design. This design relies on an algorithm which designs correlated pilot sequences based on signal-to-interference-plus-noise ratio (SINR) requirements for all the legitimate users. The pilot design is capable of achieving the SINR requirements for all users even in the presence of PC. However, this design has some intrinsic limitations and vulnerabilities, such as a known pilot sequence and the non-zero cross-correlation among different pilot sequences. We reveal that such vulnerabilities may be exploited by an active attacker to increase PC in the network. Motivated by this, we analyze the correlated pilot design for vulnerabilities that can be exploited by an active attacker. Based on this analysis, we develop an effective active attack strategy in the massive MIMO network with correlated pilot sequences. Our examinations reveal that the user capacity region of the network is significantly reduced in the presence of the active attack. Importantly, the SINR requirements for the worst-affected users may not be satisfied even with an infinite number of antennas at the base station.