Improved Networks Routing Using Link Addition

In this paper an improved routing algorithm suitable for planar networks, static Zigbee and mesh networks included, is shown. The algorithm is based on the cycle description of the graph, and on a new graph model based on arrow description, which is outlined. We show that the newly developed model allows for a faster algorithm for finding a direct and a return path in the network. The newly developed model allows further interpretations of the relationships in any simple planar graphs. Examples showing the implementation of the newly developed model are presented, too.