On the bounds of separability in sensor networks

• Published in: 2010 National Conference On Communications (NCC) pp. 1 - 5
• Main Author: Krishnan, B.S.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.01.2010
• Subjects: Algorithm design and analysis; Area measurement; Condition monitoring; Performance analysis; Random variables; Sensor phenomena and characterization; Target tracking; Temperature sensors; Testing; Upper bound
• DOI: 10.1109/NCC.2010.5430169
• ISBN: 1424463831; 9781424463831

A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose binary outputs are functions of the distance between the sensor and target. Sensors are deployed randomly according to a Poisson distribution. The probability that two target locations at a distance of r between them are separable is derived. This is extended to derive the probability of having at least Z among M uniformly distributed target locations to be non-separable from the origin. The bounds on this probability are expressed as a function of the sensor density ¿.