Geometric greedy router in Quantum-dot Cellular Automata

Abstract

This paper describes the first Geometric Greedy Router using the Quantum-dot Cellular Automata (QCA) paradigm based on a spanning-tree of the network. This type of router is a revolution for communications as it works without IP address lookups. It uses only local information and can be employed in numerous communication devices. When combined with QCA technology, a proper alternative to replace conventional circuits (CMOS), the desired results can be achieved on a nanometric scale and with very low-power consumption. In a top-down approach, we first describe the main components of the router and later present their QCA architecture. We implemented the router in the QCADesigner simulator to validate and demonstrate the functionality of the design, testing with many examples. With both technologies, geometric routing and QCA, combined and being substitutes of current paradigms, this study can be another step towards new types of digital nanocommunications systems and devices.