Molecular communication: Physically realistic models and achievable information rates

Molecular communication is a biologically-inspired method of communication with attractive properties for microscale and nanoscale devices. In molecular communication, messages are transmitted by releasing a pattern of molecules at a transmitter, which propagate through a fluid medium towards a receiver. In this paper, molecular communication is formulated as a mathematical communication problem in an information-theoretic context. Physically realistic models are obtained, with sufficient abstraction to allow manipulation by communication and information theorists. Although mutual information in these channels is intractable, we give sequences of upper and lower bounds on the mutual information which trade off complexity and performance, and present results to illustrate the feasibility of these bounds in estimating the true mutual information.

[1]  D. M. Hutton,et al.  Handbook of Discrete and Combinatorial Mathematics , 2001 .

[2]  Tatsuya Suda,et al.  Molecular communication through gap junction channels: System design, experiments and modeling , 2007, 2007 2nd Bio-Inspired Models of Network, Information and Computing Systems.

[3]  H. Kitano.  Systems Biology: A Brief Overview , 2002, Science.

[4]  Haim H. Permuter,et al.  Capacity and Zero-Error Capacity of the Chemical Channel with Feedback , 2007, 2007 IEEE International Symposium on Information Theory.

[5]  Ravindra B. Bapat,et al.  Order statistics for nonidentically distributed variables and permanents , 1989 .

[6]  Ron Weiss,et al.  Genetic circuit building blocks for cellular computation, communications, and signal processing , 2003, Natural Computing.

[7]  Tad Hogg,et al.  Nanorobot Communication Techniques: A Comprehensive Tutorial , 2006, 2006 9th International Conference on Control, Automation, Robotics and Vision.

[8]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[9]  S. Goldstein.  Mechanical models of Brownian motion , 1982 .

[10]  Tatsuya Suda,et al.  A Molecular Communication System , 2009, IWNC.

[11]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[12]  Rajesh Sundaresan,et al.  Capacity of queues via point-process channels , 2006, IEEE Transactions on Information Theory.

[13]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[14]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[15]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[16]  Ron Weiss,et al.  Engineered Communications for Microbial Robotics , 2000, DNA Computing.

[17]  Tatsuya Suda,et al.  A Biochemically-Engineered Molecular Communication System (Invited Paper) , 2008, NanoNet.

[18]  T. Suda,et al.  Molecular communication for nanomachines using intercellular calcium signaling , 2005, 5th IEEE Conference on Nanotechnology, 2005..

[19]  R. Johnstone,et al.  Cooperation in the dark: signalling and collective action in quorum-sensing bacteria , 2001, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[20]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[21]  Oliver Johnson.  Convergence to the Poisson Distribution , 2004 .