Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment
Paper
Qin, Yongrui, Wang, Hua, Zhang, Ji, Tao, Xiaohui, Zhang, Wei Emma, Taylor, Kerry and Sheng, Quan Z.. 2015. "Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment." 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS 2015). Melbourne, Australia 14 - 17 Dec 2015 Australia. https://doi.org/10.1109/ICPADS.2015.96
| Paper/Presentation Title | Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment |
|---|---|
| Presentation Type | Paper |
| Authors | Qin, Yongrui (Author), Wang, Hua (Author), Zhang, Ji (Author), Tao, Xiaohui (Author), Zhang, Wei Emma (Author), Taylor, Kerry (Author) and Sheng, Quan Z. (Author) |
| Journal or Proceedings Title | Proceedings of the 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS 2015) |
| Number of Pages | 8 |
| Year | 2015 |
| Place of Publication | Australia |
| Digital Object Identifier (DOI) | https://doi.org/10.1109/ICPADS.2015.96 |
| Web Address (URL) of Paper | https://ieeexplore.ieee.org/document/7384359 |
| Conference/Event | 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS 2015) |
| Event Details | Rank B B B B B B B B B |
| Event Details | 21st IEEE International Conference on Parallel and Distributed Systems (ICPADS 2015) Event Date 14 to end of 17 Dec 2015 Event Location Melbourne, Australia |
| Abstract | This paper tackles the key scheduling problem of reducing the overall wait time of mobile clients in wireless data broadcast systems. Existing algorithms for data broadcast usually come with various constraints. Specifically, periodic broadcast generally makes assumptions that the clients’ queries are already known and the distribution of access frequencies of their queries can be obtained in advance while on-demand broadcast requires that all interested clients submit their queries before they tune in and access data on air. However, in periodic broadcast, new mobile clients may join in and existing mobile clients may leave anytime; in on-demand broadcast, high uplink communication cost may occur as all clients have to submit their queries every time. Based such observations, in this work, we study the scheduling problem of XML data broadcast in a hybrid mode, where the system supports both periodic broadcast and on demand broadcast services at the same. By taking the structural similarity between XML documents into account, only a small portion of mobile clients would be involved in the scheduling process and all mobile clients can be served more effectively. In this way, communication cost at the client side can be reduced greatly. A formal theoretical analysis of the proposed technique is presented. Based on the analysis, a novel clustering-based scheduling algorithm is developed. Moreover, we utilize an aging method to predict the distribution of incoming queries based on small samples of queries from mobile clients. Finally, we evaluate the approach through a set of experiments and the results show that it can significantly improve access efficiency for mobile clients. |
| ANZSRC Field of Research 2020 | 469999. Other information and computing sciences not elsewhere classified |
| 460608. Mobile computing | |
| Public Notes | Files associated with this item cannot be displayed due to copyright restrictions. |
| Byline Affiliations | University of Adelaide |
| Victoria University | |
| School of Agricultural, Computational and Environmental Sciences | |
| Australian National University | |
| Institution of Origin | University of Southern Queensland |
Permalink -
https://research.usq.edu.au/item/q344z/efficient-algorithms-for-scheduling-xml-data-in-a-mobile-wireless-broadcast-environment
1794
total views12
total downloads4
views this month0
downloads this month