Enhancing the Reliability of Large-Scale Multiuser Molecular Communication Systems

被引:0
|
作者
Dissanayake, Maheshi Buddhinee [1 ]
Deng, Yansha [2 ]
Nallanathan, Arumugam [3 ]
Elkashlan, Maged [3 ]
Mitra, Urbashi [4 ]
机构
[1] Univ Peradeniya, Dept Elect & Elect Engn, Fac Engn, Peradeniya, Sri Lanka
[2] Kings Coll London, Dept Informat, London, England
[3] Queen Mary Univ London, Sch Elect Engn & Comp Sci, London, England
[4] Univ Southern Calif, Dept Elect Engn, Los Angeles, CA 90089 USA
关键词
Large-scale molecular communication system; Partially absorbing receiver; Intersymbol interference; multi-user interference; Reed Solomon Codes; CODES;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In recent years, conveying information using molecules via diffusion has attracted significant interest in micro and nanoscale applications. Yet, very little research have been conducted on the performance analysis of large-scale molecular communication (MC) systems with swarm of interfering receivers. In this type of MC system, the collective signal strength at a desired receiver can be impaired by the interference caused by other MC transmitters. The paper presents the first tractable analytical framework for the collective signal strength at a partially absorbing receiver due to a desired transmitter under the impact of a swarm of interfering transmitters in a three-dimensional (3D) large-scale MC system using stochastic geometry. We propose Reed Solomon (RS) coding as an error correction technique to combat the effects of interference caused by the multiple transmitters and the delayed molecules from the previous bits. We derive analytical expressions for the bit error probability (BEP) to evaluate the level of reliability that can be achieved by the proposed scheme. The results obtained using Monte Carlo simulations, matched extactly with the anlytical results, justifying the accuracy of the derivations. Results reveal that the RS codes are capable of providing an acceptable level of improvement in terms of BEP. Furthermore, by carefully selecting the code length, n, and the message length, k, of the RS(n, k) code, we can fine tune the BEP improvement to match the system requirements.
引用
收藏
页码:825 / 829
页数:5
相关论文
共 50 条
  • [1] Interference Mitigation in Large-Scale Multiuser Molecular Communication
    Dissanayake, Maheshi Buddhinee
    Deng, Yansha
    Nallanathan, Arumugam
    Elkashlan, Maged
    Mitra, Urbashi
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (06) : 4088 - 4103
  • [3] Reliability of large-scale communication networks with additive structure
    Gadasin, VA
    Gadasin, DV
    AUTOMATION AND REMOTE CONTROL, 1997, 58 (01) : 130 - 140
  • [4] Generalized Spatial Modulation in Large-Scale Multiuser MIMO Systems
    Narasimhan, T. Lakshmi
    Raviteja, P.
    Chockalingam, A.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (07) : 3764 - 3779
  • [5] LARGE-SCALE SYSTEMS - STABILITY, COMPLEXITY, RELIABILITY
    SILJAK, DD
    VUKCEVIC, MB
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1976, 301 (1-2): : 49 - 69
  • [6] ACHIEVING RELIABILITY IN LARGE-SCALE SOFTWARE SYSTEMS
    SCHICK, GJ
    WOLVERTON, RW
    PROCEEDINGS ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM, 1974, 7 (02): : 302 - 319
  • [7] Legal reliability in large-scale distributed systems
    Sommer, P
    SEVENTEENTH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 1998, : 416 - 421
  • [8] ACIS-Hierarchy: Enhancing community communication delay for large-scale information systems
    Ragab, K
    Mori, K
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2004, E87B (07) : 1797 - 1805
  • [9] Enhancing Data Reliability in TOMAHAQ for Large-Scale Protein Quantification
    Liu, Fang
    Singhal, Kratika
    Matney, Rowan
    Acharya, Swati
    Akdis, Cezmi A.
    Nadeau, Kari C.
    Chien, Allis S.
    Leib, Ryan D.
    PROTEOMICS, 2020, 20 (11)
  • [10] Stability Analysis for Large-Scale Multi-Agent Molecular Communication Systems
    Kotsuka, Taishi
    Hori, Yutaka
    IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2024, 23 (03) : 507 - 517