Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2013, Vol. 36 ›› Issue (4): 99-103.doi: 10.13190/jbupt.201304.101.huanghp

• Reports • Previous Articles     Next Articles

Security Improvements for Secure Routing Protocol SEAD Using Re-generative Hash Key Chain

HUANG Hai-ping1,2,3, WU Wan-feng1,2, WANG Ru-chuan1,2,3, LI Ling-juan1   

  1. 1. Department of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China;
    3. Jiangsu Computer Information Processing Technology Key Laboratory, Suzhou University, Jiangsu Suzhou 215006, China
  • Received:2012-09-24 Online:2013-08-31 Published:2013-05-22

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

CLC Number: