You are on page 1of 12

International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com


Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 72

Abstract: Mobile ad hoc networks are one of the quickest
developing regions of examination. They are an .appealing
engineering for some provisions, for example, salvage and
strategic operations, because of the adaptability gave by their
element base. Then again, this adaptability includes some
significant downfalls and presents new security dangers.
Besides, numerous ordinary security results utilized for wired
systems are within successful and wasteful for the
exceptionally dynamic and asset - compelled situations where
MANET utilization may be normal. To create suitable security
answers for such new situations, we should first see how
MANETs could be struck. We acquaint the security issues
particular with MANETs and present a definite grouping of the
assaults/ambushers against these complex conveyed
frameworks. In this paper, we examine security issues and
their current results in the portable impromptu system. Owe to
the powerless nature of the versatile impromptu system, there
are various security dangers that exasperate the improvement
of it. We first dissect the fundamental vulnerabilities in the
portable impromptu systems, which have made it much
simpler to experience the ill effects of assaults than the
conventional wired system. At that point we talk about the
security criteria of the versatile specially appointed system and
present the fundamental strike sorts that exist in it. At last we
overview the current security answers for the portable
impromptu system. We likewise give a review of interruption
recognition in MANETs and demonstrate the way of IDSs that
have been proposed for MANETs in the previous decade.
Keywords: Mobile Ad Hoc Network (MANET); Intrusion
Detection System(IDS);Denial of Service (Dos);Personal
Digital Assistants (PDAs); Rushing Attack Prevention
(RAP).

1. INTRODUCTION
With the expansion of less expensive, littler, and all the
more influential cell phones, mobile specially appointed
systems (MANETs) have turned into one of the quickest
developing territories of examination. This new kind of
self - sorting out system consolidates remote
correspondence with a high degree node portability. Not at
all like accepted wired systems they have no altered
framework (base stations, unified administration focuses
and the like). The union of nodes structures a discretionary
topology. This adaptability makes them appealing for some
requisitions, for example, military provisions, where the
system topology may change quickly to reflect an energy's
Operational developments, and calamity recuperation
operations, where the current/altered foundation may be
non - operational. The specially appointed self -
association likewise makes them suitable for virtual
gatherings, where setting up a conventional system
framework is a period expending high - cost
errand.Routine systems use committed nodes to do
fundamental capacities like bundle sending, routing, and
system administration. In specially appointed systems
these are completed collectively by all accessible nodes.
Nodes on MANETs use multi - bounce correspondence:
nodes that are inside one another's radio reach can impart
specifically by means of remote connections, while those
that are far separated must depend on middle nodes to go
about as switches to transfer messages. Mobile nodes can
move, leave and join the network and routes need to be
overhauled frequently because of the element system
topology. Case in point, node A can speak with node F by
utilizing the briefest way A B C F as indicated in
Figure 1 (the dashed lines indicate the immediate
connections between the nodes). In the event that node A
moves out of node S' range, he has to 2 find an option
course to node F (A E C C F). An assortment of
new conventions have been produced for
discovering/redesigning courses and by and large giving
correspondence between end focuses (in any case no
proposed convention has been acknowledged as standard
yet). However these new routing conventions, in view of
participation between nodes, are powerless against new
types of attacks. Tragically, numerous proposed routing
conventions for MANETs don't think about security.
Moreover their particular characteristics - the absence of
main issues, the dynamic topology, the presence of
profoundly - compelled nodes, presents a specific
challenge for security.Much research has been carried out
to counter also discover attacks against existing MANET
Routing conventions, counting work on secure Routing
conventions also interruption recognition frameworks.
Then again, for handy reasons the proposed results
normally concentrate on a couple of specific security
vulnerabilities since giving a extensive result is non -
unimportant. In the event that we are to create more
general results we should first and foremost have a far
reaching understanding of conceivable vulnerabilities and
MANET Study: Security Threats and Counter
Measure
Manpreet Singh
1
Malti Sarangal
2
Gurpreet Singh
3


M.Tech, Department of Computer Science & Engineering
1

Ambika Paul School of Technology, PTU Main Campus, Kapurthala, Punjab
1

Assistant Professor, Department of Computer Science & Engineering
2

Ambika Paul School of Technology, PTU Main Campus, Kapurthala, Punjab
2


Assistant Professor, Department of Computer Science & Engineering
3

SBBSIET, Padhiana, Punjab
3

International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 73

security dangers against MANETs. This is the
fundamental objective of this section.

Figure 1. Communication between Nodes on MANETs

2. BACKGROUND
The particular characteristics of MANETs present a test
for security results. Numerous existing security answers for
routine systems are inadequate and wasteful for numerous
visualized MANET organization nature's turfs. Thusly,
analysts have been meeting expectations for the most
recent decade on creating new security results or changing
current ones to be material to MANETs. Since numerous
routing conventions don't think about security, some
examination centres on developing secure routing
conventions then again presenting security developments
to the current routing conventions. Routing conventions
have been proposed to counter childish exercises by
driving the self-centred nodes to collaborate. Existing key
administration components are normally focused around
main issues where administrations, for example,
accreditation powers or key servers might be put. Since
MANETs don't have such focuses, new key administration
systems have must be produced to satisfy prerequisites. At
long last, following prevention systems are perpetually
constrained in viability, intrusion location frameworks are
by and large used to supplement other security systems.
This applies to MANETs excessively and researchers have
proposed new IDSs to locate noxious activities on these
systems. In the event that we are to create more general
results we should first have a complete understanding of
conceivable vulnerabilities and security dangers against
MANETs. They offer the vulnerabilities of wired systems,
for example, listening stealthily, disavowal of
administration, spoofing and so forth, which are
accentuated by the specially appointed connection [1].
They likewise have further vulnerabilities, for example,
those that exploit the agreeable nature of Routing
calculations. These vulnerabilities of MANETs are
abridged in the emulating area.

3. VULNERABILITIES OF MANETS
a. Wireless Links: First of all, the use of wireless
links makes the network susceptible to attacks such as
eavesdropping and active interference. Unlike wired
networks, attackers do not need physical access to the
network to carry out these attacks. Furthermore
wireless networks typically have lower bandwidths
than wired networks. Attackers can exploit this
feature, consuming network bandwidth with ease to
prevent normal communication among nodes.
b. Dynamic Topology: MANET nodes can leave and join
the network, and move independently. As a result the
network topology can change frequently. It is hard to
differentiate normal behaviour of the network from
anomaly/malicious behaviour in this dynamic
environment. For example, a node sending disruptive
routing information can be a malicious node, or else
simply be using outdated information in good faith.
Moreover mobility of nodes means that we cannot
assume nodes, especially critical ones (servers, etc.),
are secured in locked cabinets as in wired networks.
Nodes with inadequate physical protection may often
be at risk of being captured and compromised.
c. Cooperativeness: Routing algorithms for MANETs
usually assume that nodes are cooperative and non-
malicious. As a result, a malicious attacker can easily
become an important routing agent and disrupt
network operations by disobeying the protocol
specifications. For example, a node can pose as a
neighbour to other nodes and participate in collective
decision -making mechanisms, possibly affecting
networking significantly.
d. Lack of a Clear Line of Defence:MANETs do not have
a clear line of defence; attacks can come from all
directions [2]. The boundary that separates the inside
network from the outside world is not very clear on
MANETs. For example, there is no well-defined place
where we can deploy our traffic monitoring, and
access control mechanisms. Whereas all traffic goes
through switches, routers, or gateways in wired
networks, network information in MANETs is
distributed across nodes that can only see the packets
sent and received in their transmission range.
e. Limited Resources: Resource constraints are a further
vulnerability. There can be a variety of devices on
MANETs, ranging from laptops to handheld devices
such as PDAs and mobile phones. These will generally
have different computing and storage capacities that
can be the focus of new attacks. For example, mobile
nodes generally run on battery power. This has led to
emergence of innovative attacks targeting this aspect,
e.g. Sleep Deprivation Torture [3]. Furthermore, the
introduction of moresecurity characteristics into the
system expands the computation, correspondence and
administration load [4]. This is a test for systems that
are as of now asset - compelled.

4. ATTACKS ON MANET
At the most elevated amount, the security objectives of
MANETs are most certainly not that unique in relation to
different systems: most ordinarily confirmation,
classifiedness, respectability, accessibility, and non -
renouncement. Confirmation is the check of cases about
the personality of a wellspring of data. Confidentiality
implies that just commissioned individuals or frameworks
can read then again execute ensured information then
again programs. It ought to be noted that the affectability
of data in MANETs may rot a great deal more quickly than
in other data. For sample, yesterday's troop location will
regularly be less delicate than today's. Respectability
implies that the data is not adjusted or defiled by
unapproved clients or by nature. Accessibility alludes to
the capability of the system to give administrations as
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 74

needed. Denial of Service (Dos) assaults have turned into a
standout amongst the most stressing issues for system
supervisors. In a nature's domain, a fruitful Dos assault is
greatly perilous, and the building of such assaults is a
legitimate current war - objective. Finally, non - disavowal
guarantees that submitted activities can't be denied. In
MANETs security objectives of a framework can change
in distinctive modes (e.g. peace time, move to war, and
war time of a military system). The aspects of MANETs
make them vulnerable to a lot of people new attacks. At
the top level assaults could be grouped as per system
convention stacks. Table 1 gives a couple of samples of
attacks at each layer. A few attack could happen in any
layer of the network convention stack, e.g. sticking at
physical layer, hi surge at system layer, furthermore SYN
surge at transport layer are all Dos attack. Since new
routing conventions present new manifestations of assaults
on MANETs.
Table 1: Attacks on Protocol Stack

V. ATTACK TYPES IN MOBILE AD HOC
NETWORKS
There are various sorts of attack in the versatile specially
appointed system, just about all of which could be
delegated the accompanying two sorts [5]:
(i). Outer/External attacks: In which the assailant points
to cause blockage, engender fake routing data or
exasperate nodes from giving administrations.

Figure 2. Diagram of Outer/External attacks
ii). Inner/Internal attacks: In which the adversary wants
to increase the ordinary access to the system also take
part the system exercises, either by a few malignant
Impersonation to get the access to the system as another
node, or by specifically trading off a current node and
utilizing it as a premise to lead its noxious practices.

Figure 3. Diagram of Inner/Internal attacks
In the two classes demonstrated above, outer attacks are
like the typical attacks in the conventional wired
systems in that the adversary is in the nearness however
not a trusted node in the system, in this way, this kind
of attack might be counteracted and discovered by the
security strategies, for example, participation
verification or firewall, which are generally expected
security results. Then again, because of the pervasive
correspondence nature and open system media in the
portable specially appointed system, inside attacks are
significantly a bigger number of risky than the interior
assaults: in light of the fact that the bargained nodes are
initially the kind clients of the specially appointed
system, they can without much of a stretch pass the
confirmation and get security from the security
instruments. As a result, the enemies can make
utilization of them to pick up typical access to the
administrations that ought to just be accessible to the
commissioned clients in the system, and they can utilize
the lawful personality gave by the traded off nodes to
hide their malignant practices. Accordingly, we should
give careful consideration to the interior assaults started
by the malignant insiders when we think about the
security issues in the Mobile Ad hoc networks. In the
accompanying, we talk about the fundamental assault
sorts that develop in the Mobile Ad hoc networks.

a) Denial of Service (Dos)
The main sort of attack is disavowal of administration,
which expects to crab the accessibilityof certain node
then again even the administrations of the whole ad hoc
networks. In the customary wired system, the Dos
attacks are completed by flooding a system movement to
the target to fumes the preparing power of the target
and make the administrations gave by the target get to
be occupied. All things considered, it becomes not
functional to perform the conventional Dos attacks in
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 75

the versatile mobile ad hoc networks as a result of the
circulated nature of the administrations. In addition, the
versatile mobile ad hoc networks are more vulnerable
than the wired systems on account of the impedance
inclined radio channel what's more the restricted battery
power. In the practice, the attackers precisely utilize the
radio sticking and battery exhaustion techniques to lead
Dos attacks to the versatile mobile ad hoc networks,
which will relate to the two vulnerabilities.
b) Impersonation
Impersonation attack is an extreme risk to the security
of versatile impromptu system [6]. As we can see, if
there is not such a legitimate authentication system
among the nodes, the adversary can catch a few nodes
in the network and make them look like favourable
nodes. In thusly, the bargained nodes can join the
system as the typical nodes and start to conduct the
malignant practices, for example, propagate fake
routing information and increase unseemly necessity to
get to some secret data.
c) Eavesdropping
Eavesdropping is an alternate sort of attack that usually
happens in the portable specially appointed systems.
The objective of Eavesdropping is to acquire some
confidential data that ought to be kept mystery
throughout the correspondence. The confidential data
may incorporate the area, open key, private key or even
passwords of the nodes. Since such information are
exceptionally critical to the security state of the nodes,
they should be avoided the unapproved access.
d) Assaults against Routing
Routing is a standout amongst the most essential
administrations in the system; accordingly it is likewise
one of the primary focuses to which assaulters lead their
malevolent practices. In the mobile ad hoc networks,
assaults against Routing are for the most part ordered
into two classes: assaults on Routing conventions and
assaults on bundle sending/conveyance [5]. Assaults on
routing conventions intend to piece the spread of the
Routing data to the exploited person regardless of the
fact that there are some courses from the victimized
person to different goals. Assaults on bundle sending
attempt to aggravate the bundle conveyance along a
predefined way. The primary impacts brought by the
assaults against Routing conventions incorporate system
parcel, routing circle, asset hardship and course seize
[5]. There are a few attack against routing that have
been mulled over and well known [7] [8] [9] [10]:
Imitating an alternate node to parody course
message.
Promoting a false course metric to adulterate the
topology.
Sending a course message with wrong arrangement
number to smother other authentic course
messages.
Flooding Route Discover unnecessarily as a Dos
attack.
Changing a Route Reply message to infuse a false
course.
Producing counterfeit Route Error to upset a
working course.
Smothering Route Error to delude others.
On account of the versatility and always showing
signs of change topology of the versatile specially
appointed systems, it is extremely troublesome to
approve all the course messages [5]. There are
some more modern routing attacks, which
incorporate Wormhole attack [11], Rushing attacks
[12] and Sybil attacks [13].
The second classification of attack against routing is
attacks on parcel sending/conveyance, which are not
simple to discover and forestalled [5]. There are two
principle attack procedures in this sort: one is narrow-
mindedness, in which the vindictive node specifically
drops course messages that are expected to send with a
specific end goal to spare it claim battery power;
alternate is dissent of-administration, in which the
enemy conveys over powering network movement to the
victim.

VI. COUNTER MEASURES
In the previous segment, we have presented a few well
known attack sorts in the mobile ad hoc system. Along
these lines, it ought to be a fitting time now to discover
some security plans to manage these attacks. In this
part, we examine a few mainstream security plans that
mean to handle various types of assault recorded in the
previous segment.
a) Secure Routing
A number of the attacks depicted above could be dodged
by incorporating validation strategies in the routing
convention [14], [15], [16]. The primary thought here is
to assurance that all nodes longing to take an interest in
the directing procedure are confirmed nodes; i.e.,
trusted system components that will act as indicated by
the convention guidelines. Verification ought to be
upheld throughout all directing stages, subsequently
avoiding unapproved nodes (counting assaulters) from
taking part in the routing thus from propelling directing
attack. Confirmation might be given built either with
respect to open - key or symmetric cryptography. In the
previous case, nodes issue computerized marks
connected with the routing messages. Marks could be
confirmed by any possible node, giving a safe evidence
of the personality of the sender. Advanced confirmation
with comparative properties could be developed
utilizing mystery - key cryptography, for example, Macs
(Message Authentication Codes).The utilization of
cryptography comes as one with a co-partnered issue:
the need of a system for issuing, trading, and
disavowing keys. Key administration in MANETs is by
and large more troublesome than in established wired
systems because of the unlucky deficiency of any base or
focal managerial powers. There is no clear point(s)
where administrations, for example, affirmation powers
(CA) or key servers (KS) might be put, and the
extraordinary lion's share of the results proposed so far
depend on plans where the entire key administration
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 76

framework is spread out to a subset of the portable
nodes.Plans proposed so far are generally disseminated
key assertion conventions, for example, the established
two gathering Diffie-Hellman (DH) plan [17]. A few
works have enlarged the fundamental convention
towards nparty renditions, in such a path, to the point
that n nodes can create a typical key for gathering
correspondences (see e.g. [18]). Scrambled Key
Exchange (EKE) conventions [19] have additionally
been received in MANETs. These plans were proposed
with the objective of permitting two gatherings to create
a long - term basic key from an imparted secret word
(commonly of low entropy and subsequently helpless
against speculating attacks). A typical characteristic of
all these methodologies (DH, general DH, EKE, and so
forth.) is that some introductory qualities must be
imparted by all nodes before the convention could be
utilized. This is by and large known as the
"bootstrapping" issue and it has gained a considerable
lot of consideration as of later.In worldwide terms, the
plan is vigorous against any foe who can bargain close
to k 1 the improvement of open - key bases (PKI)
particularly customized for MANETs has been a hot
examination subject throughout the most recent years.
Most of the results depend on a circulated CA focused
around limit cryptography [20]. For instance, in the
plan proposed in [21], a subset of nodes known as
"servers" act all in all as a CA. Every open key having a
place with a system node is isolated into n imparts and
conveyed among the n servers. A number k<n of
servers are required to sign a certificate. Each server
creates its halfway signature and gathers the fractional
marks created by different server nodes. MOCA
(Mobile Certificate Authority) [22] is a comparable
result which joins various criteria (physical area,
computational qualities, efforts to establish safety sent,
and so forth.) for picking which nodes will go about as
servers.
a. Protection Method against Wormhole Attacks in
Mobile Ad Hoc Networks
Wormhole assault is a debilitating attack again routing
conventions for the versatile impromptu systems [11]
[25]. In the wormhole assault, an attacker records
packets (or bits) at one area in the system, tunnels them
(potentially specifically) to an alternate area, and
replays them there into the system. The replay of the
data will make extraordinary perplexity to the directing
issue in versatile specially appointed system in light of
the fact that the nodes that get the replayed packets
can't recognize it from the honest to goodness routing
parcels. Besides, for tunnelled separations longer than
the typical remote transmission reach of a solitary jump,
it is straightforward for the attacker to make the
tunnelled parcel touch base with preferable metric over
an ordinary multi-bounce course, which makes the
exploited person node be more inclined to acknowledge
the tunnelled parcels rather than the real routing
packets. Accordingly, the directing usefulness in the
versatile impromptu system will be extremely meddled
by the wormhole assault. Case in point, most existing
impromptu system directing conventions, without some
component to watch against the wormhole attack, might
be unable to discover courses longer than one or two
jumps, seriously upsetting correspondence. In these two
papers, the creators present the idea of a bundle rope as
a general component for recognizing and, in this way
watching against wormhole attacks. A chain is any data
that is added to a parcel intended to limit the bundle's
greatest permitted transmission separation. There are
two principle rope, which are topographical chains and
fleeting chains. A land chain guarantees that the
beneficiary of the parcel is inside a certain separation
from the sender. A transient each guarantees that the
bundle has an upper bound on its lifetime, which
confines the greatest travel separation, since the parcel
can go at most at the velocity of-light.It is possible that
sort of rope can keep the wormhole assault, in light of
the fact that it permits the beneficiary of a parcel to
discover if the bundle voyaged more distant than the
chain permits. A geological chain in conjunction with a
mark plan (i.e., a mark giving nonrepudiation), could
be utilized to get the attackers that put on a show to live
at various areas: when a genuine node catches the
assailant asserting to be in diverse areas that would just
be conceivable if the attacker could go at a speed over
the greatest node speed v, the true blue node can utilize
the marked areas to persuade other honest to goodness
nodes that the assaulter is malignant. In practice, the
paper displays the configuration of TIK convention that
actualizes the worldly chains. The TIK convention
executes fleeting rope and gives productive moment
validation to telecast correspondence in remote systems.
TIK remains for TESLA with moment key exposure,
and is an augmentation of the ESL convention [26]. At
the point when utilized within conjunction with exact
timestamps and tight clock synchronization, TIK can
forestall wormhole assaults that cause the indicator to
travel a separation longer than the ostensible reach of
the radio, or any possible go that may be specified. The
TIK convention has been ended up being proficient
since it requires simply open keys in a system with
nodes, and has moderately unobtrusive capacity, for
every bundle size, and processing overheads.In total,
this paper first presents the wormhole attack, a
noticeably unsafe assault that can have genuine
outcomes on numerous proposed impromptu system
directing conventions. To locate and shield against the
wormhole attack, the paper then presents the idea of
parcel rope, which may be either geographic or
transient chains, to limit the greatest transmission
separation of a bundle. At last, to execute worldly
chains, the paper displays the outline and execution
dissection of a novel, productive convention, called
TIK, which likewise gives moment verification of
accepted parcels.
b. Protection Mechanism against Rushing Attacks in
Mobile Ad Hoc Networks
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 77

Surging attack is another assault that brings about
dissent of-administration when utilized against all past
on-interest impromptu system directing conventions
[12]. This attack is likewise especially harming in light
of the fact that it could be performed by a moderately
powerless attacker. The execution subtle elements of
surging assaults are demonstrated in the Figure 4. In
the system demonstrated in Figure 4, the initiator node
starts a Route Discovery for the target node. On the off
chance that the ROUTE Requests for this Discovery
sent by the assailant are the first to achieve each one
neighbour of the target (indicated in ash in the figure),
then any course uncovered by this Route Discovery will
incorporate a bounce through the attacker. That is, the
point at which a neighbour of the target gets the surged
REQUEST from the attacker, it advances that
REQUEST, and won't advance any further Requests
from this Route Discovery. At the point when non-
attacking Requests arrive later at these nodes, they will
toss those honest to goodness Requests. Therefore, the
initiator will be unable to uncover any usable courses
(i.e., courses that do exclude the attacker) holding no
less than two jumps (three nodes).


Fig 4. Rush Attack in the Example Ad hoc Network

The hurrying attack applies to all proposed on-interest
conventions in light of the fact that such conventions
must point of confinement the amount of parcels that
any node will transmit because of a solitary Route
Discovery. As of now proposed conventions decide to
advance at most one REQUEST for every Discovery;
any convention that permits an attacker to foresee
which ROUTE Request(s) will be picked for sending at
each one bounce will be defenceless against some
variant of the surging attack. In the paper, the creators
portray a set of non-specific systems that together shield
against the surging assault: secure Neighbour
Detection, secure course appointment, and randomized
ROUTE REQUEST sending. The relations among these
security instruments are indicated in Figure 5 beneath.

Fig 5. Combined Mechanisms to Secure MANET
against Rushing Attacks
Secure Neighbour Detection permits each one
neighbour to confirm that alternate is inside a given
most extreme transmission range. When a node A
sending a ROUTE REQUEST discovers that node B is a
neighbour (that is, is inside the permissible reach), it
signs a Route Delegation message, permitting node B to
send the ROUTE REQUEST. At the point when node B
verifies that node is inside the permissible reach, it
signs an Accept Delegation message. Along these lines,
the area connections between nodes can be verified and
ensured to be certified. Randomized choice of the
ROUTE REQUEST message to send, which replaces
customary copy concealment in on-interest course
disclosure, guarantees that ways that advance Requests
with low dormancy are just somewhat less averse to be
chosen than different ways, however not ensured to be
chosen. The paper additionally displays a convention to
ensure the specially appointed systems from hurry
assaults, which is called Rushing Attack Prevention
(RAP). At the point when incorporated with a protected
routing convention, RAP causes no expense unless the
underlying secure convention can't discover substantial
courses. At the point when RAP is empowered, it
acquires higher overhead than do standard Route
Discovery methods, however it can discover usable
courses when different conventions can't, in this way
permitting fruitful routing and parcel conveyance when
different conventions may come up short altogether. In
rundown, furnished with these components, the
impromptu directing conventions will be more resistant
to the hurry attacks. Since the methodology is
nonexclusive, any convention that depends on double
concealment in Route Discovery can utilize our results
to fight off surging assaults. It is additionally indicated
in the recreation comes about that this methodology is
effective without presenting an excess of additional
overheads.
c. Watchdog and Pathrater
Watch dog and Pathrater are two fundamental segments
of a framework that tries to enhance execution of
impromptu systems in the vicinity of troublesome
nodes, the particular working standards of which are
talked about beneath [23] [27]. Watch dog decides
misconduct by replicating packets to be sent into a
cushion and checking the conduct of the contiguous
node to these parcels. Watch dog indiscriminately
snoops to choose if the adjoining node advances the
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 78

parcels without changes or not. In the event that the
packets that are snooped match with the watching
node's cushion, then they are tossed; while parcels that
stay in the cradle past a timeout period without any
effective match are hailed as having been dropped or
changed. The node answerable for sending the bundle is
then noted as being suspicious. In the event that the
amount of violations gets more amazing than a certain
decided limit, the damaging node is checked as being
noxious. Data about malevolent nodes is gone to the
Pathrater part for consideration in way appraising
assessment. Pathrater on a singular node attempts to
rate the greater part of the known nodes in a specific
system regarding their reliabilities. Appraisals are
made, and overhauled, from a specific node's viewpoint.
Nodes begin with an impartial rating that is altered
about whether focused around watched dependable or
temperamental conduct throughout parcel directing.
Nodes that are seen by watch dog to have acted
mischievously are given a quick appraising of -100. It
ought to be recognized that mischief is distinguished as
bundle misusing/change, although questionable conduct
is caught as connection breaks. It is indicated from the
examinations that these two segments can well reflect
the unwavering quality of the nodes focused around
their parcel sending exhibitions.

d. A Secure Ad Hoc Routing Approach utilizing
Localized Self-mending Communities
The paper first portrays two routing attacks that
utilization non-agreeable system parts and masked
parcel misfortunes to drain impromptu system assets
and to diminish specially appointed directing execution,
which are called RREQ asset exhaustion and RREP
bundle and information parcel misfortune, individually
[24]. These two attack have not been completely tended
to in past research, so it is important to present these
two attacks first. In the RREQ asset consumption
assault, an assaulter sends RREQ parcels, which the
underlying on-interest directing convention surges all
around the system. On the off chance that the assailant
is not a system part, cryptographic validation might be
added to RREQ packets to channel out those fashioned
course revelation demands. Nonetheless, if the attacker
is a traded off or self-centred system part, the
cryptographic countermeasures are inadequate. In the
RREP parcel and information bundle misfortune attack,
when a course revelation methodology is started by a
great system part, an attacker can utilize "wormhole
assault" [11] or "surging attack" [12] to surpass
different nodes as for the underlying routing metric. At
that point it is profoundly likely the assailant is chosen
on the way. At the point when the RREP returns it may
not send or may advance a debased one. The result is
equal to RREQ asset consumption attack, with the
exception of now the RREQ initiator is not the one at
fault. Additionally an assailant can seriously debase
information conveyance execution by specifically
dropping information parcels [28].
Next we quickly examine the idea of "retouching
toward oneself group" and its provision in the safe
impromptu routing. The idea of "patching toward
oneself group" is focused around the perception that
remote parcel sending normally depends on more than
one quick neighbor to hand-off packets. Group based
security investigates node excess at each one sending
step so that the traditional for every node based sending
plan is consistently changed over to another for every
group based sending plan. Since a recovering toward
oneself group is useful as long as there is no less than
one helpful "great" node in the group, there is no
necessity that what number of nodes in the group ought
to be accessible to give dependable parcel sending
administrations. There are one arrangement and one
reconfiguration convention that can separately be
utilized to at first set up the repairing toward oneself
group and fix the group if there is a shape misfortune
because of the portability or change of topology. The
paper likewise shows a scientific logical model to check
the viability of group based secure routing. In addition,
the paper gives some recreation results to assess the
execution of the group based security routing plan. In
one statement, this paper displays a novel security plan
focused around the idea of "Patching toward oneself
group", in which the group based security ought to
dependably be more critical than the security of a
solitary node. The paper additionally works out some
useful answers for set up and keep up such a recovering
toward oneself group. At long last, a diagnostic model
and some re-enactment results are given to demonstrate
the execution of the plan.

7. INTRUSION DETECTION
TECHNIQUES
Interruption location is not another idea in the system
research. As indicated by the definition in the
Wikipedia, an Intrusion Detection System (or IDS) for
the most part discovers unwanted controls to
frameworks [29]. In spite of the fact that there are a few
contrasts between the customary wired system and the
versatile impromptu system, interruption recognition
method, which is created first in the wired system and
has turned into an exceptionally vital security answer
for the wired system, has likewise picked up a few
considerations from the specialists when they
investigate the security answer for the portable specially
appointed system. In the accompanying, we examine
some commonplace interruption location methods in
the portable specially appointed systems in points of
interest.
a) Intrusion Detection Techniques in MANET: the
First Discussion The principal dialog about the
interruption location systems in the versatile specially
appointed systems was exhibited in the paper composed
by Zhang et al. [30]. In this paper, a general
interruption discovery structure in MANET was
proposed, which was conveyed and cooperative to help
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 79

MANET. The proposed construction modelling of the
interruption discovery framework is demonstrated
underneath in Figure 1.

Fig 6. IDS Architecture for MANET
In this building design, each node in the portable
specially appointed systems partakes in the interruption
location and reaction exercises by recognizing
indications of interruption conduct mainly and freely,
which are performed by the inherent IDS operator. Be
that as it may, the neighboring nodes can impart their
examination results to one another and chip in a more
extensive extent. The participation between nodes for
the most part happens when a certain node identifies an
aberrance however does not have enough confirmation
to evaluate what sort of interruption it has a place with.
In this circumstance, the node that has discovered the
peculiarity obliges different nodes in the
correspondence reach to perform quests to their security
logs with a specific end goal to track the conceivable
hints of the interloper. The inner structure of an IDS
operator is indicated in Figure 4 underneath.

Figure 7. A Conceptual Model for an Agent
In the theoretical model, there are four primary
utilitarian modules:
Local information gathering module, which
predominantly manages the information social event
issue, in which the continuous review information
may originate from different assets.
Local identification motor, which inspects the
neighbourhood information gathered by the nearby
information accumulation module and examines if
there is any irregularity indicated in the
information. Since there are constantly new strike
sorts developing as the known assaults being
perceived by the IDS, the discovery motor ought not
hope to only perform design distinguishment
between known attack practices and the
inconsistencies that are liable to be a few
interruptions: rather than the abuse identification
procedure that can't manage the novel assault sorts
successfully, the recognition motor ought to for the
most part depend on the factual peculiarity location
procedures, which recognize irregularities from
ordinary practices focused around the deviation
between the current perception information and the
typical profiles of the framework.
Cooperative recognition motor, which works with
different IDS executors when there are a few needs
to discover more proofs for a few suspicious
peculiarities discovered in some certain nodes. At
the point when there is a need to launch such
collaborated discovery prepare, the members will
engender the interruption identification state data of
themselves to the majority of their neighbouring
nodes, and the greater part of the members can
ascertain the new interruption recognition state of
them focused around all such data they have got
from their neighbours by some chose calculations,
for example, a dispersed agreement calculation with
weight. Since we can make such a sensible
presumption, to the point that larger part of the
nodes in the specially appointed system ought to be
considerate, we can believe the conclusion drawn by
any of the members that the system is under assault.
Intrusion reaction module, which manages the
reaction to the interruption when it has been
affirmed. The reaction could be reinitializing the
correspondence channel, for example, reassigning
the key, or rearranging the system and evacuating
all the bargained nodes. The reaction to the
interruption conduct differs with the various types of
interruption.
In the paper, the creators likewise quickly talk about multi-
layer coordinated interruption identification and reaction
system, in which the interruption location module ought to
be set in each one layer on every node of the portable
specially appointed system with a specific end goal to show
signs of improvement execution on a few attacks that may
appear to be somewhat real to the easier layers, for
example, MAC convention, yet are considerably more less
demanding to recognize in the higher layers, for example,
the requisition layer. The multi-layer incorporated
interruption identification and reaction system can
incredibly improve the execution of the IDS particularly
when there are substantial measure of assaults that might
be effectively gotten in the higher layer however are
elusive in the easier layer. The paper just displays the
essential thought about the multi-layer coordinated
interruption discovery and reaction system without giving
more particular usage subtle element.In one saying, this
paper is known as the first paper that investigates the
interruption identification procedures in the versatile
impromptu systems. It exhibits a construction modelling in
which each of the nodes in the portable specially appointed
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 80

system ought to be outfitted with an IDS executor, and the
greater part of the IDS operators can work freely and
mainly and in addition helpful with one another to
recognize some interruption practices in a bigger reach. In
the paper, the creators additionally portray the applied
model of the IDS executors and functionalities of
distinctive modules in the model. Also, the paper likewise
displays an interruption recognition and reaction conspire
in which the IDS operators ought to be put in each one
layer of every node such that a few attacks could be
identified prior and all the more productively.In my
perspective, there are two focuses that this paper does not
think as of: one is the constrained battery power issue that
will result in a few nodes to carry on in a self-centred way
throughout the helpful interruption discovery transform;
alternate is the conceivable overhead that is brought by the
multi-layer coordinated interruption recognition and
reaction system contrasted and the first single-layer
interruption identification component, or, as such, what
the proportion of the execution improvement over the
overhead build will be whether we apply the multi-layer
interruption location method to the MANET.
b) Cluster-based Intrusion Detection Technique for Ad
Hoc Networks
We have talked about an agreeable interruption location
structural planning for the specially appointed systems in
the past part, which was initially displayed by Zhang et al.
Then again, the greater part of the nodes in this structure
should take an interest in the helpful interruption discovery
exercises when there is such a need, which cause
tremendous power utilization for all the partaking nodes.
Because of the constrained power supply in the specially
appointed system, this structure may cause a few nodes act
in a childish manner and not helpful with different nodes
in order to spare their battery power, which will really
abuse the first proposition of this agreeable interruption
recognition building design. To tackle this issue, Huang et
al. present a group based interruption location method for
specially appointed systems [33].It is exhibited in this
paper that A MANET might be composed into various
groups in such a route, to the point that each node is a part
of no less than one bunch, and there will be stand out node
for every group that will deal with the checking issue in a
certain time of time, which is by and large called cluster
head. As is characterized in the paper, a bunch is a
gathering of nodes that live inside the same radio extent
with one another, which implies that when a node is
chosen as the cluster head, the majority of alternate nodes
in this group ought to be inside 1-bounce region. It is
important to guarantee the honesty and proficiency of the
group choice procedure. Here honesty holds two levels of
implications: the likelihood of each node in the bunch to
be chosen as the cluster head ought to be equivalent, and
every node ought to go about as the group node for the
same measure of time. Effectiveness of the procedure
implies that there ought to be a few routines that can select
a node from the bunch intermittently with high
productivity. The limited state machine of the group
shaping convention is indicated in Figure 5 underneath.



Figure 8. Finite State Machine of the Cluster
Formation Protocol
Fundamentally there are four states in the group framing
convention: introductory, faction, done and lost. All the
nodes in the system will be in the starting state from the
beginning, which implies that they will screen their own
particular movement and recognize interruption
practices autonomously. There are two steps that we
have to complete before we get the cluster head of the
system: club reckoning and cluster head processing. A
club is characterized as a gathering of nodes where each
pair of parts can convey by means of an immediate
remote connection. The meaning of club is somewhat
more confined than that of bunch. The creators utilize
the group development calculation from [32] to figure
inner circles, the parts of which are named residents
here in the paper. Once the convention is done, each
node is mindful of its kindred inner circle parts. At that
point a node will be haphazardly chosen from the coterie
to go about as the cluster head. There are two different
conventions that aid the group doing some approval and
recuperation issues, which are individually called
Cluster Valid Assertion Protocol and Cluster Recovery
Protocol. The group substantial statement convention
has by and large been utilized as a part of the
accompanying two circumstances:
The node in the bunch will occasionally utilize the
Cluster Valid Assertion Protocol to check if the
association between the cluster head and itself is
kept up or not. If not, this node will verify whether
it fits in with an alternate bunch, and in the event
that it additionally get negative reply, then the node
will enter the LOST state and start a directing
recuperation demand.
Furthermore, there need to be an obligatory re-
decision timeout for the cluster head to keep the
honesty and security of the entire bunch. On the off
chance that the timeout lapses, all the nodes switch
from DONE state to INITIAL state and start another
round of cluster head decision.
The Cluster Recovery Protocol is for the most part utilized
within the case that a native loses its association with past
cluster head or a cluster head loses all its residents, when it
enters LOST state and launchs Cluster Recovery Protocol
to re-run across another cluster head. In the paper the
creators have defended their bunch based interruption
recognition procedure by a few examinations that make
execution assessment. From the results we can find that the
CPU speedup is expanded for the bunch based IDS
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 81

technique than the for every node based IDS system, in the
meantime the system overhead for the bunch based IDS
techniques is more level than that for the for every node
based IDS strategy. Notwithstanding, the location rate of
the group based IDS technique is somewhat lower than
that of the for every node IDS system, which may be
sensible on the grounds that from an entire bunch
perspective, there might be one node that screen the
movement for the entire group, which can make some
erroneous judgments as a result of the restricted handling
power of only one node.
c) Misconduct Detection through Cross-layer Analysis
Multi-layer interruption location method is an alternate
potential exploration region that Zhang et al. call attention
to in their paper [30]. In any case, they appear to be not to
investigate deeper around there. In this part, we will
examine the cross-layer dissection strategy exhibited by
Parker et al. [31]. In this paper, the creators watch the
strike practices in the MANET, and find that some
brilliant assaulters might at the same time abuse a few
vulnerabilities at numerous layers however keep the assault
to each of the vulnerabilities stay underneath the
recognition edge in order to escape from catch by the
single-layer bad conduct identifier. This kind of cross-layer
strike will be significantly more debilitating than the
single-layer assault in that it might be effectively skipped
by the single-layer misconduct finder. By and by, this
assault situation might be distinguished by a cross-layer
misconduct identifier, in which the inputs from all layers
of the system stack are joined together and broke down by
the cross-layer finder in a far reaching manner. The
creators likewise exhibit their attempt by working with
RTS/CTS info from the 802.11 MAC layer consolidated
with system layer recognition of dropped parcels. The
extent that I know, there are a few angles that could be
further investigated here. Most importantly, it will be an
imperative issue that how to make the cross-layer
identification more effective, or as such, how to collaborate
between single-layer indicators to make them work well.
Since diverse single-layer finders bargain with distinctive
sorts of ambushes, there might be some distinctive
perspectives to the same strike situation when it is seen in
diverse layers. In this manner it is important to evaluate
the conceivable result if there are diverse identification
results created by distinctive layers. Second, we have to
discover the amount the framework asset and system
overhead will be expanded because of the utilization of
cross-layer finder contrasted and the first single-layer
identifier. Because of the constrained battery power of the
nodes in the impromptu systems, the framework and
system overhead brought by the cross-layer discovery
ought to be considered and contrasted and the execution
increase created by the utilization of cross-layer location
strategy.
8. CONCLUSION
In this paper, we attempt to investigate the security issues
in the portable impromptu systems, which may be a
fundamental aggravation to the operation of it. Because of
the versatility and open media nature, the portable
specially appointed systems are a great deal more inclined
to all sort of security dangers, for example, data revelation,
interruption, or even refusal of administration. Thus, the
security needs in the portable specially appointed systems
are much higher than those in the customary wired
systems. In the first place we quickly present the
fundamental qualities of the versatile specially appointed
system. In view of the development of the idea pervasive
registering, there is an expanding requirement for the
system clients to get association with the world at whatever
time at anyplace, which motivates the rise of the portable
impromptu system. Be that as it may, with the
accommodation that the versatile specially appointed
systems have brought to us, there are additionally
expanding security dangers for the portable impromptu
system, which need to increase enough consideration. We
then examine some regular and perilous vulnerabilities in
the versatile impromptu systems, the greater part of which
are brought about by the qualities of the portable specially
appointed systems, for example, portability, always
showing signs of change topology, open media and
restricted battery power. The presence of these
vulnerabilities has made it important to discover some
successful security results and secure the versatile
impromptu system from various types of security dangers.
At long last we present the current security answers for the
versatile specially appointed systems. We begin with the
talk on the security criteria in portable specially appointed
system, which goes about as a direction to the security-
related exploration works around there. At that point we
discuss the primary strike sorts that undermine the current
versatile impromptu systems. At last, we talk about a few
security procedures that can help ensure the versatile
specially appointed systems from outer and interior
security dangers. Besides we have studied interruption
recognition frameworks with distinctive location
procedures proposed in the writing. Each one methodology
and method is introduced with ambushes they can and
can't distinguish. To close, MANET security is an
unpredictable and testing subject. To propose security
results appropriate to this nature's turf, we prescribe
specialists examine conceivable security dangers to
MANETs generally completely.

9. REFERENCES

[1] Li Y., Wei J., Guidelines on Selecting Intrusion
Detection Methods in MANET, In Proc. of
Information Systems Educators Conference, 2004.
[2] Zhang Y., Lee W., Intrusion Detection Techniques for
Mobile Wireless Networks, Wireless Networks, pp.
545 556, Springer, 2003.
[3] Stajano F., Anderson R., The Resurrecting Duckling:
Security Issues for Ad - hoc Wireless Networks, In
Proc. of Int. Workshop on Security Protocols,
Springer, 1999.
[4] Yang H., Luo H., Ye F., Lu S., Zhang L., Security in
Mobile Ad Hoc Networks: Challenges and Solutions,
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 82

IEEE Wireless Communications, 11(1), pp. 38 - 47,
2004.
[5] Yongguang Zhang and Wenke Lee, Security in Mobile
Ad-Hoc Networks, in Book Ad Hoc Networks
Technologies and Protocols (Chapter 9), Springer,
2005.
[6] Amitabh Mishra and Ketan M. Nadkarni, Security in
Wireless Ad Hoc Networks, in Book The Handbook
of Ad Hoc Wireless Networks (Chapter 30), CRC
Press LLC, 2003.
[7] P. Papadimitratos and Z. J. Hass, Secure Routing for
Mobile Ad Hoc Networks, in Proceedings of SCS
Communication Networks and Distributed Systems
Modeling and Simulation Conference (CNDS), San
Antonio, TX, January 2002.
[8] Y. Hu, A. Perrig and D. Johnson, Ariadne: A Secure
On-demand Routing Protocol for Ad Hoc Networks,
in Proceedings of ACM MOBICOM02, 2002.
[9] K. Sanzgiri, B. Dahill, B. N. Levine, C.Shields, and E.
M. Belding-Royer, A Secure Routing Protocol for Ad
Hoc Networks, in Proceedings of ICNP02, 2002.
[10] Y. Hu, D. Johnson, and A. Perrig, SEAD: Secure
Efficient Distance Vector Routing for Mobile Wireless
Ad Hoc Networks, Ad Hoc Networks, 1 (1): 175192,
July 2003.
[11]Y. Hu, A. Perrig and D. Johnson, Packet Leashes: A
Defense against Wormhole Attacks in Wireless Ad
Hoc Networks, in Proceedings of IEEE
INFOCOM03, 2003.
[12] Y. Hu, A. Perrig and D. Johnson, Rushing Attacks
and Defense in Wireless Ad Hoc Network Routing
Protocols, in Proceedings of ACM MobiCom
Workshop - WiSe03, 2003.
[13] J. R. Douceur, The Sybil Attack, in Proceedings of
the 1st International Workshop on Peer-to-Peer
Systems (IPTPS02), pages 251260, March 2002,
LNCS 2429.
[14] Hu Y. - C., Perrig A. and Johnson D.B., Ariadne: A
Secure On - demand Routing Protocol for Ad Hoc
Networks, In Proc. of the 8th International
Conference on Mobile Computing and Networks, pp.
12 - 23, 2002.
[15] K. Sanzgiri et al., A Secure routing Protocol for Ad
Hoc Networks, In Proc. of the 10th IEEE Conference
on Network Protocols, 2002.
[16] B. Awerbuch et al, An on Demand Secure Routing
Protocol Resilient to Byzantine Failures, In Proc. of
the ACM Workshop on Wireless Security, 2002.
[17] W. Diffie and M. Hellman, New Directions in
Cryptography, IEEE Transactions on Information
Theory, IT 22(6):644 - 654, 1976.
[18] M. Steiner, Tsudik G., and Waidner M., Diffie -
Hellman Key Distribution Extended to Group
Communication, In Proc of the ACM Conference on
Computer and Communication Security, pp. 31 - 37,
1996.
[19] Bellovin S.M., Merritt M., Encrypted Key Exchange:
Password - based Protocols Secure against Dictionary
Attacks, In IEEE Symposium on Security and
Privacy, pp. 72 - 84, 1992.
[20] Shamir A., How to Share a Secret, Communications
of the ACM 22(11), pp. 612 - 613, 1979.
[21] Zhou L., Haas Z.J., Securing Ad Hoc Networks,
IEEE Network 13(6), pp. 24 - 30, 1999.
[22] Yi S., R. Kravets. MOCA: Mobile Certificate
Authority for Wireless Ad Hoc Networks, In the 2nd
Annual PKI Research Workshop, 2003.
[23] Sergio Marti, T. J. Giuli, Kevin Lai and Mary Baker,
Mitigating routing misbehavior in mobile ad hoc
networks, in Proceedings of the 6th annual
international conference on Mobile computing and
networking (MobiCom00), pages 255 265, Boston,
MA, 2000.
[24] Jiejun Kong, Xiaoyan Hong, Yunjung Yi, JoonSang
Park, Jun Liu and Mario Gerlay, A Secure Ad-hoc
Routing Approach Using Localized Self-healing
Communities, in Proceedings of the 6th ACM
International Symposium on Mobile Ad Hoc
Networking and Computing, pages 254265, Urbana
Champaign, Illinois, 2005.
[25] Y. Hu, A. Perrig and D. Johnson, Wormhole Attacks
in Wireless Networks, IEEE Journal on Selected
Areas in Communications, Vol. 24, No. 2, February
2006.
[26] A. Perrig, R. Canetti, J. D. Tygar and D. Song,
Efficient Authentication and Signature of Multicast
Streams over Lossy Channels, In Proceedings of the
IEEE Symposium on Research in Security and
Privacy, pages 5673, May 2000.
[27] Jim Parker, Discussion Record for the 1st MANET
Reading Group Meeting,
http://logos.cs.umbc.edu/wiki/eb/index.php/February_
10%2C_2006 (Authorization required).
[28] Imad Aad, Jean-Pierre Nodeaux and Edward W.
Knightly, Denial of Service Resilience in Ad Hoc
Networks, in Proceedings of the 10th annual
international conference on Mobile computing and
networking, pages 202215, Philadelphia, PA, 2004.
[29] Intrusion-detection system, from Wikipedia, the free
encyclopaedia, http://en.wikipedia.org/wiki/Intrusion-
detection_system.
[30] Y. Zhang and W. Lee, Intrusion Detection in
Wireless Ad-hoc Networks, in Proceedings of the 6th
International Conference on Mobile Computing and
Networking (MobiCom 2000), pages 275283,
Boston, Massachusetts, August 2000.
[31] Jim Parker, Anand Patwardhan, and AnupamJoshi,
Detecting Wireless Misbehavior through Cross-layer
Analysis, in Proceedings of the IEEE Consumer
Communications and Networking Conference Special
Sessions (CCNC2006), Las Vegas, Nevada, 2006.
[32] P. Krishna, N. H. Vaidya, M. Chatterjee and D. K.
Pradhan, A Cluster-based Approach for Routing in
Dynamic Networks, ACM SIGCOMM Computer
Communication Review, 27(2):4964, 1997.
[33] Yi-an Huang and Wenke Lee, A Cooperative
Intrusion Detection System for Ad Hoc Networks, in
International Journal of EmergingTrends & Technology in Computer Science(IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 4, July-August 2014 ISSN 2278-6856

Volume 3 Issue 4 July-August, 2014 Page 83

Proceedings of the 1st ACM Workshop on Security of
Ad hoc and Sensor Networks, Fairfax, Virginia, 2003,
pp. 135 147.

AUTHORS

Mr. Manpreet Singh Kinra is a student
of second year M.Tech Computer Science
and Engineering (Networking System),
Ambika Paul School of Technology (PTU
main campus), Kapurthala. He has earned his degree of
B.Tech (Computer Science and Engineering) from Global
College of Engineering And Technology in 2012.

Mrs. Malti Sarangal, Assistant
Professor, Department of Computer
Science And Engineering, Ambika Paul
School of Technology (PTU main
campus), Kapurthala. She is having 4 years of teaching
experience. She has earned degree of M.Tech (Computer
Science and Engineering) from Sri Sai Institute Of
Engineering and Technology in 2011 and B.tech from
Ludhaina college of Engineering and Technology in 2009.
She is currently involved in research and education on
Network Security and Optical Networks.

Mr. Gurpreet Singh, Assistant
Professor, Department of Computer
Science and Engineering), from Sant
Baba Bhag Singh Institute of Engg. &
Technology. He is having 5 years of teaching
experience. He has earned his degree of M.Tech in
Computer Science and Engineering in 2014 and M.B.A
in 2010 and B.tech in 2007. His research areas are
Swarm Intelligence, Ant colony System and E-learning.

You might also like