Abstract
Droplet routing in digital microfluidic biochip is very challenging. It involves moving droplets from its source cell to destination cell. The challenge is to maintain fluidic constraints for every droplet movement. In this article, we have proposed a greedy bidirectional droplet routing based on divide and conquerer approach. The biochip is explored using two waves i.e. one from source cell and other from destination cell. Then, the biochip is converted into a bipartite graph by identifying strongly connected components. The route selection is done using our four greedy selection heuristics. The final route is generated by appending multiple sub-routes. The simulation result show an improvement of 7.32% and 18.05% in latest arrival time and number of shared cells respectively in free topology. Similarly we register an enhancement of 8.43% and 19.70% latest arrival time and number of shared cells respectively in virtual topology.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
