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
Proceedings ArticleDOI
Performance Incentives for Cooperation between Wireless Mesh Network Operators
TL;DR: Analytical results indicate that there are cases where cooperation can yield significant performance improvements for both WMNs, and an analytical framework is presented that can identify when the cooperation is expected to be beneficial for both operators.
Proceedings ArticleDOI
Modelling incentives and protocols for collaboration in mobile ad hoc networks
Johannes Göbel,A. E. Krzesinski +1 more
TL;DR: A model of a signalling protocol that obtains and distributes the prices that the nodes charge for processing flows so that the credit balances can be locally computed at each node is presented.
Proceedings ArticleDOI
Incentive driven cooperation to avoid packet loss in multihop ad hoc networks
TL;DR: A pricing technique to optimally allocate power to single-antenna and Multiple-Input-Multiple-Output systems by developing a utility function for cooperative communication and imposing cooperation between nodes allows relaying of data and improves network connectivity.
Journal ArticleDOI
cRedit-based and reputation retrieval system
Yung-Ting Chuang,Jia Jun Tsai +1 more
TL;DR: In this paper, the authors present a system called "cRedit-based and reputation retrieval system" that employs a distributed message transmission protocol to avoid censorship problems, forwarding and reliable routing algorithms to ensure reliable message routing, reputation and credit algorithms to encourage greater cooperation incentives, location and refresh algorithms to deal with nodes' limited view even in high-churn network, and a protection algorithm to address the problem of selfish nodes.
Posted Content
A Strategy-Proof and Non-monetary Admission Control Mechanism for Wireless Access Networks
TL;DR: In this article, the authors proposed admission control mechanisms for wireless access networks where each user has a minimum service requirement, the capacity of the access network is limited, and the access point is not allowed to use monetary mechanisms to guarantee that users do not lie when disclosing their minimum service requirements.
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