Premium
Efficient data retrieval algorithms for multiple requests in MIMO wireless networks
Author(s) -
He Ping,
Shen Hong,
Guo Longkun,
Li Yidong
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2917
Subject(s) - computer science , data retrieval , upload , scheme (mathematics) , computer network , wireless , set (abstract data type) , latency (audio) , mimo , algorithm , information retrieval , channel (broadcasting) , telecommunications , operating system , mathematical analysis , mathematics , programming language
Summary Given a set of multiple channels, a set of multiple requests, where each request contains multiple requested data items and a client equipped with multiple antennae, the multi‐antenna‐based multirequest data retrieval problem (DRMR‐MA) is to find a data retrieval sequence for downloading all data items of the requests allocated to each antenna, such that the maximum access latency of all antennae is minimized. Most existing approaches for the data retrieval problem focus on either single antenna or single request and are hence not directly applicable to DRMR‐MA for retrieving multiple requests. This paper proposes two data retrieval algorithms that adopt two different grouping schemes to solve DRMR‐MA so that the requests can be suitably allocated to each antenna. To find the data retrieval sequence of each request efficiently, we present a data retrieval scheme that converts a wireless data broadcast system to a special tree. Experimental results show that the proposed scheme is more efficient than other existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.