Sensing uncertainty reduction using low complexity actuation
Proceedings of the 3rd international symposium on Information processing in sensor networks
Robust distributed estimation in sensor networks using the embedded polygons algorithm
Proceedings of the 3rd international symposium on Information processing in sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Dynamic coverage in ad-hoc sensor networks
Mobile Networks and Applications
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Coverage protocols for detecting fully sponsored sensors in wireless sensor networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Stochastic coverage in heterogeneous sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
ACM Transactions on Sensor Networks (TOSN)
Modeling and simulating coverage in sensor networks
Computer Communications
Bounds on coverage and target detection capabilities for models of networks of mobile sensors
ACM Transactions on Sensor Networks (TOSN)
Asynchronous random sleeping for sensor networks
ACM Transactions on Sensor Networks (TOSN)
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
International Journal of Robotics Research
Towards characterizing the effectiveness of random mobility against actuation attacks
Computer Communications
On the efficient and fast response for sensor deployment in sparse wireless sensor networks
Computer Communications
Configuring node status in a two-phase tightly integrated mode for wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
An energy efficient and self-healing 3-dimensional sensor cover
International Journal of Ad Hoc and Ubiquitous Computing
Sensor coverage in wireless ad hoc sensor networks
International Journal of Sensor Networks
Some problems of directional sensor networks
International Journal of Sensor Networks
Probabilistic model of triangulation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
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
An Algorithm of Coverage Control for Wireless Sensor Networks in 3D Underwater Surveillance Systems
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
A unified approach for heterogeneity and node fault robustness in dynamic sensor networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Covering a line segment with variable radius discs
Computers and Operations Research
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Redundant coverage for noise reduction in dynamic sensor networks
WSEAS TRANSACTIONS on SYSTEMS
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
A probabilistic model of k-coverage in minimum cost wireless sensor networks
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Distributed coordinate-free algorithm for full sensing coverage
International Journal of Sensor Networks
Covering of problem in wireless sensor networks
TELE-INFO'09 Proceedings of the 8th Wseas international conference on Telecommunications and informatics
Data fusion improves the coverage of wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
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
A Localized Algorithm for Target Monitoring in Wireless Sensor Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
How many sensors for an acceptable breach detection probability?
Computer Communications
ACC'09 Proceedings of the 2009 conference on American Control Conference
Coverage and connected coverage problems for sensors embedded in a temperature-sensitive environment
International Journal of Sensor Networks
An underwater sensor allocation scheme for a range dependent environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage, connectivity, and fault tolerance measures of wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Coverage problem of wireless sensor networks
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
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
K-connected target coverage problem in wireless sensor networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Clustering-based minimum energy wireless m-connected k-covered sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Maximal breach in wireless sensor networks: geometric characterization and algorithms
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Algorithms for the m-coverage problem and k-connected m-coverage problem in wireless sensor networks
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
A clique base node scheduling method for wireless sensor networks
Journal of Network and Computer Applications
Wireless sensor deployment for 3D coverage with constraints
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Obstacle discovery in distributed actuator and sensor networks
ACM Transactions on Sensor Networks (TOSN)
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
Maximum lifetime scheduling for target coverage in wireless sensor networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
A boundary approximation algorithm for distributed sensor networks
International Journal of Sensor Networks
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Mobile location tracking in metro areas: malnets and others
Proceedings of the 17th ACM conference on Computer and communications security
Pervasive and Mobile Computing
A distributed sleep scheduling algorithm with range adjustment for wireless sensor networks
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Policy controlled self-configuration in unattended wireless sensor networks
Journal of Network and Computer Applications
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Journal of Global Optimization
Positioning method for outdoor systems in wireless sensor networks
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On coverage problems of directional sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
An energy efficient network topology configuration scheme for sensor networks
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Optimisation problems based on the maximal breach path measure for wireless sensor network coverage
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Strong barrier coverage in directional sensor networks
Computer Communications
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
Coverage restricted to an angle
Operations Research Letters
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Roadside unit deployment for information dissemination in a VANET: an evolutionary approach
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Providing and finding k-road-coverage efficiently in wireless sensor networks
Wireless Communications & Mobile Computing
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
Voronoi tessellation based rapid coverage decision algorithm for wireless sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Analysis of Sensors' Coverage through Application-Specific WSN Provisioning Tool
International Journal of Mobile Computing and Multimedia Communications
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Barrier coverage in bistatic radar sensor networks: cassini oval sensing and optimal placement
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Sensor Networks (TOSN)
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks
International Journal of Sensor Networks
| Hi-index | 14.98 |
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking. One of the fundamental problems in sensor networks is the calculation of the coverage. In Meguerdichian et al. (2001), it is assumed that the sensor has uniform sensing ability. We provide efficient distributed algorithms to optimally solve the best-coverage problem raised in the above-mentioned article. In addition, we consider a more general sensing model: the sensing ability diminishes as the distance increases. As energy conservation is a major concern in wireless (or sensor) networks, we also consider how to find an optimum best-coverage-path with the least energy consumption and how to find an optimum best-coverage-path that travels a small distance. In addition, we justify the correctness of the method proposed above that uses the Delaunay triangulation to solve the best coverage problem and show that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.