Abstract
Secure communication involving cluster heads in a sensor network is vital as they are responsible for data aggregation and for taking important decisions in their groups. in this article, we propose a scheme for secure communication via such nodes in a sensor network. in our approach, the base station provides a function to the cluster head of each group, which is used to compute the key for the secure communication with the base station. the protocol is first elucidated for a fixed cluster head in each group and later it is extended for dynamic cluster heads. Each function is computed using a certain number of points on the curve using Lagrange's interpolation [10]. the curve computed from the function intersects the Y axis at a point which is considered as the key to the cluster head. the advantage of this approach in providing secure communication out of a cluster head is that an adversary will not be able to get hold of the function by attacking the cluster head alone. This is because instead of storing the function in the cluster head, sub-functions are generated and distributed among the sensor nodes in each group. after the distribution of the sub-functions, these functions are discarded from each cluster head. When a cluster head wants to communicate with the base station it accumulates sub-functions to compute the function to compute the key used to encrypt/decrypt messages sent and received to and from the base station. for updating the functions, the sub-functions are updated using the information provided by the base station. the key distribution approach requires that the function is to be kept secret all the time. However, since it is present in the cluster head to compute the key, it is difficult to ensure its security. We have experimentally evaluated our scheme through the simulations using TinyOs and TOSSIM and the results show that latency can be improved by using the sub-functions updating approach rather than re-generating the functions and the sub-functions. Also, updating the sub-functions requires reduced computation and bandwidth requirements than updating the sub-keys because updating of the keys needs to be done from scratch whereas updating of the sub-functions are done using an updating parameter. © Taylor & Francis Group, LLC.
Recommended Citation
B. Panja and S. Madria, "Node Security in Hierarchical Sensor Networks: Distribution of Functions Versus Keys," International Journal of Distributed Sensor Networks, vol. 5, no. 5, pp. 531 - 556, SAGE Publications, Sep 2009.
The definitive version is available at https://doi.org/10.1080/15501320701863676
Department(s)
Computer Science
Publication Status
Free Access
Keywords and Phrases
Key distribution; Key management; Key recovery; Lagrange's interpolation; Partial key; Security; Sensor networks
International Standard Serial Number (ISSN)
1550-1477; 1550-1329
Document Type
Article - Journal
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 2024 SAGE Publications, All rights reserved.
Creative Commons Licensing
This work is licensed under a Creative Commons Attribution 4.0 License.
Publication Date
01 Sep 2009
