By Topic

Exploiting Mobility Prediction for Dependable Service Composition in Wireless Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jianping Wang ; Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, China

Service-Oriented Architecture (SOA) is emerging as the next inevitable technology for application developments. One fundamental issue of SOA is service composition, i.e., to seamlessly compose distributed services into more complex applications. In the mobile environment, a service composition may face disruptions caused by the movement of both users and service providers. Thus, a dependable service composition is desired to handle the mobility in the environment. In this paper, we propose to achieve dependable service composition by taking the mobility prediction of the service providers into consideration. We exploit the fact that the service providers can predict their stay time in the current environment. However, some uncertainty may exist in the prediction such that a service provider may move out of the current environment earlier than the prediction. We use two models to characterize the uncertainty, a probability-free model and a probabilistic model. Our objective is to design dependable service composition under these two models such that the service composition solution can have the maximum tolerance to the uncertainty of the mobility prediction. We focus on the case of sequential service composition, prove the NP-hardness of the problem, then present heuristic algorithms, derive the upper and lower bounds of the problem. Simulation results have showcased the effectiveness of the heuristic algorithms.

Published in:

Services Computing, IEEE Transactions on  (Volume:4 ,  Issue: 1 )