By Topic

A Location Based Execution Path Selection for Composite Service in MANETs

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

4 Author(s)
Weiyu Chen ; Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai ; Jingjing Wu ; Weiwei Sun ; Zhenying He

There has been great interest in service composition to exploit resources of distributed nodes in mobile ad hoc networks. During composite service execution, the execution path for composite service is very important because of its significant influence on network overhead and the percentage of failure. In this paper, we study the execution path selection problem, which focuses on selecting a short path. The short path means small amount hops the request travels during execution. Based on nodes' locations, request source estimates the hop count between two nodes and then selects a short path for execution. The simulation results show the path selected by our approach almost has the same performance as the theoretical shortest path both on the path length and the percentage of failure, especially in mobile environments. Moreover, our approach performs better than the existing service selection approach both in the percentage of failure and average path length, especially in the network with high mobility and sparse service distribution.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008