Secure Overlay Routing Using Key Pre-Distribution: A Linear Distance Optimization Approach

Abstract

Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today's secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using weighted directed graphs and propose a boolean linear programming (LP) problem to find the optimal path. Albeit the fact that the solutions to boolean LP problems are of much higher complexities, we propose a method for solving our problem in polynomial time. In order to evaluate its performance and security measures, we apply our proposed algorithm to a number of recently proposed symmetric and asymmetric key pre-distribution methods. The results show that our proposed algorithm offers great network performance improvements as well as security enhancements when augmenting baseline techniques.

Random Cooperative Key Pre-Distribution Scheme in Wireless Sensor Networks

“…Gateway nodes can share and load the loads on wireless sensor nodes and prolong the lifetime of network work [1]. Gharib et al (2016) pointed out that the dense pre-allocation scheme can enable any two nodes in the network to establish a shared key directly. When the number of the captured nodes is not more than the threshold value, the entire network is secure [2].…”

A Survey of Key Pre-Distribution and Overlay Routing in Unstructured Wireless Networks

“…Eschenauer and Gligor propose the original idea of Figure 2. An example of overlay routing using asymmetric key pre-distribution [32].…”

“…Gharib et al [32] propose an overlay routing algorithm for key pre-distribution schemes with the main advantage of being able to jointly optimize the costs of overlay and underlay paths. The other important advantage of this algorithm is being agnostic to the choice of key pre-distribution scheme.…”

A Key Pre-Distribution Scheme Based on µ-PBIBD for Enhancing Resilience in Wireless Sensor Networks

“…Key pre-distribution (KPD) scheme is one of the most extensive research directions of symmetric key management in WSNs [ 15 , 16 , 17 ]. A typical KPD scheme contains three phases: key pre-distribution, shared-key discovery and path-key establishment [ 13 , 18 ].…”

“…KPD schemes in WSNs are classified into probabilistic KPD scheme and deterministic KPD scheme based on the manner of key selection [ 6 , 12 , 16 ]. Typical probabilistic KPD schemes include random KPD, Q-composite KPD and polynomial pool based KPD [ 13 ].…”