期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2013
卷号：2
期号：10
页码：3082-3095
出版社：IJECS
摘要：Disruption Tolerant Networks (DTNs) utilize the mobility of nodes and the opportunistic contacts among node s for data communications.Due to the limitation in network resources such as contact opportunity and buffer space, DTNs are vulnerable to flood attacks in which attackers sendas many packets or packet replicas as possible to the network, in order to deplete or overuse the limited network resources. In this paper, we employrate limiting to defend agains t flood attacks in DTNs, such that each node has a limit over the number of packets that it can generate in each timeinterval and a limit over the number of replicas that it can generate for each packet. We propose a distributed scheme to detect if a node has violated itsrate limits. To address the challenge that it is difficult to count all the packets or replicas sent by a node due to lack of communication infrastructure,our detection adopts claim-carry-and- check: each node itself counts the number of packets or replicas that it has sent and claims the count toother nodes; the receiving nodes carry the claims when they move, and cross-check if their carried claims are inconsistent when they contact. The claimstructure uses the pigeonhole principle to guarantee that an attacker will make incons is tent claims which may lead to detection. We providerigorous analysis on the probability of detection, and evaluate the effectiveness and efficiency of our scheme with extensive trace- driven simulations
