Efficient algorithm for online data retrieval with one antenna in wireless networks Online publication date: Mon, 09-Sep-2019
by Ping He; Shuli Luan
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 14, No. 3, 2019
Abstract: Given a set of requested data items and a set of multiple channels, data retrieval problem is to find a data retrieval sequence for downloading all requested data items from these channels in a reasonable time range. Almost all existing schemes are applied in offline environment that the client can learn prior knowledge of wireless data broadcast, such as the set of broadcast channels and the broadcast time of data items. However, this information is unknown in online data retrieval. So this paper proposes three online algorithms (MRLR, RM and MRM) for solving online data retrieval problem. Compared with the optimal offline data retrieval algorithm, MRLR, RM and MRM algorithms hold (k − 1), (log(k − 1) + k/2 ) and k/2 competitive rate respectively. Through comparison with the competitive rates and experimental results of proposed online algorithms, we observe that the performance of online data retrieval is improved in wireless networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook