Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/92613
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Scheduling parallel data retrievals for non-consecutive broadcast in MIMO wireless networks
Author: He, P.
Shen, H.
Tian, H.
Citation: Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP, 2012, pp.218-223
Publisher: IEEE
Issue Date: 2012
Series/Report no.: International Symposium on Parallel Architectures Algorithms and Programming
ISBN: 9780769548982
ISSN: 2168-3034
2168-3042
Conference Name: 2012 5th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2012) (17 Dec 2012 - 20 Dec 2012 : Taipei, Taiwan)
Statement of
Responsibility: 
Ping He, Hong Shen and Hui Tian
Abstract: Wireless data broadcast is usually used to disseminate the public information to considerable clients in wireless environment. Based on the development of mobile device, some mobile devices can simultaneously use multiple antennae to process some operations. In this paper, we commit to study data retrieval scheduling problem in wireless data broadcast, which mobile device has multiple antennae and the data items are non-consecutively broadcasted in multiple parallel channels. In order to improve the performance of downloading requested data items, we propose a scheme of scheduling parallel data retrievals for non-consecutive broadcast to decrease access latency and energy consumption. In this scheme, we utilize a weight of channel through two balancing factors to choose the suitable channel for data retrieval. We analyze the performance of proposed scheme and the other schemes. Evaluation results prove that the proposed scheme has the better performance.
Keywords: parallel data retrieval; wireless networks; nonconsecutive broadcast
Rights: ©2012 IEEE
DOI: 10.1109/PAAP.2012.39
Appears in Collections:Aurora harvest 7
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.