A probabilistic approach to inference with limited information in sensor networks

We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows sensor networks to answer queries effectively even when present information is partially corrupt and when more information is unavailable or too costly to obtain. We use a Bayesian network to model the sensor network and Markov chain Monte Carlo sampling to perform approximate inference. We demonstrate our technique on the specific problem of determining whether a friendly agent is surrounded by enemy agents and present simulation results for it.

[1]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[2]  T. J. Richardson,et al.  Approximation of Planar Convex Sets from Hyperplane Probes , 1997, Discret. Comput. Geom..

[3]  A. Hasman,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[4]  John W. Byers,et al.  Utility-based decision-making in wireless sensor networks , 2000, MobiHoc.

[5]  Leonidas J. Guibas,et al.  Sensing, tracking and reasoning with relations , 2002, IEEE Signal Process. Mag..

[6]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[7]  Sylvia Richardson,et al.  Markov Chain Monte Carlo in Practice , 1997 .

[8]  Sebastian Thrun,et al.  Learning occupancy grids with forward models , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[9]  J. Rosenthal.  Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo , 1995 .

[10]  Uri Lerner,et al.  Hybrid Bayesian networks for reasoning about complex systems , 2002 .

[11]  L. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.

[12]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[13]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[14]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[15]  Sebastian Thrun,et al.  Locating moving entities in indoor environments with teams of mobile robots , 2003, AAMAS '03.

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .