Probabilistic model of triangulation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two-stage target locating algorithm in three dimensional WSNs under typical deployment schemes
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Journal of Network and Computer Applications
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
Sensor allocation in diverse environments
Wireless Networks
Coverage analysis for target localization in camera sensor networks
Wireless Communications & Mobile Computing
Mobility increases the surface coverage of distributed sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sweep-coverage with energy-restricted mobile wireless sensor nodes
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Hi-index | 754.84 |
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.