Browse > Article
http://dx.doi.org/10.7236/JIWIT.2012.12.1.17

A Near Optimal Data Allocation Scheme for Multiple Broadcast-Channel Environments  

Kwon, Hyeok-Min (Dept. of Information and Communication System, Semyung University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.12, no.1, 2012 , pp. 17-27 More about this Journal
Abstract
Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.
Keywords
Data allocation; broadcast schedule; dynamic programming;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 S. Acharya, "Broadcast Disks: Disseminationbased Data Management for Asymmetric Communication Environments," Ph.D. thesis, Brown University, 1998.
2 M. Franklin and S. Zdonik, "A Framework for Scalable Dissemination-Based Systems," In the Int. Conf. on Object-Oriented Programming Languages, Systems, and Applications, pp. 94-105, Atlanta, GA, October 1997.
3 M. Franklin and S. Zdonik, "Data in Your Face: Push Technology in Perspective," Proc. of the 1998 ACM SIGMOD Int. Conf. on Management of Data, pp. 516-519, Seattle, WA, June 1998.
4 N.H. Vaidya and S. Hameed, "Scheduling Data Broadcast in Asymmetric Communication Environments," Wireless Networks, Vol. 5, No. 3, pp. 171-182, May 1999.   DOI
5 J.W. Wong, "Broadcast Delivery," Proc. of the IEEE, Vol. 76, No. 12, pp. 1566-1577, 1988.   DOI
6 W.C. Peng and M.S. Chen, "Efficient Channel Allocation Tree Generation for Data Broadcasting in A Mobile Computing Environment," Wireless Networks, Vol. 9, No. 2, pp. 117-129, 2003.   DOI   ScienceOn
7 W.G. Yee, S. Navathe, E. Omiecinski, and C. Jermaine, "Efficient Data Allocation over Multiple Channels at Broadcast Servers," IEEE Trans. on Computers, Vol. 51, No. 10, pp. 1231-1236, Oct. 2002.   DOI
8 S. Wang and H.L. Chen, "An O(N log K) Restricted Dynamic Programming Algorithm for Data Allocation over Multiple Channels," IEICE trans. on communications, Vol. E88-B, No. 9, pp. 3756-3764, Sep. 2005.   DOI
9 S. Wang and H.L. Chen, "Near-optimal Data Allocation over Multiple Broadcast Channels," Computer communications, Vol. 29, No. 9, pp. 1341-1349, Elsevier Science, 2006.   DOI
10 H.M. Kwon, "TLDP: A New Broadcast Scheduling Scheme for Multiple Broadcast- Channel Environments," The Journal of the Institute of Webcasting, Internet and Telecommunication, Vol. 11, No. 2, pp. 63-72, 2011.
11 C. Hsu, G. Lee, A.L.P. Chen, "A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels," Proc. ACM 10th Int. Conf. CIKM, Atlanta, Georgia, pp. 303-309, 2001.