[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2009, Vol. 35 Issue (9) :1080-1082    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�µĴ����������ż��ԿԤ���䷽��
������, ����ΰ, �۶���*
�������պ����ѧ ������Ϣ����ѧԺ, ���� 100191
New pairwise key predistribution scheme for wireless sensor networks
Ding Xiaoyu, Liu Jianwei, Shao Dingrong*
School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

ժҪ
�����
�������
Download: PDF (336KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �����һ���µĻ��ڳ�������Ͷ���ʽ�Ķ�ż��ԿԤ���䷽��,�˷����Գ��������ά�Ⱥʹ������ڵ����ĺ�������Ϊ����.����������������:�����������ھӴ������ڵ��ĺ�������С��Ԥ���趨������ֵʱ,����ֱ�ӽ�����ż��Կ.�÷����Ĵ������ڽ��������ڵ��ĺ������������,�������������ֻ���ں�������Ϊ1ʱ����ֱ�ӽ�����ż��Կ������,������ȫ�����ܵķ���˵��,��������������ֵ����ʱ,����ͨ���������ڵ���������������ֱ�Ӷ�ż��Կ��������,�Ӷ���ʡ�˶��ڴ�����������˵ʮ����Ҫ����������.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
������
����ΰ
�۶���
�ؼ����� ��ż��Կ����   ����������   ���ڳ���������ԿԤ����   ����ʽ   ��������     
Abstract�� A new hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables was developed. This scheme exhibits a nice property: when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. The scheme is typical for the innovation that the Hamming distance threshold is parameterized which solves the constraint in previous schemes that any two neighboring nodes can establish pairwise key only when the Hamming distance is one. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, the resilience against node capture attack for higher probability of direct pairwise key establishment can be traded off, so as to save the energy consumption which is the most important issue for sensor networks.
Keywords�� pairwise key establishment   sensor networks   hypercube-based key predistribution   polynomial   Hamming distance     
Received 2008-07-15;
Fund:

����863����������Ŀ(2006AA01Z422);������Ȼ��ѧ����������Ŀ(60672102)

About author: ������(1976-),��,����������,��ʿ��,ding_xiao_yu@163.com.
���ñ���:   
������, ����ΰ, �۶���.�µĴ����������ż��ԿԤ���䷽��[J]  �������պ����ѧѧ��, 2009,V35(9): 1080-1082
Ding Xiaoyu, Liu Jianwei, Shao Dingrong.New pairwise key predistribution scheme for wireless sensor networks[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2009,V35(9): 1080-1082
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2009/V35/I9/1080
Copyright 2010 by �������պ����ѧѧ��