EFFECTIVE ALGORITHM FOR REDUCED PACKET LOSS IN SYBIL ATTACKS
C. N. Shighe · 2014
Wireless as well as mobile ad hoc networks are vulnerable to different attacks from multiple sources. These attacks are classified in the taxonomy of active and passive attacks. Sybil attack is one of the majorly used and implemented attacks in the network community to sniff the identity and use the same for further usage. Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity or Sybil Attacks. A number of schemes have been proposed, but they differ greatly in the algorithms they use and in the networks upon which they are evaluated. As a result, the research community lacks a clear understanding of how these schemes compare against each other, how well they would work on real-world social networks with different structural properties, or whether there exist other (potentially efficient) ways of Sybil defense. In the event of a Sybil strike, the gatecrasher subverts the notoriety arrangement of system framework by making a substantial number of pseudonymous characters, utilizing them to addition a lopsidedly huge impact. A notoriety framework's weakness to a Sybil strike relies on upon how efficiently personalities could be created, the degree to which the notoriety framework acknowledges inputs from substances that don't have a chain of trust connecting them to a trusted substance, and whether the notoriety framework treats all elements indistinguishably. Confirmation demonstrates huge scale Sybil ambush might be completed in an exceptionally shoddy and effective path in the reasonable framework like Bittorrent Mainline. A