Record Details

Path Coverage by a Sensor Field: The Nonhomogeneous Case

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Path Coverage by a Sensor Field: The Nonhomogeneous Case
 
Creator MANOHAR, P
RAM, SS
MANJUNATH, D
 
Subject pointwise stationary approximation
queues
networks
rates
theory
design
characterization
analysis
sensor network
k-coverage of paths
nonhomogeneous sensor deployment
nonhomogeneous queues
 
Description 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)/infinity 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.
 
Publisher ASSOC COMPUTING MACHINERY
 
Date 2011-07-18T20:56:01Z
2011-12-26T12:50:50Z
2011-12-27T05:36:57Z
2011-07-18T20:56:01Z
2011-12-26T12:50:50Z
2011-12-27T05:36:57Z
2009
 
Type Article
 
Identifier ACM TRANSACTIONS ON SENSOR NETWORKS, 5(2), -
1550-4859
http://dx.doi.org/10.1145/1498915.1498923
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5064
http://hdl.handle.net/10054/5064
 
Language en