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

Pricing, competition, and routing in multi-hop networks

TL;DR: This work studies multi-hop relay networks where pricing is used to provide incentives for forwarding traffic and shows that inefficiencies stem from the intrinsicmulti-hop network structure and can give rise to an infinite price of anarchy.
Proceedings ArticleDOI

Creating motives for cooperation to achieve high throughput in wireless ad hoc networks

TL;DR: Two algorithms that create motives for cooperation among node in an ad hoc network are described, both of which can be extended to a weighted version, which inappropriate when the destinations are not uniformly distributed, as in the case where most nodes send traffic to an access point.
Journal Article

A Survey of Packet Dropper Detection in Wireless Network

TL;DR: This paper studies some of the important work carried out in mitigating misbehavior of packet dropper node and provides comparison between the different proposed methods.
Posted Content

A Large Family of Multi-path Dual Congestion Control Algorithms

TL;DR: A generalized multi-path utility maximization model to consider the problem of routes selection and flow control, and derive a family of multi- path dual congestion control algorithms that are stable in the absence of delays are proposed.

Flow allocation in wireless networks with selfish nodes

TL;DR: In this article, Krzesinski et al. present a flow allocation in wireless networks with selfish nodes in Southern Africa Telecommunication Networks and Applications Conference (SATNAC) 2013 Proceedings, 1-4 September, Stellenbosch, pp 285-290
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)