Thumbnail
Access Restriction
Subscribed

Author Ao, Buke ♦ Wang, Yongcai ♦ Yu, Lu ♦ Brooks, Richard R. ♦ Iyengar, S. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2016
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Wireless sensor networks ♦ Distributed agreement ♦ Sensor fusion
Abstract Sensors have limited precision and accuracy. They extract data from the physical environment, which contains noise. The goal of sensor fusion is to make the final decision robust, minimizing the influence of noise and system errors. One problem that has not been adequately addressed is establishing the bounds of fusion result precision. Precision is the maximum range of disagreement that can be introduced by one or more faulty inputs. This definition of precision is consistent both with Lamport’s Byzantine Generals problem and the mini-max criteria commonly found in game theory. This article considers the precision bounds of several fault-tolerant information fusion approaches, including Byzantine agreement, Marzullo’s interval-based approach, and the Brooks-Iyengar fusion algorithm. We derive precision bounds for these fusion algorithms. The analysis provides insight into the limits imposed by fault tolerance and guidance for applying fusion approaches to applications.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-05-12
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 49
Issue Number 1
Page Count 23
Starting Page 1
Ending Page 23


Open content in new tab

   Open content in new tab
Source: ACM Digital Library