[ns] kindly help me with these simulations

[Ashutosh Srivastava]

        dear all ,
   
  Please go through this scenario that I am supposed to simulate (it is an excerpt from a paper) . I have already underlined the part I am unable to have under simulate .Please go through the whole mail and kindly send in your inputs .I have already mailed about this topic even earlier but could not get through ,due to lack of any sort of input . 
   
  ----------------------------------------------------------------------------------------
  The DSR implementation built in to NS-2 version 2.1b9 was used as a base, and some slight modifications were made to simulate the sinkhole attacker node. The simulation environment was composed of 20 wireless nodes, each with a transmission radius of 250m. At the start of each simulation, the nodes were given random placements in a 1000m x 1000m area, and a random movement pattern was generated, which the nodes adhered to, using CMU’s setdest program, which is included with NS-2.
    The program generates node movement files using the random
  waypoint algorithm, in which nodes choose a random point
  within the area boundaries, and proceed towards it at a
  randomly chosen constant velocity. When the node arrives at its
  destination, it pauses for some interval, and then repeats the
  process. Constant bit rate traffic patterns were also generated at
  the start of each simulation, using the cbrgen.tcl program that is
  included with NS-2.
  A total of 23,710 simulations were run. Of these, 19,797 of
  them were normal, cooperative DSR networks with no sinkhole
  attacker, and 3,913 of them were with a single sinkhole attacker
  identified as node 20. In the simulation, the sinkhole attacker
  ran the same DSR code as the other nodes. However, in
  addition to the normal behavior, a new behavior was triggered
  by a timer that normally goes off every 0.03 seconds to check
  the DSR send buffer – the normal purpose of this is to flush
  packets that have been queued for asynchronous transmission.
  In the case of the attacker, this timer would cause 18 bogus
  route request messages to be sent, in rapid succession, with the purpose of redirecting all routes leading to a particular target node, starting with node 1. The target node would then be incremented. After the timer had fired 18 times, the attacker would have made an effort to redirect all routes in the network to itself, and the target node would be reset to 1. 
   
  For these
  messages, the attacker node used sequence numbers starting at 9999, incrementing the sequence number each time a message was sent.
   
   
   
   
   
   
   

                   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