1.

1 LITERATURE SURVEY The overall process is based on the attacker produces more packets(flood packet),so the traffic occurred.

FI G 1.1 ATTACKS DIAGRAM

1.1.1 A Delay-Tolerant Network Ar !"te t#re $or C!allen%e& Internet' The highly successful architecture and supporting protocols of todays Internet operate poorly when faced with operating environments characterized by very long delay paths and fre uent network partitions. These problems are e!acerbated by end nodes that have severe power or memory constraints. "ften deployed in mobile and e!treme environments lacking #always$on% infrastructure, many such networks have their own specialized protocols, and do not utilize I&. To achieve interoperability between them, to propose a network architecture and application interface structured around optionally$reliable asynchronous message forwarding, with limited e!pectations of end$to$end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in$network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse$grained class of service.

1.1.( So "al Network Analy'"' $or Ro#t"n% "n D"' onne te& Delay-Tolerant MANET' 'essage delivery in sparse 'obile (d hoc )etworks ('()*Ts) is difficult due to the fact that the network graph is rarely (if ever) connected. ( key challenge is to find a route that can provide good delivery performance and low end$to$end delay in a disconnected network graph where nodes may move freely. This presents a multidisciplinary solution based on the consideration of the so$ called small world dynamics which have been proposed for economy and social studies and have recently revealed to be a successful approach to be e!ploited for characterising information propagation in wireless networks. To this purpose, some bridge nodes are identified based on their centrality characteristics, i.e., on their capability to broker information e!change among otherwise disconnected nodes. +ue to the comple!ity of the centrality metrics in populated networks the concept of ego networks is e!ploited where nodes are not re uired to e!change information about the entire network topology, but only locally available information is considered. Then ,im-et .outing is proposed which e!ploits the e!change of pre$estimated /betweenness centrality metrics and locally deter$ mined social /similarity to the destination node. To present simulations using real trace data to demonstrate that ,im-et .outing results in delivery performance close to *pidemic .outing but with significantly reduced overhead. (dditionally, to show that ,im$ -et .outing outperforms &.o&0*T .outing, particularly when the sending and receiving nodes have low connectivity 1.1.) M"t"%at"n% Ro#t"n% M"'*e!a+"or "n D"'r#,t"on Tolerant Network' In disruption tolerant networks(+T)s),selfish or malicious nodes may drop received packets. ,uch routing misbehavior reduces the packet delivery ratio and wastes system resources such as power and bandwidth. (lthough techni ues have been proposed to mitigate routing misbehavior in mobile ad hoc networks, they cannot be directly applied to +T)s because of the intermittent connectivity between nodes. To address the problem,to propose a distributed scheme to detect packet dropping in +T)s. 1onsider scheme, a node is re uired to keep a few signed contact records of its previous contacts, based on which the ne!t contacted node can detect if the node has dropped any packet. ,ince misbehaving nodes may misreport their contact records to avoid being detected, a small part of each contact record is disseminated to a certain number of witness nodes, which can collect appropriate contact records and detect the misbehaving nodes.

propose a scheme to mitigate routing misbehavior by limiting the number of packets forwarded to the misbehaving nodes. Trace$driven simulations show that solutions are efficient and can effectively mitigate routing misbehavior. 1.1.- Ro#t"n% "n So "ally Sel$"'! Delay Tolerant Network' *!isting routing algorithms for +elay Tolerant )etworks (+T)s) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish 2 i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. 3ollowing the philosophy of design for user, to propose a ,ocial ,elfishness (ware .outing (,,(.) algorithm to allow user selfishness and provide better routing performance in an efficient way. To select a forwarding node, ,,(. considers both users willingness to forward and their contact opportunity, resulting in a better forwarding strategy than purely contact$based approaches. 'oreover, ,,(. formulates the data forwarding process as a 'ultiple 4napsack &roblem with (ssignment .estrictions ('4&(.) to satisfy user demands for selfishness and performance. Trace$driven simulations show that ,,(. allows users to maintain selfishness and achieves better routing performance with low transmission cost. 1.1.. Ma/0ro,1 Ro#t"n% $or Ve!" le-2a'e& D"'r#,t"on-Tolerant Network' +isruption$tolerant networks (+T)s) attempt to route network messages via intermittently connected nodes. .outing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this work using 'a!&rop, a protocol for effective routing of +T) messages. 'a!&rop is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head$start for new packets, and lists of previous intermediaries. The evaluations show that 'a!&rop performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. 1onsider the evaluations are based on 56 days of traces from a real +T) network have deployed on 76 buses. 1onsider network, called

8'ass+iesel)et, serves a large geographic area between five colleges and also evaluate 'a!&rop on simulated topologies and show it performs well in a wide variety of +T) environments. 1.1.3 E$$" "ent Ro#t"n% "n Inter4"ttently Conne te& Mo*"le Network'1 T!e M#lt",le- o,y Ca'e They propose a family of multi$copy protocols called ,pray routing, which can achieve both good delays and low transmissions. ,pray routing algorithms generate only a small, carefully chosen number of copies to ensure that the total number of transmissions is small and controlled. Then, an appropriate single$copy algorithm ac uired from their study of single$copy routing strategies is used to route each of the copies independently. the pro9ect deliver a theoretical analysis of the performance of spray routing that holds for a number of popular and recent mobility models. ,pecifically, they provide an efficient algorithm that each node can use to locally choose the number of copies to generate in a given scenario, and also show how to optimally distribute these copies. Their theory also provides a #hook% to e!plicitly take advantage of different tradeoffs between resource usage and performance, allowing a wireless device to adapt to the individual users needs, even in situations where a node initially has little or no information about the network. In this work they investigate the problem of multi$copy routing in intermittently connected mobile networks. They propose two efficient multi$copy schemes, called ,pray and :ait and,pray and 3ocus, that manage to overcome the shortcomings of flooding$based and other e!isting schemes. 8sing theory and simulations they show that; (i) :hen enough nodes in the network are sufficiently mobile, ,pray and :ait outperforms e!isting schemes with respect to both number of transmissions and delivery delays, and achieves comparable delays to an optimal scheme, despite its simplicity. (ii) :hen node mobility is low or predominantly local, ,pray and 3ocus can retain the performance advantage of ,pray and :ait with only a small overhead on total transmissions and simplicity. 3inally, both schemes are very robust to network size and density changes.

The source node of a packet sprays a certain number of copies of the packet to other nodes and each copy is individually routed using the single$copy strategy. The ma!imum number of copies that each packet can have is fi!ed. 1.1.5 S,ray an& 6a"t1 An E$$" "ent Ro#t"n% S !e4e $or Inter4"ttently Conne te& Mo*"le Network' This approach imposes a new model for routing. .outing consists of a se uence of independent, local forwarding decisions, based on current connectivity information and pre$ dictions of future connectivity information. In other words, node mobility needs to be e!ploited in order to deliver a message to its destination. ,pray$and$3ocus and &ropagation are used as representatives of the three routing strategies, respectively. In &ropagation, a node replicates a packet to another encountered node if the latter has more fre uent contacts with the destination of the packet. :ait bounds the total number of copies and transmissions per message without compromising performance. 8sing theory and simulations they show that; (i) (ii) 8nder low load, ,pray and :ait results in much fewer transmissions and comparable or smaller delays than flooding$based schemes. 8nder high load, it yields significantly better delays and fewer transmissions than flooding$based schemes. (iii) It is highly scalable, e!hibiting good and predictable performance for a large range of network sizes. It can be easily tuned online to achieve given <o, re uirements, even in unknown networks. ,uch schemes generate and route only one copy per message, in order to significantly reduce the number of transmissions. ,ingle$copy schemes do not present desirable solutions for applications that re uire high probabilities of delivery and low delays. This algorithm is aware of all future movement, and computes the optimal set of forwarding decisions (i.e. time and ne!t hop), which delivers a message to its destination in the minimum amount of time.