Authors: Ping He; Zheng Huo
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
Abstract: Multi-antennae data retrieval problem refers that finds an access pattern (to retrieve multiple requests by using multiple antennae, where each request has multiple data items) such that the access latency of some requests retrieved by each antenna is minimised and the total access latency of all requests retrieved by all antennae keeps balance. So it is very important that these requests are divided into multiple groups for achieving the retrieval by using each antenna in MIMO wireless communication, called data grouping problem. There are few studies focused on data grouping scheme applied in data retrieval problem when the clients equipped with multi-antennae send multiple requests. Therefore, this paper proposes two data grouping algorithms (HOG and HEG) that are applied in data retrieval such that the requests can be reasonably classified into multiple groups. Through experiments, the proposed schemes have better efficiency compared with some existing schemes.
Keywords: mobile computing; data broadcast; indexing; data scheduling; data retrieval; data grouping.
International Journal of Computational Science and Engineering, 2020 Vol.22 No.2/3, pp.171 - 180
Received: 21 Jul 2017
Accepted: 24 Jan 2018
Published online: 18 May 2020 *