Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474268 | Computers & Mathematics with Applications | 2008 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Kuen-Fang Jea, Jen-Ya Wang, Shih-Ying Chen,