Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

Chih-Hao Hsu1, Guanling LeeContact Information and Arbee L. P. Chen3

(1)  Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, 300, Republic of China
(2)  Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan, 973, Republic of China
(3)  Department of Computer Science, National Chengchi University, Taipei, Taiwan, Republic of China

Abstract  In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, a minimal expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the minimal expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.

Keywords  wireless environment - multiple broadcast channels - data allocation - broadcast program


Contact Information Guanling Lee
Email: guanling@mail.ndhu.edu.tw
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this article
Export this article as RIS | Text
 
Referenced by
1 newer article

  1. Tsai, Hsiao-Ping (2009) . IEEE Transactions on Mobile Computing 8(5)
    [CrossRef]
Remote Address: 38.107.191.110 • Server: mpweb04
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)