Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Modeling and Performance Evaluation of Computing Systems Year : 2019

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 back-logged source proposes a fixed reward to the relays to deliver a message. Only one message 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 competition 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 probability 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. Formulas for computing the thresholds as well as probability of message delivery are derived for a backlogged source.
Fichier principal
Vignette du fichier
report.pdf (981.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01575320 , version 1 (18-08-2017)
hal-01575320 , version 2 (04-10-2018)

Identifiers

Cite

Thi Thu Hang Nguyen, Olivier Brun, Balakrishna Prabhu. Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2019, 4 (2), ⟨10.1145/3325288⟩. ⟨hal-01575320v2⟩
74 View
21 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More