AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Byzantine Fault-Tolerant Routing for Large-Scale Wireless Sensor Networks Based on Fast ECDSA

Department of Communication and Information Engineering, Shanghai University, Shanghai 200072, China.
China Information Security Research Institute, Beijing 102200, China.
Ltd. Huawei, Shenzhen 518219, China.
Institute of Computer Engineering and Science, Shanghai University, Shanghai 200072, China.
Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USA.
Show Author Information

Abstract

Wireless sensor networks are a favorite target of Byzantine malicious attackers because of their limited energy, low calculation capability, and dynamic topology, and other important characteristics. The Byzantine Generals Problem is one of the classical problems in the area of fault tolerance, and has wide application, especially in distributed databases and systems. There is a lot of research in agreement and replication techniques that tolerate Byzantine faults. However, most of this work is not suited to large-scale wireless sensor networks, due to its high computational complexity. By introducing Fast ECDSA (Elliptic Curve Digital Signature Algorithm), which can resist timing and energy attacks, and reduce the proportion of verifying signature algorithm to generating signature algorithm to 1.2 times, we propose a new Byzantine fault-tolerant routing algorithm for large-scale wireless sensor networks with double-level hierarchical architecture. In different levels, the algorithm runs different BFT protocols. Theory and simulation results have proved that this algorithm has high security and the number of communication rounds between clusters is reduced by 1/3, which balances the network load. At the same time, the application of Fast ECDSA improves the security level of the network without burdening it.

References

[1]
Liskov B., Rodrigues R., Tolerating Byzantine faulty clients in a quorum system, in Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, (ICDCS06), Lisbon, Portugal, 2006.
[2]
Vandiver B., Detecting and tolerating Byzantine faults in database systems PhD dissertation, MIT, USA, 2008.
[3]
Amir Y., Danilov C., Dolev D., Kirsch J., Lane J., Nita-Rotaru C., Olsen J., Zage D., Steward: Scaling Byzantine fault-tolerant replication to wide area networks, IEEE Transactions on Dependable and Secure Computing, vol. 7, no. 1, pp. 8093, 2010.
[4]
Wu B., Chen J. M., Wu J., Cardei M., A survey of attacks and countermeasures in mobile ad hoc networks, in Wireless Network Security on Signals and Communication Technology, Xiao Y., Shen X., Du D.-Z., Eds. Springer, 2007, pp. 103135.
[5]
Hsieh H. C., The agreement problem in the mobile network Master degree dissertation, Chaoyang University of Technology, Taichung, China, 2004.
[6]
Liu Y., Yu N. H., Feng X. L., A cluster-based solution to BGP on mobile ad hoc network, (in Chinese), Journal of Electronics & Information Technology, vol. 28, no. 12, pp. 23862389, 2006.
[7]
Vempaty A., Ozdemir O., Varshney P. K., Target tracking in wireless sensor networks in the presence of Byzantines, in 16th International Conference on Information Fusion, Istanbul, Turkey, 2013.
[8]
Lin B., Wang W. J., Yin Q. Y., Li H. X., Yang R., An energy-efficient geographic routing based on cooperative transmission in wireless sensor networks, Science China Information Sciences, vol. 56, no. 7, p. 072302, 2013.
[9]
Koh J. Y., Teo J. C. M., Wong W.-C., Mitigating Byzantine attacks in data fusion process for wireless sensor networks using witnesses, in Proceedings of the 2014 IEEE ICCS, Macau, China, 2014.
[10]
Vempaty A., Ray P., Varshey P. K., False discovery rate based distributed detection in the presence of Byzantines, IEEE Transactions on Aerospace and Electronic System, vol. 50, no. 3, pp. 18261840, 2014.
[11]
Bhuiyan M. Z. A., Wang G. J., Cao J. N., Wu J., Deploying wireless sensor networks with fault-tolerance for structural health monitoring, IEEE Transaction on Computers, vol. 64, no. 2, pp. 382395, 2015.
[12]
Li J. J., Wu J., Ma Z. N., Frequency and similarity-aware partitioning for cloud storage based on space-time utility maximization model, Tsinghua Science and Technology, vol. 20, no. 3, pp. 233245, 2015.
[13]
Zhou Z. M., Wu C. S., Yang Z., Liu Y. H., Sensorless sensing with WiFi, Tsinghua Science and Technology, vol. 20, no. 3, pp. 16, 2015.
[14]
Min Y. H., Byzantine generals problem, Science Technology for China's Mass Media in Chinese, vol. 3, no. 3, pp. 3538, 2006.
[15]
Castro M., Liskov B., Authenticated Byzantine fault tolerance without public-key cryptography, Technical Memo MIT/LCS/TM-589, MIT Laboratory for Computer Science, 1999.
[16]
Wang C., Shi X. Y., Niu Z. H., The research of the promotion for ECDSA algorithm based on Montgomery-form ECC, (in Chinese), Journal on Communications, vol. 31, no. 1, pp. 913, 2010.
[17]
Desmedt Y., Some recent research aspects of threshold cryptography, Lecture Notes in Computer Science, vol. 1396, pp. 158173, 1998.
[18]
Wang C., Jia X. Y., Lin Q., Trust-based secure routing algorithm for wireless sensor networks, (in Chinese), Journal on Communications, vol. 29, no. 1, pp. 105112, 2008.
Tsinghua Science and Technology
Pages 627-633
Cite this article:
Xu J, Wang K, Wang C, et al. Byzantine Fault-Tolerant Routing for Large-Scale Wireless Sensor Networks Based on Fast ECDSA. Tsinghua Science and Technology, 2015, 20(6): 627-633. https://doi.org/10.1109/TST.2015.7350015

666

Views

23

Downloads

5

Crossref

N/A

Web of Science

9

Scopus

2

CSCD

Altmetrics

Received: 30 June 2015
Accepted: 27 July 2015
Published: 17 December 2015
© The author(s) 2015
Return