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
A Model of Autonomous Motion in Ad Hoc Networks to Maximise Area Coverage
Johannes Göbel,A. E. Krzesinski +1 more
TL;DR: A distributed scalable method based on local interactions with minimal sensing and low computational cost whereby the nodes move autonomously (self-deployment) in order to maximise the coverage of the network, while at the same time ensuring that the mobile nodes do not move so far away from each other (thus trivially maximising the coverage) that they become disconnected.
Journal ArticleDOI
A distributed coalition game model for cooperation in MANETs
Amr E. Hilal,Allen B. MacKenzie +1 more
TL;DR: A coalition game model for cooperation in mobile ad hoc networks (MANETs) that aims to mitigate the negative impact of topology changes on node cooperation through coalition formation and shows scalability of the cooperation mechanism with a significant improvement in packet deliverability and control overhead in a wide range of network scenarios.
Proceedings ArticleDOI
Equilibria and price of anarchy in parallel relay networks with node pricing
Yufang Xi,Edmund M. Yeh +1 more
TL;DR: It is shown that the socially optimal traffic allocation can always be induced by an equilibrium where no relay can increase its profit by unilaterally changing its bids, and an unbounded price of anarchy when the marginal cost functions are convex.
Journal ArticleDOI
Inter-domain pricing: challenges and possible approaches
Hoang-Hai Tran,Bruno Tuffin +1 more
TL;DR: The list of properties that one would ideally like the inter-domain pricing scheme to satisfy is reviewed, and it is claimed that no mechanism can satisfy all of them together.
Journal ArticleDOI
Incentive-based control of ad hoc networks: A performance study
TL;DR: In this paper, the authors investigate various ways of providing nodes near the edge of the network with preferential treatment in order to improve their credit balance and their 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