user selection
Recently Published Documents


TOTAL DOCUMENTS

576
(FIVE YEARS 122)

H-INDEX

27
(FIVE YEARS 4)

Author(s):  
Xing Zhang ◽  
Ashutosh Sabharwal

AbstractUser subset selection requires full downlink channel state information to realize effective multi-user beamforming in frequency-division duplexing (FDD) massive multi-input multi-output (MIMO) systems. However, the channel estimation overhead scales with the number of users in FDD systems. In this paper, we propose a novel propagation domain-based user selection scheme, labeled as zero-measurement selection, for FDD massive MIMO systems with the aim of reducing the channel estimation overhead that scales with the number of users. The key idea is to infer downlink user channel norm and inter-user channel correlation from uplink channel in the propagation domain. In zero-measurement selection, the base-station performs downlink user selection before any downlink channel estimation. As a result, the downlink channel estimation overhead for both user selection and beamforming is independent of the total number of users. Then, we evaluate zero-measurement selection with both measured and simulated channels. The results show that zero-measurement selection achieves up to 92.5% weighted sum rate of genie-aided user selection on the average and scales well with both the number of base-station antennas and the number of users. We also employ simulated channels for further performance validation, and the numerical results yield similar observations as the experimental findings.


2021 ◽  
Author(s):  
◽  
Refik Ustok

<p>The Shannon capacity of wireless networks has a fundamental importance for network information theory. This area has recently seen remarkable progress on a variety of problems including the capacity of interference networks, X networks, cellular networks, cooperative communication networks and cognitive radio networks. While each communication scenario has its own characteristics, a common reason of these recent developments is the new idea of interference alignment. The idea of interference alignment is to consolidate the interference into smaller dimensions of signal space at each receiver and use the remaining dimensions to transmit the desired signals without any interference. However, perfect alignment of interference requires certain assumptions, such as perfect channel state information at transmitter and receiver, perfect synchronization and feedback. Today’s wireless communication systems, on the other and, do not encounter such ideal conditions. In this thesis, we cover a breadth of topics of interference alignment and cancellation schemes in wireless communication systems such as multihop relay networks, multicell networks as well as cooperation and optimisation in such systems. Our main contributions in this thesis can be summarised as follows:  • We derive analytical expressions for an interference alignment scheme in a multihop relay network with imperfect channel state information, and investigate the impact of interference on such systems where interference could accumulate due to the misalignment at each hop.  • We also address the dimensionality problem in larger wireless communication systems such as multi-cellular systems. We propose precoding schemes based on maximising signal power over interference and noise. We show that these precoding vectors would dramatically improve the rates for multi-user cellular networks in both uplink and downlink, without requiring an excessive number of dimensions. Furthermore, we investigate how to improve the receivers which can mitigate interference more efficiently.  • We also propose partial cooperation in an interference alignment and cancellation scheme. This enables us to assess the merits of varying mixture of cooperative and non-cooperative users and the gains achievable while reducing the overhead of channel estimation. In addition to this, we analytically derive expressions for the additional interference caused by imperfect channel estimation in such cooperative systems. We also show the impact of imperfect channel estimation on cooperation gains.  • Furthermore, we propose jointly optimisation of interference alignment and cancellation for multi-user multi-cellular networks in both uplink and downlink. We find the optimum set of transceivers which minimise the mean square error at each base station. We demonstrate that optimised transceivers can outperform existing interference alignment and cancellation schemes.  • Finally, we consider power adaptation and user selection schemes. The simulation results indicate that user selection and power adaptation techniques based on estimated rates can improve the overall system performance significantly.</p>


2021 ◽  
Author(s):  
◽  
Refik Ustok

<p>The Shannon capacity of wireless networks has a fundamental importance for network information theory. This area has recently seen remarkable progress on a variety of problems including the capacity of interference networks, X networks, cellular networks, cooperative communication networks and cognitive radio networks. While each communication scenario has its own characteristics, a common reason of these recent developments is the new idea of interference alignment. The idea of interference alignment is to consolidate the interference into smaller dimensions of signal space at each receiver and use the remaining dimensions to transmit the desired signals without any interference. However, perfect alignment of interference requires certain assumptions, such as perfect channel state information at transmitter and receiver, perfect synchronization and feedback. Today’s wireless communication systems, on the other and, do not encounter such ideal conditions. In this thesis, we cover a breadth of topics of interference alignment and cancellation schemes in wireless communication systems such as multihop relay networks, multicell networks as well as cooperation and optimisation in such systems. Our main contributions in this thesis can be summarised as follows:  • We derive analytical expressions for an interference alignment scheme in a multihop relay network with imperfect channel state information, and investigate the impact of interference on such systems where interference could accumulate due to the misalignment at each hop.  • We also address the dimensionality problem in larger wireless communication systems such as multi-cellular systems. We propose precoding schemes based on maximising signal power over interference and noise. We show that these precoding vectors would dramatically improve the rates for multi-user cellular networks in both uplink and downlink, without requiring an excessive number of dimensions. Furthermore, we investigate how to improve the receivers which can mitigate interference more efficiently.  • We also propose partial cooperation in an interference alignment and cancellation scheme. This enables us to assess the merits of varying mixture of cooperative and non-cooperative users and the gains achievable while reducing the overhead of channel estimation. In addition to this, we analytically derive expressions for the additional interference caused by imperfect channel estimation in such cooperative systems. We also show the impact of imperfect channel estimation on cooperation gains.  • Furthermore, we propose jointly optimisation of interference alignment and cancellation for multi-user multi-cellular networks in both uplink and downlink. We find the optimum set of transceivers which minimise the mean square error at each base station. We demonstrate that optimised transceivers can outperform existing interference alignment and cancellation schemes.  • Finally, we consider power adaptation and user selection schemes. The simulation results indicate that user selection and power adaptation techniques based on estimated rates can improve the overall system performance significantly.</p>


2021 ◽  
Vol 2113 (1) ◽  
pp. 012025
Author(s):  
Yiyang Wu ◽  
Chang Chang ◽  
Fei Xie ◽  
Dacheng Ju ◽  
Yilun Pan

Abstract Average allocation of data rate to each user is inefficient since the resource a base station can allocate is limited. Thus, user selection and user scheduling need to be applied into multi-user massive multiple-input multiple-output (MIMO) downlink system. In this paper, we mainly focus on the methods of user selection. First, we establish a downlink system model including transmission model and channel model. Then, two user-rate based user selection algorithms via the signal-to-interference-plus-noise-ratio (SINR) are proposed, where the SINR is generated by MRC beamforming. Finally, simulation results are provided to compare the performance of two proposed algorithms and their fairness towards selected users. In the simulation results, location-based selection algorithm and random selection algorithm are jointly compared. The second proposed algorithm possesses the highest total sum-rate and is the optimal algorithms among the four algorithms.


Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1413
Author(s):  
Wuwei Huang ◽  
Yang Yang ◽  
Mingzhe Chen ◽  
Chuanhong Liu ◽  
Chunyan Feng ◽  
...  

In this paper, the optimization of network performance to support the deployment of federated learning (FL) is investigated. In particular, in the considered model, each user owns a machine learning (ML) model by training through its own dataset, and then transmits its ML parameters to a base station (BS) which aggregates the ML parameters to obtain a global ML model and transmits it to each user. Due to limited radio frequency (RF) resources, the number of users that participate in FL is restricted. Meanwhile, each user uploading and downloading the FL parameters may increase communication costs thus reducing the number of participating users. To this end, we propose to introduce visible light communication (VLC) as a supplement to RF and use compression methods to reduce the resources needed to transmit FL parameters over wireless links so as to further improve the communication efficiency and simultaneously optimize wireless network through user selection and resource allocation. This user selection and bandwidth allocation problem is formulated as an optimization problem whose goal is to minimize the training loss of FL. We first use a model compression method to reduce the size of FL model parameters that are transmitted over wireless links. Then, the optimization problem is separated into two subproblems. The first subproblem is a user selection problem with a given bandwidth allocation, which is solved by a traversal algorithm. The second subproblem is a bandwidth allocation problem with a given user selection, which is solved by a numerical method. The ultimate user selection and bandwidth allocation are obtained by iteratively compressing the model and solving these two subproblems. Simulation results show that the proposed FL algorithm can improve the accuracy of object recognition by up to 16.7% and improve the number of selected users by up to 68.7%, compared to a conventional FL algorithm using only RF.


Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1737
Author(s):  
Shu-Ming Tseng ◽  
Shih-Chun Kao

For symmetric non-orthogonal multiple access (NOMA)/multiple-input multiple-output (MIMO) systems, radio resource allocation is an important research problem. The optimal solution is of high computational complexity. Thus, one existing solution Kim et al. proposed is a suboptimal user selection and optimal power assignment for total data rate maximization. Another existing solution Tseng et al. proposed is different suboptimal user grouping and optimal power assignment for sum video distortion minimization. However, the performance of sub-optimal schemes by Kim et al. and Tseng et al. is still much lower than the optimal user grouping scheme. To approach the optimal scheme and outperform the existing sub-optimal schemes, a deep neural network (DNN) based approach, using the results from the optimal user selection (exhaustive search) as the training data, and a loss function modification specific for NOMA user selection to meet the constraint that a user cannot be in both the strong and weak set, and avoid the post processing online computational complexity, are proposed. The simulation results show that the theoretical peak signal-to-noise ratio (PSNR) of the proposed scheme is higher than the state-of-the-art suboptimal schemes Kim et al. and Tseng et al. by 0.7~2.3 dB and is only 0.4 dB less than the optimal scheme at lower online computational complexity. The online computational complexity (testing stage) of the proposed DNN user selection scheme is 60 times less than the optimal user selection scheme. The proposed DNN-based scheme outperforms the existing suboptimal solution, and slightly underperforms the optimal scheme (exhaustive search) at a much lower computation complexity.


PLoS ONE ◽  
2021 ◽  
Vol 16 (9) ◽  
pp. e0256892
Author(s):  
Yunfeng Wang ◽  
Mingzhen Li ◽  
Yang Xin ◽  
Guangcan Yang ◽  
Qifeng Tang ◽  
...  

In Location-Based Social Networks (LBSNs), registered users submit their reviews for visited point-of-interests (POIs) to the system providers (SPs). The SPs anonymously publish submitted reviews to build reputations for POIs. Unfortunately, the user profile and trajectory contained in reviews can be easily obtained by adversaries who SPs has compromised with. Even worse, existing techniques, such as cryptography and generalization, etc., are infeasible due to the necessity of public publication of reviews and the facticity of reviews. Inspired by pseudonym techniques, we propose an approach to exchanging reviews before users submit reviews to SPs. In our approach, we introduce two attacks, namely review-based location correlation attack (RLCA) and semantic-based long-term statistical attack (SLSA). RLCA can be exploited to link the real user by reconstructing the trajectory, and SLSA can be launched to establish a connection between locations and users through the difference of semantic frequency. To resist RLCA, we design a method named User Selection to Resist RLCA (USR-RLCA) to exchange reviews. We propose a metric to measure the correlation between a user and a trajectory. Based on the metric, USR-RLCA can select reviews resisting RLCA to exchange by suppressing the number of locations on each reconstructed trajectory below the correlation. However, USR-RLCA fails to resist SLSA because of ignoring the essential semantics. Hence, we design an enhanced USR-RLCA named User Selection to Resist SLSA (USR-SLSA). We first propose a metric to measure the indistinguishability of locations concerning the difference of semantic frequency in a long term. Then, USR-SLSA can select reviews resisting SLSA to exchange by allowing two reviews whose indistinguishability is below the probability difference after the exchange to be exchanged. Evaluation results verify the effectiveness of our approach in terms of privacy and utility.


Sign in / Sign up

Export Citation Format

Share Document