Kablosuz Haberleşme Aǧlarinda Adil Veri Toplama

This conference paper handles a problem of collecting data in wireless communications networks where data fusion center (DFC) receive data from M node each of which has an infinite-capacity buffer. At each time, DFC select a group nodes for receiving data from them. DFC does not know either buffer state of nodes, or statistic of their data arrival processes; it just has knowledge about outcome of each previously-made transmission attempt. Deriving low-complex algorithm is aimed to achieve maximum sum-throughput. Unless its buffer is empty, a scheduled node can transmit 1 packet to DFC. This paper applies low-complex solution to the problem at hand. The applied solution was demonstrated to achieve asymptotical-optimal fairness thru infinite time horizon. Numerical results show that the applied technique achieves nearly optimality in fairness thru infinite time horizon even with reasonably finite-capacity buffer.