An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Condor grid computing from mobile handheld devices
ACM SIGMOBILE Mobile Computing and Communications Review
Grids and grid technologies for wide-area distributed computing
Software—Practice & Experience
Mobile OGSI.NET: Grid Computing on Mobile Devices
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Tactics-based remote execution for mobile computing
Proceedings of the 1st international conference on Mobile systems, applications and services
Design and implementation of a single system image operating system for ad hoc networks
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Sensor Networks and Grid Middleware for Laboratory Monitoring
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
A Robust Decentralized Job Scheduling Approach for Mobile Peers in Ad-hoc Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Mobility-Aware Efficient Job Scheduling in Mobile Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Grid-M: Middleware to Integrate Mobile Devices, Sensors and Grid Computing
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
An ant algorithm for balanced job scheduling in grids
Future Generation Computer Systems
Journal of Parallel and Distributed Computing
Mobile Ad Hoc Computational Grid for Low Constraint Devices
ICFCC '09 Proceedings of the 2009 International Conference on Future Computer and Communication
Utility-based scheduling for grid computing under constraints of energy budget and deadline
Computer Standards & Interfaces
Mobile ad hoc grid using trace based mobility model
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Experiences with writing grid clients for mobile devices
ELeGI'05 Proceedings of the 1st international ELeGI conference on Advanced Technology for Enhanced Learning
Principles and protocols for power control in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Transmission power control in wireless ad hoc networks: challenges, solutions and open issues
IEEE Network: The Magazine of Global Internetworking
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Due to recent advancements in mobile computing and communication technologies, mobile ad hoc computational Grids are emerging as a new computing paradigm, enabling innovative applications through sharing of computing resources among mobile devices without any pre-existing network infrastructure. Energy-efficient resource allocation is one of the key issues in mobile ad hoc computational Grids due to limited battery life of mobile nodes. To reduce energy consumption, we propose a hybrid power-based resource allocation scheme for allocation of interdependent tasks to nodes within mobile ad hoc computational Grid. The basic idea is to exploit dependencies and task type, and allocate interdependent tasks to nodes accessible at minimum transmission power. We also propose a power-based algorithm to search a group of closest nodes to allocate a set of interdependent tasks. Compared to traditional algorithms, complexity of proposed algorithm depends on number of transmission power levels rather than number of nodes within a Grid. The scheme is validated in a simulation environment using various workloads and parameters.