A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Randomized algorithms
Reconstructing a three-dimensional model with arbitrary errors
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A discrete-time battery model for high-level power estimation
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Approximation algorithms
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Simulated Annealing Algorithm for Energy-Efficient Sensor Network Design
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A framework for time indexing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
eSENSE: energy efficient stochastic sensing framework scheme for wireless sensor platforms
Proceedings of the 5th international conference on Information processing in sensor networks
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Improved approximation algorithms for connected sensor cover
Wireless Networks
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in sensor networks
IEEE Transactions on Parallel and Distributed Systems
Restricted strip covering and the sensor cover problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Exploring in-situ sensing irregularity in wireless sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Wireless Personal Communications: An International Journal
A probabilistic signal-strength-based evaluation methodology for sensor network deployment
International Journal of Ad Hoc and Ubiquitous Computing
ART: an asymmetric and reliable transport mechanism for wireless sensor networks
International Journal of Sensor Networks
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Improved n 1-cover discovery using perimeter coverage information
International Journal of Sensor Networks
Connected K-target coverage problem in wireless sensor networks with different observation scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure localization with phantom node detection
Ad Hoc Networks
Minimization of the Redundant Coverage for Dense Wireless Sensor Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
EQOWSN: Evolutionary-based query optimization over self-organized wireless sensor networks
Expert Systems with Applications: An International Journal
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Towards a covered and connected body sensor network for healthcare applications
Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments
Coverage-aware sensor engagement in dense sensor networks
Journal of Embedded Computing - Selected papers of EUC 2005
Layered Diffusion-based Coverage Control in Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Simultaneous placement and scheduling of sensors
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Lifetime Maximization Based on Coverage and Connectivity in Wireless Sensor Networks
Journal of Signal Processing Systems
Optimal value of information in graphical models
Journal of Artificial Intelligence Research
IEEE Journal on Selected Areas in Communications - Special issue on body area networking: Technology and applications
Distributed algorithms for power saving optimization in sensor network
DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Energy efficient min-max spatial monitoring with wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Cluster head selection for homogeneous wireless sensor networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Energy-saving coverage algorithm of WSN
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Coverage and connected coverage problems for sensors embedded in a temperature-sensitive environment
International Journal of Sensor Networks
Energy efficient intrusion detection in camera sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Online distributed sensor selection
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
HiPC'08 Proceedings of the 15th international conference on High performance computing
Minimization of the redundant sensor nodes in dense wireless sensor networks
ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
Energy efficient monitoring in sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An optimal sensor network for intrusion detection
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Weaving a proper net to catch large objects in wireless sensor networks
IEEE Transactions on Wireless Communications
ACM Transactions on Sensor Networks (TOSN)
A memetic algorithm for extending wireless sensor network lifetime
Information Sciences: an International Journal
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Distributed energy-efficient scheduling approach for k-coverage in wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Design a breeze sensor system based on electric field via two-elemental direction
Expert Systems with Applications: An International Journal
Optimized network management for energy savings of wireless access networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
New complexity results for the k-covers problem
Information Sciences: an International Journal
Efficient Sensing Topology Management for Spatial Monitoring with Sensor Networks
Journal of Signal Processing Systems
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Primate-Inspired Communication Methods for Mobile and Static Sensors and RFID Tags
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Minimum-cost linear coverage by sensors with adjustable ranges
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless coverage via dynamic programming
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
On lightweight node scheduling scheme for wireless sensor networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Analyzing object detection quality under probabilistic coverage in sensor networks
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Design and analysis of wave sensing scheduling protocols for object-tracking applications
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On location-free node scheduling scheme for random wireless sensor networks
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Coverage-Aware sensor engagement in dense sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Multi-Dimensional resilient statistical en-route filtering in wireless sensor networks
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Randomized coverage-preserving scheduling schemes for wireless sensor networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
More is more: The benefits of denser sensor deployment
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Sensor Networks (TOSN)
An efficient sleep protocol for lifetime enhancement in multi covered and multi connected WSNs
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
ACM Transactions on Embedded Computing Systems (TECS)
A distributed lifetime-maximizing scheme for connected target coverage in WSNs
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
A survey on wireless sensor network infrastructure for agriculture
Computer Standards & Interfaces
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
Hi-index | 0.00 |
Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers iteratively in a round-robin fashion. This approach takes advantage of the overlap created when many sensors monitor a single area. Our work builds upon previous work in [13], where the model is first formulated. We have designed three approximation algorithms for a variation of the SET K-COVER problem, where the objective is to partition the sensors into covers such that the number of covers that include an area, summed over all areas, is maximized. The first algorithm is randomized and partitions the sensors, in expectation, within a fraction 1-1e (~.63) of the optimum. We present two other deterministic approximation algorithms. One is a distributed greedy algorithm with a 12 approximation ratio and the other is a centralized greedy algorithm with a 1-1e approximation ratio. We show that it is NP-Complete to guarantee better than 1516 of the optimal coverage, indicating that all three algorithms perform well with respect to the best approximation algorithm possible in polynomial time, assuming P ≠ NP. Simulations indicate that in practice, the deterministic algorithms perform far above their worst case bounds, consistently covering more than 72% of what is covered by an optimum solution. Simulations also indicate that the increase in longevity is proportional to the amount of overlap amongst the sensors. The algorithms are fast, easy to use, and according to simulations, significantly increase the longevity of sensor networks. The randomized algorithm in particular seems quite practical.