Abstract

In view of the wireless channel complexity in refuge chamber environments, we parameterize the channel characteristics for reliable signal propagation under line-of-sight (LoS) and non-line-of-sight (NLoS) conditions. According to the Saleh-Valenzuela channel model, the multipath components (MPCs) arrive at the receiver in cluster form. Therefore, clustering algorithms are required to identify clusters. However, the drawback of conventional KMeans and KPowerMeans algorithms is their limitation to an a priori cluster number. In this paper, we propose a clustering algorithm that uses a fitted curve to intersect the slope curve of the normalized power delay profile (PDP). The effectiveness of the proposed algorithm is verified based on the statistical measurement data by comparison with the conventional KMeans and KPowerMeans algorithms. Based on the clustering results, we explore the distribution of the cluster arrival delay and cluster power. We then analyze the probability density function (PDF) of the first MPC arrival delay in each cluster by comparison with conventional models. Finally, we investigate the path loss exponent (PLE) and shadow fading factor of the large-scale path loss. The outcomes of this paper is in the provision of theoretical support for mobile communications in refuge chamber environments.

Full Text
Published version (Free)

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