期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2015
卷号：4
期号：12
页码：15246-15251
DOI：10.18535/Ijecs/v4i12.28
出版社：IJECS
摘要：Social network can be generally defined as a group of individuals who are connected by a set ofrelationships. A key characteristic of social networks is their continual change. However, the bulk of theanalysis methods developed and popularized in the field of computer were static in that all information aboutthe time that social interactions take place is discarded. Although recently there is some work on dynamicsocial network analysis. In this article we have presented the overview of dynamic social groupingalgorithm[10][11] . Probabilities and social behaviour are two common criteria used to route a message indisruption/delay tolerant network wherein there is only intermittent connectivity between the nodes. In thisarticle we first discuss how the characteristics of these routing algorithms can be exploited by a maliciousnode to attract data packets and then dropping them to degrade the network performance. We then show theimpact of such a behaviour called blackhole attack on DSG as it leverages both the social behaviour as wellas the delivery probabilities to make the forwarding decisions. We present three solutions to mitigate blackhole attacks. The first algorithm mitigates non collaborating blackhole nodes. In the second algorithm, wepresent a solution that handles collaborating blackhole nodes. The first two algorithms handle only theexternal attacks. It does not handle the scenario in which a node that is good initially and becomes maliciousor selfish later. Finally, we present our third algorithm which handles collaborative black holes as well asinternal attacks. We validate the performance of our algorithms through extensive simulation in ONEsimulator
关键词：Security; Dynamic Social grouping (DSG);Blackholes
