发明名称 Method for key update based on the amount of communication in wireless sensor networks having hierarchy structure
摘要 The present invention relates to a key update method based on the amount of communication in wireless sensor networks having a hierarchy structure.
申请公布号 US8831226(B2) 申请公布日期 2014.09.09
申请号 US201113295768 申请日期 2011.11.14
申请人 Gwangju Institute of Science and Technology 发明人 Lee Saewoom;Kim Kiseon;Lee Jeehoon;Sung Yoondong
分类号 H04L29/06;H04L9/08;H04W12/04;H04L29/08 主分类号 H04L29/06
代理机构 Nath, Goldberg & Meyer 代理人 Nath, Goldberg & Meyer ;Meyer Jerald L.;Protigal Stanley N.
主权项 1. A method for updating keys used for inter-node information transmission in a network environment where nodes in the network environment are hierarchically related, said network environment comprising: a manager node residing at a highest-level of the network hierarchy, the manager node comprising a processor having a random number generator, a network interface means, and a non-transitory storage, a representative node residing at a level lower on the network hierarchy than the manager node, the representative node comprising a processor having a random number generator, a network interface means, and a non-transitory storage, and a plurality of general nodes residing at a level lower on the network hierarchy than the representative node, wherein each general node comprises a processor having a random number generator, a network interface means, and a non-transitory storage, the method for updating keys comprising the steps of: performing a first communication between the representative node and the general nodes using their respective network interface means, and also performing a second communication between the manager node and the representative node using their respective network interface means;generating a manager node random number for the manager node using the random number generator of the manager node,generating a representative node random number for the representative node using the random number generator of the representative node, andgenerating a plurality of general node random numbers for each general node of the plurality of general nodes, said plurality of general node random numbers comprising one general node random number from each general node, respectively, and the one general node random number from each general node generated using the respective random number generator of each respective general node;generating a first symmetrical key and a second symmetrical key based on the manager node random number, the representative random number and the plurality of general node random numbers, and storing the first symmetrical key and the second symmetrical key in node storage, wherein the node storage is a non-transitory storage medium;calculating a first key update value according to the first communication and updating the first symmetrical key used for the first communication when the first key update value is changed, resulting in an updated first symmetrical key;calculating a second key update value according to the second communication and updating the second symmetrical key used for the second communication when the second key update value is changed, resulting in an updated second symmetrical key; andperforming the first communication using the updated first symmetrical key, and performing the second communication using the updated second symmetrical key.
地址 Buk-Gu, Gwangju KR