Elements of statistical computing
Elements of statistical computing
Numerical methods and software
Numerical methods and software
Introduction to algorithms
Tolerating failures of continuous-valued sensors
ACM Transactions on Computer Systems (TOCS)
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Embedding the Internet: introduction
Communications of the ACM
Communications of the ACM
Wireless integrated network sensors
Communications of the ACM
Communications of the ACM
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobile Communications Handbook
Mobile Communications Handbook
Throughput analysis of fading sensor networks with regular and random topologies
EURASIP Journal on Wireless Communications and Networking
A point-distribution index and its application to sensor-grouping in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency
IEEE Transactions on Parallel and Distributed Systems
Stochastic event capture using mobile sensors subject to a quality metric
Proceedings of the 12th annual international conference on Mobile computing and networking
Coverage breach problems in bandwidth-constrained sensor networks
ACM Transactions on Sensor Networks (TOSN)
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
Challenging benchmark for location discovery in ad hoc networks: foundations and applications
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
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
Low-connectivity and full-coverage three dimensional wireless sensor networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
How many sensors for an acceptable breach detection probability?
Computer Communications
Applying general sensing mode to intrusion detection in wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-quality tradeoffs for target tracking in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
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
Pattern mutation in wireless sensor deployment
INFOCOM'10 Proceedings of the 29th conference on Information communications
Constructing low-connectivity and full-coverage three dimensional sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Journal of Global Optimization
An area-based collaborative sleeping protocol for wireless sensor networks
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Pattern mutation in wireless sensor deployment
IEEE/ACM Transactions on Networking (TON)
Distance Distribution in Convex n-Gons: Mathematical Framework and Wireless Networking Applications
Wireless Personal Communications: An International Journal
Experiment design for parameter estimation in sensing models
WiFlex'13 Proceedings of the First international conference on Wireless Access Flexibility
Hi-index | 0.00 |
Wireless ad hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This connection will enable computational treatments of the physical world in ways never before possible. In this far reaching scenario, Quality of Service can be expressed in terms of accuracy and/or latency of observing events and the overall state of the physical world. Consequently, one of the fundamental problems in sensor networks is the calculation of coverage, which can be defined as a measure of the ability to detect objects within a sensor filed. Exposure is directly related to coverage in that it is an integral measure of how well the sensor network can observe an object, moving on an arbitrary path, over a period of time. After elucidating the importance of exposure, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculations in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm can be applied to any given distribution of sensors, sensor and sensitivity models, and characteristics of the network. Furthermore, it provides an unbounded level of accuracy as a function of run time and storage. Finally, we provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation.