Posts: 1
Threads: 1
Joined: Dec 2009
could u pls send me more details about dis topic...i find it interesitng 2 take it 4 my project subj..
Posts: 247
Threads: 5
Joined: Jan 2010
A wireless ad-hoc network is a network which does not use any infrastructure such as access points or base station. Instead, the mobile nodes forward packets to each others, allowing communication among nodes outside wireless transmission range.It is formed spontaneously without any preplanning. Multicasting is a fundamental communication paradigm for group-oriented applications such as secure conferencing, visual broadcasts, military command and control, discussion forums, frequent stock updates, pay per view programs, and advertising. we present a route discovery protocol that mitigates the detrimental effects of such malicious
behavior, as to provide correct connectivity information. This protocol ensures that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node.Also, the protocol responsiveness is
safeguarded under different types of attacks that exploit the routing
protocol itself.no assumption is made regarding the intermediate nodes,which may exhibit arbitrary and malicious behavior.
The insecurity of the wireless links, energy constraints, relatively poor physical protection of nodes in a hostile environment, and the vulnerability of statically configured security schemes are the challenges for the provision of security services in the MANET(Mobile Ad Hoc Networks).
THE PROPOSED SCHEME
We focus on bi-directional communication between a pair of nodes. A security association (SA) between the source node S and the destination node T is assumed. The trust relationship could be initiated by the
knowledge of the public key of the other end. The two nodes can negotiate a shared secret key verify that the principal that participated
in the exchange was indeed the trusted node using the SA. The use of SA is justified, because the end hosts
chose to employ a secure communication scheme and,consequently, should be able to authenticate each other.Although a set of
malicious nodes may mount attacks against the protocol
concurrently, we assume that nodes are not capable of
colluding within one step of the protocol execution within the period of broadcasting one query and reception of
the corresponding replies.
Overview
The scheme introduced here combats attacks that disrupt the
route discovery process and guarantees, the acquisition of correct
topological information, under the above assumptions, and it also incorporates mechanisms to safeguard the network functionality from attacks
exploiting the protocol itself to degrade network
performance and lead to DoS(denial of service).
The source node S initiates the route discovery, by
constructing a route request packet identified by a pair of
identifiers: a query sequence number and a random query
identifier.Message Authentication
Code (MAC) is calculated from the parameters source and destination and query identifiers.(IP addresses) of the traversed intermediate nodes are
accumulated in the route request packet.
Intermediate nodes relay route requests, so that one or
more query packets arrive at the destination, and maintain a
limited amount of state information regarding the relayed
queries, so that previously seen route requests are discarded.The route requests reach the destination T, which
constructs the route replies and it calculates a MAC and returns the packet to S over the reverse of the route accumulated in the request packet.The
querying node validates the replies and updates its topology
view.
full seminar report pdf:
[attachment=1026]
Posts: 1,149
Threads: 370
Joined: Jun 2010
for more information about this topic please follow the link:
http://studentbank.in/report-a-novel-sec...6#pid25786