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 (US)
Title of host publication7th International Conference on Mobile Data Management, 2006. MDM 2006
DOIs
StatePublished - Nov 21 2006
Event7th International Conference on Mobile Data Management, 2006. MDM 2006 - Nara, Japan
Duration: May 10 2006May 12 2006

Publication series

NameProceedings - IEEE International Conference on Mobile Data Management
Volume2006
ISSN (Print)1551-6245

Other

Other7th International Conference on Mobile Data Management, 2006. MDM 2006
CountryJapan
CityNara
Period5/10/065/12/06

Fingerprint

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

All Science Journal Classification (ASJC) codes

  • 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 7th International Conference on Mobile Data Management, 2006. MDM 2006 [1630552] (Proceedings - IEEE International Conference on Mobile Data Management; Vol. 2006). 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. 7th International Conference on Mobile Data Management, 2006. MDM 2006. 2006. (Proceedings - IEEE International Conference on Mobile Data Management).
@inproceedings{ea15eef1b71d4a6a93b8d7afe4122ebd,
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",
month = "11",
day = "21",
doi = "10.1109/MDM.2006.79",
language = "English (US)",
isbn = "0769525261",
series = "Proceedings - IEEE International Conference on Mobile Data Management",
booktitle = "7th International Conference on Mobile Data Management, 2006. MDM 2006",

}

Ayyagari, P, Mitra, P & Hurson, A 2006, Efficient object retrieval from parallel air channels in the presence of replicated objects. in 7th International Conference on Mobile Data Management, 2006. MDM 2006., 1630552, Proceedings - IEEE International Conference on Mobile Data Management, vol. 2006, 7th International Conference on Mobile Data Management, 2006. MDM 2006, Nara, Japan, 5/10/06. 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.

7th International Conference on Mobile Data Management, 2006. MDM 2006. 2006. 1630552 (Proceedings - IEEE International Conference on Mobile Data Management; Vol. 2006).

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

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/11/21

Y1 - 2006/11/21

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

ER -

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