A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Computational Geometry: Theory and Applications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Coverage for robotics – A survey of recent results
Annals of Mathematics and Artificial Intelligence
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Wireless Personal Communications: An International Journal
An approach to finding weak regions for wireless sensor networks with arbitrary sensing areas
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Dynamic optimization of Bluetooth networks for indoor localization
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Performance-effective and low-complexity redundant reader detection in wireless RFID networks
EURASIP Journal on Wireless Communications and Networking - Intelligent Systems for Future Generation Wireless Networks
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Identifying RFID-embedded objects in pervasive healthcare applications
Decision Support Systems
Efficient tag detection in RFID systems
Journal of Parallel and Distributed Computing
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
Solving the Wake-Up Scattering Problem Optimally
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Layered Diffusion-based Coverage Control in Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Network Management
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Restoration of coverage blind spots in wireless sensor networks based on ant colony algorithm
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Probability model for data redundancy detection in sensor networks
Mobile Information Systems - Advances in Mobile Communications and Computing
Radius reconfiguration for energy conservation in sensor networks
International Journal of Sensor Networks
Alleviating reader collision problem in mobile RFID networks
Personal and Ubiquitous Computing
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Sensor Networks (TOSN)
Vector method based coverage hole recovery in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
International Journal of Sensor Networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
CCS-MAC: Exploiting the overheard data for compression in wireless sensor networks
Computer Communications
Sensor redundancy check without geometric information
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
A review of redundancy elimination protocols for wireless sensor networks
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
On the lifetime of node-to-node communication in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
We study the problem of detecting and eliminating redundancy in a sensor network with a view to improving energy efficiency, while preserving the network's coverage. We also examine the impact of redundancy elimination on the related problem of coverage-boundary detection. We reduce both problems to the computation of Voronoi diagrams, prove and achieve lower bounds on the solution of these problems, and present efficient distributed algorithms for computing and maintaining solutions in cases of sensor failures or insertion of new sensors. We prove the correctness and termination properties of our distributed algorithms, and analytically characterize the time complexity and traffic generated by our algorithms. Using detailed simulations, we also quantify the impact of system parameters such as sensor density, transmission range, and failure rates on network traffic.