Research Article
On the k-Coverage of Line Segments by a Non Homogeneous Poisson-Boolean Model
@INPROCEEDINGS{10.1109/WIOPT.2009.5291571, author={Siripuram Aditya and Pallavi Manohar and D. Manjunath}, title={On the k-Coverage of Line Segments by a Non Homogeneous Poisson-Boolean Model}, proceedings={5th International Workshop on Spatial Stochastic Models for Wireless Networks}, publisher={IEEE}, proceedings_a={SPASWIN}, year={2009}, month={10}, keywords={Non homogenous poisson boolean model coverage path coverage k-coverage}, doi={10.1109/WIOPT.2009.5291571} }- Siripuram Aditya
Pallavi Manohar
D. Manjunath
Year: 2009
On the k-Coverage of Line Segments by a Non Homogeneous Poisson-Boolean Model
SPASWIN
IEEE
DOI: 10.1109/WIOPT.2009.5291571
Abstract
We consider k-coverage of a line by a two-dimensional, non homogeneous Poisson-Boolean model. This has applications in sensor networks. We extend the analysis of cite{Stadje89} to the case for k > 1. The extension requires us to define a vector Markov process that tracks the k segments that have the longest residual coverage at a point. This process is used to determine the probability of a segment of the line being completely covered by k or more sensors. We illustrate the extension by considering the case of k=2.
Copyright © 2009–2024 IEEE
