Modelling incentives for collaboration in mobile ad hoc networks
01 Aug 2004-Vol. 57, Iss: 4, pp 427-439
TL;DR: The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic and illustrates the way in which network resources are allocated to users according to their geographical position.
Abstract: This paper explores a model for the operation of an ad hoc mobile network. The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic. The paper explores consequences of the model by means of fluid-level simulations of a network and illustrates the way in which network resources are allocated to users according to their geographical position.
Citations
More filters
17 May 2004
TL;DR: This work model the P2P system using the Generalized Prisoner's Dilemma, and proposes the Reciprocative decision function as the basis of a family of incentives techniques that can drive a system of strategic users to nearly optimal levels of cooperation.
Abstract: Lack of cooperation (free riding) is one of the key problems that confronts today's P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover, a symmetry of interest, collusion, zero-cost identities, and traitors. To tackle these challenges we model the P2P system using the Generalized Prisoner's Dilemma (GPD),and propose the Reciprocative decision function as the basis of a family of incentives techniques. These techniques are fullydistributed and include: discriminating server selection, maxflow-based subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation.
633 citations
Cites background from "Modelling incentives for collaborat..."
...The unique challenges imposed by peer-to-peer systems inspired additional body of work [5] [37], mainly in the context of packet forwarding in wireless ad-hoc routing [8] [27] [30] [35], and file sharing [15] [31]....
[...]
TL;DR: This survey summary summarizes different modeling and solution concepts of networking games, as well as a number of different applications in telecommunications that make use of or can make useof networking games.
593 citations
Additional excerpts
...Keywords: Game theory; Telecommunication...
[...]
Book•
20 Jun 2008TL;DR: This survey provides a comprehensive discussion of the models, algorithms, analysis, and methodologies in this vast and growing literature of power control in cellular networks, including optimization theory, control theory, game theory, and linear algebra.
Abstract: Transmit power in wireless cellular networks is a key degree of freedom in the management of interference, energy, and connectivity. Power control in both the uplink and downlink of a cellular network has been extensively studied, especially over the last 15 years, and some of the results have enabled the continuous evolution and significant impact of the digital cellular technology.
This survey provides a comprehensive discussion of the models, algorithms, analysis, and methodologies in this vast and growing literature. It starts with a taxonomy of the wide range of power control problem formulations, and progresses from the basic formulation to more sophisticated ones. When transmit power is the only set of optimization variables, algorithms for fixed SIR are presented first, before turning to their robust versions and joint SIR and power optimization. This is followed by opportunistic and non-cooperative power control. Then joint control of power together with beamforming pattern, base station assignment, spectrum allocation, and transmit schedule is surveyed\break one-by-one.
Throughout the survey, we highlight the use of mathematical language and tools in the study of power control, including optimization theory, control theory, game theory, and linear algebra. Practical implementations of some of the algorithms in operational networks are discussed in the concluding section. As illustrated by the open problems presented at the end of most chapters, in the area of power control in cellular networks, there are still many under-explored directions and unresolved issues that remain theoretically challenging and practically important..
479 citations
Cites background from "Modelling incentives for collaborat..."
...Other works studying pricing include [187, 165, 8, 166, 41, 182, 181, 97, 96] for different utility functions and network models....
[...]
TL;DR: This article describes how various interactions in wireless ad hoc networks can be modeled as a game, which allows the analysis of existing protocols and resource management schemes, as well as the design of equilibrium-inducing mechanisms that provide incentives for individual users to behave in socially-constructive ways.
Abstract: The application of mathematical analysis to the study of wireless ad hoc networks has met with limited success due to the complexity of mobility and traffic models, the dynamic topology, and the unpredictability of link quality that characterize such networks. The ability to model individual, independent decision makers whose actions potentially affect all other decision makers renders game theory particularly attractive to analyze the performance of ad hoc networks. In this article we describe how various interactions in wireless ad hoc networks can be modeled as a game. This allows the analysis of existing protocols and resource management schemes, as well as the design of equilibrium-inducing mechanisms that provide incentives for individual users to behave in socially-constructive ways. We survey the recent literature on game theoretic analysis of ad hoc networks, highlighting its applicability to power control and waveform adaptation, medium access control, routing, and node participation, among others.
449 citations
Cites background from "Modelling incentives for collaborat..."
..., beneficial to the network as a whole) is to adopt a mechanism of charge and reward [52] [53] [54] [55] [56]....
[...]
...References [53] [54] [55] [56] develop incentive compatible, cheat-proof mechanisms that apply the principles of mechanism design to enforce node collaboration for routing in ad hoc networks, with [58] focusing on multicast routing....
[...]
03 Sep 2004
TL;DR: A model to study the phenomenon of free-riding and free-identities in peer-to-peer systems finds that imposing penalty on all users that join the system is effective under many scenarios and that system performance degrades significantly only when the turnover rate among users is high.
Abstract: We develop a model to study the phenomenon of free-riding in peer-to-peer (P2P) systems. At the heart of our model is a user of a certain type, an intrinsic and private parameter that reflects the user's willingness to contribute resources to the system. A user decides whether to contribute or free-ride based on how the current contribution cost in the system compares to her type. When the societal generosity (i.e., the average type) is low, intervention is required in order to sustain the system. We present the effect of mechanisms that exclude low type users or, more realistic, penalize free-riders with degraded service. We also consider dynamic scenarios with arrivals and departures of users, and with whitewashers: users who leave the system and rejoin with new identities to avoid reputational penalties. We find that when penalty is imposed on all newcomers in order to avoid whitewashing, system performance degrades significantly only when the turnover rate among users is high.
363 citations
References
More filters
01 Jul 2003
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.
11,490 citations
"Modelling incentives for collaborat..." refers methods in this paper
...When using one of the proposed ad hoc routing protocols, such as AODV [13] or DSR [7], it is reasonable to...
[...]
...When using one of the proposed ad hoc routing protocols, such as AODV [13] or DSR [7], it is reasonable to assume that the integrity of routes will need to be checked before routing a stream of packets along a particular path....
[...]
...These routes can be determined using routing protocols like AODV [13] or DSR [7]....
[...]
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Abstract: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second is /spl Theta/(W/spl radic/An) bit-meters per second. Thus even under optimal circumstances, the throughput is only /spl Theta/(W//spl radic/n) bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
9,008 citations
"Modelling incentives for collaborat..." refers background in this paper
...In reality, interference within the wireless media places much greater constraints on the throughput of the network [5]....
[...]
TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Abstract: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks. The algorithms provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion. Stability is established by showing that, with an appropriate formulation of the overall optimisation problem, the network's implicit objective function provides a Lyapunov function for the dynamical system defined by the rate control algorithm. The network's optimisation problem may be cast in primal or dual form: this leads naturally to two classes of algorithm, which may be interpreted in terms of either congestion indication feedback signals or explicit rates based on shadow prices. Both classes of algorithm may be generalised to include routing control, and provide natural implementations of proportionally fair pricing.
5,566 citations
"Modelling incentives for collaborat..." refers background or methods in this paper
...This leads us naturally to the use of pricing mechanisms, which have found application in rate control in wireline networks [9, 3, 11]...
[...]
...Global stability of the system (6–9) can be established by the construction of an appropriate Lyapunov function [9], in the case where the network structure is static....
[...]
...Optimisation of traffic flows, from a single source using multiple routes, has been considered previously [9, 16, 17]....
[...]
...The approach in this paper builds on [9] by the incorporation of power as well as bandwidth prices to reflect additional constraints that arise in wireless networks....
[...]
...Our approach to route selection and flow allocation closely follows the theoretical formulation given in [9]....
[...]
01 Jan 2004
4,182 citations
"Modelling incentives for collaborat..." refers methods in this paper
...When using one of the proposed ad hoc routing protocols, such as AODV [13] or DSR [7], it is reasonable to...
[...]
...When using one of the proposed ad hoc routing protocols, such as AODV [13] or DSR [7], it is reasonable to assume that the integrity of routes will need to be checked before routing a stream of packets along a particular path....
[...]
...These routes can be determined using routing protocols like AODV [13] or DSR [7]....
[...]
TL;DR: The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically under this assumption, and a form of multiuser diversity via packet relaying is exploited.
Abstract: The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting a form of multiuser diversity via packet relaying.
2,736 citations
"Modelling incentives for collaborat..." refers background in this paper
...Determining energy-efficient routes is also an important consideration in ad hoc networks [2, 4, 16], and pricing mechanisms provide the means of guiding a system to its optimal operating point....
[...]