PUF-Based Mutual-Authenticated Key Distribution for Dynamic Sensor Networks

Because of the movements of sensor nodes and unknown mobility pattern, how to ensure two communicating (static or mobile) nodes authenticate and share a pairwise key is important. In this paper, we propose a mutual-authenticated key distribution scheme based on physical unclonable functions (PUFs) for dynamic sensor networks. Compared with traditional key predistribution schemes, the proposal reduces the storage overhead and the key exposure risks and thereby improves the resilience against node capture attacks. Mutual authentication is provided by the PUF challenge-response mechanism. However, the PUF response is not transmitted in plain forms so as to resist the modelling attacks, which is vulnerable in some existing PUF-based schemes. We demonstrate the proposed scheme to improve the secure connectivity and other performances by analysis and experiments.

Convergecast Tree on Temporal Graphs

Temporal graphs are useful tools to model dynamic network topologies found in many applications. In this paper, we address the problem of constructing a convergecast tree on temporal graphs for data collection in dynamic sensor networks. Two types of convergecast trees, bounded arrival time convergecast tree and minimum total arrival time convergecast tree are defined as useful structures for low delay data collection. An [Formula: see text] time centralized algorithm is proposed to construct a bounded arrival time convergecast tree, where [Formula: see text] is the number of nodes, [Formula: see text] is the number of edges, and [Formula: see text] is the lifetime of the given temporal graph. The algorithm presented is an offline algorithm and assumes that all information about change in the graph topology is known apriori. It is then shown that the problem of constructing a minimum total arrival time convergecast tree is NP-complete, and an [Formula: see text] time centralized, offline heuristic algorithm is proposed to address it. The heuristic algorithm is evaluated with experiments on four real life data sets.

Multi-Leader Election Algorithm Based On VORONOI Partition for Self-Stabilization in MANETs

Electing a leader in Mobile Adhoc Networks (MANETs) is the basic problem in providing the stabilization. Many current research outcomes study multi-leader election concept in the static networks and single leader in dynamic networks. The article mainly focusses on multi leader election in dynamic sensor networks where the nodes were installed randomly. This proposed concept elect an exclusive leader when the topology changes occurred eventually over the network. Furthermore, a basic representation used for the process. Also provided accurate proof for the proposed algorithm and shown the way of satisfying the stability condition through ensured results.