Computer Science ›› 2011, Vol. 38 ›› Issue (Z10): 56-58.

Previous Articles     Next Articles

Key Management Scheme for WSN Based on Convertible Ternary Polynomial

FANG Zhao-lin,XIE Hong-jun   

  • Online:2018-11-16 Published:2018-11-16

Abstract: Because all nodes having the same polynomial use the same shared session keys, schemes designed for wireless sensor networks based on the ternary polynomial are vulnerable to the node capture attacks. They are lack of performance scalability in terms of communication overhand. To address these limitations, a new dynamic key management proposal was designed for wireless sensor networks based on the convertible ternary polynomial, which can guarantee that all nodes having the same polynomial can get the same administration keys and two nodes having the same polynomial can get shared session keys. Compared with the schemes based on the ternary polynomial, the proposed scheme can greatly defend against the node capture attacks overall and reduce communication overhand.

Key words: Convertible ternary polynomial, Exclusion base system, Wireless sensor networks

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!