Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

Whitbeck, John; Conan, Vania; Amorim, Marcelo Dias de

doi:10.1109/tcomm.2011.020811.090163

Cited by 49 publications

(53 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Greedy Forwarding: Greedy Forwarding approaches is that, at the each stage visit an unvisited node nearest to the current node [10]. Thus, every node forwards the message to the neighbor that's best suited from a local point of view.…”

Section: Sogr-hrmentioning

confidence: 99%

“…Panagakis et al in [9] analytically derived the message delivery likelihood of two-hop relay below a given time limit by approximating the cumulative distributed operate (CDF) of message delivery delay, with the belief that for any node pair the message may be with success transmitted whenever they meet one another. In [10], Whit beck et al explored the impact of message size, message lifespan and link lifespan on the message delivery ratio (probability) of epidemic routing by treating the intermittently connected mobile networks (ICMNs) as edge-Markovian graphs, wherever every link (edge) is taken independent and simultaneously has the same transition probabilities between "up" and "down" status. Further it explored that impact of message scheduling and drop policies on the delivery likelihood performance of epidemic routing, and planned a distributed scheduling and drop policy supported applied math learning to approximate the optimum performance in [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

Somani¹,

Patil²

2016

IJCA

View full text Add to dashboard Cite

In this proposed method a new routing protocol is SelfAdaptive on demand Geographic routing protocols. One of the distinctive features has provide reliable and energy efficient feature to existing schemes in order to increase the lifetime of the network and reduces control overhead compute up to the proactive schemes which provides reliable routing at the same time with a lesser amount of energy utilization. We are embedding optimization (Marko chain algorithm) on the delivery probability performance in a two-hop relay algorithm with erasure coding. The erasure coding used for the message that is erasure coded into multiple frames at source node. Also we developed finite-state Markov chain model to characterize the complicated message delivery process in the MANETs. Based on the above model, closed-form expressions are further derived for the corresponding message delivery probability under any given message lifetime and message size. The above concept is verified through simulation studies, which can be used to accurately predict the message delivery probability behavior and characterize its relationship with the message size.

show abstract

Section: Sogr-hrmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

Somani¹,

Patil²

2016

IJCA

View full text Add to dashboard Cite

show abstract

“…Bluetooth or WiFi Direct). Moreover, by relying on properly designed security mechanisms, 10 mobile opportunistic networks can increase the confidentiality and privacy of communications, since direct communications, unlike infrastructure based communication, are more robust to the tracking of the user behaviour.…”

Section: Introductionmentioning

confidence: 99%

“…Analytical models can avoid these drawbacks providing a fast and broader performance evaluation. Two classes of analytical models have been proposed for modelling this network dynamics: Markovian models [5,6,7,8,9,10] and deterministic models based 35 on Ordinary Differential Equations (ODEs) [6,11,12,13]. Analytical models require anyway a precise and concise description of the mobility scenario, that usually assume that the inter-contact times distribution between pairs of nodes are exponentially distributed with a given contact rate [5].…”

mentioning

confidence: 99%

Analytical evaluation of the performance of contact-Based messaging applications

et al. 2016

View full text Add to dashboard Cite

Communications in mobile opportunistic networks, instead of using the Internet infrastructure, take place upon the establishment of ephemeral contacts among mobile nodes using direct communication. In this paper, we analytically model the performance of mobile opportunistic networks for contact-based messaging applications in city squares or gathering points, a key challenging topic that is required for the effective design of novel services. We take into account several social aspects such as: the density of people, the dynamic of people arriving and leaving a place, the size of the messages and the duration of the contacts. We base our models on Population Processes, an approach commonly used to represent the dynamics of biological populations. We study their stable equilibrium points and obtain analytical expressions for their resolution.The evaluations performed show that these models can reproduce the dynamics of message diffusion applications. We demonstrate that when the density of people increases, the effectiveness of the diffusion is improved. Regarding the arrival and departure of people, their impact is more relevant when the density of people is low. Finally, we prove that for large message sizes the effectiveness of the epidemic diffusion is reduced, and novel diffusion protocols should be considered.

show abstract

“…These models are considered macroscopic models, where we can identify the key mechanisms underlying the information diffusion. Two main classes of analytical models have been proposed for modeling this network dynamics: Markovian models [52,53,144,56,80,164] and deterministic models based on population or epidemic processes [53,172,33,169,61].…”

Section: Performance Evaluation Of Opportunistic Networkmentioning

confidence: 99%

Improving Message Dissemination in Opportunistic Networks

Tapia¹

View full text Add to dashboard Cite

Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

Cited by 49 publications

References 13 publications

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

Analytical evaluation of the performance of contact-Based messaging applications

Improving Message Dissemination in Opportunistic Networks

Contact Info

Product

Resources

About