[Paper Review] Convex Optimization of Distributed Cooperative Detection in Multi-Receiver Molecular Communication

Yuting Fang, Adam Noel+3 more|arXiv (Cornell University)|Nov 17, 2016

Molecular Communication and Nanonetworks24 references3 citations

TL;DR

This paper proposes a convex optimization framework for distributed cooperative detection in multi-receiver molecular communication systems, where K receivers make local hard decisions and report to a fusion center (FC) using an N-out-of-K fusion rule. By deriving convex approximations of the global error probability under perfect and noisy reporting, the authors formulate suboptimal convex optimization problems to jointly optimize receiver and FC decision thresholds, achieving near-optimal error performance with guaranteed convergence.

ABSTRACT

In this paper, the error performance achieved by cooperative detection among K distributed receivers in a diffusion-based molecular communication (MC) system is analyzed and optimized. In this system, the receivers first make local hard decisions on the transmitted symbol and then report these decisions to a fusion center (FC). The FC combines the local hard decisions to make a global decision using an N-out-of-K fusion rule. Two reporting scenarios, namely, perfect reporting and noisy reporting, are considered. Closed-form expressions are derived for the expected global error probability of the system for both reporting scenarios. New approximated expressions are also derived for the expected error probability. Convex constraints are then found to make the approximated expressions jointly convex with respect to the decision thresholds at the receivers and the FC. Based on such constraints, suboptimal convex optimization problems are formulated and solved to determine the optimal decision thresholds which minimize the expected error probability of the system. Numerical and simulation results reveal that the system error performance is greatly improved by combining the detection information of distributed receivers. They also reveal that the solutions to the formulated suboptimal convex optimization problems achieve near-optimal global error performance.

Motivation & Objective

• To analyze and optimize the error performance of distributed cooperative detection in diffusion-based molecular communication systems with multiple receivers.
• To address the lack of active cooperation among multiple receivers in existing molecular communication models, which limits reliability in long-distance or noisy environments.
• To develop a tractable optimization framework that jointly optimizes decision thresholds at individual receivers and the fusion center to minimize global error probability.
• To ensure computational feasibility by deriving convex approximations of the error probability, enabling efficient solution via convex optimization.

Proposed method

• Models a multi-receiver molecular communication system where each receiver makes a local hard decision based on observed molecule counts.
• Introduces a fusion center (FC) that combines local decisions using an N-out-of-K fusion rule to make a global decision.
• Derives closed-form expressions for the expected global error probability under both perfect and noisy reporting scenarios.
• Proposes approximated error probability expressions that are jointly convex with respect to receiver and FC decision thresholds.
• Establishes convex constraints (via bounds on thresholds) to ensure the approximated error function is jointly convex, enabling efficient optimization.
• Solves suboptimal convex optimization problems to determine optimal decision thresholds that minimize the expected global error probability.

Experimental results

Research questions

• RQ1 How does cooperative detection among multiple distributed receivers improve error performance in diffusion-based molecular communication systems?
• RQ2 What is the impact of reporting reliability—perfect vs. noisy—on the global error probability in a multi-receiver molecular communication setup?
• RQ3 Can the global error probability be approximated in a way that enables joint convex optimization of receiver and fusion center decision thresholds?
• RQ4 What constraints ensure the approximated error function remains convex with respect to both receiver and fusion center thresholds?
• RQ5 How close to optimal is the error performance achieved by the proposed convex optimization framework?

Key findings

• The proposed convex optimization framework achieves near-optimal global error performance, significantly improving reliability compared to non-cooperative detection.
• The system error performance is substantially enhanced by combining decisions from multiple distributed receivers, especially in low-signal regimes.
• The approximated error probability expressions are jointly convex with respect to receiver and fusion center thresholds under the derived constraints, enabling efficient optimization.
• Numerical results confirm that the suboptimal solutions to the convex optimization problems closely approach the theoretical optimum, with minimal performance loss.
• The framework is robust under both perfect and noisy reporting conditions, with the noisy reporting case showing a small but manageable performance degradation.
• The use of bounds on decision thresholds ensures the Hessian of the approximated error function remains positive semi-definite, preserving convexity and convergence guarantees.