Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art

Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP

Autonomic service configuration for telecommunication MASs with extended role-based GAIA and JADEx

Autonomie Communications have attracted huge attention recently for the management of telecommunication networks in the European Network Research Community. The purpose of this research is to offer the abilities such as autonomy, scalability, adaptation as well as simplicity for management application in complex networks. The accomplished networks inspired by biological mechanisms or market-based concepts could enable agents to be of intelligence, scalablility, and interoperabliliry in the management functional domains with regards to the large volume requirements from services' fulfillment perspective in decentralized Multi-Agent Systems. In accordance with TMF and FIPA specifications and requirements, the autonomy attributes self-configuring, self-adapting, self-limiting, self-preserving, and self-optimizing are involved into our simulation. Resource allocation requests are bidded for a long session in the multi-unit Vickrey-Clarke-Groves auction. This design adopts the software development methodology-GAIA and the framework-JADEx. We have shown multiple service configuration in dynamic network can be nearly optimized by autonomie behaviors via bidding according to business objectives for getting maximum revenues. We conclude this end-to-end approach maintains self-managing capability, easy-to-implement scalability, and more incentively compatible and efficient over other common implementation so that it could achieve the optimal solution to the flexible requirements for the Service Fulfillment for advanced IP networks. © 2005 IEEE

Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents

Autonomous wireless agents such as unmanned aerial vehicles or mobile base stations present a great potential for deployment in next-generation wireless networks. While current literature has been mainly focused on the use of agents within robotics or software applications, we propose a novel usage model for self-organizing agents suited to wireless networks. In the proposed model, a number of agents are required to collect data from several arbitrarily located tasks. Each task represents a queue of packets that require collection and subsequent wireless transmission by the agents to a central receiver. The problem is modeled as a hedonic coalition formation game between the agents and the tasks that interact in order to form disjoint coalitions. Each formed coalition is modeled as a polling system consisting of a number of agents which move between the different tasks present in the coalition, collect and transmit the packets. Within each coalition, some agents can also take the role of a relay for improving the packet success rate of the transmission. The proposed algorithm allows the tasks and the agents to take distributed decisions to join or leave a coalition, based on the achieved benefit in terms of effective throughput, and the cost in terms of delay. As a result of these decisions, the agents and tasks structure themselves into independent disjoint coalitions which constitute a Nash-stable network partition. Moreover, the proposed algorithm allows the agents and tasks to adapt the topology to environmental changes such as the arrival/removal of tasks or the mobility of the tasks. Simulation results show how the proposed algorithm improves the performance, in terms of average player (agent or task) payoff, of at least 30.26% (for a network of 5 agents with up to 25 tasks) relatively to a scheme that allocates nearby tasks equally among agents.Comment: to appear, IEEE Transactions on Mobile Computin

A Dynamic Application Partitioning and Offloading Framework to Enhance the Capabilities of Transient Clouds Using Mobile Agents

Mobile cloud computing has emerged as a prominent area of research, a natural extension of cloud computing that proposes to offer solutions for enhancing the capabilities of smart mobile devices commonly plagued by resource constraints. As one of its promising models, transient clouds aim to address the internet connectivity shortfall inherent in most solutions through the formation of ad hoc networks by devices in close proximity, then the offloading some computations (Cyber Foraging) to the created cloud. However, transient clouds, at their current state, have several limitations, concerning their expansion on a local network having a large number of devices and the management of the instability of the network due to the constant mobility of the devices. Another issue is the fact code partitioning and offloading are not addressed to fit the need of such networks, thereby rendering the distributed computing mechanism barely efficient for the Transient Cloud. In this study, we propose a transient cloud-based framework that exploits the use of multi-agent systems, enabling a dynamic partitioning and offloading of code, and facilitating the movement and the execution of code partition packets in a multi-hop ad-hoc mesh network. When created and deployed, these intelligent mobile agents operate independently or collaboratively and adapt to the continual entry and exit of devices in the neighbourhood. The integration of these trending concepts in distributed computing within a framework offers a new architecture for resource-sharing among cooperating devices that addresses the varied issues that arise in dynamic environments