An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Pushpin Computing System Overview: A Platform for Distributed, Embedded, Ubiquitous Sensor Networks
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Design and implementation of a single system image operating system for ad hoc networks
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
ROVERS: Pervasive Computing Platform for Heterogeneous Sensor-Actuator Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Dynamic data fusion for future sensor networks
ACM Transactions on Sensor Networks (TOSN)
On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topology-aware task mapping for reducing communication contention on large parallel machines
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On minimizing the resource consumption of cloud applications using process migrations
Journal of Parallel and Distributed Computing
Hi-index | 0.02 |
Given an application structured as a set of communicating mobile agents and a set of wireless nodes with sensing/actuating capabilities and agent hosting capacity constraints, the problem of deploying the application consists of placing all the agents on appropriate nodes without violating the constraints. This paper describes distributed algorithms that perform agent migrations until a "good" mapping is reached, the optimization target being the communication cost due to agent-level message exchanges. All algorithms are evaluated using simulation experiments and the most promising approaches are identified.