Ternary polynomial based key management scheme for wireless sensor network

Zhi Tao Guan*, Yue Xu, Jun Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

A ternary polynomial based key management (KMTP) scheme was proposed, which is effective in cluster based wireless sensor networks. Firstly, the base station will give each node one unique identifier to ensure the validity of the node. Then, algorithm of the inner-cluster and inter-cluster key pre-distribution based on the ternary polynomial of the same order was stated, which can ensure the value of the cracking threshold is bigger than the number of nodes of a cluster and all clusters separately, which means it's very hard to be cracked even all nodes of a cluster or all clusters are compromised. To assure the communication security, inter-cluster multi-hop routing mechanism was designed based on constructing secure conjunct neighbor table. Finally, the updating parameter and the updating authentication number were introduced in rekeying phase. The analysis shows that the proposed scheme can meet the security requirement of key management, and it also has less computation cost and storage cost than the existing schemes.

Original languageEnglish
Pages (from-to)71-78
Number of pages8
JournalTongxin Xuebao/Journal on Communications
Volume34
Issue number12
DOIs
Publication statusPublished - 2013 Dec

Keywords

  • Cluster
  • Distance parameter
  • Key management
  • Ternary polynomial
  • Wireless sensor network

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Ternary polynomial based key management scheme for wireless sensor network'. Together they form a unique fingerprint.

Cite this