Kablosuz aǧlarda adil veri toplama

This work tackles a data collection problem in wireless networks where an unmanned aerial vehicle (UAV) collects data from M nodes with infinite-sized buffers. In each time slot, UAV choose a subset of robots to collect data from them. UAV knows neither buffer states of robots, nor statistics of data arrival process; it only has information on outcomes of previous transmission attempts. It aims to derive low-complexity algorithms achieving maximum total throughput. Whenever being scheduled, a robot can send one data packet to UAV unless its buffer is empty. A low-complexity algorithm is suggested for the problem. The proposed algorithm is shown to achieve near-optimal fairness over finite time horizon. Numerical results demonstrate that even with reasonable finite-sized buffers, the proposed algorithm is near-optimal fair over finite time horizons.