Distributed Atomic Polarizabilities of Amino Acids and their Hydrogen-Bonded Aggregates

With the purpose of rational design of optical materials, distributed atomic polarizabilities of amino acid molecules and their hydrogen-bonded aggregates are calculated in order to identify the most efficient functional groups, able to buildup larger electric susceptibilities in crystals. Moreover, we carefully analyze how the atomic polarizabilities depend on the one-electron basis set or the many-electron Hamiltonian, including both wave function and density functional theory methods. This is useful for selecting the level of theory that best combines high accuracy and low computational costs, very important in particular when using the cluster method to estimate susceptibilities of molecular-based materials.

Assessment of a robust opportunistic routing for video transmission in dynamic topologies

Mobile multimedia ad hoc services run on dynamic topologies due to node mobility or failures and wireless channel impairments. A robust routing service must adapt to topology changes with the aim of recovering or maintaining the video quality level and reducing the impact of the user's experience. In those scenarios, beacon-less Opportunistic Routing (OR) increases the robustness by supporting routing decisions in a completely distributed manner based on protocol-specific characteristics. However, the existing beacon-less OR approaches do not efficiently combine multiple metrics for forwarding selection, which cause higher packet loss rate, and consequently reduce the video quality level. In this paper, we assess the robustness and reliability of our recently developed OR protocol under node failures, called cross-layer Link quality and Geographical-aware OR protocol (LinGO). Simulation results show that LinGO achieves multimedia dissemination with QoE support and robustness in scenarios with dynamic topologies.

BitWorker, a Decentralized Distributed Computing System based on BitTorrent

In this paper we present BitWorker, a platform for community distributed computing based on BitTorrent. Any splittable task can be easily specified by a user in a meta-information task file, such that it can be downloaded and performed by other volunteers. Peers find each other using Distributed Hash Tables, download existing results, and compute missing ones. Unlike existing distributed computing schemes relying on centralized coordination point(s), our scheme is totally distributed, therefore, highly robust. We evaluate the performance of BitWorker using mathematical models and real tests, showing processing and robustness gains. BitWorker is available for download and use by the community.