Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.Comment: 17 pages, 6 figure

PROTECT: Proximity-based Trust-advisor using Encounters for Mobile Societies

Many interactions between network users rely on trust, which is becoming particularly important given the security breaches in the Internet today. These problems are further exacerbated by the dynamics in wireless mobile networks. In this paper we address the issue of trust advisory and establishment in mobile networks, with application to ad hoc networks, including DTNs. We utilize encounters in mobile societies in novel ways, noticing that mobility provides opportunities to build proximity, location and similarity based trust. Four new trust advisor filters are introduced - including encounter frequency, duration, behavior vectors and behavior matrices - and evaluated over an extensive set of real-world traces collected from a major university. Two sets of statistical analyses are performed; the first examines the underlying encounter relationships in mobile societies, and the second evaluates DTN routing in mobile peer-to-peer networks using trust and selfishness models. We find that for the analyzed trace, trust filters are stable in terms of growth with time (3 filters have close to 90% overlap of users over a period of 9 weeks) and the results produced by different filters are noticeably different. In our analysis for trust and selfishness model, our trust filters largely undo the effect of selfishness on the unreachability in a network. Thus improving the connectivity in a network with selfish nodes. We hope that our initial promising results open the door for further research on proximity-based trust

A power efficient method against misbehaving node in reputation system to prevent sybil attack in mobile ad-hoc network

Mobile ad-hoc network has become a very important field of study for students and researchers owing to its wide application. In mobile ad-hoc network all nodes are responsible for routing and forwarding of packets, hence all nodes are required to act selflessly for proper functioning of mobile ad-hoc network. The presence of selfish behavior in a node can degrade the performance of the mobile ad hoc network to a large extent. Several works have been done for identification and punishment of the misbehaving nodes in mobile ad hoc network. We propose here a method where some selected neighbors are participated in detecting misbehaving nodes in power effective manners. These neighbors participating in selfish node detection are chosen randomly. It also alerts all other nodes about the misbehaving links in the network. The simulation studies show that this does the job efficiently with less power consumption in the network. The power effectiveness of the algorithm also reduces the number of misbehaving nodes because many nodes show misbehavior to save their power

A Survey on Secure Cooperative Bait Detection Approach for Detecting Malicious Nodes in MANETs

In Mobile Ad-hoc Networks (MANETs), the main problem is the security as well as formation of communication amongst nodes is that nodes must work together with each other. Avoiding or sensing malicious nodes initiation grayhole or collaborative blackhole attacks is the main challenge. Cooperative bait detection approach mixes the advantages of both proactive and reactive defense architectures. Here it uses the technique of transposition for implementing security and the CBDA technique outfits a reverse tracing method to help in attaining the specified aim. The demonstration in the occurrence of malicious-node attacks, the CBDA outperforms the DSR, and Best-Effort Fault-Tolerant Routing (BFTR) protocols in relations to packet delivery ratio and routing overhead. In the transposition method we use the key which is the askey value of the character which is encrypted at sender side and decrypted at receiver. DOI: 10.17762/ijritcc2321-8169.15033