Mobile ad hoc networks‟ (MANET) has been an important trend in the field of networking. MANET is nothing but a wireless, dynamic, ad hoc, infrastructure less and self configurable environment.

1. Modified Topology-Hiding Multipath
Routing Protocol: Solution to the Topology Exposure
Problem in MANET
Presented By:
Akshay S. Phalke
1

2. Overview
• Introduction
• Objectives
• Literature Survey
• Problem Statement
• Mathematical Model
• System Architecture & Algorithm
• Results
• Conclusion & Future work
• References
2

3. Introduction
• Mobile ad hoc network is open wireless
network.
• Nodes are in mobile state.
• It is dynamically changing topology and lack
infrastructure network
3

4. Introduction (contd..)
Fig 1. Introduction Of MANET
4

5. Objectives
• Hide topology-not carry the link information
in route messages.
• Find node-disjoint routes-After construction of
any route to the destination it advertises the set
of node in that path.
• Exclude unreliable routes-M-THMR able to
detect the malicious as well as faulty node.
5

6. Literature Survey
6

7. Problem Statement
• To present the solution for topology exposure
problem and discussed its mitigation
technique.
7

8. Mathematical Model
8

9. System Architecture
9

10. MODIFIED TOPOLOGY-HIDING MULTIPATH
ROUTING PROTOCOL(M-THMR)
• ExNodeSet greatly reduces the probability that a
node is placed on more than one route.
• Every node independently makes routing
decisions by checking the reverse routes.
• Only the nodes that are placed on established
routes needs to rebroadcast the RREP message.
• Only two routes in routing table remains finally,
which means that the established routes are
bidirectional.
10

11. Proposed System: Algorithm
1.M-THMR:
Algorithm 1: Trust Value Calculation for Secure Route Discovery Mechanism:
• Input: Ti (trust value of nodes)
• Output: FaultNode [ ], TrustNode [ ].
• N [ ] = GetNeighbour[ ];//find all neighboring nodes
• For all node i in N [ ]
• CalculateTrust[ ]// obtain trust
• UpdateTrust () //
• If(Ti<TThreshold)
• FaultNode U node(i)
• else
• TrustNode U node(i)
• End for
11

12. Algorithm
• Algorithm 2: M-THMR Protocol at node I
• Method1: Route request Phase
• Upon receiving RREQ < S,D, seq, hopCt > from nj :
• if ni == D then
• set a timer TD
• /∗ enter Route Reply Phase upon timeout∗/
• return
• end if
• Insert < S,nj, hopCt + 1 > into RT /∗ reverse route ∗/
• if < S,seq > doesn’t exist in SNT then
• Insert < S,seq > into SNT
• if ni! = D then
• Rebroadcast RREQ < S,D, seq, hopCt + 1 >
• end if
• end if
12

13. Algorithm
• Method2: Route reply Phase
• Upon receiving RREP < S,D, seq, hopCt,
• exNodeSet, nextNode > from nj :
• for each route R in RT do
• if R.D == S and R.nextHop ∈ exNodeSet then
• Remove route R
• end if
• end for
• if nextNode == NULL or nextNode == ni then
• Insert < D,nj, hopCt + 1 > into RT
• /∗ two temporary parameters ∗/
• Set mHop = 65535 and R1 = NULL
• for each route R in RT do
• if R.D == S and R.hopCount < mHop then
• Set mHop = R.hopCount and R1 = R
• end if
• end for
13

14. Algorithm
• for each route R in RT do
• /∗ remove all reverse routes to source ∗/
• if R.D == S then
• Remove route R
• end if
• end for
• if R1! = NULL then
• Insert R1 into RT
• nextNode = R1.nextHop
• exNodeSet = {R1.nextHop} ∪ exNodeSet
• Broadcast RREP < S,D, seq, hopCt + 1,
• exNodeSet, nextNode >
• end if
• end if
14

15. Algorithm
• Method3: Route Probe Phase
• Upon Timeout at the Destination:
• Set exNodeSetmHop = NULL
• for each route R in RT do
• exNodeSet = {R.nextHop} ∪ exNodeSet
• end for
• Broadcast RREP < S,D, 0, exNodeSet,NULL >
15

16. Implementation Requirement
•Software Requirement:
i.MFS(Meta Exploid Frame Work)
ii.Netscan (Network Scan Tools)
iii.NS 2.35
iv.CAINK (Packet Inspect)
v.VMware player
• OS: Red Hat Enterprise Linux
• OS: a) Back Track b) Kali ( Hacking O.S.)
•Hardware Requirement:
i.512 Mb RAM, 80 GB HDD
ii.2 GHz Processor
iii.Packet Builder Radiator
16

17. Simulation Parameters
Table No 1. Simulation Parameters
17

18. Results
18

19. Results
19

20. Conclusion
• Proposed System states that
• M-THMR doesn’t degrade the performance
when there is no attack.
• In the adversarial scenario, the simulation
results show that M-THMR can resist attacks.
20

21. Future Work
• As for the future work, we plan to design the
data transmission strategy with fault detection
mechanism based on M-THMR
21

22. References
• Yujun Zhang, Guiling Wang, Qi Hu, "Design & Performance Study of a
Topology-Hiding Multipath routing Protocol for Mobile Ad Hoc networks”
IEEE 2014.
• C. K. Toh, A. N. Le, et al. Load balanced routing protocols for ad hoc
mobile wireless networks. IEEE Communications Magazine, 47(8):78–84,
2011.
• M. K. Marina, and S. R. Das. Ad Hoc On-demand Multipath Distance
Vector Routing. Wiley Wireless Communications and Mobile Computing,
6(7):969–988, 2014.
• L. Abusalah, A. Khokhar, et al. A Survey of Secure Mobile Ad Hoc
Routing Protocols. IEEE Communications Surveys and Tutorials,
10(4):78–93, 2013.
• E. Gerhards-Padilla, N. Aschenbruck, et al. Detecting Black Hole Attacks
in Tactical MANETs Using Topology Graphs. IEEE Conference on Local
Computer Networks (LCN), pages 1043–1052, 2011.
22

23. Thank you
Suggestions Are Welcomed…
23