Theoretical models of planetary system formation II. Post-formation evolution

Aims. We extend the results of planetary formation synthesis by computing the long-term evolution of synthetic systems from the clearing of the gas disk into the dynamical evolution phase. Methods. We use the symplectic integrator SyMBA to numerically integrate the orbits of planets for 100 Myr, using populations from previous studies as initial conditions. Results. We show that within the populations studied, mass and semimajor axis distributions experience only minor changes from post-formation evolution. We also show that, depending upon their initial distribution, planetary eccentricities can statistically increase or decrease as a result of gravitational interactions. We find that planetary masses and orbital spacings provided by planet formation models do not result in eccentricity distributions comparable to observed exoplanet eccentricities, requiring other phenomena, such as stellar fly-bys, to account for observed eccentricities.

Enhanced Caching Strategies At the Edge of LTE Mobile Networks

With a boom in the usage of mobile devices for traffic-heavy applications, mobile networks struggle to deliver good performance while saving resources to support more users and save on costs. In this paper, we propose enhanced strategies for the preemptive migration of content stored in Information-Centric Networking caches at the edge of LTE mobile networks. With such strategies, the concept of content following the users interested in it becomes a reality and content within caches is more optimized towards the requests of nearby users. Results show that the strategies are feasible, efficient and, when compared to default caching strategies, ensure that content is delivered faster to end users while using bandwidth and storage resources more efficiently at the core of the network.

Fine-grained Indoor Tracking by Fusing Inertial Sensor and Physical Layer Information in WLANs

Indoor positioning has become an emerging research area because of huge commercial demands for location-based services in indoor environments. Channel State Information (CSI) as fine-grained physical layer information has been recently proposed to achieve high positioning accuracy by using range based methods, e.g., trilateration. In this work, we propose to fuse the CSI-based ranging and velocity estimated from inertial sensors by an enhanced particle filter to achieve highly accurate tracking. The algorithm relies on some enhanced ranging methods and further mitigates the remaining ranging errors by a weighting technique. Additionally, we provide an efficient method to estimate the velocity based on inertial sensors. The algorithms are designed in a network-based system, which uses rather cheap commercial devices as anchor nodes. We evaluate our system in a complex environment along three different moving paths. Our proposed tracking method can achieve 1.3m for mean accuracy and 2.2m for 90% accuracy, which is more accurate and stable than pedestrian dead reckoning and range-based positioning.

Trends in Human-Centric Multimedia Networking Scenarios

The evolution of wireless access technologies and mobile devices, together with the constant demand for video services, has created new Human-Centric Multimedia Networking (HCMN) scenarios. However, HCMN poses several challenges for content creators and network providers to deliver multimedia data with an acceptable quality level based on the user experience. Moreover, human experience and context, as well as network information play an important role in adapting and optimizing video dissemination. In this paper, we discuss trends to provide video dissemination with Quality of Experience (QoE) support by integrating HCMN with cloud computing approaches. We identified five trends coming from such integration, namely Participatory Sensor Networks, Mobile Cloud Computing formation, QoE assessment, QoE management, and video or network adaptation.

Information-centric communication in mobile and wireless networks

Information-centric networking (ICN) is a new communication paradigm that has been proposed to cope with drawbacks of host-based communication protocols, namely scalability and security. In this thesis, we base our work on Named Data Networking (NDN), which is a popular ICN architecture, and investigate NDN in the context of wireless and mobile ad hoc networks. In a first part, we focus on NDN efficiency (and potential improvements) in wireless environments by investigating NDN in wireless one-hop communication, i.e., without any routing protocols. A basic requirement to initiate informationcentric communication is the knowledge of existing and available content names. Therefore, we develop three opportunistic content discovery algorithms and evaluate them in diverse scenarios for different node densities and content distributions. After content names are known, requesters can retrieve content opportunistically from any neighbor node that provides the content. However, in case of short contact times to content sources, content retrieval may be disrupted. Therefore, we develop a requester application that keeps meta information of disrupted content retrievals and enables resume operations when a new content source has been found. Besides message efficiency, we also evaluate power consumption of information-centric broadcast and unicast communication. Based on our findings, we develop two mechanisms to increase efficiency of information-centric wireless one-hop communication. The first approach called Dynamic Unicast (DU) avoids broadcast communication whenever possible since broadcast transmissions result in more duplicate Data transmissions, lower data rates and higher energy consumption on mobile nodes, which are not interested in overheard Data, compared to unicast communication. Hence, DU uses broadcast communication only until a content source has been found and then retrieves content directly via unicast from the same source. The second approach called RC-NDN targets efficiency of wireless broadcast communication by reducing the number of duplicate Data transmissions. In particular, RC-NDN is a Data encoding scheme for content sources that increases diversity in wireless broadcast transmissions such that multiple concurrent requesters can profit from each others’ (overheard) message transmissions. If requesters and content sources are not in one-hop distance to each other, requests need to be forwarded via multi-hop routing. Therefore, in a second part of this thesis, we investigate information-centric wireless multi-hop communication. First, we consider multi-hop broadcast communication in the context of rather static community networks. We introduce the concept of preferred forwarders, which relay Interest messages slightly faster than non-preferred forwarders to reduce redundant duplicate message transmissions. While this approach works well in static networks, the performance may degrade in mobile networks if preferred forwarders may regularly move away. Thus, to enable routing in mobile ad hoc networks, we extend DU for multi-hop communication. Compared to one-hop communication, multi-hop DU requires efficient path update mechanisms (since multi-hop paths may expire quickly) and new forwarding strategies to maintain NDN benefits (request aggregation and caching) such that only a few messages need to be transmitted over the entire end-to-end path even in case of multiple concurrent requesters. To perform quick retransmission in case of collisions or other transmission errors, we implement and evaluate retransmission timers from related work and compare them to CCNTimer, which is a new algorithm that enables shorter content retrieval times in information-centric wireless multi-hop communication. Yet, in case of intermittent connectivity between requesters and content sources, multi-hop routing protocols may not work because they require continuous end-to-end paths. Therefore, we present agent-based content retrieval (ACR) for delay-tolerant networks. In ACR, requester nodes can delegate content retrieval to mobile agent nodes, which move closer to content sources, can retrieve content and return it to requesters. Thus, ACR exploits the mobility of agent nodes to retrieve content from remote locations. To enable delay-tolerant communication via agents, retrieved content needs to be stored persistently such that requesters can verify its authenticity via original publisher signatures. To achieve this, we develop a persistent caching concept that maintains received popular content in repositories and deletes unpopular content if free space is required. Since our persistent caching concept can complement regular short-term caching in the content store, it can also be used for network caching to store popular delay-tolerant content at edge routers (to reduce network traffic and improve network performance) while real-time traffic can still be maintained and served from the content store.

On the Density and the Volume Density Property

This article gives a short introduction into the notions of density property (DP) and volume density property (VDP). Moreover we develop an effective criterion of verifying whether a given X has VDP. As an application of this method we give a new proof of the basic fact that the product of two Stein manifolds with VDP admits VDP.

An Oka principle for equivariant isomorphisms

Let G be a reductive complex Lie group acting holomorphically on normal Stein spaces X and Y, which are locally G-biholomorphic over a common categorical quotient Q. When is there a global G-biholomorphism X → Y? If the actions of G on X and Y are what we, with justification, call generic, we prove that the obstruction to solving this local-to-global problem is topological and provide sufficient conditions for it to vanish. Our main tool is the equivariant version of Grauert's Oka principle due to Heinzner and Kutzschebauch. We prove that X and Y are G-biholomorphic if X is K-contractible, where K is a maximal compact subgroup of G, or if X and Y are smooth and there is a G-diffeomorphism ψ : X → Y over Q, which is holomorphic when restricted to each fibre of the quotient map X → Q. We prove a similar theorem when ψ is only a G-homeomorphism, but with an assumption about its action on G-finite functions. When G is abelian, we obtain stronger theorems. Our results can be interpreted as instances of the Oka principle for sections of the sheaf of G-biholomorphisms from X to Y over Q. This sheaf can be badly singular, even for a low-dimensional representation of SL2(ℂ). Our work is in part motivated by the linearisation problem for actions on ℂn. It follows from one of our main results that a holomorphic G-action on ℂn, which is locally G-biholomorphic over a common quotient to a generic linear action, is linearisable.

The algebraic density property for affine toric varieties

In this paper we generalize the algebraic density property to not necessarily smooth affine varieties relative to some closed subvariety containing the singular locus. This property implies the remarkable approximation results for holomorphic automorphisms of the Andersén–Lempert theory. We show that an affine toric variety X satisfies this algebraic density property relative to a closed T-invariant subvariety Y if and only if X∖Y≠TX∖Y≠T. For toric surfaces we are able to classify those which possess a strong version of the algebraic density property (relative to the singular locus). The main ingredient in this classification is our proof of an equivariant version of Brunella's famous classification of complete algebraic vector fields in the affine plane.

Holomorphic Automorphisms of Danielewski Surfaces II: Structure of the Overshear Group

We apply Nevanlinna theory for algebraic varieties to Danielewski surfaces and investigate their group of holomorphic automorphisms. Our main result states that the overshear group, which is known to be dense in the identity component of the holomorphic automorphism group, is a free product.

Free dense subgroups of holomorphic automorphisms

We show the existence of free dense subgroups, generated by two elements, in the holomorphic shear and overshear group of complex-Euclidean space and extend this result to the group of holomorphic automorphisms of Stein manifolds with the density property, provided there exists a generalized translation. The conjugation operator associated to this generalized translation is hypercyclic on the topological space of holomorphic automorphisms.

A note on the stable equivalence problem

We provide counterexamples to the stable equivalence problem in every dimension d ≥ 2. That means that we construct hypersurfaces H₁ , H₂ ⊂ C d+1 whose cylinders H₁ × C and H₂ × C are equivalent hypersurfaces in C d+2 , although H₁ and H₂ themselves are not equivalent by an automorphism of C d+1 . We also give, for every d ≥ 2, examples of two non-isomorphic algebraic varieties of dimension d which are biholomorphic.