This paper analyzes the security and reliability of data transmission over wireless networks. We propose a method for determining the optimal parameter of separation message with specified given security level and reliability of data transmission in mobile networks. Keywords: Multipath routing, Mobile network, Securit

Alnaser, As'ad Mahmoud As'ad

Y. O., Kulakov

English

International Institute for Science, Technology and Education (IISTE): E-Journals

Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  8 Reliable Multipath Secure Routing In Mobile  Computer Networks As'ad Mahmoud As'ad Alnaser1*  Kulakov Y. O.2 1. Department of Computer Science, Al-Balqa' Applied University, Ajlun University College P.O. Box 158, Postal Code 21166, Irbid-Aidun, Jordan 2. Department of Computer Engineering, National Technical University of Ukraine “Kyiv Polytechnic Institute” * E-mail of the corresponding author: Asad1_99@yahoo.com  Abstract This paper analyzes the security and reliability of data transmission over wireless networks. We propose a method for determining the optimal parameter of separation message with specified given security level and reliability of data transmission in mobile networks. Keywords: Multipath routing, Mobile network, Security  1. Introduction The important aspects of wireless networks are safe and reliable data transmission. There are several methods to ensure the security of information on different network layers [Priyanka et al., 2010], which include ways of multipath routing methods to ensure safety at the physical level by splitting traffic between many different ways [Gopinath S., et al., 2012 , Yi J., et al ., 2011].  Multipath routing also significantly increase the reliability and fault tolerance for data transmission. This is especially relevant for wireless networks with a dynamic infrastructure. In an article [Jaisankar N., et al., 2010] a solution to ensure the data security during transmission of information inside the network without encryption was proposed, the solution is to increase reliability of information transfer. This is achieved by separation message with threshold secret schemes to pieces, which are then transmitted to the independent paths. Feature of the secret schemes is that the message can be restored only providing the pre-determined quantity of parts. Each of the parts separately assumes no useful information. It is allowed loss of some parts, there is a possibility of making redundancies in the scheme. However, the authors do not give calculation method for the optimal values  quantity of parts according to the different requirements. The purpose of this work is to examine the influence redundancy on data transmission security, considering probability characteristics of the network, and also search for the optimal parameters of the divided message in terms of safety and reliability.  2.A threshold scheme of separation message  This work proposed a method for the optimal partitioning messages into parts based on the threshold separation of the relatively small message (secret) K to N unique parts. At the same time to reconstruct the original message is enough to receive T parts from N. Such a division is called the threshold            (T, N)-separation, where NT ≤ . In the process of exchanging the secret on the sender side, the algorithm of messages division is executed, on the receiver side – the algorithm of message is recovered. There are several different threshold schemes of separation message, for example, the work [As’ad & Kulakov Y.O., 2012], proposed a modified scheme that used Lagrange interpolation polynomials. Since the actual message is too large to make it into a polynomial as a separate number, it is divided into segments of T bytes each. The separation process on the part is a relatively simple - determining the degree of the polynomial (T - 1): pxaxaxaaxf TT mod)...()(112210−−++++=  Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  9  at the points [ ]Nx ..1=  where 10,.., −Taa  - byte segments of the original message, p - prime, exceed max ),..,( 10 −Taa , for example, p = 257. Obtained the values of S(xi) are passed by independent routes to the recipient. If the received is less than T units, restoring the segment will not be possible. After receiving T or more parts, the receiver performs recovery segment using the Lagrange interpolation polynomial:  ,mod)()( pyxlxf iii∑=   .mod)( pxxxxxlji jiji ∏≠ −−= Recovery of all the coefficients ia  is performed by calculating the coefficients of the polynomial   )(xf  modulo p.  3. Distribution of the message parts The choice of optimal values T, N is also an important task .It is necessary to consider the safety performance of independent paths and select values in order to minimize the probability of intercepting the message. The most secure and, at the same time, the least reliable - distribution (N, N). In this case we take the N, equal to the number of independent paths, T = N, each part is sent to a particular path. In this case, the attacker must intercept all N pieces to recover the original message. However, this approach has one major drawback: the loss of one of the N parts, the recipient will not be able to collect the message and will have to request a retransmission. This problem is particularly relevant for wireless networks with dynamic topology and intermittent connectivity. In the case when NT <  , to recover the message there will be enough T units and losing of TN −  units will not affect the transfer result. Namely, that T smaller, the more likely were message deliver. On the other hand, the T reducing leads to a higher probability of intercept and recover the entire message by attacker. Thus, the main task is to find such T and N, to maintain a sufficient level of security at the highest possible reliability. We will introduce the notion of redundancy as r (T, N)-distribution:  NTr −= 1                                         (1) When T = N distribution has zero redundancy, that is .0=r  This provides maximum security with minimum reliability. To increase the reliability it is necessary to reduce T.  Figure 1 shows the dependence r from N for different values of T, although, the redundancy itself is not of interest. The objective of this article - to assess the impact of redundancy on the probability of message interception order to be able determine the optimal value of r in each case. This requires analysis of the compromise way probability and the probability to intercept messages.   4.Estimation of probability interception of message  Consider the mobile computer network in which the number of non-intersecting paths at the vertices in the Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  10 network is equal to m. Each of the non-intersecting paths consists of a nodes number. Suppose that the node can be captured with a probability, with the way intercepted if intercepted at least one node on the way. Then, the probability of compromise path will be:   )1(...)1()1(1 21 ji qqqp −⋅⋅−⋅−−=                     (2)  Probability of intercept message msgP  depends on the choice values of T, N, and the number of independent paths. For the separation of (N, N) calculation msgP  is quite simple - all N parts must be intercepted:      ∏==miimsg pP1                                        (3)  For  the  case when NT <  it is necessary also to calculate the probability of interception of k paths from m. In real systems for NT <  the calculation of msgP  is a daunting task. Compromised probability jq  of individual nodes is not equal, respectively, the probability of each path interception ip  is also different. For example, a look at the calculation of the probability msgP  at m = 4, N = 4, T = 3. Let them 4321 ,,, pppp  - the probability interception of corresponding paths. Then, to restore the message you need to steal at least 3 of the 4 ways. The probability msgP  derived from the formula of total probability:  ,4,44,3 PPPmsg +=  where: ,4321414,4 pppppPii ==∏=  .)1()1()1()1( 43214321432143214,3 ppppppppppppppppP −+−+−+−=   Since all values are random, in general it can’t be obtained depending msgP  on certain parameters, for example, )(rPmsg or )( pPmsg . Therefore, we consider the special case of the average, when probability of being compromised paths ip  are equal. At the same time, for calculating mkP ,   we can use the formula for the Bernoulli: kmkkmmk ppCP−−= )1(,                          (4)     Then, the formula for the probability of messages interception: miTNimsg PP ,∑==                             (5)  Figure 2 shows a probability plot of message interception on the probability of individual paths interception for different number of ways. Thus, for m = 1 msgP  is linearly dependent on p , and already for m = 2 is noticeably significant reduction of probability. 5. The influence redundancy on probability of message intercept  Previously, it was determined that increasing the redundancy leads to increase probability of message interception. After determining the formula redundancy r (1) and the probability msgP  (5) out several Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  11 researches can be carried.  Consider the dependence )(rPmsg  in Figure 3 and Figure 4. In the first case r was calculated for various separation schemes (T, N), p = 0,5. In the second case, changing p and N, T is fixed. The diagrams show that, first, the step of redundancy depends on N. The larger N, the smaller step. Second, redundancy depends on p, since for a given fixed level of security and increasing p leads to a restriction r. We introduce the notion as a threshold value of security y, which is the limiting value of message interception probability for the desired level of protection yPmsg ≤ .  We introduce the notion as a threshold value of security y, which is the limiting value of message interception probability for the desired level of protection yPmsg ≤ .   Figure 5 shows the restriction of redundancy for certain values of y and p, T = 5.  Stair stepping graph shows change in the pitch of redundancy depending on N. Also with the help of these graphs, a rough estimate of the maximum redundancy with average values of probability interception of separate paths p can be given.  6. Analytical Modeling In the previous sections particular cases with the average value of p were cited. Consider the calculation of allowable redundancy for a given threshold y and safety of different random values ip . The survey was developed by a software environment for the modeling of multipath routing in wireless networks.  As shown in Figure 6 , the model uses a network, The nodes are recorded probability of compromise. The threshold value of  y = 0,7. A result of modeling was obtained five best independent paths (sorted in order of increasing probability): 1. p = 0.657 [SRC] -> [1] -> [6] ->[15] -> [27] -> [DST] 2. p = 0.722 [SRC] -> [5] -> [11] -> [12] -> [19] -> [24] -> [DST] 3. p = 0.807 [SRC] -> [3] -> [10] ->[13] -> [17] -> [21] -> [25] ->[DST] 4. p = 0.814 [SRC] -> [4] -> [9] ->[18] -> [22] -> [23] -> [DST] 5. p = 0.816 [SRC] -> [2] -> [8] ->[14] -> [16] -> [20] ->[26] ->[DST] Calculation of redundancy for this model: 1. T = 5, N = 5, r = 0:      msgP = 0.254, 'msgP = 0.259 < y 2. T = 4, N = 5, r = 0.2:    msgP = 0.661, 'msgP = 0.660 < y 3. T = 3, N = 5, r = 0.4:    msgP = 0.913, 'msgP = 0.910 > y Here 'msgP  - is the theoretical probability of intercept messages for the average value of p. As can be seen, the values 'msgmsg PP ≈  coincide with an error, indicating that the correct programming model and implemented algorithms. Thus, for this model separation (4, 5) is optimal given the level of security y = 0,7. Redundancy in this case is 20%. That is, with the loss of one of the message parts can be recovered. With further increase of redundancy on one step, msgP  exceeds the limit y. 5. Conclusion In this work the effects of redundancy on the security of data transmission were analyzed, as well as search for the optimal value of r for a given security level in the system. It was found that for a given level of security, it is possible to find a (T, N)-distribution, in which the reliability of the transmission is maximized, Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  12 and the probability of being compromised will be within the threshold. The introduction of a threshold security protocol to determine the optimal parameters divided message in terms of safety and reliability. In the studies N was chosen equal to the number of independent paths. In the future it is necessary to research probability mN > , with the largest number of the message parts will be assigned to the path with the least likely to be compromised. The increase of N will reduce increment of redundancy, so at equal y, in a system with a large N, redundancy (reliability) will be higher. Also, with increased N, it will be difficult to calculate the values, because there are operations in the calculation of factorial (Bernoulli distribution) and the exponent (separation / collection message).  References As'ad Mahmoud As'ad Alnaser, Kulakov Y. O.,(2012) “Multipath Routing in Wireless Networks” Contemporary Engineering Sciences, Vol. 5, no. 6, 251 – 264.  Yi J., Adnane A., David S., Parrein B. , Radunovic B., Gkantsidis C., Gunawardena D., and Key P. (January 2011) “ Multipath optimized link state routing for mobile ad hoc networks Ad Hoc Networks”, Volume 9, Issue 1, Pages 28-47  Jaisankar N., Saravanan R. An Extended AODV (August 2010) “Protocol for Multipath Routing in MANETs “IACSIT International Journal of Engineering and Technology, Vol.2, No.4,.  Priyanka Goyal, Sahil Batra, Ajit Singh (November 2010) “A Literature Review of Security Attack in Mobile Ad-hoc Networks” International Journal of Computer Applications (0975 – 8887)  Volume 9– No.12  Gopinath S.,  Maragatharaj S.,  Rajalingam C., (January 2012) “The Modified Routing Protocol for Defending against Attacks in MANET” International Journal of Advanced Research inComputer Science and Software Engineering Volume 2, Issue 1.  Figure 1. Dependence of redundancy (r) from N for different T Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  13    Figure 2.  Probability msgP  on p  for (N, N) – distribution    Figure 3. Dependence msgP  from r for different T Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  14   Figure 4. Dependence msgP  from r for different p   Figure 5. Dependence r from q for different y  Computer Engineering and Intelligent Systems                                                           www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol.4, No.2, 2013  15  Figure 6. Modeling of ways formation This academic article was published by The International Institute for Science, Technology and Education (IISTE).  The IISTE is a pioneer in the Open Access Publishing service based in the U.S. and Europe.  The aim of the institute is Accelerating Global Knowledge Sharing.  More information about the publisher can be found in the IISTE’s homepage:  http://www.iiste.org  CALL FOR PAPERS The IISTE is currently hosting more than 30 peer-reviewed academic journals and collaborating with academic institutions around the world.  There’s no deadline for submission.  Prospective authors of IISTE journals can find the submission instruction on the following page: http://www.iiste.org/Journals/ The IISTE editorial team promises to the review and publish all the qualified submissions in a fast manner. All the journals articles are available online to the readers all over the world without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself. Printed version of the journals is also available upon request of readers and authors.  IISTE Knowledge Sharing Partners EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar   

Reliable Multipath Secure Routing In Mobile  Computer Networks

https://www.iiste.org/Journals/index.php/CEIS/article/download/4222/4291

Reliable Multipath Secure Routing In Mobile Computer Networks

Abstract

Similar works

Full text

Available Versions

International Institute for Science, Technology and Education (IISTE): E-Journals