Symbol Synchronization for Diffusion-Based Molecular Communications

TL;DR

This paper develops and compares multiple symbol synchronization schemes for molecular communication systems, addressing practical challenges like lack of internal clocks and variable symbol intervals, and evaluates their performance and complexity.

Contribution

It introduces novel synchronization frameworks for MC systems considering realistic constraints, deriving optimal and low-complexity schemes for reliable detection.

Findings

Optimal ML synchronization schemes serve as performance benchmarks.

Low-complexity schemes are effective for resource-limited MC systems.

Synchronization errors significantly impact detection accuracy.

Abstract

Symbol synchronization refers to the estimation of the start of a symbol interval and is needed for reliable detection. In this paper, we develop several symbol synchronization schemes for molecular communication (MC) systems where we consider some practical challenges which have not been addressed in the literature yet. In particular, we take into account that in MC systems, the transmitter may not be equipped with an internal clock and may not be able to emit molecules with a fixed release frequency. Such restrictions hold for practical nanotransmitters, e.g. modified cells, where the lengths of the symbol intervals may vary due to the inherent randomness in the availability of food and energy for molecule generation, the process for molecule production, and the release process. To address this issue, we develop two synchronization-detection frameworks which both employ two types of molecule. In the first framework, one type of molecule is used for symbol synchronization and the other one is used for data detection, whereas in the second framework, both types of molecule are used for joint symbol synchronization and data detection. For both frameworks, we first derive the optimal maximum likelihood (ML) symbol synchronization schemes as performance upper bounds. Since ML synchronization entails high complexity, for each framework, we also propose three low-complexity suboptimal schemes, namely a linear filter-based scheme, a peak observation-based scheme, and a threshold-trigger scheme which are suitable for MC systems with limited computational capabilities. Furthermore, we study the relative complexity and the constraints associated with the proposed schemes and the impact of the insertion and deletion errors that arise due to imperfect synchronization.