The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2008 vol.20)
pp: 668-677
ABSTRACT
Existing methods of scheduling data items over multiple wireless broadcast channels focus on the assignment of a data item to a channel. But data items are not allocated more than once per broadcast cycle to a single channel. Our scheme considers the numbers of copies of a data item that should be allocated in the context of the channel assignment problem, and aims to reduce the average data access time by allocating a popular data item more than once per cycle to the channel to which it is assigned. The number of times that each data item is allocated reflects its access probability. Simulation results show that our scheme reduces the average expected delay, especially when there are few channels.
INDEX TERMS
Mobile Computing, Databases
CITATION
Song-Yi Yi, Seunghoon Nam, Sungwon Jung, "Effective Generation of Data Broadcast Schedules with Different Allocation Numbers for Multiple Wireless Channels", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 5, pp. 668-677, May 2008, doi:10.1109/TKDE.2007.190736
REFERENCES
[1] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communication Environments,” Proc. ACM SIGMOD '95, pp. 199-210, May 1995.
[2] K. Prabhakara, K.A. Hua, and J. Oh, “Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment,” Proc. Int'l Conf. Data Eng. (ICDE '00), pp. 167-176, 2000.
[3] W.C. Peng and M.S. Chen, “Dynamic Generation of Data Broadcasting Programs for Broadcast Disk Arrays in a Mobile Computing Environment,” Proc. ACM Conf. Information and Knowledge Management (CIKM '00), pp. 35-45, Nov. 2000.
[4] W.G. Yee, S.B. Navathe, E. Omiecinski, and C. Jermaine, “Efficient Data Allocation over Multiple Channels at Broadcast Servers,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1231-1236, Oct. 2002.
[5] E. Ardizzoni, A. Bertossi, M. Pinotti, S. Ramaprasad, R. Rizzi, and M. Shashanka, “Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel,” IEEE Trans. Computers, vol. 53, no. 5, pp. 558-572, May 2005.
[6] D. Katsaros and Y. Manolopoulos, “Broadcast Program Generation for Webcasting,” Data and Knowledge Eng., vol. 49, no. 1, pp. 1-21, 2003.
[7] C.-H. Hsu, G. Lee, and A. Chen, “Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies,” Proc. Third Int'l Conf. Mobile Data Management (MDM '02), pp. 87-93, Jan. 2002.
[8] W.C. Lee, Q. Hi, and D.L. Lee, “A Study on Channel Allocation for Data Dissemination in Mobile Computing Environments,” J.Mobile Networks and Applications, vol. 4, pp. 117-129, 1999.
[9] N.H. Vaidya and S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environments,” J. Mobile Networks and Applications, vol. 5, pp. 171-182, 1999.
[10] J.W. Wong, “Broadcast Delivery,” Proc. IEEE, vol. 76, no. 12, pp.1566-1577, 1988.
[11] M.H. Ammar and J.W. Wong, “On the Optimality of Cyclic Transmission in Teletext Systems,” IEEE Trans. Comm., vol. 35, no. 1, pp. 68-73, 1987.
[12] W.G. Yee, E. Omiecinski, and S.B. Navathe, Efficient Data Allocation for Broadcast Disk Arrays. Georgia Inst. Technology, Technical Report GIT-CC-02-20, 2001.
[13] S.C. Chanpra and R.P. Canale, Numerical Methods for Engineers with Programming and Software Applications. McGraw-Hill, pp. 153-159,
[14] S. Acharya, M. Franklin, and S. Zdonik, “Balancing Push and Pull for Data Broadcast,” Proc. ACM SIGMOD '97, pp. 183-194, May 1997.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool