arXiv subjects
Publications and source records attributed to Andrzej Jajszczyk.
This paper is concerned with a novel method allowing communication between FRET nanonetworks and nerve cells. It is focused on two system components: fluorophores and channelrhodopsins which serve as transmitters and receivers, respectively. Channelrhodopsins are used here also as a FRET signal-to-voltage converter. The trade-off between throughput and bit error rate is also investigated.
We present the generic Dijkstra shortest path algorithm: an efficient algorithm for finding a shortest path in an optical network, both in a wavelength-division multiplexed network, and an elastic optical network (EON). The proposed algorithm is an enabler of real-time softwarized control of large-scale networks, and is not limited to optical networks. The Dijkstra algorithm is a generalization of the breadth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units required in EONs. Specifically, we generalize the notion of a label, change what we iterate with, and reformulate the edge relaxation so that vertices are revisited, loops avoided, and worse labels discarded. We also used the typical constriction during edge relaxation to take care of the signal modulation constraints. The algorithm can be used with various spectrum allocation policies. We motivate and discuss the algorithm design, and provide our free, reliable, and generic implementation using the Boost Graph Library. We carried out 85000 simulation runs for realistic and random networks (Gabriel graphs) of 75 vertices with about a billion shortest-path searches, and found that the proposed algorithm outperforms considerably three other competing optimal algorithms that are frequently used.
The paper is concerned with Forster Resonance Energy Transfer (FRET) considered as a mechanism for communication between nanodevices. Two solved issues are reported in the paper, namely: signal generation and signal storage in FRET-based nanonetworks. First, luciferase molecules as FRET transmitters which are able to generate FRET signals themselves, taking energy from chemical reactions without any external light exposure, are proposed. Second, channelrhodopsins as FRET receivers, as they can convert FRET signals into voltage, are suggested. Further, medical in-body systems where both molecule types might be successfully applied, are discussed. Luciferase-channelrhodopsin communication is modeled and its performance is numerically validated, reporting on its throughput, bit error rate, propagation delay and energy consumption.
A practical, biologically motivated case of protein complexes (immunoglobulin G and FcRII receptors) moving on the surface of mastcells, that are common parts of an immunological system, is investigated. Proteins are considered as nanomachines creating a nanonetwork. Accurate molecular models of the proteins and the fluorophores which act as their nanoantennas are used to simulate the communication between the nanomachines when they are close to each other. The theory of diffusion-based Brownian motion is applied to model movements of the proteins. It is assumed that fluorophore molecules send and receive signals using the Forster Resonance Energy Transfer. The probability of the efficient signal transfer and the respective bit error rate are calculated and discussed.
We state a new problem of \emph{itinerant routing} in elastic optical networks, which we define as the establishment and reconfiguration of an \emph{itinerant connection}. In an itinerant connection, one of the connection end nodes is allowed to change. Itinerant routing could also be considered a form of connection restoration, where a connection has to be restored to a different end node. With the introduction of new mobile-network architectures, the progressing integration of wireless and optical networks, the continuing growth of wireless high-bitrate services, and the eventual deployment of elastic optical networks, there is a need to support this itinerant routing in the elastic optical networks. We present and discuss two major use cases of the itinerant routing, and propose a \emph{novel reconfiguration algorithm}. Our algorithm does not deteriorate the network performance, and requires half as many new links to configure as the shortest-path reconfiguration algorithm. The performance evaluation was carried out with 46800 simulation runs using randomly-generated realistic transport networks.