Abstract
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.
Highlights
This paper is the extended version of the reference [1] presented at MOCAST 2020 conference.The routing algorithm and its extension is suitable for static ZigBee and mesh networks [2,3,4,5].Many types of networks deployed for every-day use including home networks, static sensor networks, etc. can be modeled as a connected planar graph, described using either its node or its cycle description.The networks are cyclically connected such that a cycle description of the associated graph is possible.Routing is an essential feature of any communication network
In a previous paper [6], it has been shown that a routing algorithm can be developed using the cycle description of the underlying graph
We have presented an alternative method to processing the results of the routing algorithm of [6]
Summary
This paper is the extended version of the reference [1] presented at MOCAST 2020 conference. The cornerstone of routing is the ability to find paths between two given end nodes Most of such algorithms rely on node hopping and are based on the node description of the graph associated to the network [2,3,4,5]. We note that many types of networks deployed in everyday use (including home networks, static sensor networks, etc.) can be modeled as a connected planar graph. In a previous paper [6], it has been shown that a routing algorithm can be developed using the cycle description of the underlying graph This method has several advantages over algorithms based on node-hopping, such as its lack of back-tracking.
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
