Abstract
This paper presents an optimized geometric greedy router (GGR) based on quantum dot cellular automata (QCA) technology. The proposed structure of GGR is based on a spanning tree of the network. This type of communication does not require an IP address. It uses only local information and can be used in many communication devices. In this paper, we first describe the principal components of the router and then we present their QCA architecture. The QCA technology is the most likely alternative to replace conventional circuits (CMOS) due to their very low power consumption and high processing speed. To consider integration with other complex circuit, we have utilized QCA clock-phase-based technique for the proposed design architecture. The results obtained using the QCA designer tool exhibit the superiority of the presented architecture over the existing designs. The proposed structure shows a reduction of 30% reduction in occupied space. The power dissipation rate of the proposed design is analyzed by QCAPro tool to approve its reliability.
Highlights
Is routing method requires very efficient electronic support
We present an optimized architecture of geometric greedy router based on quantum dot cellular automata (QCA) technology
A proposed realization of circuit diagram of distance calculator based on QCA technology is presented in Figure 10. e proposed architecture is composed by one 2 to 1 QCA multiplexer, two OR gates, two And gates, and one XOR gate
Summary
A rather simple stateless distributed algorithm routes messages from node to node along a source-destination path, based only on position information (node coordinates). A greedy routing algorithm forwards every packet to the node in the one-hop neighborhood, which lies closest to the final destination. E coordinate distribution is based on other ad hoc network protocols or sensors, such as greedy perimeter stateless routing (GPSR) [15]. Is method starts with the creation of a spanning tree and the adoption of a set of coordinates to each node of the network. When the router structure is created, the embedding tree has already been established and each generated node is aware of the coordinate set (CS) of its neighbors; the node forward the received packet to the neighbor which has the smallest possible distance to the destination. E distance between nodes is computed according to the number of hops that must travel in the tree through the nodes, taking into consideration the common ancestors of neighbor nodes and the number of nonzero coordinates in each set
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
