Open Access Open Access  Restricted Access Subscription or Fee Access

Effective Shielding of Stressed Network from Flood Attacks

S. Angelin Joy, S. Sariga


Disruption Tolerant Networks (DTNs) deploy occasional contacts and the mobility of nodes for data transmissions. Connection opportunity and buffer space are the finite network resources and so DTNs are susceptible to flood attacks in which attackers flood the network with many packets or packet replicas as possible, concerning to consume or worn out the confined network resources. This paper involves rate and time limiting to guard against flood attacks in DTNs, such that all nodes have a constraint over the integer of packets that it can produce in each time interval and a restraint over the integer of replicas that it can create for each packet. Our detection adopts Count-Compare-Crimp: each node itself computes the integer of packets or replicas that it has sent and compares the count with the approved limit; all excess packets will be cut down or crimped at the node itself. We provide diligent analysis on the probability of detection, also effectiveness and efficiency of our scheme is calculated.


DTN, Flood Attack, Threats, Security

Full Text:



Qinghua Li, Wei Gao, Sencun Zhu, and Guohong Cao, “To Lie or to Comply: Defending against Flood Attacks in Disruption Tolerant Networks” IEEE TRANS ON DEPENDABLE AND SECURE COMPUTING, vol. 10, no. 3, may/june 2013

K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. ACM SIGCOMM, pp. 27-34, 2003.

P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, “Pocket Switched Networks and Human Mobility in Conference Environments,” Proc. ACM SIGCOMM, 2005.

M. Motani, V. Srinivasan, and P. Nuggehalli,“PeopleNet: Engineering a Wireless Virtual Social Network,” Proc. MobiCom, pp. 243-257, 2005.

J. Burgess, B. Gallagher, D. Jensen, and B. Levine, “Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proc. IEEE INFOCOM, 2006.

Q. Li, S. Zhu, and G. Cao, “Routing in Socially Selfish Delay Tolerant Networks,” Proc. IEEE INFOCOM, 2010.

A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.

C. Karlof and D. Wagner, “Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures,” Proc. IEEE First Int’l Workshop Sensor Network Protocols and Applications, 2003.

Q. Li and G. Cao, “Efficient and Privacy-Preserving Data Aggregation in Mobile Sensing,” Proc. IEEE Int’l Conf. Network Protocols (ICNP ’08), 2012.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.