Performance evaluation of service execution in opportunistic computing

Authors:
Andrea Passarella;Marco Conti;Eleonora Borgia;Mohan Kumar
Affiliations:
National Research Council (CNR), Pisa, Italy;National Research Council (CNR), Pisa, Italy;National Research Council (CNR), Pisa, Italy;The University of Texas at Arlington, Arlington, TX, USA
Venue:
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Year:
2010

Citing 9
Cited 2

Impact of Human Mobility on Opportunistic Forwarding Algorithms

IEEE Transactions on Mobile Computing
Dynamic Service Composition in Pervasive Computing

IEEE Transactions on Parallel and Distributed Systems
Efficient routing in intermittently connected mobile networks: the single-copy case

IEEE/ACM Transactions on Networking (TON)
Fast track article: Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution

Pervasive and Mobile Computing
Stationary Distributions for the Random Waypoint Mobility Model

IEEE Transactions on Mobile Computing
Fast track article: Bubble-sensing: Binding sensing tasks to the physical world

Pervasive and Mobile Computing
Opportunities in Opportunistic Computing

Computer
Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Understanding the real behavior of Mote and 802.11 ad hoc networks: an experimental approach

Pervasive and Mobile Computing

Modeling and simulation of service composition in opportunistic networks

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An Enhanced Mobile-Healthcare Emergency System Based on Extended Chaotic Maps

Journal of Medical Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic computing has emerged as a new paradigm in computing, leveraging the advances in pervasive computing and opportunistic networking. Nodes in an opportunistic network avail of each others' connectivity and mobility to overcome network partitions. In opportunistic computing, this concept is generalised, as nodes avail of any resource available in the environment. Here we focus on computational resources, assuming mobile nodes opportunistically invoke services on each other. Specifically, resources are abstracted as services contributed by providers and invoked by seekers. In this paper, we present an analytical model that depicts the service invocation process between seekers and providers. Specifically, we derive the optimal number of replicas to be spawned on encountered nodes, in order to minimise the execution time and optimise the computational and bandwidth resources used. Performance results show that a policy operating in the optimal configuration largely outperforms policies that do not consider resource constraints.