Node activity based trust and reputation estimation approach for secure and QoS routing in MANET

Achieving safe and secure communication in MANETs is a key challenge due to its dynamic nature. A number of security studies disclose that reputation management systems are able to be effectual with less overhead. The reputation of a node is calculated by using automated assessment algorithms depend on predefined trust scheme. This paper proposes a Node Activity-based Trust and Reputation estimation (NA-TRE) approach for the security and QoS routing in MANET. NA-TRE aims to find trust estimation and reputation of a node. The NA-TRE approach monitors the activity changes, packet forwarding or dropping in a node to find the status of the node. The various activities of a node like Normal State (NS), Resource Limitation State (RS) and Malicious State (MS) are monitored. This status of a node is helpful in computing trust and reputation. In this paper NA-TRE approach compared with existing protocols AODV, FACE and TMS to evaluate the efficiency of MANET. The experiment results show that 20% increasing of throughput, 10% decrease of overhead and end to end delay

DETECTION OF MALICIOUS PACKET DROPPING IN WIRELESS AD HOC NETWORKS BASED ON PRIVACY-PRESERVING PUBLIC

Security is one of the most important issues that have attracted a lot of research and development effort in past few years. In multi-hop wireless ad hoc network link error and malicious packet dropping are two sources for packet losses. Whether the losses are caused by link errors only, or by the combined effect of link errors and malicious drop are to be identified, can be known by observing a sequence of packet losses in the network. But in the insider-attack case, whereby malicious nodes that are part of the route exploit their knowledge of the communication context to selectively drop a small amount of packets critical to the network performance. Conventional algorithms that are based on detecting the packet loss rate cannot achieve satisfactory detection accuracy because the packet dropping rate in this case is comparable to the channel error rate. Hence to improve the detection accuracy, the correlations between lost packets is identified. The technique called Homomorphism linear authenticator (HLA) based public auditing architecture is developed that allows the detector to verify the truthfulness of the packet loss information reported by nodes. This technique provides privacy preserving, collusion proof, and incurs low communication and storage overheads. A packet-block based mechanism is also proposed, to reduce the computation overhead of the baseline scheme, which allows one to trade detection accuracy for lower computation complexit

Node Activities Learning(NAL)Approach to Build Secure and Privacy-Preserving Routing in Wireless Sensor Networks

Wireless networks are becoming the most popular in today communication systems, where users prefer to have wireless connectivity regardless of its geographic location. But the open environment of wireless communication increasing threat on the wireless networks under diverse network circumstances. The random and dynamic activity increases the  vulnerability due to the complete dependency on the intermediate nodes which frequently join and leave the network. It is extremely significant to have a secure routing in such a dynamic network to preserve the data privacy. In this paper, we propose a secure and privacy routing based on Node Activities Learning (NAL) approach. This approach knows the runtime activities of the node to predict the probability of activity transformation for the intentional and unintentional activities which interrupt the data communication and affects the privacy. The mean of privacy is decided based on the node individual trust factor. It also suggests a method for the node which loses their trust due to the unintentional activities. A simulation-based evaluation study shows positive improvisation in secure routing in different malicious node environment

An Effective Data Privacy Mechanism through Secure Session Key Exchange Model for MANET

Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node movement and lack of any centralized infrastructure support. In such case, it is very important to build a reliable and secure network and achieve high throughput in MANET. The reliability and security of a network depend on whether the network remains linked to different failures and malicious activities, which is the fundamental issue that needs to be focused when designing a secure routing protocol in MANET. This paper proposes an effective privacy mechanism to handle data security through a novel secure session key exchange model, which provides the node data privacy and network stability for a longer period of time and prevents abnormal behavior changes due to malicious behavior and different type of attacks in the network. The simulation results show improvement in throughput with nominal overhead and end-to-end delay in different malicious conditions against existing protocols

Secure Routing Protocols Comparison Analysis Between RNBR, SAA, A-UPK

The advent of wireless communications and the development of mobile devices have made great strides in the development of roaming communications. The MANET mobile network was developed with the ability for mobile devices to quickly self-configure and extend wireless coverage without infrastructure support. Security is one of the most important areas of research and plays a vital role in determining the success of personal and commercial telephone systems.Therefore, this study focuses on systematically examining MANET security and accountability issues and analyzing the performance of solutions proposed by three different design approaches to security systems.First, it provides an approach for identifying trusted nodes employing the proposed RNBR method for secure routing.it provides a Self-Assured Assessment (SAA) method to estimate node stability. Its main goal is to contribute to a self-assessment-based reliability assessment mechanism that provides a reliable and reliable pathway.it provides a new authentication method to prevent forgery attacks. It supports authentication mechanisms to prevent RF attacks and ensure secure routing development.The main Objective of this paper is compare to packet delivery Ratio ,Control Overhead, Packet Drop Ratio in different secure RNBR,SAA,A-UPK Routing Protocols in MANETS

Thwarting Sybil Attackers in Reputation-based Scheme in Mobile Ad hoc Networks

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