Title: Data retrieval for deadline-based multi-request in MIMO wireless networks

Authors: Ping He; Weidong Li; Shufu Cao

Addresses: Institute of Information Technology, Hebei University of Economics and Business, Shijiazhuang, Hebei, China ' Institute of Information Technology, Hebei University of Economics and Business, Shijiazhuang, Hebei, China ' Institute of Information Technology, Hebei University of Economics and Business, Shijiazhuang, Hebei, China

Abstract: Data retrieval problem refers to generates an access pattern for downloading a request with multiple data items among the parallel channels such that the efficiency of wireless networks is improved. Although many related papers have discussed this problem that clients require to retrieve one request by one and multiple antennae, but there are few study on it that clients equipped with multiple antennae require to retrieve multiple requests, in particular that each request has time constraint. So, this paper proposes an algorithm that schedules the suitable antennae to find a retrieval sequence about these requests for keeping the balance of access latency. For retrieving each request, we develop an efficient scheme that adopts maximum match to generate an access pattern for downloading all requested data items so that the access latency of each request and deadline miss ratio are minimised. Through experiments, the proposed algorithms keep good performance.

Keywords: mobile computing; data broadcast; indexing; data scheduling; data retrieval; data grouping.

DOI: 10.1504/IJSNET.2019.099470

International Journal of Sensor Networks, 2019 Vol.30 No.2, pp.93 - 104

Available online: 01 May 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article