scispace - formally typeset
Open AccessJournal ArticleDOI

Modelling incentives for collaboration in mobile ad hoc networks

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

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

A forwarding spurring protocol for multihop ad hoc networks (FURIES)

TL;DR: A forwarding protocol is presented that stimulates node cooperation to improve the throughput of the network and the incentive mechanism is provided through a micropayment protocol that deals with the cooperation range of the users.
Book ChapterDOI

BarterRoam: A Novel Mobile and Wireless Roaming Settlement Model

TL;DR: BterRoam is proposed, a new novel mobile and wireless roaming settlement model and clearance methodology, based on the concept of sharing and bartering excess capacities for usage in Visiting Wireless Internet Service Provider (WISP) coverage areas with Home WISP, to enable multiple service providers to trade their excess capacities via barter trade mode.
Book ChapterDOI

EcoRare: An Economic Incentive Scheme for Efficient Rare Data Accessibility in Mobile-P2P Networks

TL;DR: This performance study demonstrates that EcoRare indeed improves query response times and availability of rare data items in Mobile-P2P networks.
Proceedings ArticleDOI

A message-based incentive mechanism for opportunistic networking applications

TL;DR: This work proposes an incentive mechanism to improve routing, called MINEIRO, which aims to detect and avoid selfish nodes based on the source of the messages, and demonstrates under which constraints the algorithm leads to Bayesian equilibrium.
Proceedings ArticleDOI

Truthful and Secure Routing in Ad Hoc Networks

TL;DR: This work presents a secure and truthful mechanism for routing in wireless networks that cope selfish and malicious nodes that consists of malicious nodes too.
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

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

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)