Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Utility-Based Decision-Making in Wireless Sensor Networks
Utility-Based Decision-Making in Wireless Sensor Networks
On the densest k-subgraph problems
On the densest k-subgraph problems
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Maximizing system lifetime in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Dynamic wake-up and topology maintenance protocols with spatiotemporal guarantees
IPSN '05 Proceedings of the 4th international symposium 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
Decentralized, adaptive resource allocation for sensor networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
A wireless sensor network for structural health monitoring: performance and experience
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
A distributed, utility-based architecture for task assignment in tactical WSNS
ACM SIGBED Review - Special issue on the workshop on wireless sensor network architecture (April-2007)
Multi-user data sharing in radar sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Automatica (Journal of IFAC)
Priority-based target coverage in directional sensor networks using a genetic algorithm
Computers & Mathematics with Applications
Dominance and equivalence for sensor-based agents
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Optimal testing of structured knowledge
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Sensor selection via convex optimization
IEEE Transactions on Signal Processing
Feasibility analysis on optimal sensor selection in cyber-physical systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Active time scheduling for rechargeable sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient data gathering in wireless sensor networks with asynchronous sampling
ACM Transactions on Sensor Networks (TOSN)
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Cross-entropy optimization for sensor selection problems
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Estimation of distribution algorithm for sensor selection problems
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Near optimal multi-application allocation in shared sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
In-situ soil moisture sensing: Optimal sensor placement and field estimation
ACM Transactions on Sensor Networks (TOSN)
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Utility-driven data acquisition in participatory sensing
Proceedings of the 16th International Conference on Extending Database Technology
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
Hi-index | 0.01 |
Sensor networks consist of many small sensing devices that monitor an environment and communicate using wireless links. The lifetime of these networks is severely curtailed by the limited battery power of the sensors. One line of research in sensor network lifetime management has examined sensor selection techniques, in which applications judiciously choose which sensors' data should be retrieved and are worth the expended energy. In the past, many ad-hoc approaches for sensor selection have been proposed. In this paper, we argue that sensor selection should be based upon a tradeoff between application-perceived benefit and energy consumption of the selected sensor set.We propose a framework wherein the application can specify the utility of measuring data (nearly) concurrently at each set of sensors. he goal is then to select a sequence of sets to measure whose total utility is maximized, while not exceeding the available energy. Alternatively, we may look for the most cost-effective sensor set, maximizing the product of utility and system lifetime.This approach is very generic, and permits us to model many applications of sensor networks. We proceed to study two important classes of utility functions: submodular and supermodular functions. We show that the optimum solution for submodular functions can be found in polynomial time, while optimizing the costeffectiveness of supermodular functions is NP-hard. For a practically important subclass of supermodular functions, we present an LP-based solution if nodes can send for different amounts of time, and show that we can achieve an O(logn) approximation ratio if each node has to send for the same amount of time.Finally, we study scenarios in which the quality of measurements is naturally expressed in terms of distances from targets. We show that the utility-based approach is analogous to a penalty-based approach in those scenarios, and present preliminary results on some practically important special cases.