A linearly convergent method for broadcast data allocation

Authors:
Kuen-Fang Jea;Jen-Ya Wang;Shih-Ying Chen
Affiliations:
Department of Computer Science and Engineering, National Chung-Hsing University, Taichung 40227, Taiwan, ROC;Department of Computer Science and Engineering, National Chung-Hsing University, Taichung 40227, Taiwan, ROC and Department of Computer Science and Information Management, Hungkuang University, Sh ...;Department of Computer Science and Information Engineering, National Taichung Institute of Technology, 40401, Taiwan, ROC
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 8
Cited 3

Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables
Introduction to Algorithms

Introduction to Algorithms
Efficient Data Allocation over Multiple Channels at Broadcast Servers

IEEE Transactions on Computers
Efficient channel allocation tree generation for data broadcasting in a mobile computing environment

Wireless Networks
Dynamic leveling: adaptive data broadcasting in a mobile computing environment

Mobile Networks and Applications
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment

IEEE Transactions on Knowledge and Data Engineering
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel

IEEE Transactions on Computers
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast

Proceedings of the 6th international conference on Mobile data management

A near-optimal database allocation for reducing the average waiting time in the grid computing environment

Information Sciences: an International Journal
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries

International Journal of Grid and High Performance Computing
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries

International Journal of Grid and High Performance Computing

Quantified Score

Hi-index	0.09

Visualization

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 R^n. 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.