A Novel Distributed Algorithm for Constrained Resource Allocation

The problem of coordinated resource allocation in a distributed network of multiple nodes with constrained heterogeneous abilities is investigated in this paper, where resources on nodes are evenly distributed over the network for constrained coordination. The problem is essentially challenging in view of that the nodes with weak abilities may result in local minima and block the global optimization. To handle such a heterogeneous problem, a distributed coordination algorithm is developed. A theorem and its proof are presented for guaranteeing the convergence and stability of the proposed distributed algorithm. In addition, an approximated smooth formed approximation of the algorithm is presented for ease of implementation. Finally, an illustrative example is provided and analyzed to substantiate the efficacy of the proposed algorithm.