A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Algorithms for generic role assignment in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Utility based sensor selection
Proceedings of the 5th international conference on Information processing in sensor networks
The sensor selection problem for bounded uncertainty sensing models
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Supporting concurrent applications in wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Decentralized, adaptive resource allocation for sensor networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Multi-Application Deployment in Shared Sensor Networks Based on Quality of Monitoring
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Challenges of satisfying multiple stakeholders: quality of service in the internet of things
Proceedings of the 2nd Workshop on Software Engineering for Sensor Network Applications
Auction-based task allocation with trust management for shared sensor networks
Security and Communication Networks
Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a shared sensor network, in order to maximize the overall Quality of Monitoring (QoM) subject to resource constraints (e.g., in terms of memory and network bandwidth). The resulting constrained optimization problem is a difficult and open problem since it is discrete, nonlinear, and not in closed-form. This paper makes several important contributions towards optimal multi-application allocation in shared sensor networks. (1) We formulate the optimal application allocation problem for a common class of distributed sensing applications whose QoM can be modeled as variance reduction functions. (2) We prove key theoretical properties of the optimization problem, including the monotonicity and submodularity of the variance reduction functions and the multiple knapsack structure of constraints; (3) By exploiting these properties, we propose a local search algorithm, which is efficient and has a good approximation bound, for application allocation in shared sensor networks. Simulations based on both real-world datasets and randomly generated networks demonstrate that our algorithm is competitive against simulated annealing in term of QoM, with up to three orders of magnitude reduction in execution times, making it a practical solution towards multi-application allocation in shared sensor networks.