Sensing, tracking and reasoning with relations

Suppose we have a set of sensor nodes spread over a geographical area. Assume that these nodes are able to perform processing as well as sensing and are additionally capable of communicating with each other by means of a wireless network. Though each node is an independent hardware device, they need to coordinate their sensing, computation and communication to acquire relevant information about their environment so as to accomplish some high-level task. The integration of processing makes such nodes more autonomous and the entire system, which we call a sensor net, becomes a novel type of sensing, processing, and communication engine. The sensor net architecture presented in this article starts from a high-level description of the mission or task to be accomplished and then commands individual nodes to sense and communicate in a manner that accomplishes the desired result with attention to minimizing the computational, communication, and sensing resources required. Much work remains to be done to refine and implement the relational sensing ideas presented here and validate their performance. We believe, however, that the potential pay-off for the relation-based sensing and tracking we have proposed can be large, both in terms of developing rich theories on the design and complexity of sensing algorithms, as well as in terms of the eventual impact of the deployed sensor systems.

[1]  Ronald A. Howard,et al.  Information Value Theory , 1966, IEEE Trans. Syst. Sci. Cybern..

[2]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[4]  Y. Bar-Shalom.  Tracking and data association , 1988 .

[5]  Michael P. Wellman,et al.  Planning and Control , 1991 .

[6]  Michael I. Miller,et al.  REPRESENTATIONS OF KNOWLEDGE IN COMPLEX SYSTEMS , 1994 .

[7]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

[8]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[9]  Finn Verner Jensen,et al.  Introduction to Bayesian Networks , 2008, Innovations in Bayesian Networks.

[10]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[11]  Avi Pfeffer,et al.  Object-Oriented Bayesian Networks , 1997, UAI.

[12]  Leonidas J. Guibas,et al.  Cylindrical static and kinetic binary space partitions , 1997, SCG '97.

[13]  Leonidas J. Guibas,et al.  Proximity problems on moving points , 1997, SCG '97.

[14]  Leonidas J. Guibas,et al.  Maintaining the Extent of a Moving Point Set , 1997, WADS.

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

[16]  Michael I. Jordan,et al.  Probabilistic Independence Networks for Hidden Markov Probability Models , 1997, Neural Computation.

[17]  Jirí Matousek,et al.  Invitation to discrete mathematics , 1998 .

[18]  Leonidas J. Guibas,et al.  Kinetic binary space partitions for intersecting segments and disjoint triangles , 1998, SODA '98.

[19]  Avi Pfeffer,et al.  Structured Representation of Complex Stochastic Systems , 1998, AAAI/IAAI.

[20]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[21]  Leonidas J. Guibas,et al.  Parametric and kinetic minimum spanning trees , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  Avi Pfeffer,et al.  Probabilistic Frame-Based Systems , 1998, AAAI/IAAI.

[23]  Philippe Bonnet,et al.  Querying the physical world , 2000, IEEE Wirel. Commun..

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

[25]  Leonidas J. Guibas,et al.  Kinetic Connectivity for Unit Disks , 2000, SCG '00.

[26]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

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

[28]  Leonidas J. Guibas,et al.  Kinetic collision detection: algorithms and experiments , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[29]  Leonidas J. Guibas,et al.  A maintainable spanner routing graph for ad hoc mobile networks , 2001 .

[30]  Leonidas J. Guibas,et al.  Kinetic Connectivity for Unit Disks , 2001, Discret. Comput. Geom..

[31]  Leonidas J. Guibas,et al.  Scalable nonlinear dynamical systems for agent steering and crowd simulation , 2001, Comput. Graph..

[32]  Philippe Bonnet,et al.  Towards Sensor Database Systems , 2001, Mobile Data Management.

[33]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[34]  Leonidas J. Guibas,et al.  Scalable dynamical systems for multi-agent steering and simulation , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[35]  Leonidas J. Guibas,et al.  Deformable Free-Space Tilings for Kinetic Collision Detection† , 2002, Int. J. Robotics Res..

[36]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..