Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo hóa học: " A Robust on-Demand Path-Key Establishment Framework via Random Key Predistribution for Wireless Sensor "

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: A Robust on-Demand Path-Key Establishment Framework via Random Key Predistribution for Wireless Sensor | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2006 Article ID 91304 Pages 1-10 DOI 10.1155 WCN 2006 91304 A Robust on-Demand Path-Key Establishment Framework via Random Key Predistribution for Wireless Sensor Networks Guanfeng Li 1 Hui Ling 1 Taieb Znati 1 and Weili Wu2 1 Department of Computer Science University of Pittsburgh Pittsburgh PA 15260 USA 2 Department of Computer Science University of Texas at Dallas Richardson TX 75083-0688 USA Received 2 October 2005 Revised 11 January 2006 Accepted 12 January 2006 Secure communication is a necessity for some wireless sensor network WSN applications. However the resource constraints of a sensor render existing cryptographic systems for traditional network systems impractical for a WSN. Random key predistribution scheme has been proposed to overcome these limits. In this scheme a ring of keys is randomly drawn from a large key pool and assigned to a sensor. Nodes sharing common keys can communicate securely using a shared key while a path-key is established for those nodes that do not share any common keys. This scheme requires moderate memory and processing power thus it is considered suitable for WSN applications. However since the shared key is not exclusively owned by the two end entities the established path-key may be revealed to other nodes just by eavesdropping. Based on the random-key predistribution scheme we present a framework that utilizes multiple proxies to secure the path-key establishment. Our scheme is resilient against node capture collusive attack and random dropping while only incurring a small amount of overhead. Furthermore the scheme ensures that with high probability all path-keys are exclusively known by the two end nodes involved in the communication along the path. Copyright 2006 Guanfeng Li et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and .