Searcharxiv⌕ Search

arXiv subjects

Carl P. Dettmann

Publications and source records attributed to Carl P. Dettmann.

At least 55 records · Page 3Linked to original sources

Connectivity of Soft Random Geometric Graphs Over Annuli

Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains.

math.CO↗

Betweenness Centrality in Dense Random Geometric Networks

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how often all paths in the network characterisable as topologically `shortest' contain a given node (betweenness centrality), deriving an expression in terms of a known integral whenever 1) the network boundary is the perimeter of a disk and 2) the network is extremely dense. Our method shows how similar formulas can be obtained for any convex geometry. Numerical corroboration is provided, as well as a discussion of our formula's potential use for cluster head election and boundary detection in densely deployed wireless ad hoc networks.

cs.SI↗

How sticky is the chaos/order boundary?

In dynamical systems with divided phase space, the vicinity of the boundary between regular and chaotic regions is often "sticky," that is, trapping orbits from the chaotic region for long times. Here, we investigate the stickiness in the simplest mushroom billiard, which has a smooth such boundary, but surprisingly subtle behaviour. As a measure of stickiness, we investigate P(t), the probability of remaining in the mushroom cap for at least time t given uniform initial conditions in the chaotic part of the cap. The stickiness is sensitively dependent on the radius of the stem r via the Diophantine properties of rho = (2/π) arccos r. Almost all rho give rise to families of marginally unstable periodic orbits (MUPOs) where P(t) ~ C/t, dominating the stickiness of the boundary. Here we consider the case where rho is MUPO-free and has continued fraction expansion with bounded partial quotients. We show that t^2 P(t) is bounded, varying infinitely often between values whose ratio is at least 32/27. When rho has an eventually periodic continued fraction expansion, that is, a quadratic irrational, t^2 P(t) converges to a log-periodic function. In general, we expect less regular behaviour, with upper and lower exponents lying between 1 and 2. The results may shed light on the parameter dependence of boundary stickiness in annular billiards and generic area preserving maps.

nlin.CD↗

Counting Geodesic Paths in 1D VANETs

In the IEEE 802.11p standard addressing vehicular communications, Basic Safety Messages (BSMs) can be bundled together and relayed as to increase the effective communication range of transmitting vehicles. This process forms a vehicular ad hoc network (VANET) for the dissemination of safety information. The number of "shortest multihop paths" (or geodesics) connecting two network nodes is an important statistic which can be used to enhance throughput, validate threat events, protect against collusion attacks, infer location information, and also limit redundant broadcasts thus reducing interference. To this end, we analytically calculate for the first time the mean and variance of the number of geodesics in 1D VANETs.

cs.NI↗

Universal hitting time statistics for integrable flows

The perceived randomness in the time evolution of "chaotic" dynamical systems can be characterized by universal probabilistic limit laws, which do not depend on the fine features of the individual system. One important example is the Poisson law for the times at which a particle with random initial data hits a small set. This was proved in various settings for dynamical systems with strong mixing properties. The key result of the present study is that, despite the absence of mixing, the hitting times of integrable flows also satisfy universal limit laws which are, however, not Poisson. We describe the limit distributions for "generic" integrable flows and a natural class of target sets, and illustrate our findings with two examples: the dynamics in central force fields and ellipse billiards. The convergence of the hitting time process follows from a new equidistribution theorem in the space of lattices, which is of independent interest. Its proof exploits Ratner's measure classification theorem for unipotent flows, and extends earlier work of Elkies and McMullen.

math-ph↗

Correlated Interference from Uncorrelated Users in Bounded Ad Hoc Networks with Blockage

In this letter, we study the joint impact of user density, blockage density and deployment area on the temporal correlation of interference for static and highly mobile users. We show that even if the user locations become uncorrelated, the interference level can still be correlated when the deployment area is bounded and/or there is blockage. In addition, we study how the correlation coefficients of interference scale at a high density of blockage.

cs.NI↗

Temporal Correlation of Interference in Bounded Mobile Ad Hoc Networks with Blockage

In mobile wireless networks with blockage, different users, and/or a single user at different time slots, may be blocked by some common obstacles. Therefore the temporal correlation of interference does not depend only on the user displacement law but also on the spatial correlation introduced by the obstacles. In this letter, we show that in mobile networks with a high density of users, blockage increases the temporal correlation of interference, while in sparse networks blockage has the opposite effect.

cs.IT↗

Connectivity Scaling Laws in Wireless Networks

We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas exploited for diversity coding and/or beamforming at each node. We demonstrate that the local probability of connectivity scales like $\mathcal{O}(z^\mathcal C)$ in these parameters, where $\mathcal C$ is the ratio of the dimension of the network domain to the path loss exponent, thus enabling efficient boundary effect mitigation and network topology control.

cs.NI↗

Random geometric graphs with general connection functions

In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad-hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r are linked (directly connect). In many applications (not only wireless networks), it is desirable that the graph is connected, that is every node is linked to every other node in a multihop fashion. Here, the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components, for a very general class of connection functions. It turns out that only a few quantities such as moments of the connection function appear. Good agreement is found with special cases from previous studies and with numerical simulations.

cond-mat.stat-mech↗

Directional antennas improve the link-connectivity of interference limited ad hoc networks

We study wireless ad hoc networks in the absence of any channel contention or transmit power control and ask how antenna directivity affects network connectivity in the interference limited regime. We answer this question by deriving closed-form expressions for the outage probability, capacity and mean node degree of the network using tools from stochastic geometry. These novel results provide valuable insights for the design of future ad hoc networks. Significantly, our results suggest that the more directional the interfering transmitters are, the less detrimental are the effects of interference to individual links. We validate our analytical results through computer simulations.

cs.NI↗

Separation of particles leading to decay and unlimited growth of energy in a driven stadium-like billiard

A competition between decay and growth of energy in a time-dependent stadium billiard is discussed giving emphasis in the decay of energy mechanism. A critical resonance velocity is identified for causing of separation between ensembles of high and low energy and a statistical investigation is made using ensembles of initial conditions both above and below the resonance velocity. For high initial velocity, Fermi acceleration is inherent in the system. However for low initial velocity, the resonance allies with stickiness hold the particles in a regular or quasi-regular regime near the fixed points, preventing them from exhibiting Fermi acceleration. Also, a transport analysis along the velocity axis is discussed to quantify the competition of growth and decay of energy and making use distributions of histograms of frequency, and we set that the causes of the decay of energy are due to the capture of the orbits by the resonant fixed points.

nlin.CD↗

More is less: Connectivity in fractal regions

Ad-hoc networks are often deployed in regions with complicated boundaries. We show that if the boundary is modeled as a fractal, a network requiring line of sight connections has the counterintuitive property that increasing the number of nodes decreases the full connection probability. We characterise this decay as a stretched exponential involving the fractal dimension of the boundary, and discuss mitigation strategies. Applications of this study include the analysis and design of sensor networks operating in rugged terrain (e.g. railway cuttings), mm-wave networks in industrial settings and vehicle-to-vehicle/vehicle-to-infrastructure networks in urban environments.

cs.NI↗

Location, location, location: Border effects in interference limited ad hoc networks

Wireless networks are fundamentally limited by the intensity of the received signals and by their inherent interference. It is shown here that in finite ad hoc networks where node placement is modelled according to a Poisson point process and no carrier sensing is employed for medium access, the SINR received by nodes located at the border of the network deployment/operation region is on average greater than the rest. This is primarily due to the uneven interference landscape of such networks which is particularly kind to border nodes giving rise to all sorts of performance inhomogeneities and access unfairness. Using tools from stochastic geometry we quantify these spatial variations and provide closed form communication-theoretic results showing why the receiver's location is so important.

cs.NI↗

Crises in a dissipative Bouncing ball model

The dynamics of a bouncing ball model under the influence of dissipation is investigated by using a two dimensional nonlinear mapping. When high dissipation is considered, the dynamics evolves to different attractors. The evolution of the basins of the attracting fixed points is characterized, as we vary the control parameters. Crises between the attractors and their boundaries are observed. We found that the multiple attractors are intertwined, and when the boundary crisis between their stable and unstable manifolds occur, it creates a successive mechanism of destruction for all attractors originated by the sinks. Also, an impact physical crises is setup, and it may be useful as a mechanism to reduce the number of attractors in the system.

nlin.CD↗

Network connectivity in non-convex domains with reflections

Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks but has largely focused on convex deployment regions. We consider here a scenario of practical importance to wireless communications, in which one or more nodes are located outside the convex space where the remaining nodes reside. We call these `external nodes', and assume that they play some essential role in the macro network functionality e.g. a gateway to a dense self-contained mesh network cloud. Conventional approaches with the underlying assumption of only line-of-sight (LOS) or direct connections between nodes, fail to provide the correct analysis for such a network setup. To this end we present a novel analytical framework that accommodates for the non-convexity of the domain and explicitly considers the effects of non-LOS nodes through reflections from the domain boundaries. We obtain analytical expressions in 2D and 3D which are confirmed numerically for Rician channel fading statistics and discuss possible extensions and applications.

cs.NI↗

Survival Probability for Open Spherical Billiards

We study the survival probability for long times in an open spherical billiard, extending previous work on the circular billiard. We provide details of calculations regarding two billiard configurations, specifically a sphere with a circular hole and a sphere with a square hole. The constant terms of the long-term survival probability expansions have been derived analytically. Terms that vanish in the long time limit are investigated analytically and numerically, leading to connections with the Riemann hypothesis.

nlin.CD↗

Diffusion in the Lorentz gas

The Lorentz gas, a point particle making mirror-like reflections from an extended collection of scatterers, has been a useful model of deterministic diffusion and related statistical properties for over a century. This survey summarises recent results, including periodic and aperiodic models, finite and infinite horizon, external fields, smooth or polygonal obstacles, and in the Boltzmann-Grad limit. New results are given for several moving particles and for obstacles with flat points. Finally, a variety of applications are presented.

nlin.CD↗

Escape through a time-dependent hole in the doubling map

We investigate the escape dynamics of the doubling map with a time-periodic hole. We use Ulam's method to calculate the escape rate as a function of the control parameters. We consider two cases, oscillating or breathing holes, where the sides of the hole are moving in or out of phase respectively. We find out that the escape rate is well described by the overlap of the hole with its images, for holes centred at periodic orbits.

nlin.CD↗