A linearly convergent method for broadcast data allocation

https://doi.org/10.1016/j.camwa.2007.12.012Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Mobile computing
Broadcast scheme
Data allocation
NP-hard
Gradient

Cited by (0)

This work is partially supported by the National Science Council (NSC) of Taiwan under Grant No. NSC-93-2213-E005-026.