Network Court Protocol and Malicious Node Conviction

摘要：

A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebraic operators. It is shown that the malicious node conviction is equivalent to the uniqueness of the solution of a system of Boolean equations and that is equivalent to the uniqueness of a corresponding satisfiability problem. A linear time algorithm is presented for the conviction process using a graph search.

作者: Na Li David Lee

作者单位: Department of Computer Science and Engineering, The Ohio State University

会议类型: 国际会议

会议名称: The 15th IEEE International Conference on Network Protocols(ICNP 2007)(第15届IEEE国际网络协议大会)

会议地点: 北京

会议语种:英文

页码: 336-337

在线出版日期: 2007-10-16（万方平台首次上网日期，不代表论文的发表时间）