A SURVEY ON TRUST BASED SECURE ROUTING IN MANET

David C. Wyld (Eds) : ICCSEA, SPPR, CSIA, WimoA - 2013
pp. 243–253, 2013. © CS & IT-CSCP 2013 DOI : 10.5121/csit.2013.3525
A SURVEY ON TRUST BASED SECURE ROUTING IN
MANET
Mousumi Sardar1
and Koushik Majumder2
Department of Computer Science & Engineering,
West Bengal University of Technology,
Kolkata, India
1
mousumi.sardar02@gmail.com
2
koushik@ieee.org
ABSTRACT
A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a self-
configuring network. Due to dynamic nature of MANET it is very challenging work to employ a secure
route. The intermediate nodes cooperate with each other as there is no such base station or access point.
The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques
incur a high computational cost and can’t identify the nodes with malicious intention. So, employing
cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic
technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust
value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
.
KEYWORDS
Network Protocols, Mobile Network, Cooperation, Dynamic topology, Route trust, Path trust
1. INTRODUCTION
Mobile Ad-Hoc network (MANET) is infrastructure-less, self-configuring network, comprised of
several wireless nodes. There are no base stations or routers like wired network for routing the
packets. In this network, the nodes behave as a router and discover the routes and maintain the
routing of packets. The main features and characteristics of MANET [1] are: Cooperation,
Dynamic topology, Resource Constraints.
Due to this above discussed nature of MANET, networks are more vulnerable to attacks than
wired networks. So security is an important issue in MANET to provide secure communication
between mobile nodes. Due to the misbehaviour of malicious nodes, performance of MANET
degrades. To overcome this problem secure routing protocols need to design which is a more
difficult and challenging too.
Different approaches are already proposed to secure the routing process in MANET.
Cryptographic mechanisms are used in routing protocols to secure the routing information from
tampering it by the attacker. But this approach can’t be deployed in real MANET network

244 Computer Science & Information Technology (CS & IT)
because of high computational cost and it can’t identify the attacker nodes. This mechanism only
secures the routing information from tampering but can’t secure nodes that participate in routing.
So the trust mechanism is adopted in routing protocols to secure nodes as well as the data
transmission. Different trust based routing protocols are proposed to provide security in MANET
by securing nodes in routing path.
2. TRUST MECHANISM
Trust mechanism is introduced in the protocols to provide security in MANET. Trust is a value
that is calculated on the basis of nodes action when needed. Trust is introduced to prevent from
various attacks like wormhole, black-hole, Dos, selfish attack etc. Trust can be implemented in
various ways such as by reputation, subjective logic, from opinion of nodes etc as there are no
particular definitions of trust. According to (Marc Branchaud, Scott Flinn) trust has following
properties:
• Context Dependence: In some specific context trust relationships are applicable.
• Function of uncertainty: Trust depends on the uncertainty of nodes action. It gives the
probability of action performed by a node.
• Quantitative value: Trust can be assigned any type of numeric values discrete or
continuous.
• Asymmetric Relationship: Trust relationship is asymmetric in nature. If node A trusts B
and node B trust C that does not mean that A trusts C.
4. RELATED WORK
4.1. Trusted AODV [2]
In this scheme, AODV protocol is modified implementing node trust and route trust. Two new
control packets are added to AODV protocol i.e. trust request packet(TREQ) and trust reply
packet(TREP) and routing table is modified by adding one new field: route trust. The RREP
packet of AODV is also modified by extending two new fields: neighbour list and route trust.
4.1.1. Calculation of Node Trust
All the nodes maintain neighbour table to keep information of frequently changing node and node
trust value. Node trust value is evaluated using neighbour’s collective opinion. The node trust
value (NTV) of a node i is calculated by the following formulae:
NTV=[NNT(1)+NNT(2)+NNT(3)+…….+NNT(n)]/n
where NNT is the neighbour node trust value about the i node and n is the no of neighbour in the
neighbour list.
4.1.2. Calculation of Route Trust
Every node calculates route trust for each route in the routing table at some regular interval.
Destination node in each entry in the routing table generates R_ACK packet and send back in
reverse path. The nodes that receive R_ACK calculate the route trust value using the value in the
no_of_packets_received field of R_ACK packet and the value of no_of_packets_sent field in the
routing table. Route trust value is calculated by the following formulae: Route trust= (no of

Computer Science & Information Technology (CS & IT) 245
packets send by source - no of packets received by destination) The route with route trust value 0
is the perfect one. If the route trust value is equal to the no of packets sent the route is rejected.
4.1.3. Route Discovery
In route discovery phase when a node has packets to send it broadcasts RREQ packets. When all
RREQ reaches to the destination, it sends RREP packets. After receiving the RREP packets,
source node selects three RREP packets that have high route trust value. Then the source node
generates the TREQ packets and sends it to all neighbours in the neighbour list of that RREP
packet. After receiving the TREQ packet, all neighbours replies with TREP packet to the source
node. Then the source node calculates the node trust of the nodes. Next, the source node arrange
the RREP packets in the ascending order based on node trust value and selects the first RREP
packet and hence that path is selected for communication.
4.2. Cooperation of Nodes: Fairness in Dynamic Ad-hoc Networks [3]
The main idea of CONFIDANT protocol is to identify non-cooperative nodes. A node selects a
route based on trust relationships which is built up from experienced routing and packet
forwarding behavior of other nodes. Each node monitors the behavior of all neighbor nodes.
When any misbehaving node is found, alarm messages are sent to all other nodes in the network.
As a result, all nodes in the network will be able to avoid that misbehaving node while selecting a
route. The components of CONFIDANT protocol works as follows:-
4.2.1. The Monitor
This component watches the behavior of nodes during the routing procedure. If any node
misbehaves, then the monitor module detects that misbehaving node and immediately calls
reputation system.
4.2.2. The Trust Manager
The trust manager handles ALARM messages. When any misbehaving node is found ALARM
messages are sent to all other nodes to inform about that node. The trust manager maintain alarm
table and trust table for checking the trustworthiness of alarm. The rating function assigns greater
weights for own experience and smaller for other nodes opinion about that detected node. The
rating of a node is updated when sufficient proof of the nodes maliciousness is found. If the rating
falls below threshold value path manager module is called.
4.2.3. The Reputation System
The reputation system maintains the rating of nodes in a table which has 2 field node id and their
ratings. The ratings are done according to the type of nodes behavior detected. The rating of a
node is updated when sufficient proof of the nodes maliciousness is found. If the rating falls
below threshold value path manager module is called.
4.2.4. The Path Manager
The path manager manages the routing path according to ratings of the nodes. The path
containing malicious nodes are deleted by this module. If any route request comes from malicious
node path manager takes appropriate action like ignore request or don’t reply etc.

4.3. Friendship Based AODV (FrAODV) [4]
In Friendship based AODV is based on AODV, there are two evaluation algorithms to evaluate
forward and reverse path between source and destination. In this scheme, it is assumed that each
node has identity can’t be forged by any other malicious node and no of malicious node is less
than the no of good nodes. In this proposed scheme every node has a list of friends with
friendship values. The range of friendship values is 0 to 100. More the friendship values means
more trustable. The two algorithms for establishing path are described as follows:
4.3.1. RvEvaluate Algorithm
This algorithm sets up reverse path from destination to source. After broadcasting RREQ packet
the two things can happen: -
Case-1: The receiving node can be destination node itself. If so it checks the friendship value of
the node from which it receives the RREQ packet, as every node maintains a friendship list along
with friendship value of the neighbor nodes. If the node is not a friend the node rejects the RREQ
packet. Otherwise it calculates the friendship value of the route to originator from destination and
then compares the current routes friendship value with the existing route’s friendship values. The
reverse route’s friendship value (RvFwRte) is the sum of friendship values of all nodes in that
path and it is calculated as follows:
Where PrFrHpi is friendship value of that node from which the current node receives RREQ
packet and h is the no. of hops between source and destination. . If the friendship value of the new
route is less than the existing route the new route is rejected otherwise it is registered as a friendly
route.
Case-2: If the receiving node is intermediate one, it first checks the friendship value of the node
from which it receives the RREQ packet and next neighbor node. If one of these two nodes is not
in friend list, the intermediate node rejects the RREQ packet. Otherwise it calculates the
friendship value of the route to originator from destination using the previously mentioned
formulae and compares it with the existing route’s friendship value. If the friendship value of the
new route is less than the existing route the new route is rejected otherwise the reverse path is
established from current node to the previous node.
4.3.2. FwEvaluate Algorithm
This algorithm sets up the forward path i.e. from source to destination during RREP forwarding.
There are following two cases when any node receives that packet:
Case-1: If the node receiving the RREP packet is sender node itself, it checks the friendship list
and the friendship value of the node from which it receives the RREP packet i.e. the next node. If
the next node is not a friend, rejects the RREQ packet. Otherwise it calculates the friendship
value of forward route to destination and then compares it with the existing route’s friendship
value. If the friendship value of the new route is less than the existing route the new route is
rejected otherwise it is registered as a friendly forward route. If there is not any existing route the
new route is included as a friendly route. The forward path’s friendship value is formulated as:

Where FwFrHpi is friendship value of that node from which the current node receives RREP
packet and h is the no hops between source and destination.
Case-2: If the node is an intermediate node then it checks the friendship value of the node from
which it receives the RREP packet and previous node. If one of these nodes is not friend, rejects
the RREP packet. Otherwise it calculates the friendship value of the route to destination in the
same way and compares it with the existing forward route’s friendship value. If the friendship
value of the new route is less than the existing route the new route is rejected otherwise the
forward path is established from current node to the next node.
In this way after establishing friendly path from source to destination the sender sends data packet
along that path.
4.4. Secure Routing Using Trust (SRT) [5]
In this paper, a secure routing using trust level is proposed. This scheme is based on node
transition probability (NTP) and AODV. This scheme develops a new algorithm to secure NTP
protocol. A trust rate (Trate) is calculated as a parameter. When a node has data packet to send, it
first floods control frame (beacon) in search of secure and reliable route. After broadcasting the
first beacon trust rate is evaluated as:
Where r = no of beacons received by a node, t = no of beacons send by a node.
This Trate value divides the nodes of the network into 3 categories: ally list (level2), associate
list(level1), acquaintance list(level0).
Ally list: The nodes of the ally list send highly secured information.
Associate list: The nodes of this list send medium secured information.
Acquaintance list: The nodes of this list send the information that do not require any security.
An additional field “level” is there in neighbor table. When a node has data to send it just checks
its neighbor table, if the destination is available it just sends data packets. If not, it searches for a
node which has route to destination in its same level. If no suitable node is not found it goes to
next lower level and so on. If any node in the same level is not found trust is compromised by
choosing a neighbor in the next lower level using the following formulae:
Trust compromise= n (associate) + 2*n (acquaintance)
Where n (associate) is the no of nodes in associate list and n (acquaintance) is the no of nodes in
acquaintance list. When all the nodes including destination node are in the same level with the
source node trust compromise will be very low because trust rate is very high as it is better to
forward control packets in the same level than to forward the packets to the another level. In this
way after finding secure route the data packets are sent to the destination.
4.5. Trusted AOMDV [6]
AOMDV is a multipath routing protocol. In the paper, a trust mechanism is employed with soft
encryption methodology in AOMDV protocol. This Trusted AOMDV protocol has the following
steps:

4.5.1. Degree Of Secrecy for Path /Message
Degree of secrecy of a path implies how much degree of security level required for a path to
transfer packets. The path trust value (Tp) is the minimum trust value among all nodes along the
path p depending upon the path trust value there are three classifications: - If Tp ≥ 8 implies class
A paths. All the class A paths have degree of secrecy≥8. Tp ≥ 5 implies class B paths. All the class
B paths have degree of secrecy≥ 5. Tp ≥ 3 implies class C paths. All the class C paths have degree
of secrecy≥ 3. This classification is also applied for data packets. Class A data only is transferred
to class A category path. It is same for other categories.
4.5.2. Message Encryption
The message is divided into three parts and then encrypted using soft-encryption methodology to
secure the message. It is encrypted in the following way:
a’=aXORc b’=bXORc c’=aXORbXORc
4.5.3. Message Routing
Before routing the encrypted messages a secure trusted path is established using the following
trust mechanisms:-
The trust mechanism of this scheme depends on the monitoring of packets and node’s behavior. It
is assumed here that when a node sends packets it will monitor its neighbor node to which it
sends its packet and determines node’s trust value depending on its behavior. If the neighbor node
sends the packets correctly node’s trust will increase, otherwise it is decreased. The trust value of
a node (Tn) is calculated as: Tn = Wd * Td + Wr * Tr where Wd is the weight assigned to direct trust
Td, Wr is the weight assigned to recommendation trust Tr. Again Direct trust is calculated as: Td=
Td +c. Ts, if no. of successful packet transmission time is high and Td= Td - c .Tf, if the no. of
packet transmission failed time is high. Where Ts is the aggregate successful transfer time, Tf is
the aggregate failure transfer time and c is the predefined constant value. Ts is incremented by 1
for every successful transfer of packet, otherwise Tf is incremented by 1. The trust table values
determined through hello message transmission. When a node receives hello message it first
check trust table contained in hello packet and find some common nodes it has. If any node
common node is found that wants to participate in forwarding packets the trust recommendation
(Tr) is calculated by the formulae:-
Where implies source A’s trust on intermediate node X and implies X’s
trust on destination D and n is the no. of hop. In the routing process, source broadcasts RREQ
packet. When an intermediate node receives the first RREQ packet it checks the path list and hop
count and updates its reverse route table and sets up reverse path. When duplicate request packet
arrives at node it checks the hop count of that packet, if it has lesser hop count than the previous
one, record of the previously received packet is replaced by the new one in the reverse route
table. After receiving request packet destination node generates reply packet (RREP) and sends
back to the sender. When an intermediate node receives RREP packet, it compares the trust value
in RREP packet with the node’s trust value from which it receives the RREP packet. If the node’s
trust value is less than the one in RREP packet, the trust value in RREP packet is replaced by that
node’s trust value. In this way, finally when RREP packet reaches to the source node, it gets the
trust value from the RREP packet and set it as a trust value of that path. After receiving all the
RREP packets and the path trust values, it sorts the paths based on the trust values. Then it breaks

the message in three parts and encrypts it in the previously mentioned way and starts sending it to
the appropriate path according to the data degree of secrecy. After route discovery, if the
appropriate path is not found, routing process will be restarted.
4.6. Friend Based Ad Hoc Routing Using Challenges to Establish Security [7]
This algorithm achieves security in ad hoc network by sending challenges and sharing friend lists.
In this scheme, there are different list of nodes: Question mark List, Unauthenticated List, Friend
List. The rating of friends ranges from 0 to 10.
This algorithm has four steps: challenging neighbor, friends rating, sharing friends and route
through friends. FACES is a hybrid protocol as the routing of data is on demand where as
challenging and sharing occurs periodically. When the network is initialized, the nodes are not
familiar with each other. So after initializing the network the nodes challenge each other to find
the friend nodes. The challenging mechanism works as – suppose node A challenges its neighbor
B. A first performs share Friend list with B by sending FREQ packet to B. After receiving FREQ
packet from A, B replies by sending its all three list to A. After getting replies A picks one node
(let C) from B’s list to which it can reach by own. Then send a challenge packet to C directly and
through node B. When C receives challenge packet it replies node A and node B in turns replies
to node A. then node A compares these two results if it matches node A add B in its friend list
otherwise in question mark list.
Friends are rated in this scheme using three parameters: Data rating (DR), friend rating (FR), net
rating (NR). Initially the nodes only have friend List, nodes of which perform a successful
challenge. The sharing of friend list takes place periodically. Let node B sends its friend list to
node A during the friend sharing stage, then node A picks those nodes that are not in its own list
from friend list of B and includes those nodes in its own list and the rating of those nodes, which
is obtained from B set as FR of those nodes. The data rating (DR) of those nodes is set to zero.
Then the net rating (NR) of node is calculated as:
where w1 and w2 are the weight that is network dependent.
If the friend of B is already in the list of A i.e. if the nodes A and B have common nodes (let C)
then A obtains rating of C from B and calculate obtain rating as:
OR= (net rating of B in list of A * net rating of C in list of B)/ 10
FR of node C is obtained by adding all OR from various neighbor nodes and divides the value by
the sum of ratings of those various nodes. The data rating is calculated on the basis of data
transfer by a node. DR is calculated as: DR=10*(1-e-λx
), where x is no of forwarded data packets
and λ is a factor by which data packets are related to rating. The routing of data takes place when
any node has data to end. It broadcasts route request message including no of data it wants to
send. After receiving route reply messages, it finds the best route depending on the net rating
value of nodes, to the destination from its friend list.

4.7. Trust Based Security Protocol Routing [8]
In this protocol a trust mechanism is employed in DSR protocol. An extra data structure is
maintained by every node that is Neighbor’s Trust Counter Table (NTT) which is used to keep
track of no. of sent packets by a node using a forward counter (FC) and also stores the trust
counter(TC) corresponding to node. Initially a node can completely trust its neighbor or fully
distrust its neighbor as the nodes don’t have any information about its neighbor nodes reliability.
When any node needs to send data it broadcasts RREQ packets. Each time a node (let nk) receives
packet from another node (let ni), node nk increments the FC of ni as: FCni=FCni+1; i=1, 2….
Then this new FCni value is stored in NTT of node nk. After receiving all RREQ packets,
destination node makes a MAC on the no of packets it received (Prec) using the shared key
between the sender and destination. Then the destination node attaches that MAC and also the
accumulated path from the RREQ after digitally signed it, in the RREP packet and sends back in
the reverse path to the destination. The intermediate nodes of that path determines Success ratio
as: - SCni=FCni/Prec, where Prec is the no of packets received at destination. This SCni is
appended in RREP packet. The intermediate nodes in reverse path check the validity of the RREP
packet by verifying digital signature of destination. If it is valid, the intermediate node signs the
packet and forwards it to the next, otherwise the packet is dropped. When source node finally gets
the reply it first verifies the first node id in RREP packet. If it is its neighbor, then all other
intermediate nodes’ digital signature is verified. If the verifications of all the nodes are successful
then the trust counter is incremented for all the nodes as: Tci = Tci + δ1, if the verification is
failed the trust counter value is decremented by 1: Tci = Tci - δ1.where δ1 is the small fractional
value. The source node also checks the success ratio of all other nodes and compares it with the
minimum threshold value (SRmin), if the SRni of a node is less than the SRmin the trust counter
is decremented by another step value δ2 again, otherwise it is incremented. Another comparison
is made by comparing trust counter with a minimum threshold. If trust counter is less than the
trust threshold value the node is marked as malicious. This mechanism is applied to all the other
routes and a route with no or least malicious node is selected. In this way, a trusted and
authenticated route is found for secure routing.
4.8. Trust Based DSR [9]
This protocol is proposed to improve the security of the existing DSR protocol. The trust based
secure route is established in this scheme. In DSR the shortest route is selected which may not be
secure. There are some malicious nodes in the network that replies to the route request packet
with shorter hop count (black hole) so that the source will select that path, and routing process is
disrupted. The following components are used in this newly proposed protocol: Initialiser,
Upgrader, Administrator, Monitor, and Router. In this scheme, there is a separate administrator to
maintain the trust values of all other nodes. An acknowledgement module is there which is used
to keep track of all received acknowledgements and trust values of nodes are adjusted. Every
node has trust value which depends on its interaction with its neighbor. Trust unit of this scheme
comprises of three modules: - Initialiser module assigns low trust values to the unknown nodes in
initial stage. If the route contains some known and unknown nodes, then it assigns trust of those
known nodes as the initial trust value of the unknown nodes. Upgrader module upgrades the trust
value of a node based on experiences of that node in a particular situation. When a node receives
any reply from its neighbor the trust value of neighbor node is updated. If any reply is not
received by a node the trust value of the neighbor node is decreased. Trust value is evaluated as:
T= tanh[(∆ +W) *Te] where T is the updated trust, Te is existing trust, W is a weight i.e. 1 for
acknowledgements and 0.5 for data packets forwarded and received, ∆ is +1 for positive and 0 for
negative experiences. Positive experience means acknowledgement is received within the time
frame and otherwise it is considered as the negative experience. Administrator module keeps the
trust information of all the known nodes and also has some methods to query this trust

information. The monitor module monitors the received acknowledgments to adjust trust values
of nodes. The router module selects the route to forward packets based on nodes trust values.
Monitor module uses two routing strategy: In the first routing strategy, the route is rated based on
the average value of all nodes along that path. The route which gets highest rating is selected for
routing. In the second routing strategy, the average of all nodes trust value is divided by no of
nodes to get shorter path. The route which gets high value is selected.
Figure 4. Components of TDSR
5. COMPARISON OF DIFFERENT TRUST BASED ROUTING PROTOCOLS
Protocol Advantage Disadvantage
1. Trusted Ad Hoc on
Demand Distance
Vector (TAODV)
1)TAODV can detect malicious
node and selfish node in network
2)It is more secure and having
better performance than AODV
3)It can prevent modification,
fabrication attacks
1)It has no authentication
mechanism of nodes and messages
2)It can’t prevent worm-hole and
impersonation attack
2. Cooperation Of
Nodes: Fairness In
Dynamic Ad-Hoc
Networks
(CONFIDANT)
CONFIDANT protocol
effectively detect selfish nodes
and PM wormhole nodes that
drop packets
1) It can’t prevent various attacks
such as modification impersonation
fabrication Sybil attack by malicious
nodes
2) An attacker is able to send false
alarm messages and can do false
claim that a node is misbehaving.
3.Friendship Based Ad
Hoc On Demand
Distance Vector
(FrAODV)
This protocol gives better
performance in terms of QoS
services like packet delivery
fraction, normalized routing load.
The end to end delay is not included
in performance measurement metric.
The delay is more here because two
evaluation algorithms are used to
establish path.
4.SecureRouting Using
Trust(SRT):
In terms of mobile mobility it
gives better throughput, packet
delivery ratio, average path
length, average routing load.
The performance decreases in the
presence of attacks except black
hole. The trust is calculated on the
basis of control packets only.
5. Trusted AOMDV Performance is measured in terms
of route selection time, trust
compromise with
TDSR,AOMDV etc
This protocol measures the
performance in fixed mobility
environment that actually not
applicable in MANET.
INITIALISER UP GRADER
MONITOR ADMINISTRATO ROUTER
STANDARD DSR PROTOCOL

6.Friend Based Ad Hoc
Routing Using
Challenges To
Establish Security
(FACES)
Challenge packet helps to detect
flooding, grey-hole, spoofing,
modification, dropping of control
packets. As well as it gives better
performance in the presence of
malicious nodes.
In this protocol control overhead is
increased due to periodic flooding of
challenge packet and periodic
sharing of friend list.
7. Trust Based
Security
Protocol(TMSP)
This protocol maintains
confidentiality and authenticates
the nodes based on digital
signature. It detects the nodes
which are misbehaving.
This protocol can’t detect
authenticated malicious node. In this
protocol after finding route then the
trust of the nodes along the path is
calculated which increases control
overhead. Because calculating the
trust after finding path is inefficient
as the path may be rejected due to
presence of malicious nodes.
8. Trust Based DSR It gives better throughput with
general DSR.
This protocol doesn’t consider
delay, packet forward ratio,
communication overhead matrices in
performance analysis.
6. CONCLUSION AND FUTURE WORK
MANETs are vulnerable to different types of attacks due to its infra-structure less network.
Different trust based approaches are proposed to prevent such types of attacks and to improve
Quality of Services (QoS). These trust based approaches try to give a secure node in routing path
by implementing trust mechanism in the existing routing protocols. In this paper, firstly we have
given a brief idea on several types of attacks that MANET suffers and trust mechanism. Then we
review currently existing trust based protocols and finally we have carried out a comparative
study on these protocols on the basis of their merits and demerits.
In the above mentioned CONFIDANT protocol the attacker can send false alarm messages to
isolate a good node by claiming it as a bad node. The attacks like wormhole, impersonation, Sybil
attack etc still exists in some of the protocol such as trusted AODV, CONFIDANT. As in
CONFIDANT protocol the reputation of a node is increased when it forwards he packet so the
malicious node that create wormhole get high reputation value.
Most of the protocols like TDSR, SRT etc. consider some performance matrices like packet
deliver ratio(no of successful packets/no of packets forwarded), average end to end delay to
forward packets to the destination and get back reply, communication overhead, route selection
time, throughput etc. to measure the performance. These protocols only focus on the
improvement of the performance through trust mechanisms but don’t focus on the security flaws
launched by malicious nodes on the network. Some protocols such as FrAODV, FACES increases
communication overhead due to excessive calculation for route finding and periodic flooding of
control packets.
After going through this comparison, we have seen that there are still many scope of work
towards the development of a new trust mechanism by considering QoS as well as minimizing the
several attacks. A newly developed trust mechanism we can apply in various environments like in
hybrid environments. We can also develop some rules in the protocol on the basis of which the
actions are taken to detect the nodes that are authenticated but perform malicious behaviour
without dropping packets and also authenticate the nodes to prevent attacks. So we can work on
these disadvantages through implementing a new trust based protocol.

REFERENCES
[1] G. Aggelou (2004) Mobile Ad Hoc Networks, Mcgraw-Hill.
[2] A. M. Pushpa, (2009) “Trust Based Secure Routing In Aodv Routing Protocol”, International
Conference On Internet Multimedia Services Architecture And Applications (Imsaa), Usa: Ieee Press,
1-6.
[3] S. Buchegger, J. L. Boudec, (2002) “Performance Analysis Of Confidant Protocol”, Mobihoc’02, Epfl
Lausanne, Switzerland, Pp226-236.
[4] Essia, T., Razak, A., Khokhar, R.S., Samian, N.: Trust-Based Routing Mechanism In Manet: Design
And Implementation. Springer, 18 June 2011.
[5] Edua Elizabeth, N., Radha, S., Priyadarshini, S., Jayasree, S., Naga Swathi, K.:Srt- Secure Routing
Using Trust Levels In Manets. European Journal Of Scientific Research, Issn 1450-216x Vol. 75,
No. 3 (2012), Pp. 409-422
[6] Huang, J., Woungang, I., Chao, H., Obidant, M., Chi, T., Dhurandher, S.K.: Multi-Path Trust –Based
Secure Aomdv Routing In Ad Hoc Networks. Ieee 2011
[7] Dhurandher, S.K., Obidant, M.S., Verma, K., Gupta, P., Dhuradar, P.:Faces: Friendhip-Based Ad Hoc
Routing Using Challenges To Establish Security In Manets Systems. Ieee System Journal, Vol.5, No.
2, June 2011
[8] Sharma, S., Mishra, R., Kaur, I.: New Trust Based Security Approach For Ad-Hoc Networks
.Ieee(2010)
[9] Bhalaji, N., Mukherjee, D., Banerjee, N., Shanmugam, A.:Direct Trust Estimated On Demand
Protocol For Secured Routing In Mobile Ad-Hoc Networks. International Journal Of Computer
Science & Security, Vol. 1, Issue (5)
AUTHORS
Mousumi Sardar has received her B.Tech degree in Information Technology in the year
2011 from College of Engineering & Management, Kolaghat, India. She is now perusing
her M.Tech. degree in Information Technology from West Bengal University of
Technology Kolkata, India.
Koushik Majumder has received his B.Tech and M.Tech degrees in Computer Science and
Engineering and Information Technology in the year 2003 and 2005 respectively from
University of Calcutta, Kolkata, India. He obtained his PhD degree in the field of Mobile Ad
Hoc Networking in 2012 from Jadavpur University, Kolkata, India. Before coming to the
teaching profession he has worked in reputed international software organizations like Tata
Consultancy Services and Cognizant Technology Solutions. He is presently working as an
Assistant Professor in the Dept. of Computer Science & Engineering in West Bengal
University of Technology, Kolkata, India He has published several papers in International
and National level journals and conferences. He is a Senior Member, IEEE.

A SURVEY ON TRUST BASED SECURE ROUTING IN MANET

More Related Content

What's hot (20)

Similar to A SURVEY ON TRUST BASED SECURE ROUTING IN MANET (20)

More from cscpconf (20)

Recently uploaded (20)

A SURVEY ON TRUST BASED SECURE ROUTING IN MANET