Modelling incentives for collaboration in mobile ad hoc networks
Jon Crowcroft,Richard J. Gibbens,Frank Kelly,Sven Östring +3 more
- Vol. 57, Iss: 4, pp 427-439
Reads0
Chats0
TLDR
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.read more
Citations
More filters
Journal ArticleDOI
Networks of interacting stochastic fluid models
TL;DR: An approach for analysing networks of interacting stochastic fluid models, each modulated by the same background process, which incorporates feedback from the fluid level at a node to the background phase process is introduced.
Posted Content
Cooperation Enforcement for Packet Forwarding Optimization in Multi-hop Ad-hoc Networks
TL;DR: In this paper, a self-learning repeated game framework is proposed to enforce cooperation between the nodes of a network, inspired by the concept of "The Weakest Link" TV game, where each node has a utility function whose value depends on its cooperation in forwarding packets on a route and the cooperation of all the nodes that form this same route.
Journal ArticleDOI
A Collaborative Replication Approach for Mobile-P2P Networks
TL;DR: The authors' performance evaluation demonstrates that CADRE is indeed effective in improving data availability in M-P2P networks with significant reduction in query response times and low communication traffic during replication as compared to a recent existing scheme as well as a baseline approach, which does not consider any replication.
Proceedings ArticleDOI
On Optimal and Cheat-Proof Packets Forwarding Strategies in Autonomous Ad Hoc Networks
Wei Yu,K. Ray Liu +1 more
TL;DR: This paper mathematically studies the cooperation and packet forwarding issues among selfish nodes in ad hoc networks under a game theoretic framework and shows that when cheating behaviors are considered, all these unique equilibrium solutions will converge to the same format.
Proceedings ArticleDOI
Analysis of an ad hoc network with autonomously moving nodes
TL;DR: In this paper, the authors focus on the situation where each node can move to improve its utility expressed in terms of either credit balance or throughput, where nodes use credits to pay for the costs of sending their own traffic, and earn credits by forwarding traffic from other nodes.
References
More filters
Ad hoc On-Demand Distance Vector (AODV) Routing
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.
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
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.
Journal ArticleDOI
Rate control for communication networks: shadow prices, proportional fairness and stability
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.
Journal ArticleDOI
Mobility increases the capacity of ad hoc wireless networks
Matthias Grossglauser,David Tse +1 more
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.
Related Papers (5)
Stimulating cooperation in self-organizing mobile ad hoc networks
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Sheng Zhong,J. Chen,Yang Yang +2 more