Abstract
As interconnection architectures, the regular six-degree hexagonal networks and the regular three-degree honeycomb networks have been widely investigated. For the lack of a proper addressing schema, some published routing algorithms are very complicated and the topological properties of some complex hexagonal and honeycomb related architectures are not well known. In this paper, a unified addressing schema for hexagonal and honeycomb meshes is proposed; two Cayley graphs isomorphic to the two meshes are presented as a formal foundation for the addressing schema. Using the suggested addressing schema, simple distance formulas and concise shortest-path routing algorithms of the two meshes are developed. The routing algorithms may be directly applied in real interconnection networks such as cellular networks. The models based on the unified addressing schema and the two isomorphic Caylay graphs established a concise and elegant foundation to investigate complex hexagonal and honeycomb related networks
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
