IJECET_06_09_001

http://www.iaeme.com/IJECET/index.asp 1 [email protected]

International Journal of Electronics and Communication Engineering & Technology

(IJECET)

Volume 6, Issue 9, Sep 2015, pp. 01-10, Article ID: IJECET_06_09_001

Available online at

http://www.iaeme.com/IJECETissues.asp?JTypeIJECET&VType=6&IType=9

ISSN Print: 0976-6464 and ISSN Online: 0976-6472

© IAEME Publication

PERFORMANCE EVALUATION OF TRUST

BASED STABLE DISTANCE VECTOR

ROUTING PROTOCOL IN MANET

Umang Chawla

M. Tech. Scholar

Department of Electronics & Communication Engineering

Institute of Engineering & Technology, Alwar-301030 (Raj.), India

Dr. Anil Kumar Sharma

Professor & Principal

Department of Electronics & Communication Engineering

Institute of Engineering & Technology, Alwar-301030 (Raj.), India

ABSTRACT

A Mobile Ad hoc Network (MANET) is a short-term network molded by a

number of mobile nodes without a centralized administration or wired

infrastructure. The dynamic nature of these Ad hoc networks makes support of

QoS (Quality of Service) a challenging and difficult task where nodes may

leave and join the network or move around anytime. In this paper, we present

a stable election protocol trust On-Demand Distance Vector (SEOTDV) for

manipulating performance of path optimality,(packet fraction ratio) PFR ,

delay, average jitter of Packet transfer node. In mobile ad hoc networks, the

movement of the network nodes may quickly change the topology resulting in

the increase of the overhead message in topology maintenance and changing

of the cluster head node. Protocols try to keep the number of nodes in a cluster

around a pre-defined threshold to facilitate the optimal operation of the

medium access control protocol.

Keywords: AODV, MANET, PFR, SEOTDV, JITTER.

Cite this Article: Umang Chawla and Dr. A. K. Sharma. Performance

Evaluation of Trust Based Stable Distance Vector Routing Protocol In Manet

International Journal of Electronics and Communication Engineering &

Technology, 6(9), 2015, pp. 01-10.

http://www.iaeme.com/IJECET/issues.asp?JTypeIJECET&VType=6&IType=9

1. INTRODUCTION

Mobile ad hoc networks (MANETs) are a new paradigm of wireless communication

for mobile hosts. In mobile ad hoc network, there is no fixed infrastructure such as

Umang Chawla and Dr. Anil Kumar Sharma


base stations or mobile switching centers. Mobile nodes that are within each other's

radio range communicate directly via wireless links, while those that are far apart rely

on other nodes to relay messages as routers. Node mobility in mobile ad hoc network

causes frequent changes of the network topology [1]. MANETs technology targets

networks that can be rapidly deployed or formed in an arbitrary environment to enable

or facilitate communications or to serve a common objective dictated by the supported

application. Such networks can be heterogeneous, with various types of equipment,

usage, transmission, and mobility patterns. The ad hoc network architecture is as

shown in Fig.1.

Figure 1 Ad-hoc Network Architecture

There are some drawbacks associated with LEACH such as: single hop routing is

used where each node can transmit directly to CH and sink. CHs are elected

randomly. The protocol also assumes that all nodes have amount of energy for each

node. But recent protocols like SEP are opposite to that of LEACH as it considers

energy heterogeneity. The nodes also differ in initial amount of energy and also in

depletion rate. This leads to the heterogeneous networks where we consider two or

more types of nodes. The nodes that have higher amount of energy than the other

nodes are called advance nodes and the other nodes are the normal nodes. In SEP the

election probabilities of nodes are weighted by the initial energy of each node to

become the cluster head relative to the other nodes in a network. This prolongs the

time period before the death of first node in the system. SEP approach makes sure that

CH election is done randomly and is distributed based on the energy of each node

assuring the uniform utilization of the nodes energy. SEP consists of advance nodes

that carry more energy than the normal nodes at the beginning, so it enhances the

stability period of the network. Normal nodes have initial energy E0 , and advance

nodes have initial energy (1+a)E0 .Where (a) is the percentage of energy higher than

normal nodes. Each node has a probability to become a CH and each node generates a

random number between 0 and 1 just like in LEACH. If the number is less than

threshold T(s), then that node becomes CH in the current round. With increase in

number of rounds, the T(s) also increases and reaches 1 only in the last round. Let

pnrm be the weighted election probability of normal nodes and padv be the weighted

election probability of advance nodes. Optimum probability of each node to become

CH can be calculated by:

Performance Evaluation of Trust Based Stable Distance Vector Routing Protocol In Manet


where ‘m’ denotes the fraction of advance nodes and ‘a’ is the additional energy

factor between advance and normal nodes. The threshold is given by the

formula:

The total energy of new heterogeneous setting will be:

n. (1-m).E0 + n.m. E0. (1+a) = n. E0. (1+a.m)

So the total energy of the system is increased by (1+a.m) times. In order to optimize

the stable region of the system the new epoch must become as the

system has a.m times more energy and a.m times more nodes.

In this paper, we provide a Trust-based framework which uses Route Trust as a

metric for the source node to make such informed route selection decisions. Related

literature on improving the performance of AODV includes multi-path variants of the

protocol [2, 3] which are equally susceptible to malicious node behavior. Schemes to

make the protocol secure rely on heavy encryption techniques [6] or on continuous

promiscuous monitoring of the neighbors [4]; both of which are restrictive in the

resource constrained wireless domain and would have scalability concerns. Besides,

these schemes only assure node and hop count authentication while providing no

information on the route quality or ambient route conditions. Thus, none of the

existing schemes address the issues this paper attempts to solve. Additionally, our

schemes also aim at preserving the lightweight nature of AODV, while being

adaptive, secure, robust and scalable.

2. PROBLEM STATEMENT

The key issue with ad-hoc networking is how to send a message from one node to

another with no direct link. The nodes in the network are moving around randomly,

and it is very difficult that which nodes are directly linked together and the

intermediate node judges its ability to forward the RREQ packets or drop it [12]. The

number of packets transferred successfully by each node. Route from source to

destination is determined by selecting the most trusted path [13]. Here battery

capacity is not considered as an issue for selecting the path between source and

destination. Same time topology of the network is constantly changing and it is very

difficult for routing process. We efforts to simulate and analyze of these two

parameters to discover a reliable route between the source and destination and reduce

power consumption. Trust is extracted from social relationship. It is always

established between two parties for a specific action. In particular, one party trusts the

other party to perform an action. Trust may be referred as belief or reputation of one

entity to other to perform an action [14]. Trust in entities is based on the fact that the

trusted entity will not act maliciously in a particular situation.



3. SYSTEM MODEL

To compute the direct trust in a node, we have used an effort-return based trust model

(Pirzada et al, 2004b). The accuracy and sincerity of the immediate neighboring nodes

is measured by observing their contribution to the packet forwarding mechanism.

Every time a node transmits a data or control packet, it immediately brings its receiver

into the promiscuous mode, so as to overhear its immediate neighbor forwarding the

packet. The sending node verifies the different fields in the forwarded IP packet for

requisite modifications through a sequence of integrity checks. If the integrity checks

succeed, it confirms that the node has acted in a benevolent manner and so its direct

trust counter is incremented. Similarly, if the integrity check fails or the forwarding

node does not transmit the packet at all, its corresponding direct trust measure is

decremented. We represent the direct trust in a node y by node x as Txy and is given

by the following equation:

where PA represents the category Packet Acknowledgements that preserves a count of

the number of packets that have been forwarded by a node. PP represents the category

Packet Precision, which maintains a count of the number of packets forwarded

correctly. W reflects the weight or priority assigned to that particular category.

4. PROPOSED IMPLEMENTATION

We incorporate our trust based model with AODV routing protocol in order to

prevent the malicious behavior and uniform utilization of network resources. The

AODV protocol is modified as described below.

AODV sends RREP packet for each RREQ packet it receives, thereby enabling

AODV to make the destination sends multiple RREP packets for single route request.

RREP packet structure is modified to contain trust value of the path.

The routing table structure is modified to store the trust value for each entry of

source to destination.

AODV sends request to update the routing path at regular intervals. Hence, at

regular intervals, source node is going to have multiple paths each with its

trust value from which one with the maximum trust is selected.

The method to handle RREP packet is changed to update the route entry when

new path is received with greater trust than current trust value.

AODV is modified to send RREQ packet to destination every time thereby

disabling the mechanism to initiate RREP packet at intermediate nodes.

SEOTDV (SEP+AODV) Protocol Algorithm

Sd = Distance based node sequence

FRREQ = First Route Request

NODEPRV = Previous Node

Broadcasts RREQ packet: this protocol works in the route reply phase only .

If RREP packet received then

Sends data packets Otherwise



NI Link Status for Next Hop Then RREQ=0; // where NI =Intermediate

Nodes

End If

Verify Availability for trust Mechanism

while (prev)

{

if (Node_id->Nt)

{

prev = NprevNAprev; // where Nprev =previous Normal Node and

// NAprev =Previous of Advance Node

Advance node energy Sn= Sd>D’ (Sequence Node energy) ------significance of

this equation…why we do need energy more than the destination node.

}

else {

k8

prev = NprevNAprev;

if ((new node->next = prev1->next))

new nodenext->prev 1

else

tail = new node; prev->next = new node; return; } }

If RREP packet received from suspected node then

Initiates a route to next node

if(Tmin =no of node (node energy(in Joule)) ) //minimum Threshold Tmin

S dst-- =>S, //Reverse route of source destination route should

meet the trust

//requirement of the data packet. In other words, Non-Repudiated

// of the qualified route is greater than the

requirement of the data

//packet. If such routes are found

nexthop=S,

hopcount=1

Sends FRREQ packet to next node

If FRREP packet received then

Extract FRREP packet information

If next node has a route to (destination &weak nodes) then

Discards FRREP packet



Unicasts RREP to source node

Otherwise Discards both RREP and FRREP packets

Broadcasts Normal energy node

while(prev)

{

if (then Node_id->N_sort<prev->Node_id->N_sort)

{

prev = prev->prev; // Go up the queue

}

else

{

newnode->prev=prev1;

if ((newnode->next = prev->next))

newnode->next->prev = newnode;

else

tail = newnode;

prev->next = newnode;

return;

}

}

End if

End if

End if

Figure 2 Proposed Flow chart

5. RESULT

The performance of AOTDV and SEOTDV is analyzed with varying PFR, Average

Jitter, Average hops & End to end delay using MATLAB 2012a. The snapshot of

broadcasting, nodes mobility and transmission results of data are shown in Figures 3-

6.



Figure 3 Average jitter with respect to no of nodes

Average Jitter: Jitter is the variation in the time between packets arriving, caused by

network congestion, timing drift, or route changes. It should be less for a routing

protocol to perform better. The average jitter is shown in fig 1. In SEOTDV, there is

more chance for jitter as source node initiate route discovery mechanism by

broadcasting a route request packet to its neighbours. According to our simulation

results, SEOTDV has less average jittering than AOTDV routing protocols.

Figure 4 Packet Delivery Ratio with respect to Number of Nodes

Packet Delay Ratio: Packet delay ratio is the ratio that is use to calculate the number of

data packet transmitted by the source node and no. of data received by the destination

node. It is used to calculate the loss rate of data packets while during data

transmission in network. It evaluates the loss rate and measures up both the

correctness and efficiency of ad-hoc routing protocols. A higher packet delivery ratio

is hoped in any network.



Figure 5 Average hops with respect to no of nodes

Average Hops: AODV uses only symmetric links and a RREP follows the reverse path

of the respective RREQ. Upon receiving the RREP packet, each intermediate node

along the route updates its next-hop table entries with respect to the destination node.

The redundant RREP packets or RREP packets with lower destination sequence

number will be dropped. The advantage of this protocol is low Connection setup

delay.

Figure 6 End to end delay with respect to no of nodes

Average End-to-End delay: It is the average time from the beginning of a packet

transmission at a source node until packet delivery to a destination. This includes

delays caused by buffering of data packets during route discovery, queuing at the

interface queue, retransmission delays at the MAC, and propagation and transfer

times.



6. CONCLUSION

In this paper, we investigate a trust mechanism in MANET based on Trust Model

which is an abstract trust model. Then we show that this mechanism can be

effectively integrated into the AODV and the SEP routing protocols which is

SEOTDV. The design of this mechanism is to successfully implemented on nodes and

then take actions on them. Afterward we did a series of simulations to test the

performance of our proposed mechanism in both AOTDV and SEOTDV. The

simulation results have showed that in the presence of nodes in ad hoc network, the

performance of AOTDV and SEOTDV which are integrated with proposed trust

vector evaluation mechanism are better than their standard protocols in terms of

packet delivery ratio, Jitter, no of hops & End to end delay. Future work includes

adapting our model to counteract more malicious attacks in MANET such as

wormhole attacks, byzantine attacks, resource consumption attack etc [8], and attacks

aiming at trust model itself, for example, fabricating trust recommendations and

conspiring to rate each other high scores among malicious nodes, should be also taken

into consideration.

REFERANCES

[1] Azzedine Boukerche, Performance Evaluation of Routing Protocols for Ad Hoc

Wireless Networks, Mobile Networks and Applications 9, 333–342, 2004 Kluwer

Academic Publishers.Manufactured in The Netherlands.

[2] C.Perkins, E.Royer and S.Das, Ad hoc on-demand Distance Vector Routing,

RFC-3651.

[3] P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks, Istituto di

Informatics e Telematica del CNR, Italy, 2005.

[4] Sung-Hoon Park. A Stable Election Protocol based on an Unreliable Failure

Detector in Distributed Systems, 2011 Eighth International Conference on

Information Technology: New Generations, April 2011, pp. 979 – 984.

[5] Haddar, M.A., HadjKacem, A. Metivier, Y, Mosbah, M. and Jmaiel, M, Electing

a leader in the local computation model using mobile agents, IEEE/ACS

International Conference on Computer Systems and Applications, 2008. AICCSA

2008. pp.: 473 – 480, April, 2008.

[6] Mina Shirali, Abolfazl Haghighat Toroghi, and Mehdi Vojdani, Leader election

algorithms: History and novel schemes, Third 2008 International Conference on

Convergence and Hybrid Information Technology (ICCIT’08), pp. 1001-1006,

November 2008.

[7] MuneerBaniYassein, Ala’a N Alslaity and Sana’a AAlwidian. An Efficient

Overhead-aware Leader Election Algorithm for Distributed Systems,

International Journal of Computer Applications, 49(6), July 2012, pp. 10-15,.

[8] Abdalla MH, Aamir S, Irfan A, Mike W. Dynamic Probabilistic Flooding

Performance Evaluation of On Demand Routing Protocols in MANETs CISIS '08

Proceedings of the 2008 International Conference on Complex, Intelligent and

Software Intensive Systems, IEEE, 2008, pp. 200-204.

[9] Ala’a N. Alslaity Stable Neighborhood-Based Route Discovery Protocol For

Mobile Ad Hoc Networks, Dissertation, Jordan University of Science and

Technology. May, 2012.

[10] Sharma D. K, Kumar C., Jain S. Tyagi N. An Enhancement of AODV Routing

protocol for Wireless AD HOC network, IEEE International Conference on

Recent Advance in Information Technology, 2012, pp – 290-294.



[11] Harish Saini, Saba Khanum, QoS Parameters analysis on AODV & DSDB

Protocol for MANET’s. International Journal of Movable & AD HOC network,

1(1), May 2011.

[12] Chaurasia N. Sharma S. Soni D, Review study of Routing Protocol & versatile

challenges of MANET’s , IJCTEE 2(1), 2012, pp. 150-157.

[13] Perkins C. E, Royer E. Ad- Hoc on Demand Distance Vector Routing, IEEE

Workshop on Movable Computing System & Applications, 1999, pp 90-100.

[14] Kavita Sharma and Dr. Anil Kumar Sharma. Perfermance Evaluation Of Neural

Network Based Hand Gesture Recoginition, International Journal of Electronics

and Communication Engineering & Technology, 5(3), 2014, pp. 23-33.

[15] Rekhanshi Raghava and Dr. Anil Kumar Sharma. Matlab Based Motion

Estimation and Compression In Video Frames Using True Motion Tracker,

International Journal of Electronics and Communication Engineering &

Technology, 5(3), 2014, pp. 34-42.

Documents

IJECET_06_09_001