Ashutosh Srivastava [EMAIL PROTECTED] wrote:dear all ,
I am supposed to simulate the Sinkhole attack (made on
Ad-Hoc Networks) . As i am quite new to ns-2 programming I am unable to do so
.The main problem is that how do we create routing tables for the different
nodes in the ad-hoc network (or Mobile Network) and then how can we
represent the sending of information from a compromised node that it has the
shortest route for a number of nodes . Kindly helpme
out as I am stuck badly here .Any sort of inputs are welcome .I am also
including a definition of the sinkhole attacks at the bottom .
Expecting a quick relief .
Sinkhole attacks
By carrying out a sinkhole attack, a compromised node tries to attract the
data to itself from all neighboring nodes. Since this would give access to all
data to this node, the sinkhole attack is the basis for many other attacks
likes eavesdropping or data alteration. Sinkhole attacks make use of the
loopholes in routing algorithms of ad hoc networks and present themselves to
adjacent nodes as the most attractive partner in a multihop route. Even though
by definition nodes on the network layer of an ad hoc network are equal,
sinkhole attacks might be very effective on application level, where nodes may
have different roles. This means, that as stated the effect of sinkhole
attacks on networks with centralized entities can be especially grave, because
by impersonating the centralized node or its neighbors, the adversary can get
access to the biggest part of the data flowing through the network.
Send instant messages to your online friends http://in.messenger.yahoo.com
