A Contamination Aware Droplet Routing Algorithm for the Synthesis of Digital Microfluidic Biochips

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 29; no. 11; pp. 1682 - 1695
• Main Authors: Huang, Tsung-Wei, Lin, Chun-Hsien, Ho, Tsung-Yi
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2010; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Arrays; Bioassay; Bioassays; Biochips; Cleaning; Complexity theory; Contamination; contaminations; Digital; Droplets; dynamic programming; Fault tolerance; Heuristic algorithms; Microfluidics; minimum cost circulation (MCC); Routing; Studies; Timing
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2010.2062770

Recent advances of digital microfluidic biochips (DMFBs) have revolutionized the traditional laboratory procedures. By providing the droplet-based system, DMFB can perform real-time biological analysis and safety-critical biomedical applications. However, different droplets being transported and manipulated on the DMFB may introduce the contamination problem caused by liquid residue between different biomolecules. To overcome this problem, a wash droplet is introduced to clean the contaminations on the surface of the microfluidic array. However, current scheduling of wash droplet does not restrict the extra used cells and execution time of bioassay, thereby degrading the reliability and fault-tolerance significantly. In this paper, we propose a contamination aware droplet routing algorithm for DMFBs. To reduce the routing complexity and the used cells, we first construct preferred routing tracks by analyzing the global moving vector of droplets to guide the droplet routing. To cope with contaminations within one subproblem, we first apply a k -shortest path routing technique to minimize the contaminated spots. Then, to take advantage of multiple wash droplets, we adopt a minimum cost circulation (MCC) algorithm for optimal wash-droplet routing to simultaneously minimize used cells and the cleaning time. Since the droplet routing problem consists of several subproblems, a look-ahead prediction technique is further used to determine the contaminations between successive subproblems. After that, we can simultaneously clean both contaminations within one subproblem and those between successive subproblems by using the MCC-based algorithm to reduce the execution time and the used cells significantly. Based on four widely used bioassays, our algorithm reduces the used cells and the execution time significantly compared with the state-of-the-art algorithm.