Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks

By Levente Buttyán, Jean-Pierre Hubaux. Mob. Networks Appl., 2003

1,269 citations recorded by the source corpus.

In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node is its own authority and tries to maximize the benefits it gets from the network. More precisely, we assume that the nodes are not willing to forward packets for the benefit of other nodes. This problem may arise in civilian applications of mobile ad hoc networks. In order to stimulate the nodes for packet forwarding, we propose a simple mechanism based on a counter in each node. We study the behavior of the proposed mechanism analytically and by means of simulations, and detail the way in which it could be protected against misuse.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/670473de9b839c5eda376d2dc3ef27759df42c9b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

A charging and rewarding scheme for packet forwarding in multi-hop cellular networks (2003, neutral): “In [6, 8], Buttyán and Hubaux use a virtual currency called nuglets to charge and reward the provision of the packet forwarding service in ad hoc networks while in [34], Zhong et al.”
Vehicular networks and the future of the mobile internet (2011, background): “For example, with the assumption of tamper-proof hardware on board [48,49], each relaying node earns some virtual credit that is protected by the tamper-proof hardware.”
A specification-based intrusion detection system for AODV (2003, background): “The work described in [2],[3],[11], and [12] use the mechanism of assigning a value to the “reputation” of a node and using this information to weed out misbehaving nodes and use only trusted and verifiably good nodes.”
PeopleNet: engineering a wireless virtual social network (2005, background): “There are a number of papers on ad hoc networks which address this issue [9, 10].”
A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects (2013, background): “Incentive mechanisms [95]–[103] have been well-studied in traditional wireless ad hoc networks.”
A Survey of Trust and Reputation Management Systems in Wireless Communications (2010, background): “cooperation stimulation models can be broadly classified into three categories based on the mechanisms they use to induce cooperation: simple punitive mechanisms [19], [20], [43], price-based mechanisms [8], [16], [21], [23], and reputation-based mechanisms [11], [14], [26].”
UCAN: a unified cellular and ad-hoc network architecture (2003, background): “leave the details of the credit accounting [12, 26], and focus on the identification of legitimate intermediate clients along the data relay path.”
TRM-IoT: A trust management model based on fuzzy reputation for internet of things (2011, background): “Such trust and reputation systems not only help in node behavior detection, but also improve network performance since honest nodes can avoid working with untrustworthy nodes [7].”
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks (2003, methodology): “Buttyan and Hubaux proposed a nice solution of this type in [5], and then presented an improved result based on credit counters in [6].”
Modelling incentives for collaboration in mobile ad hoc networks (2004, background): “This has been shown to stimulate cooperation within ad hoc networks [1].”
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks (2006, background): “In this paper, we will not consider security issues and the motivation for vehicles to relay, which can be addressed by many existing techniques [6], [12], [19].”
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents (2003, methodology): “In a follow-up work Buttyan and Hubaux [9] enhanced their results: they introduce a model with a credit counter in each node and analyze four rules when a node forwards packets for other nodes.”
A survey on peer-to-peer key management for mobile ad hoc networks (2007, background): “The network is therefore operated and managed by the nodes themselves, which makes MANETs dependent upon the cooperative and trusting nature of nodes [Buttyan and Hubaux 2003].”