Data grouping scheme for multi-request retrieval in MIMO wireless communication Online publication date: Mon, 18-May-2020
by Ping He; Zheng Huo
International Journal of Computational Science and Engineering (IJCSE), Vol. 22, No. 2/3, 2020
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.
Online publication date: Mon, 18-May-2020
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 Computational Science and Engineering (IJCSE):
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 firstname.lastname@example.org