Nanonetworks (eBook)

The Future of Communication and Computation

Florian-Lennert A. Lau (Autor)

eBook Download: EPUB

2024 | 1. Auflage
384 Seiten
Wiley-IEEE Press (Verlag)
978-1-394-21312-2 (ISBN)

Learn the basics-and more-of nanoscale computation and communication in this emerging and interdisciplinary field

The field of nanoscale computation and communications systems is a thriving and interdisciplinary research area which has made enormous strides in recent years. A working knowledge of nanonetworks, their conceptual foundations, and their applications is an essential tool for the next generation of scientists and network engineers. Nanonetworks: The Future of Communication and Computation offers a thorough, accessible overview of this subject rooted in extensive research and teaching experience. Offering a concise and intelligible introduction to the key paradigms of nanoscale computation and communications, it promises to become a cornerstone of education in these fast-growing areas.

Readers will also find:

Detailed treatment of topics including network paradigms, machine learning, safety and security
Coverage of the history, applications, and important theories of nanonetworks research
Examples and use-cases for all formulas and equations

Nanonetworks is ideal for advanced undergraduate and graduate students in engineering and science, as well as practicing professionals looking for an introductory book to help them understand the foundations of nanonetwork systems.

Florian-Lennert A. Lau, PhD, MSc, obtained his MSc in 2016 and his PhD in 2020 from the Universität zu Lübeck, winning the KuVS award for the best Ph.D. thesis. He has been Head of the Nano Group since November 2021. His research interests cover self-assembly systems, nanonetworks, algorithmics, computational complexity theory, modelling human learning, human consciousness & logical inference systems, and distributed AI-systems.

List of Figures

Figure 1.1 Soccer Ball vs. Earth
Figure 1.2 Size Comparison Between Different Structures
Figure 1.3 Mindmap of Nanotechnologies
Figure 1.4 Electric Nanorobot
Figure 2.2 Early Chopping Tools
Figure 2.2 A 200 000-year-old hand ax (a) and a 30 000-year-old statue (b)
Figure 2.3 Ancient Egypt Potter’s Wheel
Figure 2.4 Damascene steel
Figure 2.5 The Germanic sword “Ulfberth”
Figure 2.6 Small Scale Manufacturing Methods
Figure 2.7 Healthy and Cancerous Cells in Comparison
Figure 2.8 3D-Printed Micro Structure
Figure 2.9 Some Allotropes of Carbon
Figure 2.10 An Array of Microbots
Figure 2.11 A Box From DNA-Origami
Figure 2.12 An Overview of Tile DNA-Nanostructures
Figure 2.13 An Overview of DNA-Nanostructures
Figure 2.14 An Artificial Living Organism Created From Frog Cells
Figure 3.1 Storyboard of a Nanomedicine Scenario
Figure 3.2 Nanoparticles in Drug Delivery
Figure 3.3 Maslow’s Hierarchy of Needs
Figure 4.1 Carbon Atom
Figure 4.2 An Example Molecule
Figure 4.3 c60 and c540 fullerenes. (a) c60 fullerene, also called “Buckminsterfullerene.” (b) c540 fullerene
Figure 4.4 Different Types of Carbon Nanotubes
Figure 4.5 A rope made out of carbon nanotubes
Figure 4.6 An Example DNA-Helix Segment
Figure 4.7 Timeline of DNA Discoveries
Figure 4.8 Venn-Diagramm of Nanostructures
Figure 4.9 The State Space for a MDP
Figure 4.10 An MDP With Sand Pit and Charging Station
Figure 4.11 An Example Policy for a Nanodevice
Figure 4.12 A POMDP Example Scenario
Figure 4.13 ADecPOMDP Example
Figure 4.14 An Example DecPOMDPcom
Figure 4.15 Biological Nanorobot
Figure 4.16 Bacterial Nanorobot
Figure 4.17 Liposomes and Micelles
Figure 4.18 Example Circuit
Figure 4.19 Self-Assembled Snowflakes
Figure 4.20 DNA-Origami
Figure 4.21 Wang-Tiles
Figure 4.22 DX and TX-Tile
Figure 4.23 Holliday Junction
Figure 4.24 Tiletype examples
Figure 4.25 DNA-Tile in the Process of Binding
Figure 4.26 (a) 2D-Tileset (b) Assembly Sequence of a TAS
Figure 4.27 Growth- and Facet-Errors
Figure 4.28 (a) k × k Proofreading Tiles. (b) Snaked Proofreading Tiles
Figure 4.29 Odd/even Snaked-Block
Figure 4.30 3D-Snaked Proofreading
Figure 4.31 HollowCube of Edge Length 5
Figure 4.32 Linear Runtime Hollow Cube
Figure 4.33 Constant Size Square Tileset
Figure 4.34 Square of Logarithmically Many Tile Types
Figure 5.1 Inclusion Diagram of Complexity Classes
Figure 5.2 Reduction Scheme
Figure 5.3 QCA Neighborhoods
Figure 5.4 Quantum Dot Cell With Tunnel Junctions
Figure 5.5 Binary Interpretation of QCA States
Figure 5.6 Majority Gate
Figure 5.7 Invertergatter
Figure 5.8 (a) Tileset that assembles into a 4-bit AND at temperature 2. (b) Resulting message molecule
Figure 5.9 Ligand of a Message Molecule
Figure 5.10 Receptor for Message Molecules
Figure 5.11 4 bitAND-Nanonetwork
Figure 5.12 Messages Molecule Without Nucleation Errors
Figure 5.13 Message Combination With Ligand
Figure 5.14 General Boolean Tileset Construction
Figure 5.15 Message Molecule for the Decision Problem THRES
Figure 5.16 Message Molecule for the function problem ADD
Figure 5.17 Message Molecule for the Function Problem MULT
Figure 5.18 Message Molecule for the Function Problem XOR
Figure 5.19 Message Molecule for the Counting Problem
Figure 5.20 Complexity of Different MDP Variations
Figure 5.21 A Lifted DecPOMDPcom
Figure 6.1 Average Data Rates Over Time
Figure 6.2 Connecting in-Body and out-Body
Figure 6.3 Molecular Communication Channel Model
Figure 6.4 Receptor Ligand Interaction
Figure 6.5 Ligand of a Message Molecule
Figure 6.6 Receptor for Message Molecules
Figure 6.7 The Architecture of a FCNN Network
Figure 6.8 Example Nanonode Distributions
Figure 6.9 Hop Count Network After a Reset
Figure 6.10 An MST After the propagation Phase
Figure 6.11 The Retrieval-PhaseWorst-Case
Figure 6.12 Number of propagation messages sent
Figure 6.13 Destructive Retrieval Message Number
Figure 7.1 The Process of Chemotaxis
Figure 7.2 A Motor Protein Moving Cargo Along a Track
Figure 7.3 Bubble Propulsion
Figure 7.4 Overlapping Hop-Count Zones
Figure 7.5 The Initial 3D Hop Count State
Figure 7.6 The 3D Hop Count State After Propagation
Figure 7.7 The 3D Hop Count State With Real Distances
Figure 7.8 3D Hop Counts in a Human Model
Figure 7.9 Proteom Fingerprint Strengths
Figure 7.10 BloodvoyagerS Circulatory System Model
Figure 7.11 Model of Individual Blood Vessels in Nanonetworks
Figure 7.12 Different Modules of MEHLISSA
Figure 8.1 Diagnostic Procedures Overview
Figure 8.2 Overview of Quantitative Procedures of Laboratory Analytical Methods
Figure 8.3 A CNT Sensors
Figure 8.4 Molecule Counter
Figure 8.5 DNA-Box Dispenser
Figure 9.1 A Generic Fuel Cell
Figure 9.2 The Broadcast Storm
Figure 9.3 Harvesting vs. Sending Duration
Figure 9.4 Compariosn of Different Message Retrieval Schemes
Figure 9.5 Conical Signal Propagation in Hop Count Network
Figure 9.6 Obstacles in Hop-Count Routing
Figure 9.7 SLR Routing With Hindrances
Figure 9.8 Ring-Saving in Hop-Count Nanonetworks
Figure 9.9 Naive Flooding vs. Ring Saving
Figure 9.10 SLR vs. Ring Saving + SLR
Figure 10.1 Several Example Quartz
Figure 10.2 Clock Drift
Figure 10.3 NTPv4 Architecture
Figure 10.4 QCA Clock
Figure 10.5 Dysfunctional QCA Majority Gate
Figure 10.6 Lanmport Clock Example
Figure 10.7 The Chandy-Lamport Snapshot Algorithm
Figure 10.8 Sequential Consistency
Figure 10.9 Transitivity And Consistency
Figure 10.10 Causal Consistency
Figure 10.11 Langton’s Ant Simulation
Figure 11.1 Nanonetwork Safety Architecture
Figure 12.1 IoNT Reference Architecture
Figure 12.2 A Body Area Network
Figure 12.3 The SwarmNetwork Rules
Figure 12.4 An Example Acoustic Nanonetwork
Figure 12.5 An Example Electromagnetic Nanonetwork
Figure 12.6 Nanonetwork on Chip Architecture
Figure 12.7 An Example Bacterial Nanonetwork
Figure 12.8 An Example Molecular Nanonetwork
Figure 12.9 DNA-Based Nanonetwork Reference Architecture
Figure 12.10 4-bit in 2HAM
Figure 12.11 Result of 100 Simulations of a 4 Bit-AND
Figure 12.12 3 Bit-THRES-Tileset
Figure 12.13 THRES as a Nanonetwork
Figure 12.14 Result of 50 kTAM Simulations for a 3 Bit-THRES
Figure 12.15 4 bitADD Tileset
Figure 12.16 ADD as a Nanonetwork
Figure 12.17 Result of 50 kTAM -Simulations for ADD
Figure 12.18 General Boolean Tileset Construction
Figure 12.19 A DNA-Based Nanonetwork for Boolean Formulas
Figure...

Erscheint lt. Verlag	31.7.2024
Sprache	englisch
Themenwelt	Technik ► Elektrotechnik / Energietechnik
ISBN-10	1-394-21312-3 / 1394213123
ISBN-13	978-1-394-21312-2 / 9781394213122

Haben Sie eine Frage zum Produkt?

EPUB (Adobe DRM)
Größe: 36,0 MB

Kopierschutz: Adobe-DRM
Adobe-DRM ist ein Kopierschutz, der das eBook vor Mißbrauch schützen soll. Dabei wird das eBook bereits beim Download auf Ihre persönliche Adobe-ID autorisiert. Lesen können Sie das eBook dann nur auf den Geräten, welche ebenfalls auf Ihre Adobe-ID registriert sind.
Details zum Adobe-DRM

Dateiformat: EPUB (Electronic Publication)
EPUB ist ein offener Standard für eBooks und eignet sich besonders zur Darstellung von Belletristik und Sachbüchern. Der Fließtext wird dynamisch an die Display- und Schriftgröße angepasst. Auch für mobile Lesegeräte ist EPUB daher gut geeignet.

Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen eine Adobe-ID und die Software Adobe Digital Editions (kostenlos). Von der Benutzung der OverDrive Media Console raten wir Ihnen ab. Erfahrungsgemäß treten hier gehäuft Probleme mit dem Adobe DRM auf.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen eine Adobe-ID sowie eine kostenlose App.
Geräteliste und zusätzliche Hinweise

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.