Energy efficient resource allocation in mobile ad hoc computational grids

Sayed Chhattan Shah, Myong Soon Park

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

1 Citation (Scopus)

Abstract

This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.

Original languageEnglish
Title of host publication2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011
DOIs
Publication statusPublished - 2011 Mar 17
Event2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011 - Bangalore, India
Duration: 2011 Jan 42011 Jan 8

Other

Other2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011
CountryIndia
CityBangalore
Period11/1/411/1/8

Fingerprint

Resource allocation
Energy utilization
Power transmission
energy
energy consumption
resources
Communication
Costs
communication
costs
Group

Keywords

  • Ad hoc networks
  • Computational grid
  • Mobile grids
  • Resource allocation
  • Task dependencies

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Shah, S. C., & Park, M. S. (2011). Energy efficient resource allocation in mobile ad hoc computational grids. In 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011 [5716409] https://doi.org/10.1109/COMSNETS.2011.5716409

Energy efficient resource allocation in mobile ad hoc computational grids. / Shah, Sayed Chhattan; Park, Myong Soon.

2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011. 2011. 5716409.

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

Shah, SC & Park, MS 2011, Energy efficient resource allocation in mobile ad hoc computational grids. in 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011., 5716409, 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011, Bangalore, India, 11/1/4. https://doi.org/10.1109/COMSNETS.2011.5716409
Shah SC, Park MS. Energy efficient resource allocation in mobile ad hoc computational grids. In 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011. 2011. 5716409 https://doi.org/10.1109/COMSNETS.2011.5716409
Shah, Sayed Chhattan ; Park, Myong Soon. / Energy efficient resource allocation in mobile ad hoc computational grids. 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011. 2011.
@inproceedings{669f54c9c4404780950ad5269ffc7fcd,
title = "Energy efficient resource allocation in mobile ad hoc computational grids",
abstract = "This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.",
keywords = "Ad hoc networks, Computational grid, Mobile grids, Resource allocation, Task dependencies",
author = "Shah, {Sayed Chhattan} and Park, {Myong Soon}",
year = "2011",
month = "3",
day = "17",
doi = "10.1109/COMSNETS.2011.5716409",
language = "English",
isbn = "9781424489534",
booktitle = "2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011",

}

TY - GEN

T1 - Energy efficient resource allocation in mobile ad hoc computational grids

AU - Shah, Sayed Chhattan

AU - Park, Myong Soon

PY - 2011/3/17

Y1 - 2011/3/17

N2 - This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.

AB - This paper addresses the problem of energy efficient resource allocation to interdependent tasks in mobile ad hoc computational grids. The interdependent tasks may exchange large quantity of data and consume the energy proportional to amount of data exchanged among the tasks. If tasks wouldn't be allocated effectively, then there can be a significant increase in the energy consumption and communication cost. The increased energy consumption limit the life time of a node and may result in a power failure which not only affects the task executing on a node but also affects other tasks in various ways. In addition, the mobile nodes within a grid are battery driven and thus have a limited power that should be utilized effectively. In this paper, we propose a hybrid power-based resource allocation scheme to reduce the energy consumption and communication cost among the interdependent tasks. The basic idea is to exploit the dependency and task types and allocate interdependent tasks to nodes accessible at a minimum transmission power level. We also propose a power-based algorithm to find a group of closest nodes to allocate a set of interdependent tasks. Compared to the traditional algorithms, the complexity of proposed algorithm depends on the number of transmission power levels rather than the number of nodes within a grid.

KW - Ad hoc networks

KW - Computational grid

KW - Mobile grids

KW - Resource allocation

KW - Task dependencies

UR - http://www.scopus.com/inward/record.url?scp=79952568610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952568610&partnerID=8YFLogxK

U2 - 10.1109/COMSNETS.2011.5716409

DO - 10.1109/COMSNETS.2011.5716409

M3 - Conference contribution

AN - SCOPUS:79952568610

SN - 9781424489534

BT - 2011 3rd International Conference on Communication Systems and Networks, COMSNETS 2011

ER -