Coverage problems for random intervals
SIAM Journal on Applied Mathematics
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Delay of intrusion detection in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Probabilistic detection of mobile targets in heterogeneous sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Bounds on coverage and target detection capabilities for models of networks of mobile sensors
ACM Transactions on Sensor Networks (TOSN)
On the Path Coverage Properties of Random Sensor Networks
IEEE Transactions on Mobile Computing
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
Energy-quality tradeoffs for target tracking in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
In-Network Computations of Machine-to-Machine Communications for Wireless Robotics
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We analyze the statistical properties of the k- coverage of a point-target moving in a straight line in a non-uniform dynamic sensor field. Sensor locations form a spatial point process. The environmental variation is captured by making the sensor locations form a non homogeneous spatial Poisson process with a fixed, spatially varying density function. The sensing areas of the sensors are circles of i.i.d. radii. The availability of each node is modeled by an independent, {0, 1}- valued, continuous time Markov chain. This gives a Markov-non homogeneous Poisson-Boolean model for which we perform a coverage analysis. We first obtain k-coverage of the target at an arbitrary time instant. We then obtain k-coverage statistics of the target during the time interval [0, T]. We also provide an asymptotically tight, closed form approximation for the duration for which the target is not k-covered in [0, T]. Numerical results illustrate the analysis. The environmental variation can also be captured by modeling the density function as a spatial random process resulting in the point process being a two-dimensional Cox process. For this model, we discuss issues in the coverage analysis.