Robust Fault Tolerant Rail Door State Monitoring Systems: Applying the Brooks-Iyengar Sensing Algorithm to Transportation Applications
##plugins.themes.academic_pro.article.main##
Abstract
In a moving train, the acceleration and deceleration adversely effects the sensor systems, which may induce errors into the system. Todays technology does not guarantee success and safety in all situations. There are two important situations that are critical for the safety of passengers when embarking and disembarking. Distributed sensing networks needed to control the train doors require a fusion of the sensor inputs to provide accurate automatic opening and closing with minimum traction. Brooks-Iyengar Distributed Sensing algorithm can be used to provide a fault tolerant automatic sensing platform for closing doors based on the following scenario. An automatic sensor network can be installed in the motor circuit to collect current data through a wireless protocol. The data can be transmitted by cellular communication to servers, where the Brooks-Iyengar distributed sensing algorithm can be applied to identify and categorize the data signals to safely and automatically open and close the doors. This paper describes the performance evaluation of the signal output of Brooks-Iyengar algorithm in this application. Based upon the performance results, the Brooks-Iyengar Algorithm provides the best robust algorithm for implementation under faulty sensor conditions, such as those encountered in real-world transportation applications.
##plugins.themes.academic_pro.article.details##
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
Ao, B. . (2017). Robust Fault Tolerant Rail Door State Monitoring Systems: Applying the Brooks-Iyengar Sensing Algorithm to Transportation Applications. International Journal of Next-Generation Computing, 8(2), 108–114. https://doi.org/10.47164/ijngc.v8i2.129
References
- Ao, B., Wang, Y., Yu, L., Brooks, R. R., and Iyengar, S. S. 2016. On precision bound of distributed fault-tolerant sensor fusion algorithms. ACM Comput. Surv. 49, 1 (May), 5:1. 5:23.
- Brooks, R. R. and Iyengar, S. S. 1996. Robust distributed computing and sensing algorithm. Computer 29, 6 (June), 53-. 60.
- Dolev, D. 1981. The byzantine generals strike again. Tech. rep., Stanford, CA, USA.
- Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., and Weihl, W. E. 1986. Reaching approximate agreement in the presence of faults. J. ACM 33, 3 (May), 499-516.
- Ilyas, M., Mahgoub, I., and Kelly, L. 2004. Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Inc., Boca Raton, FL, USA.
- Kumar, V. 2012. Computational and compressed sensing optimizations for information processing in sensor network. IJNGC 3.
- Lamport, L., Shostak, R., and Pease, M. 1982. The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3 (July), 382-401.
- Mahaney, S. R. and Schneider, F. B. 1985. Inexact agreement: Accuracy, precision, and graceful degradation. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing. PODC '85. ACM, New York, NY, USA, 237-249.
- Marzullo, K. 1990. Tolerating failures of continuous-valued sensors. ACM Trans. Comput. Syst. 8, 4 (Nov.), 284-304.
- Mendes, H. and Herlihy, M. 2013. Multidimensional approximate agreement in byzantine asynchronous systems. In Proceedings of the Forty- fth Annual ACM Symposium on Theory of Computing. STOC '13. ACM, New York, NY, USA, 391-400.
- Sahni, S. and Xu, X. 2005. Algorithms for wireless sensor networks. IJDSN 1, 35-56.
- Vaidya, N. H. and Garg, V. K. 2013. Byzantine vector consensus in complete graphs. In Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. PODC '13. ACM, New York, NY, USA, 65-73.