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
Proceedings ArticleDOI

Optimal Pricing in a Free Market Wireless Network

TL;DR: This work demonstrates that individuals can benefit from carrying wireless devices even if they are not interested in their own personal communication.
Journal ArticleDOI

A stochastic fluid model for an ad hoc mobile network

TL;DR: This paper shall assume that there is no bound on the energy or the credit that a user’s handset can accumulate, and uses a stochastic fluid model to calculate the critical rates of recharge that are necessary and sufficient to guarantee that no calls are lost.

Applications of Game Theory in Ad Hoc Networks

Juha Leino
TL;DR: This thesis analyzes the relationship between a node and the rest of the network from the energy efficiency perspective using game theory and simulates networks in order to study the characteristics of the nodes that lose energy when joining the network.
Patent

Fair resource sharing in wireless communications

TL;DR: In this paper, a fair resource sharing among wireless nodes in a wireless communication environment is described, in which credits for the borrowing node are decreased based on consumption of a shared resource, or credit for the lending node are increased based on such consumption.
Journal ArticleDOI

Cooperative Strategies for Challenged Networks and Applications: A Survey

TL;DR: This paper presents a comprehensive review of the state of the art on cooperation strategies and algorithms for mobile ad hoc networks and delay-tolerant networks that are challenged by mobility constraints such as battery and storage capacity, broadcast constraints, interferences, disconnections, noises, limited bandwidths, and network delays.
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)