SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks (original) (raw)

A Reputation-based Incentive Framework for Mobile Ad Hoc Networks

International Journal of Computer Applications, 2015

In mobile ad hoc networks (MANIT), nodes forward the packet to other with the help of intermediate nodes within the transmission range and as they are expected to cooperate to make the networks reliably. In ad hoc network, node may have limited resources. Due to this, some nodes (selfish node) may not to forward packets to save resources for their own use. To discourage such misbehaviour, we propose reputation-based incentive mechanism to motivate the selfish nodes to cooperate in order to packet forwarding. Incentive will be earned by the intermediate nodes which are responsible for forwarding the packet. In this paper, a cluster head will be used as reputation management of each node in the network. This paper highlights various views of cooperation enforcement mechanism and reliability. We perform an overall analysis of our paper by simulation using the network simulator (NS-2) with the help of AODV protocol.

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

Electronics, 2022

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...

SIP: a secure incentive protocol against selfishness in mobile ad hoc networks

2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)

Security in mobile ad hoc networks (MANETs) has received intensive attention recently, whereas the issue of selfish nodes, which may refuse to forward packets for others to save their own resources, is not well addressed yet. This kind of noncooperative action would cause a severe problem that is more likely in MANETs compared to their wired counterpart. To cope with this problem, we propose SIP: a Secure Incentive Protocol to stimulate cooperation among those possible selfish nodes. The most attractive feature of SIP is that it does not rely on any predeployed infrastructure and provides highly secure incentives for selfish nodes to be cooperative in packet forwarding with low overhead and implementation complexity.

Reputation based selfishness prevention techniques for mobile ad-hoc networks

Telecommunication Systems, 2013

Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multihop connectivity. Different reputation-based protocols have been proposed to cope with selfishness in mobile ad-hoc networks. These protocols utilize the watchdog detection mechanism to observe the correct relaying of packets, and to compile information about potential selfish nodes. This information is used to prevent the participation of selfish nodes in the establishment of multi-hop routes. Despite its wide use, watchdog tends to overestimate the selfish behavior of nodes due to the effects of radio transmission errors or packet collisions that can be mistaken for intentional packet drops. As a result, the availability of valid multi-hop routes is reduced, and the overall performance deteriorates. This paper proposes and evaluates three detection techniques that improve the ability of selfishness prevention protocols to detect selfish nodes and to increase the number of valid routes.

Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks

2001

Abstract. Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network entity keeps track of other entities' collaboration using a technique called reputation.

A secure incentive protocol for mobile ad hoc networks

Wireless Networks, 2006

The proper functioning of mobile ad hoc networks depends on the hypothesis that each individual node is ready to forward packets for others. This common assumption, however, might be undermined by the existence of selfish users who are reluctant to act as packet relays in order to save their own resources. Such non-cooperative behavior would cause the sharp degradation of network throughput. To address this problem, we propose a credit-based Secure Incentive Protocol (SIP) to stimulate cooperation among mobile nodes with individual interests. SIP can be implemented in a fully distributed way and does not require any pre-deployed infrastructure. In addition, SIP is immune to a wide range of attacks and is of low communication overhead by using a Bloom filter. Detailed simulation studies have confirmed the efficacy and efficiency of SIP.

MODSPIRITE: A Credit Based Solution to Enforce Node Cooperation in an Ad-hoc Network

2011

In an Ad-hoc network, node cooperation is an important factor for successful data transmission among nodes. Most of the routing protocols are based on the assumption that the intermediate node cooperates during data transmission from source node to destination. However, because mobile nodes are constrained by limited energy, bandwidth and computational resources, a node sometimes behaves as selfish to conserve its resources like energy, bandwidth etc. These selfish nodes are unwilling to forward others’ packets. This paper gives a review of existing reputation based and credit based systems and proposes a credit based solution called MODSPIRIT which is a modification of SPIRITE system. MODSPIRITE system detects selfish node using neighbor monitoring mechanism and enforce cooperation among non cooperative node by providing incentives to intermediate nodes. One of the limitations of SPIRITE system is that sender loses too much credit to forward its data to the destination and for futu...

On using reputations in ad hoc networks to counter malicious nodes

Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.

Nodes in mobile ad hoc networks have a limited transmission range. Hence the nodes expect their neighbors to relay packets meant for far off destinations. These networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay it and will not cheat. This assumption becomes invalid when the nodes in the network have tangential or contradictory goals. The reputations of the nodes, based on their past history of relaying packets, can be used by their neighbors to ensure that the packet will be relayed by the node. This paper introduces a reputation scheme for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40% malicious nodes, improves the throughput of the system to 65%, from 22% throughput provided by AODV. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length. 1

Mitigating routing vulnerabilities in ad hoc networks using reputations

International Journal of Information and Computer Security, 2009

Nodes in mobile ad hoc networks have limited transmission ranges that necessitate multihop communication. Hence the nodes expect their neighbours to relay the packets meant for nodes out of the transmission range of the source. Ad hoc networks are based on the fundamental assumption that if a node promises to relay a packet, it will relay the packet and will not cheat. This assumption becomes invalid when the nodes in the network have contradictory goals. As a result, routing protocols for ad hoc networks become vulnerable to rogue nodes. The reputations of the intermediate nodes, based on their past history of relaying packets, can be used by their neighbours to ensure that the packet will be relayed by the intermediate nodes. This paper introduces a reputation scheme for ad hoc networks that can motivate the intermediate nodes to relay packets. The source performs a route discovery (using Ad hoc on Demand Distance Vector Routing Protocol (AODV)) and finds a set of routes to the destination. Instead of choosing the shortest route to the destination, the source node chooses a path whose next hop node has the highest reputation. This policy, when used recursively, in the presence of 40% rogue nodes, improves the throughput of the system to 65%, from the 22% throughput provided by AODV with same number of rogue nodes. This improvement is obtained at the cost of a higher number of route discoveries with a minimal increase in the average hop length.

A survey on reputation-based cooperation enforcement schemes in wireless ad hoc networks

Mobile ad hoc networks rely on node cooperation to perform and support basic functions like packet forwarding, routing and network management. In general, nodes' misbehaviour can significantly degrade the performance of the network. Cooperation enforcement schemes are seen as a lightweight alternative to conventional security techniques, providing a "softer" security layer to protect basic networking operations. The aim of this paper is to survey representative cooperation enforcement schemes exploiting a reputation system proposed in related research literature. Their distinct features are analyzed and their relative merits and weaknesses are discussed.