Transcript 下載/瀏覽Download

報告日期：12月8號
報告學生：馬敏修
2009/12/82009/12/8
2009/12/8
1
Outline

Introduction


A comparative study of various routing
protocol
Performance analysis
Static case
 Dynamic case


Conclusion
2009/12/82009/12/8
2009/12/8
2
Introduction(I)
 Wireless multi-hop networks have come to be
used in various facets of our life.
 Recovery operations in cases of disasters
such as hurricanes, floods, terrorist acts as
witnessed by the WTC bombing etc.
2009/12/82009/12/8
2009/12/8
3
Introduction(II)
 There are two main techniques used for
intrusion detection namely anomaly
detection and misuse detection or
signature detection.
2009/12/82009/12/8
2009/12/8
4
Introduction(III)
 In order to realize these ID techniques the
packets can be sniffed on each of the end hosts.
(HID)
 Also possible to sniff these packets on certain
predetermined machines in the network.(NID)
2009/12/82009/12/8
2009/12/8
5
Introduction(Ⅳ)
 HID systems are designed to monitor, detect
and respond to user and system activity and
attacks on a given host.
 NID deals with information passing on the
entire network between any pair of
communicating hosts.
2009/12/82009/12/8
2009/12/8
6
A comparative study of various
routing protocol(I)
 DSDV routing protocol
(Destination-Sequenced Distance-Vector routing)
 TORA routing protocol
(Temporally-Ordered Routing Algorithm)
2009/12/82009/12/8
7
A comparative study of various
routing protocol(II)
 DSR routing protocol
(Dynamic Source Routing)
 AODV routing protocol
(Ad hoc On Demand Distance Vector )
2009/12/82009/12/8
8
Performance analysis(I)
 There are two types of routing protocols
designed for ad-hoc networks, proactive
routing protocols and reactive routing
protocols.
2009/12/82009/12/8
2009/12/8
9
Performance analysis(II)
 The proactive routing protocols attempt to
maintain routing information from a given
node to every other node in the network.
 Amongst the protocols that we consider
DSDV is a proactive routing protocol.
2009/12/82009/12/8
2009/12/8
10
Performance analysis(III)
 The reactive routing protocols take a lazy
approach to routing.
 Once a route has been established, it is
maintained by a route maintenance procedure
until either the destination becomes
inaccessible or until the route is no longer
desired.
2009/12/82009/12/8
2009/12/8
11
Static case(I)
2009/12/82009/12/8
2009/12/8
12
Static case(II)
2009/12/82009/12/8
2009/12/8
13
Static case(III)
2009/12/82009/12/8
2009/12/8
14
Static case(Ⅳ)
2009/12/82009/12/8
2009/12/8
15
Dynamic case(I)
2009/12/82009/12/8
2009/12/8
16
Dynamic case(II)
2009/12/82009/12/8
2009/12/8
17
Dynamic case(III)
2009/12/82009/12/8
2009/12/8
18
Conclusion
 We focus on signature based intrusion detection
technique and investigate the ability of different adhoc network routing protocols to facilitate detection of
intrusions.
 We show that reactive routing protocols are less
effective than proactive routing protocols in the
absence of mobility.
 We also investigate the relationship between the
probability of intrusion and the number of nodes
2009/12/82009/12/8
2009/12/8
19