Abbas, S, Merabti, M, Kifayat, K and Baker, T (2019) Thwarting Sybil Attackers in Reputation-based Scheme in Mobile Ad hoc Networks. KSII Transactions on Internet and Information Systems, 13 (12). pp. 6214-6242. ISSN 1976-7277

Preview

Text Thwarting Sybil Attackers in Reputation-based Scheme in Mobile Ad hoc Networks.pdf - Published Version Download (640kB) | Preview

Abstract

Routing in mobile ad hoc networks is performed in a distributed fashion where each node acts as host and router, such that it forwards incoming packets for others without relying on a dedicated router. Nodes are mostly resource constraint and the users are usually inclined to conserve their resources and exhibit selfish behaviour by not contributing in the routing process. The trust and reputation models have been proposed to motivate selfish nodes for cooperation in the packet forwarding process. Nodes having bad trust or reputation are detected and secluded from the network, eventually. However, due to the lack of proper identity management and use of non-persistent identities in ad hoc networks, malicious nodes can pose various threats to these methods. For example, a malicious node can discard the bad reputed identity and enter into the system with another identity afresh, called whitewashing. Similarly, a malicious node may create more than one identity, called Sybil attack, for self-promotion, defame other nodes, and broadcast fake recommendations in the network. These identity-based attacks disrupt the overall detection of the reputation systems. In this paper, we propose a reputation-based scheme that detects selfish nodes and deters identity attacks. We address the issue in such a way that, for normal selfish nodes, it will become no longer advantageous to carry out a whitewash. Sybil attackers are also discouraged (i.e., on a single battery, they may create fewer identities). We design and analyse our rationale via game theory and evaluate our proposed reputation system using NS-2 simulator. The results obtained from the simulation demonstrate that our proposed technique considerably diminishes the throughput and utility of selfish nodes with a single identity and selfish nodes with multiple identities when compared to the benchmark scheme.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Computer Science & Mathematics
Publisher:	Korea Society of Internet Information
Date Deposited:	19 Jul 2019 09:15
Last Modified:	04 Sep 2021 09:07
DOI or ID number:	10.3837/tiis.2019.12.023
URI:	https://researchonline.ljmu.ac.uk/id/eprint/11071

View Item