Introduction to algorithms
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Energy-Aware Routing in Cluster-Based Sensor Networks
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A distributed coordination framework for wireless sensor and actor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage, exploration, and deployment by a mobile robot and communication network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Propagation measurements and models for wireless communications channels
IEEE Communications Magazine
Clustering of wireless sensor and actor networks based on sensor distribution and connectivity
Journal of Parallel and Distributed Computing
Coverage-aware connectivity restoration in mobile sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Formal development of wireless sensor-actor networks
Science of Computer Programming
| Hi-index | 0.00 |
In Wireless Sensor and Actor Networks (WSANs), responsiveness to serious events is of utmost importance and thus, minimal latency should be experienced. In addition, since these actions can be taken at any spot within the monitored area, the actors should provide maximal coverage of the area. In this paper, we propose two actor placement mechanisms for WSANs, namely COLA and COCOLA that consider both the delay requirements of data collection and the coverage of the area. COLA evenly distributes the actors in the region for maximised coverage first. Actors then collaboratively form clusters. Each individual actor repositions itself at a new location that enables minimal latency in collecting data in its cluster. COCOLA is an extension to COLA which additionally enforces connectivity among the actors by assigning appropriate locations to each actor for improved coverage and reduced latency. The effectiveness of both approaches is evaluated through extensive simulation experiments.