Yonggang Kim

Machine learning techniques have attracted considerable attention for wireless networks because of their impressive performance in complicated scenarios and usefulness in various applications. However, training with and sharing raw data obtained locally from each wireless node does not guarantee privacy and requires a large communication overhead. To mitigate such issues, federated learning (FL), in which sharing parameters for model updates are shared instead of raw data, has been developed. FL has also been studied using blockchain techniques to efficiently perform learning in distributed wireless systems without having to deploy a centralized server. Although blockchain-based decentralized federated learning (BDFL) is a promising technique for various wireless sensor networks, malicious attacks can still occur, which result in performance degradation or malfunction. In this study, we analyze the impact of a jamming threats from malicious miners to BDFL in wireless networks. In a wireless BDFL system, it is possible for malicious miners with jamming capability to interfere with the collection of model parameters by normal miners, thus preventing the victim miner from generating a global model. By disrupting normal miners participating in BDFL systems, malicious miners with jamming capability can more easily add malicious data to the mainstream. Through various simulations, we evaluated the success probability performance of malicious block insertion and the participation rate of normal miners in a wireless BDFL system.

In high-density network environments with multiple access points (APs) and stations, individual uplink scheduling by each AP can severely interfere with the uplink transmissions of neighboring APs and their associated stations. In congested areas where concurrent uplink transmissions may lead to significant interference, it would be beneficial to deploy a cooperative scheduler or a central coordinating entity responsible for orchestrating cooperative uplink scheduling by assigning several neighboring APs to support the uplink transmission of a single station within a proximate service area to alleviate the excessive interference. Cooperative uplink scheduling facilitated by cooperative information sharing and management is poised to improve the likelihood of successful uplink transmissions in areas with a high concentration of APs and stations. Nonetheless, it is crucial to account for the queue stability of the stations and the potential delays arising from information exchange and the decision-making process in uplink scheduling to maintain the overall effectiveness of the cooperative approach. In this paper, we propose a Lyapunov drift-plus-penalty framework-based cooperative uplink scheduling method for densely populated Wi-Fi networks. The cooperative scheduler aggregates information, such as signal-to-interference-plus-noise ratio (SINR) and queue status. During the aggregation procedure, propagation delays are also estimated and utilized as a value of expected cooperation delays in scheduling decisions. Upon aggregating the information, the cooperative scheduler calculates the Lyapunov drift-plus-penalty value, incorporating a predefined model parameter to adjust the system accordingly. Among the possible scheduling candidates, the proposed method proceeds to make uplink decisions that aim to reduce the upper bound of the Lyapunov drift-plus-penalty value, thereby improving the network performance and stability without a severe increase in cooperation delay in highly congested areas. Through comprehensive performance evaluations, the proposed method effectively enhances network performance with an appropriate model parameter. The performance improvement is particularly notable in highly congested areas and is achieved without a severe increase in cooperation delays.