The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2009 vol.8)
pp: 694-708
Hao-Ping Hung , National Taiwan University, Taipei
Ming-Syan Chen , National Taiwan University, Taipei
We explore in this paper the problem of generating broadcast programs in a heterogeneous data broadcasting environment, in which disseminated data items can be of different sizes. Given the broadcast database and the number of channels, we first derive the analytical model of the heterogeneous data broadcasting to obtain the average waiting time of mobile users, and prove the allocation problem as an NP-complete problem. In order to solve such problem, we propose a two-phase architecture to perform channel allocation. Algorithm DRP (Dimension Reduction Partitioning) is employed to perform rough allocation to derive the satisfactory solutions, whereas mechanism CDMS (Cost-Diminishing Movement Selection) is used for fine allocation to achieve local optimum solutions. In addition, we also propose algorithm GA-CDMS according to the concept of hybrid genetic algorithm for comparison purposes. GA-CDMS can perform global search more accurately and efficiently than conventional genetic algorithm GA and the suboptimum that GA-CDMS achieves will be very close to the optimal solution. In the experiments, we consider the important issues such as accuracy, scalability, diversity and the efficiency. From the experimental results, we show that the proposed two-phase channel allocation is very practical in performing an effective channel allocation with high efficiency in a heterogeneous broadcasting environment.
Database Management, Access methods
Hao-Ping Hung, Ming-Syan Chen, "On Channel Allocation for Heterogeneous Data Broadcasting", IEEE Transactions on Mobile Computing, vol.8, no. 5, pp. 694-708, May 2009, doi:10.1109/TMC.2008.148
[1] D. Barbará, “Mobile Computing and Database—A Survey,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, pp. 108-117, Jan./Feb. 1999.
[2] J. Xu, X. Tang, and D. Lee, “Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 2, pp.474-488, Mar./Apr. 2003.
[3] M. Satyanarayanan, “Pervasive Computing: Vision and Challenges,” IEEE Personal Comm., vol. 8, no. 4, pp. 10-17, Aug. 2001.
[4] C.H. Hsu, G. Lee, and A.L.P. Chen, “An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels,” Distributed and Parallel Databases, vol. 18, no. 3, 2005.
[5] J.-L. Huang and M.-S. Chen, “Broadcasting Dependent Data for Ordered Queries without Replication in a Multi-Channel Mobile Environment,” Proc. 19th IEEE Int'l Conf. Data Eng. (ICDE '03), Mar. 2003.
[6] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air: Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 353-372, May/June 1997.
[7] J.-L. Huang and M.-S. Chenn, “Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 6, June 2004.
[8] 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.
[9] 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.
[10] B. Zheng, X. Wu, X. Jin, and D.L. Lee, “TOSA: A Near-Optimal Scheduling Algorithm for Multi-Channel Data Broadcast,” Proc. Sixth Int'l Conf. Mobile Data Management (MDM '05), 2005.
[11] J.-L. Huang and M.-S. Chen, “Broadcast Program Generation for Unordered Queries with Data Replication,” Proc. ACM Symp. Applied Computing (SAC '03), Mar. 2003.
[12] S. Acharya and S. Muthukrishuan, “Scheduling On-Demand Broadcasts: New Metrics and Algorithm,” Proc. ACM MobiCom, 1998.
[13] C.C. Aggarwal, J.L. Wolf, and P.S. Yu, “A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems,” Proc. Int'l Conf. Multimedia Computing and Systems (ICMCS '96), 1996.
[14] L.-S. Juhn and L.-M. Tseng, “Fast Data Broadcasting and Receiving Scheme for Popular Video Service,” IEEE Trans. Broadcasting, vol. 44, no. 1, Mar. 1998.
[15] S. Viswanathan and T. Imielinski, “Pyramid Broadcasting for Video-on-Demand Service,” Proc. SPIE Multimedia Computing and Networking Conf. (MMCN '95), 1995.
[16] D.E. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
[17] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[18] S. Acharya, R. Alonso, M.J. Franklin, and S.B. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communications Environments,” Proc. ACM SIGMOD, pp. 199-210, May 1995.
[19] J.W. Wong, “Broadcast Delivery,” Proc. IEEE, vol. 76, no. 12, pp.1566-1577, Dec. 1988.
[20] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. McGraw-Hill.
[21] F. Martinez, J. Gonzalez, and I. Stojmenovic, “A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients-Providers-Servers Systems,” Proc. Seventh IEEE Symp. Computers and Comm. (ISCC '02), 2002.
[22] Y. Chung and M. Kim, “Efficient Data Placement for Wireless Broadcast,” Distributed and Parallel Database, vol. 9, no. 2, Mar. 2001.
[23] C.J. Su and L. Tassiulas, “Broadcast Scheduling for Information Distribution,” Proc. IEEE INFOCOM, 1997.
[24] N.H. Vaidya and S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environments,” ACM/Baltzer Wireless Networks, vol. 5, no. 3, pp. 171-182, 1999.
[25] S. Hameed and N.H. Vaidya, “Efficient Algorithms for Scheduling Data Broadcast,” ACM/Baltzer Wireless Networks, vol. 5, no. 3, pp.183-193, 1999.
[26] D. Aksoy and M.J. Franklin, “Scheduling for Large Scale On-Demand Data Broadcasting,” Proc. IEEE INFOCOM, 1998.
[27] J.-L. Huang, M.-S. Chen, and H.-P. Hung, “A QoS-Aware Transcoding Proxy Using On-Demand Data Broadcasting,” Proc. IEEE INFOCOM, Mar. 2004.
[28] Y. Wu and G. Cao, “Stretch-Optimal Scheduling for On-Demand Data Broadcasts,” Proc. 10th Int'l Conf. Computer Comm. and Networks (ICCCN '97), 1997.
[29] D. Aksoy and M.S. Leung, “Pull versus Push: A Quantitative Comparison for Data Broadcast,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '04), 2004.
[30] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[31] M.-S. Chen, P.S. Yu, and K.-L. Wu, “Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 1, Jan./Feb. 2003.
[32] S.-C. Lo and A.L. Chen, “Optimal Index and Data Allocation in Multiple Broadcast Channels,” Proc. 16th IEEE Int'l Conf. Data Eng. (ICDE '00), pp. 293-302, 2000.
[33] C.-L. Hu and M.-S. Chen, “Adaptive Multi-Channel Data Dissemination: Support of Dynamic Traffic Awareness and Push-Pull Time Balance,” IEEE Trans. Vehicular Technology, vol. 54, no. 2, 2005.
[34] T. Imielinski and B.R. Badrinath, “Wireless Mobile Computing: Challenges in Data Management,” Comm. ACM, vol. 37, no. 10, 1994.
[35] H.P. Hung and M.S. Chen, “Efficient Data Broadcasting by Progressively Merging and Splitting,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '06), 2006.
[36] W.-C. Peng, J.-L. Huang, and M.S. Chen, “Dynamic Leveling: Adaptive Data Broadcasting in a Mobile Computing Environment,” Mobile Networks and Applications, vol. 8, no. 4, pp. 355-364, 2003.
[37] J.M.R. Dondo and R.G. Valle, “An Optimal Power System Model Order Reduction Technique,” Int'l J. Electrical Power and Energy Systems, vol. 26, no. 7, pp. 493-500, Sept. 2004.
[38] Y.B. Park, “A Hybrid Genetic Algorithm for the Vehicle Scheduling Problem with Due Times and Time Deadlines,” Int'l J. Production Economics, vol. 73, no. 2, pp. 175-188, 2001.
[39] J. Andre, P. Siarry, and T. Dognon, “An Improvement of the Standard Genetic Algorithm Fighting Premature Convergence in Continuous Optimization,” Advances in Eng. Software, vol. 32, no. 12, pp. 49-60, Jan. 2001.
[40] A.G. Williamson, “Refining a Neural Network Credit Application Vetting System with a Genetic Algorithm,” J. Microcomputer Applications, vol. 18, no. 3, pp. 261-277, July 1995.
[41] D.B. Fogel, “An Introduction to Simulated Evolutionary Optimization,” IEEE Trans. Neural Networks, vol. 5, no. 1, pp. 3-14, Jan. 1994.
[42] G. Syswerda, “Uniform Crossover in Genetic Algorithms,” Proc. Third Int'l Conf. Genetic Algorithms (ICGA '89), 1989.
[43] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, second extended ed. Springer, 1994.
[44] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programming, second ed. Springer, 1994.
[45] G.K. Zipf, Human Behaviour and the Principle of Least Effort. Addison-Wesley, 1949.
[46] V. Padmanabhan and L. Qiu, “The Content and Access Dynamics of a Busy Web Site: Findings and Implications,” Proc. ACM SIGCOMM, 2000.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool