Title: Resource allocation scheme to reduce communication cost in mobile ad hoc computational grids

Authors: Sayed Chhattan Shah; Myong-Soon Park; Fida Hussain Chandio

Addresses: Internet Computing Research Lab., Department of Computer and Radio Communications Engineering, Korea University, Anam-Dong 5-1, Sungbuk-Gu, Seoul, 136-713 Korea. ' Internet Computing Research Lab., Department of Computer and Radio Communications Engineering, Korea University, Anam-Dong 5-1, Sungbuk-Gu, Seoul, 136-713 Korea. ' Brunel Business School, Brunel University, Kingston Lane, Uxbridge, Middlesex UB 3PH, UK

Abstract: Recent advancements in mobile computing and communication technologies have given rise to the development of mobile ad hoc computational grids which provide a software and hardware infrastructure to share computing resources in mobile ad hoc environments. The adaptation of computational grids in mobile ad hoc environments is not simple and presents numerous research challenges due to node mobility and infrastructure-less network environment. In order to improve utilisation of shared computing resources and application performance, one of the key services is a resource allocation. In this paper, we propose a centralised resource allocation scheme that allocates interdependent tasks to nodes in mobile ad hoc computational grids. First, we classify tasks and dependencies, and then exploit them to reduce communication cost between interdependent tasks, and thus application completion time. The effectiveness of proposed scheme is demonstrated through simulations.

Keywords: computational grid; ad hoc networks; mobile grids; mobile ad hoc computational grids; shared computing resources; resource allocation; simulation.

DOI: 10.1504/IJSSC.2011.043510

International Journal of Space-Based and Situated Computing, 2011 Vol.1 No.4, pp.270 - 280

Received: 18 May 2011
Accepted: 19 Jul 2011

Published online: 26 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article