Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays

(1) , (1) , (1)
1

Abstract

We analyse the performance of an incentive scheme for two- hop DTNs in which a backlogged source proposes a fixed reward to the relays to deliver a message. Only one mes- sage at a time is proposed by source. For a given message, only the first relay to deliver this message gets the reward corresponding to this message thereby inducing a competi- tion between the relays. The relays seek to maximize the expected reward for each message whereas the objective of the source is to satisfy a given constraint on the probabil- ity of message delivery. We show that the optimal policy of a relay is of threshold type: it accepts a message until a first threshold and then keeps the message until it either meets the destination or reaches the second threshold. For- mulas for computing the thresholds as well as probability of message delivery are derived for a backlogged source. Ex- plicit expressions are obtained for this scenario in the limit- ing regime where the number of relays is large.
Fichier principal
Vignette du fichier
netecon_onepage.pdf (89.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01365939 , version 1 (13-09-2016)

Identifiers

  • HAL Id : hal-01365939 , version 1

Cite

Hang Thi Thu Nguyen, Olivier Brun, Balakrishna Prabhu. Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays. The 11th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2016), Jun 2016, Juan-les-Pins, France. ⟨hal-01365939⟩
227 View
156 Download

Share

Gmail Facebook Twitter LinkedIn More