Literature Database Entry

misra2023bioblock

Sudip Misra, Saswati Pal and Anandarup Mukherjee, "BioBlock: A Blockchain Analogous Mechanism for Integrity in IoBNT-Based Drug Delivery Systems," IEEE Systems Journal, vol. 17 (1), pp. 1000–1007, March 2023.

Abstract

Internet of Bio-Nano Things-based molecular communication system in nanonetworks is deemed critical for various applications in futuristic health care technologies. In this work, we envisage a new research direction and coin the term—“BioBlock”—a blockchain-inspired nanonetworking security mechanism since the existing macro-scale security solutions are not suitable for nanoscale. Specifically, we propose a biological ledger-based relay model to secure targeted drug delivery without affecting surrounding healthy tissues. In BioBlock, each successful transaction generates a block with genetic signatures of the bionodes in the nanonetwork, which eventually gets validated by the neighboring bionodes. We show the effectiveness of our model regarding energy utilization and information delivery while highlighting the average delay introduced in the network with an increasing level of security. We observe that the information delivery factor in the case of the naive approach is 90.59%, while in the case of a 6-fold secure approach, it is 89.77%. Eventually, we observe that the targeted drug delivery is not affected by the introduction of multifold security.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Sudip Misra
Saswati Pal
Anandarup Mukherjee

BibTeX reference

@article{misra2023bioblock,
    author = {Misra, Sudip and Pal, Saswati and Mukherjee, Anandarup},
    doi = {10.1109/jsyst.2022.3197119},
    title = {{BioBlock: A Blockchain Analogous Mechanism for Integrity in IoBNT-Based Drug Delivery Systems}},
    pages = {1000--1007},
    journal = {IEEE Systems Journal},
    issn = {1932-8184},
    publisher = {IEEE},
    month = {3},
    number = {1},
    volume = {17},
    year = {2023},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.