关键词: 无线自组织网络, 散列链再生, 安全路由协议, (t, n)门限方案

Abstract:

The regenerative Hash key chain mechanism is adopted for the secure routing protocol named as secure efficient distance vector routing (SEAD) in Ad hoc networks in order to enhance the security performance. Based on (t, n)-threshold scheme, a new regenerative Hash chain method is designed, in which as the sender sends one key value of the current Hash chain, and then it sends a shadow of public key of the new Hash chain as following. This method effectively verifies the signature of the tail value of the new Hash chain after receiving total t key values of the old Hash chain and simultaneously makes the new Hash chain to be used correctly continuing to ensure the routing protocol's security and reliability. Compared with the two methods proposed by Zhao Yuanchao, NS-2 simulation shows that the method has higher security and success rate on transmission of cbr packets, makes some improvements on energy consumption at the same time.

Key words: Ad hoc networks, re-initialization of Hash chain, secure routing protocol, (t, n)-threshold scheme