Abstract
Data broadcasting is accepted as an effective solution to disseminate information to a large number of clients in wireless environments. Data broadcast scheduling attracts extensive attention, especially for multi-item queries. However, most previous works focusing on this issue do not take data replication in broadcast schedule into consideration, which leads to poor performance when the access probability of data items is skewed. In this paper, we proposed an efficient schedule algorithm called the affinity path approach. It firstly creates paths based on affinity of different data items, and then broadcast the paths based on the square root rule with data replication. Experiments prove that our approach reduces the average access time significantly.
This research is supported in part by the National Natural Science Foundation of China (NSFC) under grant 60503035 and SRF for ROCS, SEM.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on air: organization and access. IEEE Transactions on Knowledge and Data Engineering 9(3) (1997)
Xu, J., Lee, D., Hu, Q., Lee, W.C.: Data broadcast. In: Handbook of wireless networks and mobile computing. John Wiley & Sons, Chichester (2002)
Chung, Y., Kim, M.: QEM: A scheduling method for wireless broadcast. In: DASFAA 1999 (1999)
Lee, G., Yeh, M.-S., Lo, S.-C., Chen, A.L.P.: A strategy for efficient access of multiple data items in mobile environments. In: MDM 2001 (2001)
Chung, Y., Kim, M.: A wireless data clustering method for multipoint queries. Decision Support Systems 30(4) (2001)
Vaidya, N., Hameed, S.: Scheduling data broadcast in asymmetric communication environment. ACM Journal of Wireless Networks 5, 171–182 (1999)
Tsaih, D., Wu, G., Wang, C., Ho, Y.: An efficient broadcast scheme for wireless data schedule under a new data affinity model. In: Kim, C. (ed.) ICOIN 2005. LNCS, vol. 3391, pp. 390–400. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W., Zhang, Z., Sun, W., Mao, D., Wu, J. (2009). An Affinity Path Based Wireless Broadcast Scheduling Approach for Multi-item Queries. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-00672-2_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00671-5
Online ISBN: 978-3-642-00672-2
eBook Packages: Computer ScienceComputer Science (R0)