TY - GEN
T1 - Efficient object retrieval from parallel air channels in the presence of replicated objects
AU - Ayyagari, Padmapriya
AU - Mitra, Prasenjit
AU - Hurson, Ali
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - A mobile device retrieving objects from parallel air channels has to optimize multiple objectives: (1) reduce the response time for object retrieval, and (2) reduce power consumption in the device. This multi-objective optimization becomes even more difficult when the same object is broadcast multiple times over the parallel air channels to increase availability. In this work, several heuristic algorithms - branch and bound, greedy, random, and first-choice have been proposed for efficient object retrieval from parallel air channels in the presence of replicated objects. Empirical evaluation of the algorithms shows that the greedy algorithm produces near-optimal-response time with minimum overhead in terms of energy consumption. The runtime of the greedy algorithm is significantly faster than that of the optimal branch and bound algorithm, and is similar to the first-choice and random algorithms.
AB - A mobile device retrieving objects from parallel air channels has to optimize multiple objectives: (1) reduce the response time for object retrieval, and (2) reduce power consumption in the device. This multi-objective optimization becomes even more difficult when the same object is broadcast multiple times over the parallel air channels to increase availability. In this work, several heuristic algorithms - branch and bound, greedy, random, and first-choice have been proposed for efficient object retrieval from parallel air channels in the presence of replicated objects. Empirical evaluation of the algorithms shows that the greedy algorithm produces near-optimal-response time with minimum overhead in terms of energy consumption. The runtime of the greedy algorithm is significantly faster than that of the optimal branch and bound algorithm, and is similar to the first-choice and random algorithms.
UR - http://www.scopus.com/inward/record.url?scp=33751029764&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33751029764&partnerID=8YFLogxK
U2 - 10.1109/MDM.2006.79
DO - 10.1109/MDM.2006.79
M3 - Conference contribution
AN - SCOPUS:33751029764
SN - 0769525261
SN - 9780769525266
T3 - Proceedings - IEEE International Conference on Mobile Data Management
BT - 7th International Conference on Mobile Data Management, 2006. MDM 2006
T2 - 7th International Conference on Mobile Data Management, 2006. MDM 2006
Y2 - 10 May 2006 through 12 May 2006
ER -
