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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call