An Improved Distributed Gradient-Push Algorithm for Bandwidth Resource Allocation over Wireless Local Area Network

Bandwidth allocation problems over wireless local area network have attracted extensive research recently due to the rapid growth in the number of users and bandwidth-intensive applications. In this paper, a bandwidth allocation problem over wireless local area network with directed topologies is investigated and the global objective function of the problem consists of local downloading and uploading cost with both constraints of feasible allocation region and network resources. An improved high-efficiency gradient-push algorithm is proposed for the bandwidth allocation problem which not only guarantees successful data transmission but also minimizes the global objective function. Compared with the existing distributed algorithms, firstly, we use weighted running average bandwidth to replace the current state variables which can ensure the solution converge to the optimal value asymptotically with probability one. Next, noisy gradient samples are used in the proposed algorithm instead of accurate gradient information which enhances the robustness and expands the scope of application. Theoretical analysis shows the convergence rate of the time-averaged value to the optimal solution. Finally, numerical examples are presented to validate the proposed algorithm.