publication . Article . 2015

Relay Analysis in Molecular Communications With Time-Dependent Concentration

Xiayang Wang; Matthew D. Higgins; Mark S. Leeson;
Open Access
  • Published: 14 Nov 2015 Journal: IEEE Communications Letters, volume 19, pages 1,977-1,980 (issn: 1089-7798, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
  • Country: United Kingdom
Molecular communications (MC) is a promising paradigm which enables nano-machines to communicate with each other. Due to the severe attenuation of molecule concentrations, there tends to be more errors when the receiver becomes farther from the transmitter. To solve this problem, relaying schemes need to be implemented to achieve reliable communications. In this letter, time-dependent molecular concentrations are utilised as the information carrier, which will be influenced by the noise and channel memory. The emission process is also considered. The relay node (RN) can decode messages, and forward them by sending either the same or a different kind of molecules...
Persistent Identifiers
ACM Computing Classification System: Data_CODINGANDINFORMATIONTHEORY
free text keywords: QD, TK, Computer science, Molecular communication, Transmitter, Relay channel, Communication channel, Communications system, Relay, law.invention, law, Decoding methods, Telecommunications, business.industry, business, Electronic engineering, Bit error rate
Related Organizations

[1] K. V. Srinivas, A. W. Eckford, and R. S. Adve, “Molecular Communication in Fluid Media: The Additive Inverse Gaussian Noise Channel”, in IEEE Trans. Inf. Theory, Jul. 2012, pp. 4678-4692.

[2] Y. Chahibi, and I. F. Akyildiz, “Molecular Communication Noise and Capacity Analysis for Particulate Drug Delivery Systems”, in IEEE Trans. on Commun., Nov. 2014, pp. 3891-3903. [OpenAIRE]

[3] T. Nakano, Y. Okaie, and J.-Q. Liu, “Channel Model and Capacity Analysis of Molecular Communication with Brownian Motion”, in IEEE Commun. Lett., Jun. 2012, pp. 797-900.

[4] B. Atakan and O. B. Akan, “On Molecular Multiple-Access, Broadcast, and Relay Channels in Nanonetworks”, in Proc. 3rd Int. Conf. BioInspired Models Netw. Inform. Comput. Syst., Nov. 2008, pp. 16:1-16:8.

[5] A. Einolghozati, M. Sardari, and F. Fekri, “Relaying in diffusion-based molecular communication”, in IEEE Int. Symp. on Inform. Theory Proc. (ISIT), Jul. 2013, pp. 1844-1848.

[6] A. Einolghozati, M. Sardari, and F. Fekri, “Decode and forward relaying in diffusion-based molecular communication between two populations of biological agents”, in IEEE Int. Conf. on Commun. (ICC), Jun. 2014, pp. 3975-3980.

[7] T. Nakano, and J.-Q. Liu, “Design and Analysis of Molecular Relay Channels: An Information Theoretic Approach”, in IEEE Trans. on NanoBioscience, Sept. 2010, pp. 213-221.

[8] T. Nakano, and J. Shuai, “Repeater design and modeling for molecular communication networks”, in IEEE Conf. on Comput. Commun. Workshops, Apr. 2011, pp. 501-506.

[9] A. Ahmadzadeh, A. Noel, and R. Schober, “Analysis and design of two-hop diffusion-based molecular communication networks”, in IEEE Global Commun. Conf. (GLOBECOM), Dec. 2014, pp. 2820-2825.

[10] H. ShahMohammadian, G. G. Messier, and S. Magierowski, “Optimum receiver for molecule shift keying modulation in diffusion-based molecular communication channels”, in Nano Commun. Netw., Sept. 2012, pp. 183-195.

[11] I. Llatser, A. Cabellos-Aparicio, M. Pierobon, and E. Alarcon, “Detection Techniques for Diffusion-based Molecular Communication”, in IEEE J. Sel. Areas Commun., Dec. 2013, pp. 726-734.

[12] X. Wang, M. D. Higgins, and M. S. Leeson, “Distance Estimation Schemes for Diffusion Based Molecular Communication Systems”, in IEEE Commun. Lett., Mar. 2015, pp. 399-402. [OpenAIRE]

[13] G. Aminian, H. Arjmandi, A. Gohari, M. N. Kenari, and U. Mitra, “Capacity of LTI-Poisson Channel for Diffusion based Molecular Communication”, in IEEE Int. Conf. on Commun. (ICC), Jun. 2015.

[14] D. Kilinc, and O. B. Akan, “Receiver Design for Molecular Communication”, in IEEE J. Sel. Areas Commun., Dec. 2013, pp. 705-714.

Any information missing or wrong?Report an Issue