2 P2P or Not 2 P2P?

In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge the likely suitability of a P2P architecture for their applications. It is based on the characteristics of a wide range of P2P systems from the literature, both proposed and deployed.Comment: 6 pages, 1 figur

An Energy-Efficient Proactive Routing Scheme for MANET: Game Theoretical Approach of Forwarding with Selfish Nodes

In Mobile Ad-hoc Networks, nodes exchange packets with each other using intermediate nodes as relays. Since nodes in MANETs are battery powered, energy conservation is a crucial issue. Accepting relay all request may not be in the best interest of a node. But if many nodes prefer not to consume energy in relaying packets on behalf of others, the overall performance of routing in network will be influenced. In this paper we address the energy-efficient routing problem in MANETs with selfish nodes. We modeled this problem as a game-theoretic constraint optimization; we defined the utility of each node as a weighted difference between a performance metric and some transmission costs. A motivate mechanism is proposed in order to induce nodes to forwarding cooperation. Each node independently implements the optimal equilibrium strategy under the given constraints. Simulation results by NS3 simulator show that our proposed approach can improve system performance in network lifetime and packet delivery ratio

Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness

In mobile ad-hoc networks, nodes do not rely on any routing infrastructure but relay packets for each other. Thus communication in mobile ad-hoc networks functions properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate, for example to save power or to launch security attacks such as denial-of-service. In this paper, we give an overview of potential vulnerabilities and requirements of mobile ad-hoc networks, and of proposed prevention, detection and reaction mechanisms to thwart attacks

Enabling cost aware routing with auctions in wireless ad-hoc networks

Battery power is a precious resource in wireless ad-hoc networks, and most routing protocols that have been proposed so far do not generate cost efficient routes. In this thesis, a novel auction-based cost-aware routing scheme, called CARA, is presented. CARA is designed as an extension of the MAC layer, and is shown to improve the cost efficiency of existing ad-hoc routing protocols through dynamic power control, while introducing only minimal additional overhead. The MAC layer at each node is given the capability to run local sealed-bid second-price auctions for the user data packets that need to be transmitted, and to determine any neighbor nodes that reduce the transmission cost to the next hop identified by the network layer. Existing network layer routing protocols are utilized with no changes or impact on their operation. Selforganized networks, where nodes are greedy and selfish, are being supported through the proposed auction-based framework

Counteracting Selfish Nodes Using Reputation Based System in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a group of nodes constituting a network of mobile nodes without predefined and pre-established architecture where mobile nodes can communicate without any dedicated access points or base stations. In MANETs, a node may act as a host as well as a router. Nodes in the network can send and receive packets through intermediate nodes. However, the existence of malicious and selfish nodes in MANETs severely degrades network performance. The identification of such nodes in the network and their isolation from the network is a challenging problem. Therefore, in this paper, a simple reputation-based scheme is proposed which uses the consumption and contribution information for selfish node detection and cooperation enforcement. Nodes failing to cooperate are detached from the network to save resources of other nodes with good reputation. The simulation results show that our proposed scheme outperforms the benchmark scheme in terms of NRL (normalized routing load), PDF (packet delivery fraction), and packet drop in the presence of malicious and selfish attacks. Furthermore, our scheme identifies the selfish nodes quickly and accurately as compared to the benchmark scheme

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

This is an open access article distributed under the Creative Commons Attribution License (cc BY 4.0) https://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nodes in mobile ad hoc networks (MANETs) are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the networkPeer reviewedFinal Published versio

Manifestation and mitigation of node misbehaviour in adhoc networks

Mobile adhoc network is signified as a boon for advance and future wireless communication system. Owing to its self-establishing network features and decentralization, the system can actually establish a wireless communication with vast range of connectivity with the other nodes. However, the system of MANET is also beheld with various technical impediments owing to its inherent dynamic topologies. Although there are abundant volume of research work, but very few have been able to effectively address the node misbehavior problems in MANET. The paper initially tries to draw a line between different types of nodes in MANETs based on their behavior characteristics, then reviews some of the significant contribution of the prior researches for addressing node misbehavior issues. A major emphasis is laid on is the researches which use game theory as a tool to study and address the misbehavior problems. The manuscript is developed considering some of the latest and standard evidences of past 5 years and finally discusses the open issues related to the problems