Abstract
We analyze the statistical properties of the coverage of a one-dimensional path induced by a two-dimensional nonhomogeneous random sensor network. Sensor locations form a nonhomogeneous Poisson process and sensing area for the sensors are circles of random independent and identically distributed radii. We first characterize the coverage of a straight-line path by the nonhomogeneous one-dimensional Boolean model. We then obtain an equivalent M t /G t /∞, queue whose busy period statistics is the same as the coverage statistics of the line. We obtain k -coverage statistics for an arbitrary point and a segment on the x -axis. We provide upper and lower bounds on the probability of complete k -coverage of a segment. We illustrate all our results for the case of the sensor deployment having a “Laplacian” intensity function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
