Int. J. of Wireless and Mobile Computing   »   2017 Vol.12, No.4

 

 

Title: Hierarchy Merkle tree wireless sensor network architecture

 

Authors: Peiyong Cong; Zhenhu Ning; Fei Xue; Kechao Xu; Bo Fan; Haibo Li

 

Addresses:
Faculty of Information Technology, Beijing University of Technology, Beijing, China
Faculty of Information Technology, Beijing University of Technology, Beijing, China
School of Information, Beijing Wuzi University, Beijing, China
China Electronics Standardization Institute, Beijing, China
China Electronics Standardization Institute, Beijing, China
China Electronics Standardization Institute, Beijing, China

 

Abstract: The famous cryptographer Merkle first put forward the idea of Merkle tree authentication. Complete binary tree is used for large amounts of data authentication and signature. In recent years, many scholars use Merkle tree for wireless sensor networks. For the processing of a large number of sensor nodes, Merkle tree can cause high computational complexity, high memory demand, high traffic load, validation delay and a series of practical problems. The Graded Merkle tree is proposed to alleviate some of these issues. However, with the further increase in the number of sensor nodes and expansion of the geographical scope, the wireless sensor networks based on the Graded Merkle tree highlights some new problems, such as scalability, robustness, flexibility, security and so on. In this paper, a modified wireless sensor network architecture based on hierarchical Merkle tree is proposed to effectively solve the above problems.

 

Keywords: Merkle tree; wireless sensor network; hierarchical Merkle tree.

 

DOI: 10.1504/IJWMC.2017.10006556

 

Int. J. of Wireless and Mobile Computing, 2017 Vol.12, No.4, pp.341 - 348

 

Submission date: 28 Oct 2016
Date of acceptance: 16 Feb 2017
Available online: 25 Jul 2017

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article