A linearly convergent method for broadcast data allocation

In this paper, we deal with an NP-hard minimization problem, performing data allocation over multiple broadcast channels in the wireless environment. Our idea is to solve the discrete case of such a problem by the concept of gradient in the Euclidean space Rn. The theoretical basis of the novel idea ensures the near-optimality of our solution. Furthermore, the experimental results show that the problem can be solved quickly.