This Article 
 Bibliographic References 
 Add to: 
Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems
April 2008 (vol. 20 no. 4)
pp. 504-518
We present a new adaptive and energy-efficient broadcast dissemination model that supports flexible responses to client requests. In current broadcast dissemination models, clients must specify precisely what documents they require, and servers disseminate exactly those documents. This approach can be impractical, since in practice, clients may know the characteristics of the documents, but not the document names or IDs. In our model, clients specify the required document using attributes, and servers broadcast documents that match client requests at a prespecified level of similarity. A single document may satisfy several clients, so the server broadcasts a minimal set of documents that achieves a desired level of satisfaction in the client population. We introduce a mechanism for the server to obtain randomized feedback from clients to adapt its broadcast program to client needs. Finally, the server integrates a selective tune-in scheme based on approximate index matching to allow clients to conserve energy. Our simulation results show that our model captures client interest patterns efficiently and accurately and scales very well with the number of clients, while reducing overall client average waiting times. The selective tune-in scheme can considerably reduce the consumption of client energy with moderate waiting time overhead.

[1] W. Wang and C.V. Ravishankar, “Adaptive Data Broadcasting in Asymmetric Communication Environments,” Proc. Eighth IEEE Int'l Database Eng. and Applications Symp. (IDEAS '04), pp. 27-36, 2004.
[2] B. Xu, O. Wolfson, and S. Chamberlain, “Cost Based Data Dissemination in Broadcast Networks with Disconnection,” Proc. Eighth Int'l Conf. Database Theory (ICDT '01), pp. 114-128, 2001.
[3] B. Xu, O. Wolfson, S. Chamberlain, and N. Rishe, “Cost-Based Data Dissemination in Satellite Networks,” Mobile Networks and Applications, vol. 7, no. 1, pp. 49-66, 2002.
[4] W.G. Yee, S.B. Navathe, E. Omiecinski, and C. Jermaine, “Efficient Data Allocation over Multiple Channels at Broadcast Servers,” IEEE Trans. Computers, Oct. 2002.
[5] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communications Environments,” Proc. ACM SIGMOD, 1995.
[6] S. Hameed and N.H. Vaidya, “Efficient Algorithms for Scheduling Data Broadcast,” ACM/Baltzer J. Wireless Networking., vol. 5, no. 3, pp. 183-193, 1999.
[7] C.-J. Su and L. Tassiulas, “Joint Broadcast Scheduling and User's Cache Management for Efficient Information Delivery,” Proc. ACM MobiCom '98, pp. 33-42, 1998.
[8] T. Hara, “Cooperative Caching by Mobile Clients in Push-Based Information Systems,” Proc. 11th ACM Int'l Conf. Information and Knowledge Management (CIKM '02), pp. 186-193, 2002.
[9] G. Herman, G. Gopal, K.C. Lee, and A. Weinrib, “The Datacycle Architecture for Very High Throughput Database Systems,” Proc. ACM SIGMOD '87, pp. 97-103, June 1987.
[10] T.F. Bowen, G. Gopal, G. Herman, T. Hickey, K.C. Lee, W.H. Mansfield, J. Raitz, and A. Weinrib, “The Datacycle Architecture,” Comm. ACM, vol. 35, no. 12, Dec. 1992.
[11] Los Angeles Times, paper/ mediacenterla-mediacenter-20% 02-06.htmlstory , 2007.
[12] CNN's Newswatch,, 2007.
[13] Battlefield of the Future, battlebftoc.html, 2007.
[14] S. Acharya, M. Franklin, and S. Zdonik, “Dissemination-Based Data Delivery Using Broadcast Disks,” IEEE Personal Comm., vol. 2, no. 6, 1995.
[15] S. Acharya, M. Franklin, and S. Zdonik, “Balancing Push and Pull for Data Broadcast,” Proc. ACM SIGMOD, 1997.
[16] K. Stathatos, N. Roussopoulos, and J.S. Baras, “Adaptive Data Broadcast in Hybrid Networks,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB), 1997.
[17] Q. Hu, D.-L. Lee, and W.-C. Lee, “Dynamic Data Delivery in Wireless Communication Environments,” Proc. W3C Workshop Mobile Data Access '98, pp. 213-224, Nov. 1998.
[18] J.-H. Hu, K. Yeung, G. Feng, and K. Leung, “A Novel Push-and-Pull Hybrid Data Broadcast Scheme for Wireless Information Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '00), vol. 3, pp. 1778-1782, 2000.
[19] J. Oh, K.A. Hua, and K. Prabhakara, “A New Broadcasting Technique for an Adaptive Hybrid Data Delivery in Wireless Mobile Network Environment,” Proc. Ninth IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '00), pp. 361-367, 2000.
[20] N.H. Vaidya and S. Hameed, “Data Broadcast in Asymmetric Environments,” Proc. First Int'l Workshop Satellite-Based Information Services (WOSBIS '96), pp. 38-52, 1996.
[21] N.H. Vaidya and S. Hameed, “Scheduling Data Broadcast in Asymmetric Communication Environments,” Wireless Networks, vol. 5, pp. 171-182, 1999.
[22] C.-J. Su, L. Tassiulas, and V. Tsotras, “Broadcast Scheduling for Information Distribution,” Wireless Networks, vol. 5, no. 2, pp. 137-147, 1999.
[23] P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham, and P. Shenoy, “Adaptive Push-Pull: Disseminating Dynamic Web Data,” Proc. 10th Int'l World Wide Web Conf. (WWW '01), May 2001.
[24] C.-L. Hu and M.-S. Chen, “Dynamic Data Broadcasting with Traffic Awareness,” Proc. 22nd Intl' Conf. Distributed Computing Systems (ICDCS '02), 2002.
[25] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM '99, pp. 126-134, 1999.
[26] G. Salton, A. Wong, and C.S. Yang, “A Vector Space Model for Automatic Indexing,” Comm. ACM, pp. 613-620, 1975.
[27] U. Cetintemel, M.J. Franklin, and C.L. Giles, “Self-Adaptive User Profiles for Large-Scale Data Delivery,” Proc. 16th IEEE Int'l Conf. Data Eng. (ICDE '00), pp. 622-633, Feb. 2000.
[28] K.-L. Wu, P.S. Yu, and M.-S. Chen, “Energy-Efficient Caching for Wireless Mobile Computing,” Proc. 12th IEEE Int'l Conf. Data Eng. (ICDE '96), 1996.
[29] D. Aksoy and M. Franklin, “Scheduling for Large-Scale On-Demand Data Broadcasting,” Proc. IEEE INFOCOM '98, vol. 2, pp.651-659, 1998.
[30] D. Aksoy and M. Franklin, “RXW: A Scheduling Approach for Large-Scale On-Demand Data Broadcast,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 846-860, 1999.
[31] S. Acharya and S. Muthukrishnan, “Scheduling On-Demand Broadcasts: New Metrics and Algorithms,” Proc. ACM MobiCom '98, pp. 43-54, 1998.
[32] G. Salton and M.J. McGill, Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
[33] Information Retrieval: Data Structures and Algorithms, W.B. Frakes and R. Baeza-Yates, eds. Prentice Hall, 1992.
[34] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, 1988.
[35] C. Buckley, G. Salton, J. Allan, and A. Singhal, “Automatic Query Expansion Using SMART,” Proc. Third Text Retrieval Conf. (TREC '94), pp. 69-80, 1994.
[36] B. Vélez, R. Weiss, M.A. Sheldon, and D.K. Gifford, “Fast and Effective Query Refinement,” Proc. 20th ACM SIGIR, pp. 6-15, 1997.
[37] M. Mitra, A. Singhal, and C. Buckley, “Improving Automatic Query Expansion,” Proc. 21st ACM SIGIR, pp. 206-214, 1998.
[38] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[39] H. Chernoff, “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,” Annals of Math. Statistics, vol. 23, no. 4, pp. 493-507, 1952.
[40] M.H. Ammar and J.W. Wong, “The Design of Teletext Broadcast Cycles,” Performance Evaluation, vol. 5, no. 4, pp. 235-242, 1985.
[41] D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, 1996.
[42] S. Hameed and N.H. Vaidya, “Log-Time Algorithms for Scheduling Single- and Multiple-Channel Data Broadcast,” Proc. ACM MobiCom '97, pp. 90-99, Sept. 1997.
[43] T. Imielinski and B.R. Badrinath, “Mobile Wireless Computing: Challenges in Data Management,” Comm. ACM, vol. 37, no. 10, pp.18-28, 1994.
[44] Lucent, IEEE 802.11 waveLAN PC Card User's Guide, 2007.
[45] T. Simunic, H. Vikalo, P. Glynn, and G.D. Micheli, “Energy Efficient Design of Portable Wireless Systems,” Proc. Int'l Symp. Low-Power Electronics and Design (ISPLED '00), 2000.
[46] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Energy Efficient Indexing on Air,” Proc. ACM SIGMOD '94, pp. 25-36, May 1994.
[47] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Data on Air: Organization and Access,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, May/June 1997.
[48] W.-C. Lee and D.L. Lee, “Using Signature Techniques for Information Filtering in Wireless and Mobile Environments,” Distributed and Parallel Databases, vol. 4, no. 3, pp. 205-227, 1996.
[49] Q. Hu, W.-C. Lee, and D.L. Lee, “A Hybrid Index Technique for Power Efficient Data Broadcast,” Distributed and Parallel Databases, vol. 9, pp. 151-177, 2001.
[50] S. Lee, D.P. Carney, and S. Zdonik, “Index Hint for On-Demand Broadcasting,” Proc. 19th IEEE Int'l Conf. Data Eng. (ICDE '03), pp.726-728, Mar. 2003.
[51] J.-L. Huang and W.-C. Peng, “An Energy-Conserved On-Demand Data Broadcasting System,” Proc. ACM SIGMOD '05, pp. 234-238, 2005.
[52] CSIM 19 Simulation Engine, http://www.mesquite.comdocumentation/, 2007.
[53] D.D. Lewis, “Reuters-21578, Distribution 1.0,” http://www. daviddlewis.comresources/, 2007.
[54] M. Portor, “The Portor Stemming Algorithm,” http://www. /, 2007.
[55] I.S. Dhillon, J. Fan, and Y. Guan, “Efficient Clustering of Very Large Document Collections,” Data Mining for Scientific and Eng. Applications, Kluwer Academic Publishers, 2001.
[56] I.S. Duff, R.G. Grimes, and J.G. Lewis, “Sparse Matrix Test Problems,” ACM Trans. Math. Software, vol. 15, no. 1, pp. 1-14, 1989.
[57] D. Knuth, The Art of Computer Programming, Volume II: Eminumerical Algorithms. Addison Wesley, 1981.
[58] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. ACM SIGCOMM '99, pp. 251-262, 1999.

Index Terms:
Wireless systems, Content Analysis and Indexing, Dissemination, Relevance feedback, Similarity measures
Wei Wang, Chinya V. Ravishankar, "Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 4, pp. 504-518, April 2008, doi:10.1109/TKDE.2007.190717
Usage of this product signifies your acceptance of the Terms of Use.