EnviroTrack: Towards an Environmental Computing Paradigm for Distributed Sensor Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Scheduling Algorithms
Sensor Networks for Emergency Response: Challenges and Opportunities
IEEE Pervasive Computing
VigilNet: An integrated sensor network system for energy-efficient surveillance
ACM Transactions on Sensor Networks (TOSN)
Task scheduling strategies for workflow-based applications in grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
The Impact of Under-Estimated Length of Jobs on EASY-Backfill Scheduling
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Speed control and scheduling of data mules in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
First responder applications often require safety surveillance using wireless camera networks~\cite{breadcrums}. To ensure visual sensing coverage, it is crucial to place optical sensor nodes at proper locations. Under the scenario of energy constrained wireless camera deployment, the issue of communication cost should also be considered. Previous camera deployment research (e.g Art Gallery Problem) mainly concerned sensing coverage. One well-known solution for the art gallery problem is to triangulate the objective polygon and then select vertices to ensure full coverage. However, deploying cameras only in the vertices of polygon may induce inefficiency both in number of necessary cameras and overall communication cost. To reduce the cost, we propose two deployment algorithms: 1) connected visibility region planning algorithm for static deployment given the floor plan is known, and 2) connected visibility region tracking algorithm for the dynamic deployment during the run time. In extensive simulations with real floor plans, our algorithms outperform previous solutions significantly.