Linear programming 1: introduction
Linear programming 1: introduction
Embedding the Internet: introduction
Communications of the ACM
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Navigation protocols in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Energy-efficient coverage for target detection in wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
The self-protection problem in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Wireless Networks
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage Estimation in the Presence of Occlusions for Visual Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Partially controlled deployment strategies for wireless sensors
Ad Hoc Networks
Covering of problem in wireless sensor networks
TELE-INFO'09 Proceedings of the 8th Wseas international conference on Telecommunications and informatics
Improving mobile target detection on randomly deployed sensor networks
International Journal of Sensor Networks
How many sensors for an acceptable breach detection probability?
Computer Communications
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
A fully distributed node allocation scheme for partition protection in MANET
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Efficient computation of minimum exposure paths in a sensor network field
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Energy efficient intrusion detection in camera sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Approximation algorithms for computing minimum exposure paths in a sensor field
ACM Transactions on Sensor Networks (TOSN)
Minimal exposure path algorithms for directional sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Coverage properties of clustered wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
Constructing underwater sensor based barriers using distributed auctions
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Mobile object evasion from detection by a group of observers
Automation and Remote Control
Analysis of target detection performance for wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
A GIS based wireless sensor network coverage estimation and optimization: a voronoi approach
Transactions on Computational Science XIV
Coverage estimation for crowded targets in visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Optimization of the law of moving object evasion from detection under constraints
Automation and Remote Control
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
Partial sensing coverage with connectivity in lattice wireless sensor networks
International Journal of Sensor Networks
Detect smart intruders in sensor networks by creating network dynamics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.01 |
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In order to maximize the effectiveness of sensor networks, one has to identify, examine, understand, and provide solutions for the fundamental problems related to wireless embedded sensor networks. We believe that one of such problems is to determine how well the sensor network monitors the instrumented area. These problems are usually classified as coverage problems. There already exist several methods that have been proposed to evaluate a sensor network's coverage.We start from one of such method and provide a new approach to complement it. The method of using the minimal exposure path to quantify coverage has been optimally solved using a numerical approximation approach. The minimal exposure path can be thought of as the worst-case coverage of a sensor network. Our first goal is to develop an efficient localized algorithm that enables a sensor network to determine its minimal exposure path. The theoretical highlight of this paper is the closed-form solution for minimal exposure in the presence of a single sensor. This solution is the basis for the new and significantly faster localized approximation algorithm that reduces the theoretical complexity of the previous algorithm. On the other hand, we introduce a new coverage problem - the maximal exposure path - which is in a sense the best-case coverage path for a sensor network. We prove that the maximal exposure path problem is NP-hard, and thus, we provide heuristics to generate approximate solutions.In addition, we demonstrate the effectiveness of our algorithms through several simulations. In the case of the minimal single-source minimal exposure path, we use variational calculus to determine exact solutions. For the case of maximal exposure, we use networks with varying numbers of sensors and exposure models.