A Security protocol for Mobile Ad-hoc Networks Thesis Report Student: Lijun Jia advisor: Dr. Mangir 05/18/2007. A Security protocol for Mobile Ad-hoc networks. Outline Background Problem Statement Objective Methods Used Research Methodology
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Student: Lijun Jia
advisor: Dr. Mangir
Features of Ad hoc networks:
Such networks can be very useful in scenarios where natural conditions or time constraints make it impossible to pre-deploy infrastructure. Meanwhile, secure routing has become an excellent topic of open research because of the extraordinary gap between the nature of ad hoc network and the security required by its applications.
AODV Route Establishment Process
1. Attacks using Modification:
2. Attacks using Impersonation :
3. Attacks using Fabrication :
Routing updates need to be sent in a timely fashion. Timestamps and timeout mechanisms can guarantee the freshness of the routes they provide.
ensures the identity of the party with which communications are exchanged, before granting it access to the network.
the originator of a message cannot deny having sent the message. If non-repudiation is guaranteed, the receiver of a wrong message can prove that the originator sent it, and that therefore the originator misbehaved.
C[S]= [ IPS ||PKS|| T || te ]PVT
source and destination
choose return path
an example of secure ad hoc network
2. Route Discovery(continue)
S broadcasts RDM:=[RDM || IPD|| C[S] || NS|| t]PVS
A rebroadcasts RDM:=[[RDM || IPD|| C[S] || NS|| t]PVS]PVA || C[A]
B rebroadcasts RDM:=[[RDM || IPD|| C[S] || NS|| t]PVS]PVB || C[B]
3. Route Reply (Route Setup)
D to C RRM: = [RRM || IPS || C[D] || NS || t] PVD
C to BRRM: = [[RRM || IPS || C[D] || NS || t] PVD] PVC|| C[C]
B to ARRM: = [[RRM || IPS || C[D] || NS || t] PVD] PVB|| C[B]
4. Route Maintenance
AbroadcastsB REER: =[RERR || IPS || IPD || C[A]|| NA || t]PVA
Four Cases are simulated:
The topology of Case 1
An example of the Average Routing Traffic Received (bits/sec) of Case 4 based on case 2 condition
PR = PT / (2 * π * D * f / c)²
C is speed of light
D is the transmitted distance
F is transmission frequency
The transmitted distance can affect route topology, throughput, and efficiency of the network
an example of SAODV with 20% malicious nodes (red and yellow circled nodes)