Failure Filtrations for Fenced Sensor Networks

Details Failure Filtrations for Fenced Sensor Networks Failure Filtrations for Fenced Sensor Networks

2011-09-29

arxiv.org/abs/1109.6535v1

Computer Science

Computational Geometry

Scientific paper

In this paper we consider the question of sensor network coverage for a 2-dimensional domain. We seek to compute the probability that a set of sensors fails to cover given only non-metric, local (who is talking to whom) information and a probability distribution of failure of each node. This builds on the work of de Silva and Ghrist who analyzed this problem in the deterministic situation. We first show that a it is part of a slightly larger class of problems which is #P-complete, and thus fast algorithms likely do not exist unless P$=$NP. We then give a deterministic algorithm which is feasible in the case of a small set of sensors, and give a dynamic algorithm for an arbitrary set of sensors failing over time which utilizes a new criterion for coverage based on the one proposed by de Silva and Ghrist. These algorithms build on the theory of topological persistence.

Affiliated with

Also associated with

No associations

Rating

Failure Filtrations for Fenced Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Failure Filtrations for Fenced Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Failure Filtrations for Fenced Sensor Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152082