Study of two-hop message spreading in DTNs

Panagakis, Antonis; Vaios, Athanasios; Stavrakakis, Ioannis

doi:10.1109/wiopt.2007.4480026

Cited by 22 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• The file to forward has a finite lifetime (called also horizon) during which the destination is interested in its content; • For simplicity and without loss of generality, we assume that all nodes are identical and equipped with the same wireless interface; • We consider that the relay nodes use a two-hop routing policy, 21,22 which works as follows: when a relay node receives a copy of the file from the source, it stores it and forwards it to the destination node when met within the file's lifetime. The choice of this routing protocol is motivated by an energy efficiency purpose.…”

Section: Problem Formulationmentioning

confidence: 99%

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Ezzahidi

Sabir

Ghogho

2018

Int J Communication

View full text Add to dashboard Cite

We deal in this article with the content forwarding problem in delay tolerant networks (DTNs). We first formulate the content delivery interaction as a noncooperative satisfaction game. On one hand, the source node seeks to ensure a delivery probability above some given threshold. On the other hand, the relay nodes seek to maximize their own payoffs. The source node offers a reward (virtual coins) to the relay, which caches and forwards the file to the final destination. Each relay has to solve the dilemma of accepting/rejecting to cache the source's file. Cooperation incurs energy cost due to caching, carrying, and forwarding the source's file. Yet when a relay accepts to cooperate, it may receive some reward if it succeeds to be the first relay to forward the content to the destination. Otherwise, the relay may receive some penalty in the form of a constant regret; the latter parameter is introduced to make incentive for cooperation.Next, we introduce the concept of satisfaction equilibrium (SE) as a solution concept to the induced game. Now, the source node is solely interested in reaching a file delivery probability greater than some given threshold, while the relays behave rationally to maximize their respective payoffs. Full characterizations of the SEs for both pure and mixed strategies are derived. Furthermore, we propose two learning algorithms allowing the players (source/relays) to reach the SE strategies. Finally, extensive numerical investigations and some learning simulations are carried out to illustrate the behavior of the interacting nodes and to give some insightful thoughts on how to fine-tune the network setting.KEYWORDS content caching, delay tolerant network, distributed learning, energy efficiency, reward-penalty incentive mechanism, satisfaction equilibrium Int J Commun Syst. 2019;32:e3844.wileyonlinelibrary.com/journal/dac

show abstract

Section: Problem Formulationmentioning

confidence: 99%

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Ezzahidi

Sabir

Ghogho

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…here c, r and Q are given in (22), (23) and (24), respectively; I is an identity matrix of size f × f , and 1 is a column vector of proper size with all elements being 1.…”

Section: A State Distribution Of Local-queuementioning

confidence: 99%

Source delay in mobile ad hoc networks

et al. 2015

View full text Add to dashboard Cite

Abstract-Source delay, the time a packet experiences in its source node, serves as a fundamental quantity for delay performance analysis in networks. However, the source delay performance in highly dynamic mobile ad hoc networks (MANETs) is still largely unknown by now. This paper studies the source delay in MANETs based on a general packet dispatching scheme with dispatch limit f (PD-f for short), where a same packet will be dispatched out up to f times by its source node such that packet dispatching process can be flexibly controlled through a proper setting of f . We first apply the Quasi-Birth-and-Death (QBD) theory to develop a theoretical framework to capture the complex packet dispatching process in PD-f MANETs. With the help of the theoretical framework, we then derive the cumulative distribution function as well as mean and variance of the source delay in such networks. Finally, extensive simulation and theoretical results are provided to validate our source delay analysis and illustrate how source delay in MANETs are related to network parameters.

show abstract

“…Delay performance modeling under packet redundancy technique has also been extensively studied recently. The works [35][36][37] conducted delay modeling under a simple network scenario, where only one source-destination pair is available in the network. Later, Liu et al [9,38] explored delay modeling under more general network scenarios with multiple source-destination pairs.…”

Section: Delay Control With Packet Redundancymentioning

confidence: 99%

“…Spyropoulos et al [39] proposed a single period routing algorithm (called spray and wait) for delay control in DTNs, and Bulut et al [40] extended the algorithm in [39] and further proposed a more general multi-period spraying algorithm for delay control in DTNs. Panagakis et al [36] developed a theoretical framework for delay modeling in DTNs with packet redundancy-based delay control.…”

Section: Delay Control With Packet Redundancymentioning

confidence: 99%

Delay control in MANETs with erasure coding and f-cast relay

et al. 2014

View full text Add to dashboard Cite

Packet delay control in Mobile Ad Hoc Networks (MANETs) is critical to support delay-sensitive applications in such networks. By combining erasure coding and packet redundancy techniques, this paper proposes a general two-hop relay algorithm 2HR-(x, τ, f) for a flexible control of packet delivery delay in MANETs , where a group of x packets in source node are first encoded into x • τ encoded packets based erasure coding, and each encoded packet is then delivered to at most f distinct relay nodes (f-cast) that will help to forward the encoded packet to destination node. To understand the delay performance in a 2HR-(x, τ, f) MANET, we then develop a discrete time multi-dimensional Markov chain model to depict the packet delivery process in the network, based on which closed-form results on mean and variance of packet delivery delay are further derived. Finally, extensive simulation and theoretical results are provided to illustrate

show abstract

Study of two-hop message spreading in DTNs

Cited by 22 publications

References 11 publications

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Satisfactory content delivery scheme for QoS provisioning in delay tolerant networks

Source delay in mobile ad hoc networks

Delay control in MANETs with erasure coding and f-cast relay

Contact Info

Product

Resources

About