Hierarchy Merkle tree wireless sensor network architecture Online publication date: Sun, 30-Jul-2017
by Peiyong Cong; Zhenhu Ning; Fei Xue; Kechao Xu; Bo Fan; Haibo Li
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 12, No. 4, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook