SECURE MULTIPATH ROUTING ALGORITHM WITH OPTIMAL BALANCING MESSAGE FRAGMENTS IN MANET
Authors: OLEKSANDRA S. YEREMENKO, ALI SALEM ALI
Number of views: 504
This paper is devoted to the proposition of the algorithm of secure multipath routing with optimal balancing message fragments number in MANET. The work considered the concept of the threshold secret sharing scheme in relation to secure routing using non-overlapping paths for the message fragments transmission. Based on the analysis of disadvantages of existing mechanism SPREAD, it was proposed to improve the fragments allocation model, which had been reduced to the optimal balancing of message fragments number transmitted over the non-overlapping paths. Several optimality criteria were suggested as to the solution of balancing problem using Shamir`s scheme with or without redundancy. In the comparative analysis it was justified to use optimality criterion in practice, providing, on the one hand, minimization of dynamically managed upper bound number of fragments transmitted over separate non-overlapping paths in the network, and on the other hand –adaptation to security parameters (probability of compromise) of individual network elements: nodes, links and paths. Numerical examples of models with different optimality criteria of the solutions obtained, and their comparative analysis were presented. Within the proposed algorithm it is suggested to use the model under which the minimum number of fragments is transmitted by the worst path in terms of the probability of compromise, whereas their maximum number - by the best path.
Keywords — Secure routing, MANET, probability of compromise, number of fragments balancing, non-overlapping paths.