Abstract

In fog computing systems, each fog node often maintains multiple interfaces to achieve simultaneous communications with end devices. To maximize the utilization of network capacities and avoid interference, a critical mission for each fog node is to allocate distinct channels to its interfaces, also known as multi-interface channel allocation, to maximize the total throughput by successful transmissions. However, the effective allocation scheme design is challenging because the full knowledge of channel state dynamics is often hard to attain in practice. Faced with such uncertainties, online learning is needed to cooperate with online decision making. In this article, we devise an integrated design to conduct such multi-interface channel allocation in fog computing systems. Specifically, by formulating the channel allocation problem in the settings of multiarmed bandit with multiple plays and leveraging Thompson sampling techniques, we propose a multi-interface channel allocation with binary feedback (MICA-B) scheme, which makes online channel allocation decisions through effective learning from binary transmission feedback. Our theoretical analysis shows that MICA-B achieves a sublinear O(logT) regret bound on the performance loss (also known as regret) over a finite time horizon T. Based on MICA-B, we further exploit structure information of channel characteristics and design constrained MICA-B (CoMICA-B) to improve learning efficiency. Further, we propose multi-interface channel allocation with multilevel feedback (MICA-M) which extends MICA to handle more general cases with multilevel feedback information. Our simulation results verify the effectiveness and robustness of MICA-B, CoMICA-B, and MICA-M in terms of regret reduction.

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