Microscopic theory of cooperative spin crossover: Interaction of molecular modes with phonons

In this article, we present a new microscopic theoretical approach to the description of spin crossover in molecular crystals. The spin crossover crystals under consideration are composed of molecular fragments formed by the spin-crossover metal ion and its nearest ligand surrounding and exhibiting well defined localized (molecular) vibrations. As distinguished from the previous models of this phenomenon, the developed approach takes into account the interaction of spin-crossover ions not only with the phonons but also a strong coupling of the electronic shells with molecular modes. This leads to an effective coupling of the local modes with phonons which is shown to be responsible for the cooperative spin transition accompanied by the structural reorganization. The transition is characterized by the two order parameters representing the mean values of the products of electronic diagonal matrices and the coordinates of the local modes for the high- and low-spin states of the spin crossover complex. Finally, we demonstrate that the approach provides a reasonable explanation of the observed spin transition in the [Fe(ptz)6](BF4)2 crystal. The theory well reproduces the observed abrupt low-spin → high-spin transition and the temperature dependence of the high-spin fraction in a wide temperature range as well as the pronounced hysteresis loop. At the same time within the limiting approximations adopted in the developed model, the evaluated high-spin fraction vs. T shows that the cooperative spin-lattice transition proves to be incomplete in the sense that the high-spin fraction does not reach its maximum value at high temperature.

SCAD: Sensor Context-aware Adaptive Duty-cycled Beaconless Opportunistic Routing for WSNs

Low quality of wireless links leads to perpetual transmission failures in lossy wireless environments. To mitigate this problem, opportunistic routing (OR) has been proposed to improve the throughput of wireless multihop ad-hoc networks by taking advantage of the broadcast nature of wireless channels. However, OR can not be directly applied to wireless sensor networks (WSNs) due to some intrinsic design features of WSNs. In this paper, we present a new OR solution for WSNs with suitable adaptations to their characteristics. Our protocol, called SCAD-Sensor Context-aware Adaptive Duty-cycled beaconless opportunistic routing protocol is a cross-layer routing approach and it selects packet forwarders based on multiple sensor context information. To reach a balance between performance and energy-efficiency, SCAD adapts the duty-cycles of sensors according to real-time traffic loads and energy drain rates. We compare SCAD against other protocols through extensive simulations. Evaluation results show that SCAD outperforms other protocols in highly dynamic scenarios.

Adaptive Beaconless Opportunistic Routing for Multimedia Distribution

User experience on watching live videos must be satisfactory even under the inuence of different network conditions and topology changes, such as happening in Flying Ad-Hoc Networks (FANETs). Routing services for video dissemination over FANETs must be able to adapt routing decisions at runtime to meet Quality of Experience (QoE) requirements. In this paper, we introduce an adaptive beaconless opportunistic routing protocol for video dissemination over FANETs with QoE support, by taking into account multiple types of context information, such as link quality, residual energy, buffer state, as well as geographic information and node mobility in a 3D space. The proposed protocol takes into account Bayesian networks to define weight vectors and Analytic Hierarchy Process (AHP) to adjust the degree of importance for the context information based on instantaneous values. It also includes a position prediction to monitor the distance between two nodes in order to detect possible route failure.

Cooperative VET in Training Networks: Analysing the Free-Rider Problem in a Sociology-of-Conventions Perspective

In training networks, particularly small and medium-sized enterprises pool their resources to train apprentices within the framework of the dual VET system, while an intermediary organisation is tasked with managing operations. Over the course of their apprenticeship, the apprentices switch from one training company to another on a (half-) yearly basis. Drawing on a case study of four training networks in Switzerland and the theoretical framework of the sociology of conventions, this paper aims to understand the reasons for the slow dissemination and reluctant adoption of this promising form of organising VET in Switzerland. The results of the study show that the system of moving from one company to another creates a variety of free-rider constellations in the distribution of the collectively generated corporative benefits. This explains why companies are reluctant to participate in this model. For the network to be sustainable, the intermediary organisation has to address discontent arising from free-rider problems while taking into account that the solutions found are always tentative and will often result in new free-rider problems.

WEAVE: Efficient Geographical Routing in Large-Scale Networks

We propose WEAVE, a geographical 2D/3D routing protocol that maintains information on a small number of waypoints and checkpoints for forwarding packets to any destination. Nodes obtain the routing information from partial traces gathered in incoming packets and use a system of checkpoints along with the segments of routes to weave end-to-end paths close to the shortest ones. WEAVE does not generate any control traffic, it is suitable for routing in both 2D and 3D networks, and does not require any strong assumption on the underlying network graph such as the Unit Disk or a Planar Graph. WEAVE compares favorably with existing protocols in both testbed experiments and simulations.

Dynamic Unicast: Information-Centric Multi-hop Routing for Mobile Ad-hoc Networks

Abstract Information-centric networking (ICN) offers new perspectives on mobile ad-hoc communication because routing is based on names but not on endpoint identifiers. Since every content object has a unique name and is signed, authentic content can be stored and cached by any node. If connectivity to a content source breaks, it is not necessarily required to build a new path to the same source but content can also be retrieved from a closer node that provides the same content copy. For example, in case of collisions, retransmissions do not need to be performed over the entire path but due to caching only over the link where the collision occurred. Furthermore, multiple requests can be aggregated to improve scalability of wireless multi-hop communication. In this work, we base our investigations on Content-Centric Networking (CCN), which is a popular {ICN} architecture. While related works in wireless {CCN} communication are based on broadcast communication exclusively, we show that this is not needed for efficient mobile ad-hoc communication. With Dynamic Unicast requesters can build unicast paths to content sources after they have been identified via broadcast. We have implemented Dynamic Unicast in CCNx, which provides a reference implementation of the {CCN} concepts, and performed extensive evaluations in diverse mobile scenarios using NS3-DCE, the direct code execution framework for the {NS3} network simulator. Our evaluations show that Dynamic Unicast can result in more efficient communication than broadcast communication, but still supports all {CCN} advantages such as caching, scalability and implicit content discovery.