Towards Practical and Scalable Molecular Networks
Jiaming Wang, Sevda Ögüt, Haitham Al-Hassanieh, Bhuvana Krishnaswamy
摘要
Molecular networks have the potential to enable bio-implants and biological nano-machines to communicate inside the human body. Molecular networks send and receive data between nodes by releasing molecules into the bloodstream. In this work, we explore how we can scale molecular networks from a single transmitter single receiver paradigm to multiple transmitters that can concurrently send data to a receiver. We identify unique challenges in enabling multiple access in molecular networks that prevent us from using standard multiple access protocols. These challenges include the lack of synchronization and feedback, the non-negativity of molecular signals, the extremely long tail of the molecular channel leading to high ISI (Inter-Symbol-Interference), and the limited types of molecules that can be used for communication. We present MoMA (Molecular Multiple Access), a protocol that enables a molecular network with multiple transmitters. We introduce packet detection, channel estimation, and encoding/decoding schemes that leverage the unique properties of molecular networks to address the above challenges. We evaluate MoMA on a synthetic experimental testbed and demonstrate that it can scale up to four transmitters while significantly outperforming the state-of-the-art.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- Heartbeat Aware Decoding in Molecular NetworksJiaming Wang, Samin Beheshti Zavareh, Haitham Hassanieh, Bhuvana KrishnaswamyINFOCOM 2025
- A Theory of Goal-Oriented Medium Access: Protocol Design and Distributed Bandit LearningFederico Chiariotti, Andrea ZanellaINFOCOM 2026 · 被引用 2 次
- Expert-Inspired Multi-Agent Coordination for Multi-Objective Molecular OptimizationDaojian Zeng, Tianle Li, Jiahao Yang, Jiacai Yi 等AAAI 2026
- MOMA: Multi-Object Multi-Actor Activity ParsingZelun Luo, Wanze Xie, Siddharth Kapoor, Yiyun Liang 等NeurIPS 2021 · 被引用 34 次
- Graph Similarity Description: How Are These Graphs Similar?Corinna Coupette, Jilles VreekenKDD 2021 · 被引用 13 次
