Design and Implementation of Nanotechnology QCA Geometric Greedy Router
Algorithm 1
: Forwarding a packet to its destination.
(1)
Begin;
(2)
while packet is not at the destination do
(3)
for each neighbor of present node do
(4)
find the first pair of different coordinates, comparing bit by bit, between neighbor and destination node; from there, count the number of nonzero coordinates from both CS to encounter distance;
(5)
end
(6)
compare found distances;
(7)
forward packet to node with smallest distance to destination;
