MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Composable ad-hoc mobile services for universal interaction
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Multicluster, mobile, multimedia radio network
Wireless Networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
MOCA: a service framework for mobile computing devices
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Challenges: an application model for pervasive computing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Service Location Protocol: Automatic Discovery of IP Network Services
IEEE Internet Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Techniques for Improving Opportunistic Sensor Networking Performance
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Adaptive workflow scheduling under resource allocation constraints and network dynamics
Proceedings of the VLDB Endowment
A QoS-driven approach for service-oriented device anycasting in ubiquitous environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and analysis of composite network embeddings
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Service-Oriented device anycasting using quality first search in wireless personal area network
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Comparison of Hyper-DAG based task mapping and scheduling heuristics for wireless sensor networks
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
An effective cooperation mechanism among multi-devices in ubiquitous network
Proceedings of the 8th International Conference on Network and Service Management
Hi-index | 0.00 |
Mobile ad hoc networks (MANETs) have received significant attention in the recent past owing to the proliferation in the numbers of tetherless portable devices, and rapid growth in popularity of wireless networking. Most of the MANET research community has remained focused on developing lower layer mechanisms such as channel access and routing for making MANETs operational. However, little focus has been applied on higher layer issues, such as application modeling in dynamic MANET environments. In this paper, we present a novel distributed application framework based on task graphs that enables a large class of resource discovery based applications on MANETs. A distributed application is represented as a complex task comprised of smaller sub-tasks that need to be performed on different classes of computing devices with specialized roles. Execution of a particular task on a MANET involves several logical patterns of data flow between classes of such specialized devices. These data flow patterns induce dependencies between the different classes of devices that need to cooperate to execute the application. Such dependencies yield a task graph (TG) representation of the application.We focus on the problem of executing distributed tasks on a MANET by means of dynamic selection of specific devices that are needed to complete the tasks. In this paper, we present simple and efficient algorithms for dynamic discovery and selection (instantiation) of suitable devices in a MANET from among a number of them providing the same functionality. This is carried out with respect to the proposed task graph representation of the application, and we call this process Dynamic Task-Based Anycasting. Our algorithm periodically monitors the logical associations between the selected devices, and in the event of a disruption in the application owing to failures in any component in the network, it adapts to the situation and dynamically rediscovers the affected parts of the task graph, if possible. We propose metrics for evaluating the performance of these algorithms and report simulation results for a variety of application scenarios differing in complexity, traffic, and device mobility patterns. From our simulation studies, we observed that our protocol was able to instantiate and re-instantiate TG nodes quickly and yielded high effective throughput at low to medium degrees of mobility and not much below 70% effective throughput for high mobility scenarios.