具有同构Cayley图的六边形和蜂窝网络的统一寻址模式

Mingxin He, W. Xiao
{"title":"具有同构Cayley图的六边形和蜂窝网络的统一寻址模式","authors":"Mingxin He, W. Xiao","doi":"10.1109/IMSCCS.2006.24","DOIUrl":null,"url":null,"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","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Unified Addressing Schema for Hexagonal and Honeycomb Networks with Isomorphic Cayley Graphs\",\"authors\":\"Mingxin He, W. Xiao\",\"doi\":\"10.1109/IMSCCS.2006.24\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":202629,\"journal\":{\"name\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2006.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

规则六度六边形网络和规则三度蜂巢状网络作为互连结构得到了广泛的研究。由于缺乏合适的寻址模式,一些已发布的路由算法非常复杂,一些复杂的六边形和蜂巢结构的拓扑特性也不为人所知。本文提出了一种六边形网格和蜂窝网格的统一寻址模式;与这两个网格同构的两个Cayley图作为寻址模式的正式基础。利用所提出的寻址模式,给出了两个网格的简单距离公式和简洁的最短路径路由算法。该路由算法可直接应用于蜂窝网络等实际互联网络中。基于统一寻址模式和两个同构Caylay图的模型为研究复杂的六边形和蜂窝相关网络奠定了简洁、优雅的基础
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Unified Addressing Schema for Hexagonal and Honeycomb Networks with Isomorphic Cayley Graphs
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信