Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
ACM SIGCOMM Computer Communication Review
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Dynamic QoS-Aware Multimedia Service Configuration in Ubiquitous Computing Environments
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Ontology-Driven Web Services Composition Platform
CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
On exploring performance optimizations in web service composition
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Service composition for mobile environments
Mobile Networks and Applications
Journal of Systems and Software
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Journal of Systems and Software
Disruption-aware service composition and recovery in dynamic networking environments
Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE)
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
DAnCE: a qos-enabled component deployment and configuration engine
CD'05 Proceedings of the Third international working conference on Component Deployment
Improving availability in large, distributed component-based systems via redeployment
CD'05 Proceedings of the Third international working conference on Component Deployment
An architecture for highly available wide-area service composition
Computer Communications
A brief overview of ad hoc networks: challenges and directions
IEEE Communications Magazine - Part Anniversary
NonStop: continuous multimedia streaming in wireless ad hoc networks with node mobility
IEEE Journal on Selected Areas in Communications
Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network
Journal of Intelligent and Robotic Systems
Hi-index | 0.00 |
The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can satisfy the end-to-end quality of service requirements and minimize the effect of service disruptions caused by dynamic link and node failures. Although existing research on mobile ad hoc networks has focused on improving reliability, little existing work has considered service deliveries spanning multiple components. Moreover, service composition strategies proposed for wireline networks (such as the Internet) are poorly suited for highly dynamic wireless ad hoc networks. This paper proposes a new service composition and recovery framework designed to achieve minimum service disruptions for mobile ad hoc networks. The framework consists of two tiers: service routing, which selects the service components that support the service path, and network routing, which finds the optimal network path that connects these service components. Our framework is based on the disruption index, which is a novel concept that characterizes different service disruption aspects, such as frequency and duration, that are not captured adequately by conventional metrics, such as reliability and availability. Using the definition of disruption index, we formulate the problem of minimum-disruption service composition and recovery (MDSCR) as a dynamic programming problem and analyze the properties of its optimal solution for ad hoc networks with known mobility plan. Based on the derived analytical insights, we present our MDSCR heuristic algorithm for ad hoc networks with uncertain node mobility. This heuristic algorithm approximates the optimal solution with one-step lookahead prediction, where service link lifetime is predicted based on node location and velocity using linear regression. We use simulations to evaluate the results of our algorithm in various network environments. The results validate that our algorithm can achieve better performance than conventional methods.