Search

Pilot contamination due to pilot reuse seriously mitigates the performance of the cell-free massive multiple-input multiple-output (MIMO) systems. In this paper, we propose a joint pilot assignment scheme that employs user clustering and graph coloring (UC-GC) to reduce pilot contamination. The proposed method consists of two steps: firstly, we utilize AP selection to classify all users; secondly, we assign pilots to users with more severe pilot contamination using the graph coloring algorithm and then assign pilots to the remaining users. The numerical simulation results show that the proposed scheme outperforms existing pilot assignment schemes and significantly improves throughout with low complexity.

With the emergence of various Internet of Things (IoT) technologies, energy-saving schemes for IoT devices have been rapidly developed. To enhance the energy efficiency of IoT devices in crowded environments with multiple overlapping cells, the selection of access points (APs) for IoT devices should consider energy conservation by reducing unnecessary packet transmission activities caused by collisions. Therefore, in this paper, we present a novel energy-efficient AP selection scheme using reinforcement learning to address the problem of unbalanced load that arises from biased AP connections. Our proposed method utilizes the Energy and Latency Reinforcement Learning (EL-RL) model for energy-efficient AP selection that takes into account the average energy consumption and the average latency of IoT devices. In the EL-RL model, we analyze the collision probability in Wi-Fi networks to reduce the number of retransmissions that induces more energy consumption and higher latency. According to the simulation, the proposed method achieves a maximum improvement of 53% in energy efficiency, 50% in uplink latency, and a 2.1-times longer expected lifespan of IoT devices compared to the conventional AP selection scheme.

An RSS transform–based weighted k-nearest neighbor (WKNN) indoor positioning algorithm, Q-WKNN, is proposed to improve the positioning accuracy and real-time performance of Wi-Fi fingerprint–based indoor positioning. To smooth the RSS fluctuation difference caused by acquisition equipment, time, and environment changes, base Q is introduced in Q-WKNN to transform RSS to Q-based RSS, based on the relationship between the received signal strength (RSS) and physical distance. Analysis of the effective range of base Q indicates that Q-WKNN is more suitable for regions with noticeable environmental changes and fixed access points (APs). To reduce the positioning time, APs are selected to form a Q-WKNN similarity matrix. Adaptive K is applied to estimate the test point (TP) position. Commonly used indoor positioning algorithms are compared to Q-WKNN on Zenodo and underground parking databases. Results show that Q-WKNN has better positioning accuracy and real-time performance than WKNN, modified-WKNN (M-WKNN), Gaussian kernel (GK), and least squares-support vector machine (LS-SVM) algorithms.

With the development of communication technology, the demand for location-based services is growing rapidly. This paper presents an algorithm for indoor localization based on Received Signal Strength (RSS), which is collected from Access Points (APs). The proposed localization algorithm contains the offline information acquisition phase and online positioning phase. Firstly, the AP selection algorithm is reviewed and improved based on the stability of signals to remove useless AP; secondly, Kernel Principal Component Analysis (KPCA) is analyzed and used to remove the data redundancy and maintain useful characteristics for nonlinear feature extraction; thirdly, the Affinity Propagation Clustering (APC) algorithm utilizes RSS values to classify data samples and narrow the positioning range. In the online positioning phase, the classified data will be matched with the testing data to determine the position area, and the Maximum Likelihood (ML) estimate will be employed for precise positioning. Eventually, the proposed algorithm is implemented in a real-world environment for performance evaluation. Experimental results demonstrate that the proposed algorithm improves the accuracy and computational complexity.