Skip to Main Content
There has been a good amount of research over the past few years on the integration of mobile devices into computational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource discovery and scheduling protocol for mobility (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mobile grid, while mitigating the overhead of discovery messages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the protocol provides efficient load balancing between nodes under an increasing number of requests, and scales well with respect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.