An improved byzantine fault-tolerant program for WSNs

被引：0
作者：
Tian, Yi [1 ]
机构：
[1] Shangluo University, Shangluo
来源：
Journal of Networks | 2014年 / 9卷 / 04期
关键词：
Byzantine fault-tolerant program; Fault tolerance; M-tree; WSNs;
D O I：
10.4304/jnw.9.4.932-940
中图分类号：
学科分类号：
摘要：
In order to increase the level of fault-tolerance of wireless sensor networks, thus to enhance the reliability and accuracy, we studies the traditional byzantine fault-tolerant program, and makes improvements in the environment of WSNs, reducing the number of rounds of message exchange between network nodes, thus improving the efficiency and reducing communication overhead and energy consumption. The simulation result shows that our program makes all normal network nodes reach an agreement, while the number of rounds of message exchange greatly decreases compared to the traditional byzantine program. © 2014 ACADEMY PUBLISHER.
引用
收藏
页码：932 / 940
页数：8
相关论文
共 15 条
  • [1] Zhou Y., Fang Y., Zhang Y., Securing wireless sensor networks: A survey, Communications Surveys & Tutorials, IEEE, 10, 3, pp. 6-28, (2008)
  • [2] Bekmezci I., Alagoz F., Energy efficient, delay sensitive, fault tolerant wireless sensor network for military monitoring, International Journal of Distributed Sensor Networks, 5, 6, pp. 729-747, (2009)
  • [3] Chen X., Makki K., Yen K., Pissinou N., Sensor network security: A survey, Communications Surveys & Tutorials, IEEE, 11, 2, pp. 52-73, (2009)
  • [4] Yick J., Mukherjee B., Ghosal D., Wireless sensor network survey, Computer networks, 52, 12, pp. 2292-2330, (2008)
  • [5] Kavitha T., Sridharan D., Security vulnerabilities in wireless sensor networks: A survey, Journal of information Assurance and Security, 5, 1, pp. 31-44, (2010)
  • [6] Lamport L., Shostak R., Pease M., The Byzantine generals problem, ACM Transactions on Programming Languages and Systems (TOPLAS), 4, 3, pp. 382-401, (1982)
  • [7] Correia M., Bessani N.A., Verissimo P., On Byzantine generals with alternative plans, Journal of Parallel and Distributed Computing, 68, 9, pp. 1291-1296, (2008)
  • [8] Kapron M.B., Kempe D., King V., Saia J., Sanwalani V., Fast asynchronous byzantine agreement and leader election with full information, ACM Transactions on Algorithms (TALG), 6, 4, (2010)
  • [9] King V., Saia J., Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary, Journal of the ACM (JACM), 58, 4, (2011)
  • [10] AlZain M.A., Soh B., Pardede E., A Survey on Data Security Issues in Cloud Computing: From Single to Multi-Clouds, Journal of Software, 8, 5, pp. 1068-1078, (2013)
12