Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On deriving the upper bound of α-lifetime for large sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
ReCoDa: reliable forwarding of correlated data in sensor networks with low latency
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Monitoring schedules for randomly deployed sensor networks
Proceedings of the fifth international workshop on Foundations of mobile computing
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
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
Optimal placement of distributed sensors against moving targets
ACM Transactions on Sensor Networks (TOSN)
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
Theoretical Computer Science
Coverage and Reliability of Randomly Distributed Sensor Systems with Heterogeneous Detection Range
International Journal of Distributed Sensor Networks
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Data fusion improves the coverage of wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Minimal exposure path algorithms for directional sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Exposure-path prevention in directional sensor networks using sector model based percolation
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Sensor scheduling for p-percent coverage in wireless sensor networks
Cluster Computing
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Coverage estimation for crowded targets in visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Providing and finding k-road-coverage efficiently in wireless sensor networks
Wireless Communications & Mobile Computing
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
One of the main applications of wireless sensor networks is to provide proper coverage of their deployment regions. A wireless sensor network k-covers its deployment region if every point in its deployment region is within the coverage ranges of at least k sensors. In this paper, we assume that the sensors are deployed as either a Poisson point process or a uniform point process in a square or disk region, and study how the probability of the k-coverage changes with the sensing radius or the number of sensors. Our results take the complicated boundary effect into account, rather than avoiding it by assuming the toroidal metric as done in the literature.