Selfish Aware Mathematical Model Based on ...

Selfish Aware Mathematical Model Based on Conditional Reliability Expectation Coefficient J.Sengathir1 and R.Manoharan2 1

Research Scholar, Department of Computer Science and Engineering, 1 Pondicherry Engineering College, Pondicherry, India. 2 Associate Professor, Department of Computer Science and Engineering, 2 Pondicherry Engineering College, Pondicherry, India. 1 [email protected],[email protected]

Abstract: In Mobile ad hoc networks, Reputation is considered as an important aspect for establishing collaboration between wireless mobile nodes. Computing the level of reputation in MANETs is highly challenging due to the dynamic movement of nodes and their computational overhead. In MANETs, the presence of a selfish node could affect both the reliability and the quality of data disseminated in the network. Hence there is a need for devising a detection mechanism to identify the selfish behavior of nodes. In this paper, we propose a conditional probability based mathematical solution for detecting the selfish nodes in an ad hoc scenario. The performance of the proposed solution is analyzed through ns-2 simulations based on the parameter like Packet Delivery Ratio, Control Overhead and Total Overhead, which is determined by varying the threshold level for selfish node detection. The result facilitates to predict large number of selfish nodes using optimal threshold range. Keywords: Conditional Probability, Threshold range, Selfish nodes, Random variable, Erlang distribution

1 Introduction Establishing Collaboration among the wireless mobile nodes in a MANET is considered to be a significant issue that has not been explored in the past decades [1]. Establishing cooperation between the mobile nodes is crucial because of the lack of dynamic movement of mobile nodes in MANET [2]. The network performance may degrade in the existence of malicious nodes called selfish nodes which deny collaborating in order to save its own resources [3]. Hence, a need arises for framing a mathematical model for efficient and effective detection of selfish nodes. In this paper, we propose an efficient probabilistic mathematical model based on conditional expectation to identify and mitigate selfish nodes. This is accomplished through the manipulation of Conditional Reliability Expectation Coefficient (CREC) for each and every node participating in an ad hoc scenario. The protocol used for our experimental study is the AODV protocol, which is a reactive and tree based protocol. The rest of the paper is organized as follows: In Section 2, we elaborate on the literature review. In section 3, we discuss the proposed conditional probability based

Deshmukh Ratnadeep Raghunathro and Vinu V Das (Eds.): CNC 2013, LNICST pp. 205–213, 2013. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2013

206

J.Sengathir and R.Manoharan

solution for selfish nodes in MANETs. The simulation parameters and evaluation metrics are presented in section 4. The detailed analysis of the solution based on the evaluation metrics are presented in section 5. Finally, we conclude the paper in section 6.

2 Literature Survey From the recent past, numerous mathematical models based on probability were proposed for detecting the existence of the selfish nodes in ad hoc networks. Some of the probabilistic solutions available in the existing literature for detecting misbehaving nodes are listed below: Thomas M.chen and Varadharajan venkataraman [4] proposed that the DempsterShafer theory of evidence is ideally suitable for detecting malicious nodes because it can predict uncertainty of node co-operation to the maximum extent. They also contributed a Dempster rule of combination that could help in determining a numerical procedure for combining multiple evidences obtained from neighbor nodes. They used two bounds called belief and plausibility for detecting malicious nodes. Their method of detection is based on posterior probability. Md.Amir Khusru Akthar and G.Sahoo[5] proposed that a node in MANET is selfish when the parameter called P(S|Pos) computed based on Baye’s Theorem is less than 0.5.Their model classified the nodes available in the network as regular or selfish nodes. They also used the method of prior probability and continuous Baye’s theorem for monitoring the transmission of a regular node towards selfish node. They gave the relationship between the number of nodes and their conditional probability towards selfishness. Hernandez – Orallo et al [6] proposed a mathematical detection model to manipulate the time as well as cost of detecting selfish nodes with the aid of watchdogs. In this model the occurrence of communication between any two communications between any two mobile node follows Poisson distribution .The authors used two states to detect the behavior of nodes. They are NOINFO and POSITIVE states. The network was modeled as a time Markov chain represented with the help of a transition matrix in canonical form. S.Buchegger and J.L.Boudec [7] proposed a Bayesian approach for determining the reputation of each and every participating node of ad hoc network. They used a Beta distribution which is the conjugate of Bernoulli distributions for determining reputation rating. Initially they took prior is BETA (1, 1) and the uniform distribution on BETA (0, 1). They computed reputations based on first hand observation and the reputation rating published by other nodes participating in the network. They classified nodes as normal and misbehaving based on threshold expression of tolerance. They also addressed the various issues that could arise due to reputation fading. C.Zouridzki et al [8] proposed a trust establishment framework for determining the reliability of packets forwarded by mobile nodes in an ad hoc network. They assumed that the each node forms an opinion about all other nodes with the help of first and second hand information collected from the network. This opinion metric was used as

Selfish Aware Mathematical Model

207

a parameter to detect misbehaving nodes so that the performance of the network does not degrade. They also used trust and confidence values which captures the statistical inference about the reliable delivery of packets. 2.1 Extract of the Literature The Probabilistic approaches present in the existing literature for identifying selfish nodes lack in the following issues. They are: I. A mechanism which can identify node’s selfishness by means of conditional probability based Erlang distribution has not been proposed. II. An approach which makes use of both the conditional and total probability for manipulating the network performance has not been explored.

3 The Conditional Reliability Expectation Coefficient Model Let us consider ‘x’ as the lifetime of the network, which contains both co-operative nodes (non-selfish nodes) and non co-operative nodes (selfish nodes). Let ‘y’ be the random variable for the determination of selfish or non-selfish nodes given by y=0, if the nodes are selfish. y=1, if the nodes are non selfish. Then, the probability of a node to be selfish or normal is given by

Py 0   1  a and Py 1  a

(1)

To Manipulate the MTTS (Mean Time of Survival) for a node in the network based on conditional expectation of x given y is during routing that when there is absence of selfish nodes is given by

1 E  x  0  y   

(2)

Where λ is the rate at which the node becomes selfish. On the other hand, if ‘n’ nodes becomes selfish, the mean life of the network is the sum of mean lifetime of the ‘n’ nodes that becomes selfish is computed by

n E  x  1   y   Using the theorem of total expectation the MTTS of a node is

(3)

208


1  a na    1  a  na E x    1  (1  n) a E x    E x  

(4)

Thus, when a=0, the reliability of the network is not affected. But when a=1, the reliability of the network is affected. Given that the selfish node is present (y=1), the network lifetime, ‘x’ is the sum of two independent exponentially distributed random variables, each with parameter . Then, the conditional probability of a x given y=1 is Erlang distributed,

f x t 1  2te  t

(5)

y

On the other hand, when there is selfish node then,

f x t 1  e  t

(6)

y

Then,

f t , y   f x t y , Py  y  can be represented as y

 1  a e  t , t  0, y  0. f t , y    2 t  ate , t  0, y  1

(7)

and the Mdf of the network nodes of life time ‘X‘ is given by

f x (t )  f t ,0  f t ,1 f x t    ate 2

 t

  1  a e

(8)  t

(9)

Thus, the reliability of the node given by

R x t   1  a e  t  ae  t 1  t  R x t   1  at e

 t

(10)

(11) Thus the equation (11) gives the CREC value of a node by its neighbor nodes. The above proposed mathematical model is a distributed model, which is omnipresent in each and every mobile nodes of an ad hoc scenario. This proposed approach helps to frame different range sets for detecting selfish nodes so that it could be mitigated in order to maintain the network performance.


209

This mechanism has the following merits I. The detection mechanism helps in establishing a minimal and maximal threshold range so that large number of selfish nodes could be detected II. this mechanism not only depends upon the reliability of a node but also on the reliability of the entire network 3.1 Algorithm for the Conditional Probability Based Mathematical Model ALGORITHM: The conditional probability based mathematical model for detecting Selfish behavior in an ad hoc scenario. Notation: SR: Source Node DR: Destination node CREC: Conditional Reliability based Expectation Co-efficient 1. SR broadcast RREQs through all possible routes towards DR. 2. DR sends acknowledgement with the aid of RREPs through reverse route. 3. SR transmits packets to DR through optimal established path. 4. Each and every node monitors all other nodes with the help of CREC. 5. If (0≤CREC≤0.25) 6. The node is identified as a selfish node. 7. Call Rehabilitate_Network( ); 8. Else 9. If(CREC>0.25) 10. The node is identified as a normal node. 11. End. When the connection is established in an AODV Protocol, the source starts sending the data packets. During the transmission, the selfish nodes deny to forward the packet due to limited energy. These selfish nodes can be detected with the aid of CREC by the neighbor nodes. The range of probability coefficient fixed for detecting selfishness is between 0 and 0.25.if the probability coefficient value is greater than 0.25 then the node is identified as normal node.

4 Simulation Results and Analysis Extensive simulation has been carried out to analyze the impact of conditional probability based mathematical model for detecting and mitigating selfish nodes in MANET. We mainly focus on finding out the minimum and the maximum threshold probability value that can enable highest optimal prediction of existence of selfish nodes. Evaluation parameters used for the exhaustive analyses of the conditional probability based mathematical model are performed based on the following parameters: I. Packet delivery ratio: It is defined as the ratio of actual number of packets destined for the receiver nodes to the actual number of packets received by the destination

210


II.

Control overhead: It is defined as the maximum size of bytes of packets that are required for the establishing effective communication between the source nodes and the destination node III. Total overhead: It is the ratio between the total number of packets that reaches its destination to the actual number of data packets destined to the receivers The following table 1 illustrates both the general parameters and traffic model parameters for carrying out our experimental study using AODV protocol. Table 1: Simulation Setup Parameter Name

Value

Number of Nodes

100

Simulation Time

1000

Mac Layer

802.11

Range

200 meters

Terrain Area

1000x1000 Sq.meters

Traffic model

Constant bit rate

Packet size

512 bytes

Type of antenna

Antenna/Omni Antenna

Type of Propagation

Two Ray Ground

5 Experimental analysis of Conditional Probabilistic based Mathematical Model (CPMM) From the fig.1, it is clear that the maximum number of selfish nodes could be detected when a range set of 0.25 is defined. It depicts the maximum threshold detection ranges 0.10 and the minimal threshold detection range is 0.40. From fig.2, it is obvious that when the maximum threshold of 0.10 is set the Packet Delivery Ratio increases. This is because of the isolating and mitigating large number of selfish nodes. But, when a minimum threshold of 0.40 is chosen the Packet Delivery Ratio is considerably low to an extent of 14%. From fig.3, it is obvious that when the maximum threshold of 0.10 is set the Control Overhead decreases. This is because of the isolating and mitigating large number of selfish nodes. But, when a minimum threshold of 0.40 is chosen the Control Overhead is considerably high to an extent of 26%.


211

Fig.1: The Chart representing the variation in number of selfish nodes based on different range set for detection

Fig.2: Performance analysis for CPMM based on number of selfish nodes and Packet Delivery Ratio

Fig.3: Performance analysis for CPMM based on number of selfish nodes and Control Overhead

212


From fig.4, it is obvious that when the maximum threshold of 0.10 is set the Total Overhead decreases. This is due of the isolation and mitigation of large number of selfish nodes. But, when a minimum threshold of 0.40 is chosen the Total Overhead is considerably high to an extent of 19%

Fig.4: Performance analysis for CPMM based on number of selfish nodes and Total Overhead

6 Conclusion This paper presented an extensive analysis of the impact of Conditional Expectation Based Probabilistic Mathematical Model for detecting and mitigating the existence of selfish nodes. The results predicts that our mathematical model deployed could outperform other mathematical model in terms of Packet Delivery Ratio, Control Overhead and Total Overhead computed by varying the minimum and maximum range of threshold detection. This solution also aided in framing an optimal threshold range in which maximum number of selfish nodes could be detected and mitigated.

References 1. Abusalah.L, Khokar.A, and Guizani.M. : A survey of secure mobile ad hoc routing protocols. IEEE Communications surveys tuts. Vol.10 no.4, pp.78-93, (2008). 2. Cho.J.H, Swami.A and Chen.I.R. A Survey of trust Management in mobile ad hoc networks. IEEE Communications surveys tuts.(2008). 3. Sarvanko.H, Hyhty.M, Katz.M and Fitzek.F.: Distributed resources in wireless networks. Discovery and cooperative uses. Forth ERCIM eMobility Workshop in conjunction with WWIC (2010). 4. Chen T.M, Varatharajan.V: Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks. IEEE Internet Computing (2005)


213

5. Md.Amir Khusru Akhtar and Sahoo.G. Mathematical Model for the detection of selfish Nodes in MANETs. International Journal of Computer science and Informatics, 2231-5292, Vol 1(3), pp 25-28 (2011) 6. Hernandez-Orallo, Manuel.D, Serraty, Juan-Carlos Cano, Calafate.T and Manzoni’s.: Improving Selfish Node Detection in MANETs Using a collaborative Watchdog. IEEE Communication Letters, Vol 16, No.5, (2012) 7. Buchegger.S and Boudec.J.L. A robust reputation system for P@P and mobile ad hoc networks. In Proc. 2nd Workshop on Economics of Peer- to Peer system, (2004) 8. Zouridaki.C, Mark.B.L, Hejmo.M and Thomas.R.K. A quantitative trust establishment framework for reliable data packet delivery in MANETs. Proceedings of the 3rd ACM Workshop on security of ad hoc and sensor networks, vol 1, pp.1-10, (2005).