Enhancing Node Cooperation in Mobile Wireless Ad Hoc Networks with Selfish Nodes

In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. However, to save power and other resources, nodes belonging to independent authorities may behave selfishly, and may not be willing to help other nodes. Such selfish behavior poses a real threat to the proper functioning of MANETs. One way to foster node cooperation is to introduce punishment for selfish nodes. Based on neighbor-monitoring techniques, a fully distributed solution to detect, punish, and re-admit selfish nodes, is proposed here. This solution provides nodes the same opportunity to serve/and be served by others. A light-weight solution regarding battery status is also proposed here. This solution requires neighbor monitoring only when necessary, thereby saving nodes battery power. Another effective way to solve the selfish-node problem is to reward nodes for their service according to their cost. To force nodes to show their true cost, truthful protocols are needed. A low overhead truthful routing protocol to find optimal routes is proposed in this thesis. The most prominent feature of this protocol is the reduction of overhead from existing solutions O(n3) to O(n2). A light-weight scalable truthful routing protocol (LSTOP) is further proposed, which finds near-least-cost paths in dense networks. LSTOP reduces overhead to O(n) on average, and O(n2) in worst case scenarios. Multiple path routing protocols are an effective alternative to single path routing protocols. A generic mechanism that can turn any table-driven multipath routing protocol into a truthful one, is outlined here. A truthful multipath routing protocol (TMRP), based on well-known AOMDV protocol, is presented as an example. TMRP incurs an only 2n message overhead for a route discovery, and can also achieve load balancing without compromising truthfulness. To cope with the selfish-node problem in the area of position-based routing, a truthful geographic forwarding (TGF) algorithm is presented. TGF utilizes three auction-based forwarding schemes to stimulate node cooperation. The truthfulness of these schemes is proven, and their performance is evaluated through statistical analysis and simulation studies

Auction-based schemes for multipath routing in selfish networks

We study multipath routing with traffic assignment in selfish networks. Based on the Vickrey-Clarke-Groves (VCG) auction, an optimal and strategy-proof scheme, known as optimal auction-based multipath routing (OAMR), is developed. However, OAMR is computationally expensive and cannot run in real time when the network size is large. Therefore, we propose sequential auction-based multipath routing (SAMR). SAMR handles routing requests sequentially using some greedy strategies. In particular, with reference to the Ausubel auction, we develop a water-draining algorithm to assign the traffic of a request among its available paths and determine the payment of the transmission in approximately constant time. Our simulation results show that SAMR can rapidly compute the allocations and payments of requests with small sacrifice on the system cost. Moreover, various sequencing strategies for sequential auction are also investigated. © 2013 IEEE.published_or_final_versio

Survey on Quality Analysis of Collaboration Motivation Approach in Wireless Ad Hoc Networks

In Wireless Ad Hoc Networks (WANETs), tasks are conducted based on the cooperation of nodes in the networks. However, since the nodes are usually constrained by limited computation resources, selfish nodes may refuse to be cooperative. Reputation system is one of the main solutions to the node non cooperation problem. A reputation system evaluates node behaviours by reputation values and uses a reputation threshold to distinguish trustworthy nodes and untrustworthy nodes. Although this system has been widely used, very little research has been devoted to investigating the effectiveness of the node cooperation incentives provided by the systems. We propose a protocol called Enhanced Reverse Ad Hoc On Demand Vector Routing Protocol (ERAODV), which uses Hybrid Reputation System (HRS). A Hybrid Reputation system is an enhanced version of Classical Reputation System (CRS). Unlike the CRS it takes into account all the reputation values from the node to determine whether it is trustworthy or not. Keywords: WANET; Reputation System; Price Based System; Quality Analysis; Multipath Routing

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

Securing routing protocols in mobile ad hoc networks

A Mobile Ad Hoc Network (MANET) is more prone to security threats than other wired and wireless networks because of the distributed nature of the network. Conventional MANET routing protocols assume that all nodes cooperate without maliciously disrupting the operation of the protocol and do not provide defence against attackers. Blackhole and flooding attacks have a dramatic negative impact while grayhole and selfish attacks have a little negative impact on the performance of MANET routing protocols. Malicious nodes or misbehaviour actions detection in the network is an important task to maintain the proper routing protocol operation. Current solutions cannot guarantee the true classification of nodes because the cooperative nature of the MANETs which leads to false exclusions of innocent nodes and/or good classification of malicious nodes. The thesis introduces a new concept of Self- Protocol Trustiness (SPT) to discover malicious nodes with a very high trustiness ratio of a node classification. Designing and implementing new mechanisms that can resist flooding and blackhole attacks which have high negative impacts on the performance of these reactive protocols is the main objective of the thesis. The design of these mechanisms is based on SPT concept to ensure the high trustiness ratio of node classification. In addition, they neither incorporate the use of cryptographic algorithms nor depend on routing packet formats which make these solutions robust and reliable, and simplify their implementations in different MANET reactive protocols. Anti-Flooding (AF) mechanism is designed to resist flooding attacks which relies on locally applied timers and thresholds to classify nodes as malicious. Although AF mechanism succeeded in discovering malicious nodes within a small time, it has a number of thresholds that enable attacker to subvert the algorithm and cannot guarantee that the excluded nodes are genuine malicious nodes which was the motivation to develop this algorithm. On the other hand, Flooding Attack Resisting Mechanism (FARM) is designed to close the security gaps and overcome the drawbacks of AF mechanism. It succeeded in detecting and excluding more than 80% of flooding nodes within the simulation time with a very high trustiness ratio. Anti-Blackhole (AB) mechanism is designed to resist blackhole attacks and relies on a single threshold. The algorithm guarantees 100% exclusion of blackhole nodes and does not exclude any innocent node that may forward a reply packet. Although AB mechanism succeeded in discovering malicious nodes within a small time, the only suggested threshold enables an attacker to subvert the algorithm which was the motivation to develop it. On the other hand, Blackhole Resisting Mechanism (BRM) has the main advantages of AB mechanism while it is designed to close the security gaps and overcome the drawbacks of AB mechanism. It succeeded in detecting and excluding the vast majority of blackhole nodes within the simulation time

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

An incentive scheme for non-cooperative social networks under the Independent Cascade Model

Session 20: Intelligent e-Technology IIn this paper we analyze influence maximization for noncooperative social networks under the Independent Cascade Model. We propose a model of noncooperative nodes and prove some interesting properties of this model. Based on this, we further develop a game-theoretic model to characterize the behavior of noncooperative nodes, and design a Vickrey-Clarke-Groves-like scheme to incentivise cooperation. An advertiser can resolve the negative effect of noncooperation with our proposed solution. Evaluation on large social networks demonstrates the importance of cooperation and the effectiveness of our proposed incentive scheme in maximizing influence. We also discuss the budget allocation between seed nodes activation and incentives to non-seed nodes.published_or_final_versio