arXiv subjects

Shotaro Kamiya

Publications and source records attributed to Shotaro Kamiya.

3 recordsLinked to original sources

arXiv2021

Penalized and Decentralized Contextual Bandit Learning for WLAN Channel Allocation with Contention-Driven Feature Extraction

In this study, a contextual multi-armed bandit (CMAB)-based decentralized channel exploration framework disentangling a channel utility function (i.e., reward) with respect to contending neighboring access points (APs) is proposed. The proposed framework enables APs to evaluate observed rewards compositionally for contending APs, allowing both robustness against reward fluctuation due to neighboring APs' varying channels and assessment of even unexplored channels. To realize this framework, we propose contention-driven feature extraction (CDFE), which extracts the adjacency relation among APs under contention and forms the basis for expressing reward functions in the disentangled form, that is, a linear combination of parameters associated with neighboring APs under contention). This allows the CMAB to be leveraged with joint a linear upper confidence bound (JLinUCB) exploration and to delve into the effectiveness of the proposed framework. Moreover, we address the problem of non-convergence -- the channel exploration cycle -- by proposing a penalized JLinUCB (P-JLinUCB) based on the key idea of introducing a discount parameter to the reward for exploiting a different channel before and after the learning round. Numerical evaluations confirm that the proposed method allows APs to assess the channel quality robustly against reward fluctuations by CDFE and achieves better convergence properties by P-JLinUCB.

cs.NI↗

arXiv2019

Deep Reinforcement Learning-Based Channel Allocation for Wireless LANs with Graph Convolutional Networks

Last year, IEEE 802.11 Extremely High Throughput Study Group (EHT Study Group) was established to initiate discussions on new IEEE 802.11 features. Coordinated control methods of the access points (APs) in the wireless local area networks (WLANs) are discussed in EHT Study Group. The present study proposes a deep reinforcement learning-based channel allocation scheme using graph convolutional networks (GCNs). As a deep reinforcement learning method, we use a well-known method double deep Q-network. In densely deployed WLANs, the number of the available topologies of APs is extremely high, and thus we extract the features of the topological structures based on GCNs. We apply GCNs to a contention graph where APs within their carrier sensing ranges are connected to extract the features of carrier sensing relationships. Additionally, to improve the learning speed especially in an early stage of learning, we employ a game theory-based method to collect the training data independently of the neural network model. The simulation results indicate that the proposed method can appropriately control the channels when compared to extant methods.

eess.SP↗

arXiv2018

Asymptotic Analysis of Normalized SNR-Based Scheduling in Uplink Cellular Networks with Truncated Channel Inversion Power Control

This paper provides the signal-to-interference-plus-noise ratio (SINR) complimentary cumulative distribution function (CCDF) and average data rate of the normalized SNR-based scheduling in an uplink cellular network using stochastic geometry. The uplink analysis is essentially different from the downlink analysis in that the per-user transmit power control is performed and that the interferers are composed of at most one transmitting user in each cell other than the target cell. In addition, as the effect of multi-user diversity varies from cell to cell depending on the number of users involved in the scheduling, the distribution of the number of users is required to obtain the averaged performance of the scheduling. This paper derives the SINR CCDF relative to the typical scheduled user by focusing on two incompatible cases, where the scheduler selects a user from all the users in the corresponding Voronoi cell or does not select users near cell edges. In each case, the SINR CCDF is marginalized over the distribution of the number of users involved in the scheduling, which is asymptotically correct if the BS density is sufficiently large or small. Through the simulations, the accuracies of the analytical results are validated for both cases, and the scheduling gains are evaluated to confirm the multi-user diversity gain.

cs.IT↗