Using localized random walks to model Delay-Tolerant Networks

Walker, Brenton; Clancy, T. Charles; Glenn, J.K.

doi:10.1109/milcom.2008.4753165

Cited by 11 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance evaluations of mobile routing protocols based on synthetic traces produced by SLAW demonstrate that SLAW gets the unique performance features of various routing protocols. Lee et al [30] has developed SLAW depending on Global Positioning Systems traces of human walks that counted 226 daily traces collected from 101 volunteers in five different outdoor sites. Especially, many of these traces are derived considering people who have common interests such as students in the same university campuses and tourists in a theme park.…”

Section: Self-similar Least-action Walk (Slaw)mentioning

confidence: 99%

See 1 more Smart Citation

Mobility Models for Delay Tolerant Network: A Survey

Shahzamal¹,

Parvez²,

Zaman³

et al. 2014

IJWMN

View full text Add to dashboard Cite

show abstract

Section: Self-similar Least-action Walk (Slaw)mentioning

confidence: 99%

“…Thus, the performances of DTN protocols are usually evaluated using simulator based on different mobility models. These mobility models are expected to reflect the real mobility patterns of nodes [1]- [2].…”

Section: Introductionmentioning

confidence: 99%

Mobility Models for Delay Tolerant Network: A Survey

Shahzamal¹,

Parvez²,

Zaman³

et al. 2014

IJWMN

View full text Add to dashboard Cite

show abstract

“…For comparison, we also simulate a bottom-line strategy that randomly selects deployment locations and an oracle deployment strategy that uses the same data for training and testing (in contrast, all the other strategies use one data set for computing utilities and placement solutions, and an independent data set for testing performance; see [10]). To simulate heterogeneous mobility for different domains, we use a localized random walk mobility model [24], where each domain is represented by a G × G grid with a "home cell" that attracts nodes 6 We have simulated binary spray for the constrained version of limited replication and centralized spray for the unconstrained version. Binary spray without resource constraints yields performance between the two (not shown).…”

Section: A Evaluation On Synthetic Data 1) Evaluation Of Utility Commentioning

confidence: 99%

Utility-Based Gateway Deployment for Supporting Multi-Domain DTNs

Lee

Sofra

et al. 2010

2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)

View full text Add to dashboard Cite

Abstract-Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the overall performance. In this paper, we study the problem of placing static gateways in mobile DTNs consisting of multiple domains. Given a limited gateway budget, the problem is to select deployment locations to optimize certain performance. The challenge is that different domains may possess heterogeneous properties. To ensure general applicability of solution, we propose a unified framework based on utility optimization, and solve utility computation and placement optimization separately. To handle heterogeneity, we decompose utility computation into individual domains and derive closed-form solutions based on key domain characteristics with focus on the routing scheme. Moreover, we develop quadratic-complexity algorithms to solve the optimization efficiently, which has guaranteed performance under certain uniformity conditions. Although certain assumptions have been made in developing the solutions, evaluations based on synthetic data and real DTN traces both show that the proposed solutions can achieve near-optimal performance at much lower complexities, and the results are robust with respect to the routing schemes and the mobility patterns. Compared with utility-agnostic deployments, our solutions significantly improve the end-to-end performance.

show abstract

“…It turns out that a node following the LRAW mobility model will have a double exponential (or Laplace) stationary distribution about the home cell. We will pull in a variety of properties of this mobility model, though a complete analysis is beyond the scope of this paper [13].…”

Section: Mobility Modelsmentioning

confidence: 99%

“…It turns out that the expected pair encounter rate in an LRAW cloud with tightness parameter τ can be computed exactly [13].…”

Section: Transient Properties With Lraw Mobilitymentioning

confidence: 99%

Analysis of simple counting protocols for delay-tolerant networks

Walker

Glenn

Clancy

2007

Proceedings of the Second ACM Workshop on Challenged Networks

Self Cite

View full text Add to dashboard Cite

Mobile Wireless Delay-Tolerant Networks (DTNs) are wireless networks that suffer from intermittent connectivity, but enjoy the benefit of mobile nodes that can store and forward packets or messages, and can act as relays, bringing packets and messages closer to their destination through a selective forwarding policy. Many DTN protocols compensate for the unpredictability of the network by distributing multiple message copies in the hopes that at least one will eventually be delivered. As the number of message carriers becomes large these schemes experience diminishing marginal benefits from the addition of more message carriers. We describe and analyze the Simple Counting Protocol, an extremely simple and robust method for limiting the fraction of nodes that carry a copy of a message. We examine the performance of this protocol in conjunction with several abstract mobility models and show that the protocol performs reasonably well in diverse circumstances. The Simple Counting Protocol does not assume much about node mobility, and therefore should be useful for applications where little is known about node encounter patterns. The simplicity of its implementation will hopefully make it a useful substitute for epidemic routing as a naive lower bound in protocol performance comparisons.We also show how the same simple techniques and principles can be applied in conjunction with more complex heuristic DTN protocols to reduce network resource usage, a scheme we call Intermediate Immunity.

show abstract

Using localized random walks to model Delay-Tolerant Networks

Cited by 11 publications

References 17 publications

Mobility Models for Delay Tolerant Network: A Survey

Mobility Models for Delay Tolerant Network: A Survey

Utility-Based Gateway Deployment for Supporting Multi-Domain DTNs

Analysis of simple counting protocols for delay-tolerant networks

Contact Info

Product

Resources

About