SPSep 14, 2022
Joint User and Data Detection in Grant-Free NOMA with Attention-based BiLSTM NetworkSaud Khan, Salman Durrani, Muhammad Basit Shahab et al.
We consider the multi-user detection (MUD) problem in uplink grant-free non-orthogonal multiple access (NOMA), where the access point has to identify the total number and correct identity of the active Internet of Things (IoT) devices and decode their transmitted data. We assume that IoT devices use complex spreading sequences and transmit information in a random-access manner following the burst-sparsity model, where some IoT devices transmit their data in multiple adjacent time slots with a high probability, while others transmit only once during a frame. Exploiting the temporal correlation, we propose an attention-based bidirectional long short-term memory (BiLSTM) network to solve the MUD problem. The BiLSTM network creates a pattern of the device activation history using forward and reverse pass LSTMs, whereas the attention mechanism provides essential context to the device activation points. By doing so, a hierarchical pathway is followed for detecting active devices in a grant-free scenario. Then, by utilising the complex spreading sequences, blind data detection for the estimated active devices is performed. The proposed framework does not require prior knowledge of device sparsity levels and channels for performing MUD. The results show that the proposed network achieves better performance compared to existing benchmark schemes.
LGApr 17, 2022
Federated Learning Cost Disparity for IoT DevicesSheeraz A. Alvi, Yi Hong, Salman Durrani
Federated learning (FL) promotes predictive model training at the Internet of things (IoT) devices by evading data collection cost in terms of energy, time, and privacy. We model the learning gain achieved by an IoT device against its participation cost as its utility. Due to the device-heterogeneity, the local model learning cost and its quality, which can be time-varying, differs from device to device. We show that this variation results in utility unfairness because the same global model is shared among the devices. By default, the master is unaware of the local model computation and transmission costs of the devices, thus it is unable to address the utility unfairness problem. Also, a device may exploit this lack of knowledge at the master to intentionally reduce its expenditure and thereby enhance its utility. We propose to control the quality of the global model shared with the devices, in each round, based on their contribution and expenditure. This is achieved by employing differential privacy to curtail global model divulgence based on the learning contribution. In addition, we devise adaptive computation and transmission policies for each device to control its expenditure in order to mitigate utility unfairness. Our results show that the proposed scheme reduces the standard deviation of the energy cost of devices by 99% in comparison to the benchmark scheme, while the standard deviation of the training loss of devices varies around 0.103.
94.2ITMay 1
Artificial-Noise Aided Design for Movable-Antenna Enabled Physical-Layer Service IntegrationZhifeng Tang, Guangchen Wang, Nan Yang et al.
This paper pioneers a novel scheme for artificial-noise (AN)-aided movable-antenna (MA)-enabled physical-layer service integration (PLSI) to harmonize the simultaneous delivery of multicast and confidential messages. By jointly exploiting the spatial reconfiguration capability of MAs and the interference shaping capability of AN, we aim to enhance secrecy performance while guaranteeing multicast reliability. The joint design of MA positions and transmit variables results in a highly coupled and non-convex optimization problem. To address this, we first provide key insights into the role of spatial degrees of freedom in AN design. We then characterize the AN direction under a structured transmission design and derive a closed-form expression for the AN-to-confidential power allocation ratio, which significantly simplifies the overall design. To solve the resulting problem, we further develop a low-complexity block coordinate ascent (BCA)-based scheme that alternates between transmit design and MA position optimization. Numerical results demonstrate that the proposed scheme achieves significant secrecy performance gains with low computational complexity and fast convergence, highlighting its effectiveness for MA-enabled PLSI systems.
LGSep 11, 2021
Utility Fairness for the Differentially Private Federated LearningSheeraz A. Alvi, Yi Hong, Salman Durrani
Federated learning (FL) allows predictive model training on the sensed data in a wireless Internet of things (IoT) network evading data collection cost in terms of energy, time, and privacy. In this paper, for a FL setting, we model the learning gain achieved by an IoT device against its participation cost as its utility. The local model quality and the associated cost differs from device to device due to the device-heterogeneity which could be time-varying. We identify that this results in utility unfairness because the same global model is shared among the devices. In the vanilla FL setting, the master is unaware of devices' local model computation and transmission costs, thus it is unable to address the utility unfairness problem. In addition, a device may exploit this lack of knowledge at the master to intentionally reduce its expenditure and thereby boost its utility. We propose to control the quality of the global model shared with the devices, in each round, based on their contribution and expenditure. This is achieved by employing differential privacy to curtail global model divulgence based on the learning contribution. Furthermore, we devise adaptive computation and transmission policies for each device to control its expenditure in order to mitigate utility unfairness. Our results show that the proposed scheme reduces the standard deviation of the energy cost of devices by 99% in comparison to the benchmark scheme, while the standard deviation of the training loss of devices varies around 0.103.