Graphical Model Theory for Wireless Sensor Networks.

Davis, W. B.

Technical Information Center Oak Ridge Tennessee

关键词: Information processing;    Communications networks;    Algorithms;    Probability density functions;    Wireless sensor networks;   

RP-ID  :  DE2004833692

学科分类：工程和技术（综合）

美国|英语

来源: National Technical Reports Library

【 摘 要 】

Information processing in sensor networks, with many small processors, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort throughout the network. Graphical model theory provides a probabilistic theory of computation that explicitly addresses complexity and decentralization for optimizing network computation. The junction tree algorithm, for decentralized inference on graphical probability models, can be instantiated in a variety of applications useful for wireless sensor networks, including: sensor validation and fusion; data compression and channel coding; expert systems, with decentralized data structures, and efficient local queries; pattern classification, and machine learning. Graphical models for these applications are sketched, and a model of dynamic sensor validation and fusion is presented in more depth, to illustrate the junction tree algorithm.