Continuum Percolation Threshold for Permeable Aligned Cylinders and Opportunistic Networking

@article{Hyyti2012ContinuumPT,
  title={Continuum Percolation Threshold for Permeable Aligned Cylinders and Opportunistic Networking},
  author={Esa Hyyti{\"a} and Jorma T. Virtamo and Pasi E. Lassila and J{\"o}rg Ott},
  journal={IEEE Communications Letters},
  year={2012},
  volume={16},
  pages={1064-1067}
}
We consider the critical percolation threshold for aligned cylinders, which provides a lower bound for the required node degree for the permanence of information in opportunistic networking. The height of a cylinder corresponds to the time a node is active in its current location. By means of Monte Carlo simulations, we obtain an accurate numerical estimate for the critical reduced number density, ηc ≈ 0.3312(1) for constant height cylinders. This threshold is the same for all ratios of the… 

Figures and Tables from this paper

Criticality of large delay tolerant networks via directed continuum percolation in space-time

Under the given assumptions, it is shown that DTN communication is feasible when the mean node degree ν is greater than 4 · η<sub>c</sub>(γ), where parameter γ=ℓ/d is the ratio of the distance ℓ to the transmission range d, and η(sub)</sub) is the critical reduced number density of tilted cylinders in a directed continuum percolation model.

Bond percolation on simple cubic lattices with extended neighborhoods.

The results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number z quite accurately according to a power-law p_{c}∼z^{-a} with exponent a=1.111.

Site percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit.

By means of extensive Monte Carlo simulation, extended-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors up to the eighth nearest neighbors for the square lattice and the ninth nearestNeighborhoods are found using a single-cluster growth algorithm.

A Percolation-Based Approach to Model DTN Congestion Control

This paper proposes a novel modeling framework based on directed site-bond percolation where sites represent space-time positions of DTN nodes, and bonds are contact opportunities, i.e. Communication links that can be established whenever nodes come in range of each other.

A novel congestion control framework for delay and disruption tolerant networks

Important challenges of DTNs are reviewed and the existing congestion control mechanism of this domain is surveyed and a taxonomy of existing DTN congestion control mechanisms is provided and their strengths and weaknesses are discussed in the context of their assumptions and applicability in DTN applications.

Conductivity simulations of field-grading composites

The electrical conductivity and the percolation threshold of field grading polymer composites intended for high voltage applications were examined with representative elementary volume simulation

References

SHOWING 1-10 OF 12 REFERENCES

Asymmetry in the percolation thresholds of fully penetrable disks with two different radii.

Simulation of continuum gradient percolation of systems of fully penetrable disks of two different radii improves the measurement of thepercolation threshold for disks of equal radius, and improves the difference from symmetry.

Continuum percolation threshold for interpenetrating squares and cubes.

Simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions for objects whose edges are aligned parallel to one another and randomly oriented objects.

Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that

Towards a Better Understanding of Large-Scale Network Models

Through two case studies related to network connectivity on the expected number of isolated nodes and on the vanishing of components of finite order respectively, some subtle but important differences are demonstrated between the infinite network model and the dense and extended network models.

Precise determination of the critical percolation threshold for the three- dimensional ''Swiss cheese'' model using a growth algorithm

Precise values for the critical threshold for the three-dimensional “Swiss cheese” continuum percolation model have been calculated using extensive Monte Carlo simulations. These simulations used a

Cluster size and boundary distribution near percolation threshold

It is shown that the shape of the large, random clusters, near the critical percolation concentration ${c}_{0}$, is such that their mean boundary $〈b〉$ is proportional to their mean bulk $〈n〉$ and

When does content float? Characterizing availability of anchored information in opportunistic content sharing

By means of analytical models, it is shown that an opportunistic content sharing system, without any supporting infrastructure, can be a viable and surprisingly reliable option for content sharing as long as a certain criterion, referred to as the criticality condition, is met.

Scaling corrections: Site percolation and Ising model in three-dimensions

Using finite-size scaling techniques we obtain accurate results for critical quantities of the Ising model and the site percolation, in three dimensions. We pay special attention to parametrizing the

Percolation thresholds in the three-dimensional sticks system

On presente comment le seuil de percolation depend du taux d'aspect et de l'anisotropie macroscopique

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers, which provides a super astronomical period of 2 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words.