Efficient object retrieval from parallel air channels in the presence of replicated objects

Padmapriya Ayyagari, Prasenjit Mitra, Ali Hurson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Mobile Data Management
Volume2006
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event7th International Conference on Mobile Data Management, 2006. MDM 2006 - Nara
Duration: 10 May 200612 May 2006

Other

Other7th International Conference on Mobile Data Management, 2006. MDM 2006
CityNara
Period10/5/0612/5/06

Fingerprint

Air
Heuristic algorithms
Multiobjective optimization
Mobile devices
Electric power utilization
Energy utilization
Availability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ayyagari, P., Mitra, P., & Hurson, A. (2006). Efficient object retrieval from parallel air channels in the presence of replicated objects. In Proceedings - IEEE International Conference on Mobile Data Management (Vol. 2006). [1630552] https://doi.org/10.1109/MDM.2006.79

Efficient object retrieval from parallel air channels in the presence of replicated objects. / Ayyagari, Padmapriya; Mitra, Prasenjit; Hurson, Ali.

Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2006 2006. 1630552.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ayyagari, P, Mitra, P & Hurson, A 2006, Efficient object retrieval from parallel air channels in the presence of replicated objects. in Proceedings - IEEE International Conference on Mobile Data Management. vol. 2006, 1630552, 7th International Conference on Mobile Data Management, 2006. MDM 2006, Nara, 10/5/06. https://doi.org/10.1109/MDM.2006.79
Ayyagari P, Mitra P, Hurson A. Efficient object retrieval from parallel air channels in the presence of replicated objects. In Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2006. 2006. 1630552 https://doi.org/10.1109/MDM.2006.79
Ayyagari, Padmapriya ; Mitra, Prasenjit ; Hurson, Ali. / Efficient object retrieval from parallel air channels in the presence of replicated objects. Proceedings - IEEE International Conference on Mobile Data Management. Vol. 2006 2006.
@inproceedings{9a8d47df64ae450fba1442f83e897d5a,
title = "Efficient object retrieval from parallel air channels in the presence of replicated objects",
abstract = "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.",
author = "Padmapriya Ayyagari and Prasenjit Mitra and Ali Hurson",
year = "2006",
doi = "10.1109/MDM.2006.79",
language = "English",
isbn = "0769525261",
volume = "2006",
booktitle = "Proceedings - IEEE International Conference on Mobile Data Management",

}

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

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

SN - 0769525261

SN - 9780769525266

VL - 2006

BT - Proceedings - IEEE International Conference on Mobile Data Management

ER -