ĐÁNH GIÁ VỀ AN TOÀN GIAO THỨC ĐỊNH TUYẾN TRONG MẠNG MANET LUẬN VĂN THẠC SĨ CÔNG NGHỆ THÔNG TIN

Manet Unicast
 Routing Protocol
Protocol in NS-2”
NS-2”,, December, 2004
9.  C. P. Vandana and A. F. S. Devaraj, “MLDW - A MultiLayered Detection
mechanism for Wormhole attacks in AODV based MANET”,
MANET” , in
International Journal of Security, Privacy and Trust Management
(IJSPTM) vol. 2, no. 3, (2013) June
10. H. Deng, W. Li and D. P. Agrawal (2002), “Routing Security in Wireless
 Ad Hoc Networks”,University
Networks”,University of Cincinnati, IEEE Communication
Magazine, October 2002
11. The VINT Project, “The NS manual”,
manual”, A Collaboration between
researches at UC Berkeley, LBL, USC/ISI, and Xerox PARC, March
March
14,2008
12.  />

 

80
13. Elizabeth M.Royer, C-K Toh (1999), “A review of current routing
 protocol for Ad hoc Mobile Wireless Networks”,
Networks”, IEEE Personal
Communications, 6(2):46–55, April 1999  
14. Charles E. Perkins, Pravin Bhagwat, “ Highly
“ Highly Dynamic DestinationSequenced Distance Vector Routing (DSDV) for Mobile Computers”,
Computers” ,
Comp Commun Rev, Oct. 1994 

15. David B. Johnson, David A. Maltz, Josh Broch, “ DSR:
“ DSR: The Dynamic
Source Routing Protocol for Multi-hop Wireless Ad Hoc Networks”,
Networks”, t.
Imielinski and H.Korth , Eds Kluwer, 1996
16. Jathe S.R., Dakhane D.M. (2012), “A Review Paper on Black Hole Attack
and Comparison of Different Black Hole Attack Tech-niques”, 
Tech-niques”,  
International Journal of Cryptography and Security, ISSN: 2249-7013 &
E-ISSN: 2249-7021, Volume 2, Issue 1, pp.-22-26
17. Kimaya Sanzgiri, Bridget Dahill, Brian N. Levine, and Elizabeth M.
Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks”.
Networks”.
Proceedings of 10th IEEE International Conference on Network Protocols
(ICNP’02), Paris, France, November 2002, pp. 78-90
18. Yi-an Huang and Wenke Lee, “Attack analysis and Detection for Ad-hoc
 Routing protocols”.
protocols”. Proceedings of the 7th International Symposium on
Recent Advances in Intrusion Detection (RAID'04), French Riviera,
France. September 2004 
19. Mishra Amitabh, Nadkarni Ketan M., Ilyas Mohammad, 
Mohammad,  “Chapter 30:
Security in wireless ad-hoc networks,
networks, the handbook of Ad hoc wireless
network”,, CRC PRESS Publisher, 2003
network”
20. C.Siva Ram Murthy, B. S. Manoj, “ Ad hoc wireless networks:
 Architecture and Protocols”. 
Protocols”.  Prentice Hall Publishers, May 2004, ISBN
013147023X

21. William Stallings, “Network Security essentials: Application and
Standards”,, Pearson Education , Inc 2003, ISBN 0130351288
Standards”
22. Preeti Sachan, Pabitra Mohan Khilar (2011), “Securing AODV routing
 protocol in MANET based cryptographic authentication”,
authentication”,  International
 Journal of Network Security
Security & Its Applications, Volume 3 (5)


 

81
PHỤ LỤC
Phụ lục 1 - Kịch bản mô phỏng
# Define options
set val(chan)
set val(prop)
set val(netif)
set val(mac)
set val(ifq)
set val(ll)
set val(ant)
set val(ifqlen)
set val(nn)
set val(nnaodv)
set val(rp)
set val(x)
set val(y)
set val(cstop)

set val(stop)
set val(cp)
Connections
set val(cc)

Channel/WirelessChannel
Channel/Wireles sChannel
;#Channel Type
Propagation/TwoRayGround
Propagation/Two RayGround
;# radio-propagation model
Phy/WirelessPhy
;# network interface type
Mac/802_11
;# MAC type
Queue/DropTail/PriQueue
Queue/DropTail/ PriQueue
;# interface queue type
LL
;# link layer type
Antenna/OmniAntenna
Antenna/OmniAnt enna
;# antenna model
150
;# max packet in ifq
50
;# total number of mobilenodes
49
;# number of AODV mobilenodes
AODV

;# routing protocol
1000
;# X dimension of topography
1000
;# Y dimension of topography
600
;# time of connections end
600
;# time of simulation end
"…/kichban-n50-t600-1000-1000
"…/kichban-n50 -t600-1000-1000"
"
;#Connection Pattern
"…/cbr" ;#CBR Connections

set ns_
[new Simulator]
$ns_ use-newtrace
set tracefd
[open aodv1.tr w]
$ns_ trace-all $tracefd
set namtrace
[open aodv1.nam w]
$ns_ namtrace-all-wireless $namtrace $val(x) $val(y)
# set up topography object
set topo
[new Topography]
$topo load_flatgrid $val(x) $val(y)
# Create God
create-god $val(nn)

# Create channel #1 and #2
set chan_1_ [new $val(chan)]
set chan_2_ [new $val(chan)]
set god_ [God instance]
# configure node, please note the change below.
$ns_ node-config
-adhocRouting $val(rp) \
-llType $val(ll) \
-macType $val(mac) \
-ifqType $val(ifq) \
-ifqLen $val(ifqlen) \
-antType $val(ant) \
-propType $val(prop) \
-phyType $val(netif) \
-topoInstance $topo \
-agentTrace ON \
-routerTrace ON \
-macTrace ON \
-movementTrace ON \
-channel $chan_1_
# Creating mobile AODV nodes for simulation
puts "Creating nodes..."
for {set i 0} {$i < $val(nnaodv)} {incr i} {


 

82
set node_($i) [$ns_ node]
$node_($i) random-motion 0

;#disable random motion
}
# Creating Black Hole nodes for simulation
$ns_ node-config
-adhocRouting blackholeAODV
for {set i $val(nnaodv)} {$i < $val(nn)} {incr i} {
set node_($i) [$ns_ node]
$node_($i) random-motion 0
;#disable random motion
$ns_ at 0.01 "$node_($i) label \"blackhole node\""
}
puts "Loading random connection pattern..."
source $val(cp)
# CBR Connections generated by cbrgen
source $val(cc)
# Define initial node position
for {set i 0} {$i < $val(nn) } {incr i} {
$ns_ initial_node_pos $node_($i) 30
}
# CBR connections stops
for {set i 0} {$i < 9 } {incr i} {
$ns_ at $val(cstop) "$cbr_($i) stop"
}
# Tell all nodes when the simulation ends
for {set i 0} {$i < $val(nn) } {incr i} {
$ns_ at $val(stop).000000001 "$node_($i) reset";
}
# Ending nam and simulation
$ns_ at $val(stop) "finish"
$ns_ at $val(stop).0 "$ns_ trace-annotate \"Simulation has ended\""

$ns_ at $val(stop).00000001 "puts \"NS EXITING...\" ; $ns_ halt"
proc finish {} {
global ns_ tracefd namtrace
$ns_ flush-trace
close $tracefd
close $namtrace
#
exec nam aodv1.nam &
exit 0
}
puts "Starting Simulation..."
$ns_ run


 

83
Phụ Lục 2 – Tính toán các tham số hiệu năng
# ============
============================
=================
= ketqua.awk ================
========================
========
BEGIN {
sends=0;
recvs=0;
droppedPackets=0;
highest_packet_id=0;
sum=0;

recvnum=0;
routing_packets=0;
}
{
time = $3;
packet_id = $41;
#============= TINH TY LE PHAN PHOI GOI TIN THANH CONG ================
if (( $1 == "s") && ( $35 == "cbr" ) && ( $19=="AGT" ))
{ sends++; }
if (( $1 == "r") && ( $35 == "cbr" ) && ( $19=="AGT" ))
{ recvs++; }
#============= TINH DO TRE TRUNG BINH =================================
if ( start_time[pack
start_time[packet_id]
et_id] == 0 ) start_time[pa
start_time[packet_id]
cket_id] = time;
if (( $1 == "r") && ( $35 == "cbr" ) &
&&
& ( $19=="AGT" )) { end_time[packet_
end_time[packet_id]
id] =
time; }
else { end_time[packet
end_time[packet_id]
_id] = -1; }
#============= TINH TONG PHI ==========================================
if (($1 == "s" || $1 == "f") && $19 == "RTR" && $35 =="AODV") routing_packets++;
#============= SO GOI TIN BI MAT ======================================
if (( $1 == "d" ) && ( $35 == "cbr" ) && ( $3 > 0 ))

{
droppedPackets=droppedPackets+1;
}
#find the number of packets in the simulation
if (packet_id > highest_packet_id)
highest_packet_id = packet_id;
}
END {
for ( i in end_time )
{
start = start_time[i];
end = end_time[i];
packet_duration = end - start;
if ( packet_duration > 0 ) { sum += packet_duration; recvnum++; }
}
delay = sum/recvnum;
PDR = (recvs/sends)*100;
printf("So goi tin phat = %.2f\n",sends);
printf("So goi tin nhan = %.2f\n",recvs);
printf("Ti le phan phat thanh cong = %.2f\n",PDR);
printf("Do tre trung binh (ms)= %.2f\n",delay*1000);
printf("So goi tin bi mat (packets) = %d\n",droppedPackets);
printf("Tong phi = %d\n",routing_packets);
}