Abstract
The real-time distributed systems predominantly rely on the time at which the correctness of results is obtained. More specifically, the core consideration is the time limitation with the running tasks, process, and threads of the system. Furthermore, the real-time systems spans from tiny micro-controller to aviation technology involving various process controls in engineering, technology, and manufacturing sites. Traditionally, the real-time computer application systems are built by using the services offered by a distributed sensors operating system. The three features of this are predictability, fault tolerance, and integration between the time constraint resources and schedule. The information about the distributed computational environment is provided via sensors and the state of the system can be controlled by the actuators, failure to meet the task deadlines can lead to disaster consequences.
The following chapter is reprinted by permission from Dr. Latesh Kumar K.J, MTS-Programmer, Computer Science and Engineering, Cloud and Cyber Security Consultant, latesh@sit.ac.in.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
D. Dolev, The Byzantine generals strike again. J. Algorithms 3(1), 14–30 (1982)
Penn State University, Reactive Sensor Networks, AFRL-IF-RS-TR-2003-245, Directorate, Public Affairs Office (IFOIPA) and is releasable to the National Technical Information Service (NTIS), Defense Advanced Research Laboratory, 2013
J. Park, R. Ivanov, J. Weimer, M. Pajic, S.H. Son, I. Lee, Security of cyber-physical systems in the presence of transient sensor faults. J. ACM Trans. Cyber-Phys. Syst. 1(3), 15 (2017). https://doi.org/10.1145/3064809
R.R. Brooks, S.S. Iyengar, Robust distributed computing and sensing algorithm. Computer 29(6), 53—60 (1996). https://doi.org/10.1109/2.507632. ISSN 0018-9162. Archived from the original on 2010-04-08. Retrieved 2010-03-22
M. Ilyas, I. Mahgoub, Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems (CRC Press, Boca Raton, 2004). pp. 254, 33-2 of 864. https://bit.csc.lsu.edu. ISBN 978-0-8493-1968-6. Archived from the original (PDF) on June 27, 2010. Retrieved March 22, 2010
B. Ao, Y. Wang, L. Yu, R.R. Brooks, S.S. Iyengar, On Precision bound of distributed fault-tolerant sensor fusion algorithms. ACM Comput. Surv. 49(1), 5 (2016). https://doi.org/10.1145/2898984. ISSN 0360-0300
L. Lamport, R. Shostak, M. Pease, The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982). CiteSeerX 10.1.1.64.2312. https://doi.org/10.1145/357172.357176
D. Dolev, et al., Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499–516. CiteSeerX 10.1.1.13.3049. https://doi.org/10.1145/5925.5931. ISSN 0004-5411. Accessed 23 March 2010
S. Mahaney, F. Schneider, Inexact agreement: accuracy, precision, and graceful degradation, in Proceedings of Fourth ACM Symposium Principles of Distributed Computing (1985), pp. 237–249. CiteSeerX 10.1.1.20.6337. https://doi.org/10.1145/323596.323618. ISBN 978-0897911689
B. Ao, Robust fault tolerant rail door state monitoring systems: applying the Brooks–Iyengar sensing algorithm to transportation applications. Int. J. Next Gener. Comput. 8(2), 108–114 (2015)
V. Kumar, Computational and compressed sensing optimizations for information processing in sensor network. Int. J. Next Gener. Comput. 3(3), 1–5 (2012)
B. Ao, Y. Wang, L. Yu, R.R. Brooks, S.S. Iyengar, On precision bound of distributed fault-tolerant sensor fusion algorithms. ACM Comput. Surv. 49(1), 5:1–5:23 (2016)
P.J. Rogina, G. Wainer, New real-time extensions to the MINIX operating system, in Proceedings of 5th International Conference on Information System Analysis and Synthesis (IASS ’99) (1999)
G.A. Wainer, Implementing Real-Time services in MINIX. ACM Oper. Syst. Rev. 29(3), 75–84 (1995)
S. Tanenbaum Andrew, S. Woodhull Albert, Sistemas Operativos: Diseno e Implementacion, 2nd edn. (Prentice Hall, Englewood Cliffs, 1999). ISBN 9701701658
K. Chakrabarty, S.S. Iyengar, H. Qi, E.C. Cho, Grid coverage of surveillance and target location in distributed sensor networks. IEEE Trans. Comput. 51(12), 1448–1453 (2002)
B. Krishnamachari, S.S. Iyengar, Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks. IEEE Trans Comput. 53(3), 241–250 (2004)
S. Mahaney, F. Schneider, Inexact agreement: accuracy, precision, and graceful degradation, in Proceedings of Fourth ACM Symposium Principles of Distributed Computing (ACM Press, New York, 1985), pp. 237–249
R. Brooks, S. Iyengar, Robust distributed computing and sensing algorithm. IEEE Comput. 29(6), 53–60 (1996)
Warrenedgar, An implementation of the Brooks–Iyengar algorithm using OpenMPI (2019). https://github.com/warrenedgar/brooks-iyengar
Acknowledgements
Authors of this book would like to thank Dr. Kumar as a prominent researcher on Storage—Cloud—Cyber-security—Protocol Engineering for the contribution to the chapter.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sniatala, P., Amini, M.H., Boroojeni, K.G. (2020). Ubiquitous Brooks–Iyengar’s Robust Distributed Real-Time Sensing Algorithm: Past, Present, and Future. In: Fundamentals of Brooks–Iyengar Distributed Sensing Algorithm. Springer, Cham. https://doi.org/10.1007/978-3-030-33132-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-33132-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33131-3
Online ISBN: 978-3-030-33132-0
eBook Packages: EngineeringEngineering (R0)