Efficient Data Retrieval Algorithm for Multi-request in Multi-antenna Wireless Networks

Given a set of multiple requests sent by clients, where each request contains multiple data items, multi-antenna data retrieval problem refers that finds an access pattern (to retrieve multiple requests by using multiple antennae) such that the access latency of each antenna is minimized and the total access latency in all antennae keeps balance. The problem has great value in mobile computing applications. Although almost researches have focused on data retrieval problem when the clients equipped with one antenna send single request and multiple requests, there are few studies on data retrieval problem with multiple requests sent by clients equipped with multiple antennae. Therefore, this paper proposes two algorithms that adopt two different grouping schemes (SG and WG) such that the requests can be reasonably retrieved by each antenna. For retrieving each request, we propose an algorithm that converts wireless data broadcast system to a super tree for finding an access pattern to download all requested data items in minimal access latency. Through experiments, the proposed scheme has currently most efficiency in existing schemes.