Trust Management in Mobile Ad Hoc Networks Using a

slide1. Trust Management in Mobile Ad Hoc Networks Using a Scalable Maturity-Based Model Authors: Pedro B. Velloso, Rafael P. Laufer, Daniel de O. Cunha, Otto Carlos M. B. Duarte, and Guy Pujolle Paper Presentation By : Gaurav Dixit (gdixit@vt.edu)<br>
slide2. Outline Introduction
Trust Model
Implementation
Results<br>
slide3. MANets - same node can work as router server client
Assumption of good behavior – Not true!
Trust needs to be measured - This paper provides one such method.
Applying human trust dynamics to trust calculation of nodes
Builds on recommendations Introduction<br>
slide4. Trust level of a node depends on:= (previous individual experiences) + (recommendation from neighbors)

Benefits of trust calculation:
avoid sending packets to malicious nodes.
increased co-operation among good nodes.<br>
slide5. Recommendations collected only from neighbors. Advantages for nodes:

Less storage
Less power requirement
Less processing
Better for changing topologies – information for entire network not required<br>
slide6. Since, recommendations not forwarded, it is good for networks:

Less recommendation messages travelling in network - low traffic

Low energy consumption for entire network<br>
slide7. Relationship Maturity

Similar to human trust behavior, more weightage is given to the recommendations from older neighbors.<br>
slide8. Trust Model

Trust level assigned to each neighbor.

Trust value reflects behavior history, and thus expected future behavior.

Node forms opinion based on experiences.
Transmission of these opinions about node i are called recommendations.<br>
slide9. Trust Model …

Recommendations compensate for lack of monitoring capabilities.

Paper defines Recommendation Exchange Protocol (REP)<br>
slide10. Trust Model…

Trust level varies from 0 to 1.

Recommendation from C more important than that from B, because of relationship maturity.<br>
slide11. Trust Model: Architecture Two parts:
Learning Plan: gathers and converts information into knowledge.
Trust plan: assess trust level of each neighbor using stored knowledge and recommendations.<br>
slide12. Trust Model: Components<br>
slide13. Trust Model: Components
Behavior monitor observes network, indicates new neighbors to Rec Manager, and send behavior report to Classifier.
Classifier sends behavior classification to Experience Calculator.
Trust Calculator calculates trust with inputs from experiences and recommendations.
Auxiliary Trust Table entries correspond to relationship maturity.
Trust table entries have timeout.<br>
slide14. Trust Model: Components

Three operation modes:
Simple: Just trust table, REP optional
Intermediate: Simple mode plus storage of recommendations
Advanced: Complete system implementation.

Recommendation Manager implements REP.
All nodes are in advanced mode in this paper.<br>
slide15. Trust level evaluation

𝑇𝑎(𝑏) = (1 − 𝛼)𝑄𝑎(𝑏) + 𝛼𝑅𝑎(𝑏)

𝑄𝑎(𝑏) = 𝛽𝐸𝑎(𝑏) + (1 − 𝛽)𝑇𝑎(𝑏)

Ta(b) ->Trust calculation from node a for node b
Qa(b) -> Personal Experience
Ra(b) -> Recommendations

All variables(except a & b) range from 0 to 1.<br>
slide16. Recommendation Computation

𝐾𝑎  subset of neighbors
𝑀𝑖(𝑏)  relationship Maturity
𝑋𝑖(𝑏)  random variable with normal distribution representing recommendation uncertainty.
𝑋𝑖(𝑏) = 𝑁(𝑇𝑖(𝑏), 𝜎𝑖(𝑏))<br>
slide17. First Trust Values

Initial trust values can be:
Prudent : Strangers have low trust value
Optimist: High trust in new neighbors.
Moderate: Trust value between Prudent and optimist.
Fa  First trust value

𝑇𝑎(𝑏) = (1 − 𝛼)𝐹𝑎 + 𝛼𝑅𝑎(𝑏)<br>
slide18. Recommendation Exchange Protocol

Only one hop neighbors considered. ( IP TTL=1)

Consists of:
TREQ: Trust Request
TREP: Trust Reply
TA: Trust Advertisement<br>
slide19. REP
TREQ sent when nodes first meet, with IP of new neighbor as target node. Wait time tREQ before sending TREQ

TREP sent by neighbors who have target node as their neighbor, after waiting for random time period tREP

TA sent if trust level changes by threshold 𝜋<br>
slide20. Authentication

A pair of public-private key for each node is sufficient for the system to work.

Sybil attack would not be a problem since the malicious identities are quickly found and ignored.<br>
slide21. Trust Model Implementation

Learning Plan<br>
slide22. Nature of nodes vary from 0 (untrustworthy) to 1 (trustworthy)

A node with nature of 0.8 would do 8 good actions out of 10.

Behavior Monitor is emulated by concept of perception, which indicates probability of noticing a certain action.

Classifier (perfectly) classifies actions.<br>
slide23. Node will decide for itself whether or not it will use behavior monitor in promiscuous mode. Required perception value and personal constraints would help in this decision.

Experience Calculator observes imin actions before calculating trust. Higher perception would result in more accurate trust level. But higher imin means higher convergence time.

Paper assumes imin =10<br>
slide24. Results: Small networks All nodes are at one hop distance.

Time in seconds.
Convergence at t=350 for 𝛼 = 𝛽 = 𝜏 = 0.5<br>
slide25. Results: Small networks Optimistic first trust strategy.

Time in minutes.
Nature set to 0.2 .

Number of neighbors varied.<br>
slide26. Results: Small networks Neighbors =15

Varying alpha<br>
slide27. Results: Small networks Perception 𝜏 is the fraction of actions a node can notice from its neighbors

Varying 𝜏<br>
slide28. Results: Multihop MANets Analyzing movement in more complex networks.
21 nodes with 250m transmission range, placed in 1000 m × 400 m .
𝛼 = 𝛽 = 𝜏 = 0.5
First trust optimist (0.9)
Nature of nodes = 0.2<br>
slide29. Results: Multihop … m1 keeps 3 old neighbors
m2 has no old neighbors<br>
slide30. Results: Multihop … m1 keeps 3 old neighbors
m2 has no old neighbors<br>
slide31. Results: Multihop … Node speeds three times faster.<br>
slide32. Results: Multihop … Varying perception – lower perception takes longer time to converge.<br>
slide33. Results: Relationship maturity Node 1,8,15 go to zone F2.

Evaluating trust level of node 8 about node 20<br>
slide34. Results: Relationship maturity Using lower perception value(0.2)

Note that recommendations are important in low perception cases<br>
slide35. Results: Lying Attacks 20 nodes -250m transmission range, placed in a
150 m × 150m

Node 1 changes nature from 0.9 to 0.2<br>
slide36. Results: Lying Attacks Malicious nodes fixed at 40%<br>
slide37. Results: Lying Attacks Slander Attack

Node2 evaluating node1 which has nature 0.9

Pessimistic strategy (Fa=0.1)<br>
slide38. Results: Lying Attacks Slander Attack

Varying alpha<br>
slide39. Results: Lying Attacks Slander Attack

Varying perception parameter.<br>
slide40. Results: Lying Attacks Slander Attack

Malicious nodes lie after t=200<br>
slide41. Results: Lying Attacks Slander Attack

Malicious nodes identification time varying<br>
slide42. Results: Lying Attacks Slander Attack

Malicious nodes identification time varying<br>
slide43. REP
To reduce number of messages sent across network:
TREQ is sent once containing multiple target nodes, using timer based approach.
TREP instead of sending once per request, implemented as broadcast – this saves 85%
TREP implemented, additionally, with timer, saves 99% messages.
TA implemented with a threshold to reduce its occurrence.<br>
slide44. REP<br>
slide45. REP Changing the value of Trust threshold(𝜋)<br>
slide46. REP Changing the value of Trust threshold(𝜋) and its impact on trust levels.<br>
slide47. Discussion Using smart timers in suppressing redundant messages scales well in large networks, reducing overhead for trust management by 85 to 99%.
Increasing value of α improves the trust model efficiency, since we can use already derived results (by neighbors) in the form of recommendations.<br>
slide48. Conclusion Flexible trust evaluation model proposed based on concept of human trust, which uses recommendations and relationship maturity.
Recommendation Exchange Protocol (REP) proposed.
Model highly scalable – since only neighbors consulted.
Model tolerates 35 % liars
Trust level error reduced by 50% by using relationship maturity parameter.<br>
slide49. Thank You!<br>