With much advancement in the field of nanotechnology, bioengineering, and synthetic biology over the past decade, microscales and nanoscales devices are becoming a reality. Yet the problem of engineering a reliable communication system between tiny devices is still an open problem. At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it difficult or expensive to reach. Points of interest in industry, cities, and medical applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio waves and microwaves, or they are located in such a way that directional high frequency systems are ineffective. Inspired by nature, one solution to these problems is molecular communication (MC), where chemical signals are used to transfer information. Although biologists have studied MC for decades, it has only been researched for roughly 10 year from a communication engineering lens. Significant number of papers have been published to date, but owing to the need for interdisciplinary work, much of the results are preliminary. In this survey, the recent advancements in the field of MC engineering are highlighted. First, the biological, chemical, and physical processes used by an MC system are discussed. This includes different components of the MC transmitter and receiver, as well as the propagation and transport mechanisms. Then, a comprehensive survey of some of the recent works on MC through a communication engineering lens is provided. The survey ends with a technology readiness analysis of MC and future research directions.

/pdf/a-comprehensive-survey-of-recent-advancements-in-molecular-2pjzig1xwb.pdf

A Comprehensive Survey of Recent Advancements in Molecular Communication

Cryptosystems I.- On Ideal Lattices and Learning with Errors over Rings.- Fully Homomorphic Encryption over the Integers.- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups.- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.- Obfuscation and Side Channel Security.- Secure Obfuscation for Encrypted Signatures.- Public-Key Encryption in the Bounded-Retrieval Model.- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases.- 2-Party Protocols.- Partial Fairness in Secure Two-Party Computation.- Secure Message Transmission with Small Public Discussion.- On the Impossibility of Three-Move Blind Signature Schemes.- Efficient Device-Independent Quantum Key Distribution.- Cryptanalysis.- New Generic Algorithms for Hard Knapsacks.- Lattice Enumeration Using Extreme Pruning.- Algebraic Cryptanalysis of McEliece Variants with Compact Keys.- Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds.- IACR Distinguished Lecture.- Cryptography between Wonderland and Underland.- Automated Tools and Formal Methods.- Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others.- Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR.- Computational Soundness, Co-induction, and Encryption Cycles.- Models and Proofs.- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.- Cryptographic Agility and Its Relation to Circular Encryption.- Bounded Key-Dependent Message Security.- Multiparty Protocols.- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography.- Adaptively Secure Broadcast.- Universally Composable Quantum Multi-party Computation.- Cryptosystems II.- A Simple BGN-Type Cryptosystem from LWE.- Bonsai Trees, or How to Delegate a Lattice Basis.- Efficient Lattice (H)IBE in the Standard Model.- Hash and MAC.- Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation.- Stam's Collision Resistance Conjecture.- Universal One-Way Hash Functions via Inaccessible Entropy.- Foundational Primitives.- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.- Constructing Verifiable Random Functions with Large Input Spaces.- Adaptive Trapdoor Functions and Chosen-Ciphertext Security.

Advances in cryptology -- EUROCRYPT 2010 : 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010 : proceedings

Spectrum sensing, spectrum decision, spectrum sharing, and spectrum mobility are four major functions of cognitive radio systems. Spectrum sensing is utilized to observe the spectrum occupancy status and recognize the channel availability, while CR users dynamically access the available channels through the regulation processes of spectrum decision, spectrum sharing, and spectrum mobility. To alleviate the processing delays involved in these four functions and to improve the efficiency of spectrum utilization, spectrum prediction for cognitive radio networks has been extensively studied in the literature. This article surveys the state of the art of spectrum prediction in cognitive radio networks. We summarize the major spectrum prediction techniques, illustrate their applications, and present the relevant open research challenges.

/pdf/spectrum-prediction-in-cognitive-radio-networks-2lf87kaopc.pdf

Spectrum prediction in cognitive radio networks

Many applications in scientific and engineering domains are structured as large numbers of independent tasks with low granularity. These applications are thus amenable to straightforward parallelization, typically in master-worker fashion, provided that efficient scheduling strategies are available. Such applications have been called divisible-loads because a scheduler may divide the computation among worker processes arbitrarily, both in terms of number of tasks and of task sizes. Divisible load scheduling has been an active area of research for the last 15 years. A vast literature offers results and scheduling algorithms for various models of the underlying distributed computing platform. Broad surveys are available that report on, accomplishments in the field. By contrast, We propose a unified theoretical perspective that synthesizes previously published results, several novel results, and open questions, in a view to foster hover divisible load scheduling research. Specifically, we discuss both one-round and multiround algorithms, and we restrict our scope to the popular star and tree network topologies, which we study with both linear and affine cost models for communication and computation.

/pdf/scheduling-divisible-loads-on-star-and-tree-networks-results-17yamie90j.pdf

Scheduling divisible loads on star and tree networks: results and open problems

Spectrum handoff in cognitive radio networks

https://personals.ac.upc.edu/llatser/docs/simpat.pdf

N3Sim: Simulation framework for diffusion-based molecular communication nanonetworks

With the advent of digital TV and interactive multimedia over broadband networks, the need for high performance computing for broadcasting is stronger than ever. Processing a digital video sequence requires considerable computing. One of the ways to cope with the demands of video processing in real-time, we believe, is parallel processing. Scheduling plays an important role in parallel processing especially for video processing applications which are usually bounded by the data bandwidth of the transmission medium. Although periodic real-time scheduling algorithms have been under research for more than a decade, scheduling for continuous data streams and impact of scheduling on communication performance are still unexplored. In this paper we examine periodic real-time scheduling assuming that the application is communication constrained where input and output data sizes are not equal.

/pdf/optimal-scheduling-algorithms-for-communication-constrained-3l45uch1do.pdf

Optimal Scheduling Algorithms for Communication Constrained Parallel Processing

Wireless technology has enabled the development of increasingly diverse applications and devices resulting in an exponential growth in usage and services. These advancements made the radio frequency spectrum a scarce resource, and consequently, its efficient use is of the ultimate importance. To cope with the growing demand, network design focused on increasing the spectral efficiency by making use of advancement in Cognitive Radio technology. Cognitive Radio can reduce the spectrum shortage problem by enabling unlicensed users equipped with Cognitive Radios to reuse and share the licensed spectrum bands. Using the fact that a Cognitive Radio is capable of sensing the environmental conditions and automatically adapting its operating parameters in order to enhance network performance, we would like to make use of its knowledge to predict the mobility of Cognitive Radio users to improve the overall performance of the Cognitive Radio network. This study makes novel use of mobility prediction techniques to enhance reliability, bandwidth efficiency and scalability of the cognitive radio networks. Firstly, prediction techniques are evaluated and compared for prediction accuracy. Secondly, routing protocol reliability, efficiency and scalability performances are evaluated under different prediction techniques. Simulation results verify the performance improvements even with moderate accuracy predictors. Results clearly show that hybrid Markov CDF prediction performs the best. When compared with no prediction it significantly improves average reliability and efficiency by 11% and 8%, respectively.

/pdf/impact-of-mobility-prediction-on-the-performance-of-489bgt090x.pdf

Impact of mobility prediction on the performance of Cognitive Radio networks

Self adaptive routing for dynamic spectrum access in cognitive radio networks

Advancement of Cognitive Radio technology can remedy the problems encountered from bandwidth and spectrum access limitations. In Cognitive Radio Ad Hoc Networks routing is one of the most important issues to be addressed and desires deep investigation. Previously proposed routing protocols assume the presence of a connected path from the source to the destination. In some scenarios, due to the characteristics of ad hoc networks and the features of the used cognitive radios, this assumption is likely to be invalid. In this study, a novel routing algorithm for future multi-hop Cognitive Radio Networks is proposed. The main motivation is to maximize data rates and minimize data delivery latency for a set of user communication sessions to deliver messages for the case where there is no connected path from the source to the destination or when network is partitioned at the time a message is originated. Experimental evaluations are performed in the ns2 simulator. It has been shown that the proposed approach provides better adaptability to the environment and maximizes throughput in a number of realistic scenarios and outperforms recently proposed routing protocols for Cognitive Radio networks.

/pdf/racon-a-routing-protocol-for-mobile-cognitive-radio-networks-4xkmq9wlhc.pdf

D. Turgay Altilar

Papers

N3Sim: Simulation framework for diffusion-based molecular communication nanonetworks

Optimal Scheduling Algorithms for Communication Constrained Parallel Processing

Impact of mobility prediction on the performance of Cognitive Radio networks

Self adaptive routing for dynamic spectrum access in cognitive radio networks

RACON: a routing protocol for mobile cognitive radio networks