{"title":"利用双监视/径向环配置网络开发关键/动态区域安全","authors":"L. Hsu","doi":"10.1109/THS.2008.4534457","DOIUrl":null,"url":null,"abstract":"We prototype optimal-degree, bipartite SCADA networks, namely generalized honeycomb torus networks and spider-web networks, to provide real-time sightline-availability in critical infrastructure paths, where large passing cars can block the view of targeted objects. These network prototypes, i.e., generalized honeycomb torus (GHT) networks, spider-web (SW) networks, can offer both nodes' and edges' fault-tolerance and a processing order to help the network management. The SW network can also be used as a main skeleton to combine paths' SCADA networks into an area SCADA network, which can have greater response capability. Cellular wireless telecommunications can be networked as the spider-web network to promote communication quality. SW(6,n) can optimally offer dual-pair mutually independent hamiltonian paths (MIHP) for any pair of bipartite nodes, so that information transmitted in a specific route can be assigned special meanings like the hint motion between the pitcher and the catcher in the baseball game, cooperatively with the mechanism of dynamic authentication/authorization. Furthermore, because routes of signal transmission can be specifically arranged, the impact of environmental factors related to multipath effects can be calculated to promote transmission quality. The proof of such MIHP properties is introduced by combinatorial graph patterns, logical rules, and mathematical rules in this article.","PeriodicalId":366416,"journal":{"name":"2008 IEEE Conference on Technologies for Homeland Security","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Developing Critical/Dynamical Area Security with Dual-Surveillance/Radial-Ring Configured Networks\",\"authors\":\"L. Hsu\",\"doi\":\"10.1109/THS.2008.4534457\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prototype optimal-degree, bipartite SCADA networks, namely generalized honeycomb torus networks and spider-web networks, to provide real-time sightline-availability in critical infrastructure paths, where large passing cars can block the view of targeted objects. These network prototypes, i.e., generalized honeycomb torus (GHT) networks, spider-web (SW) networks, can offer both nodes' and edges' fault-tolerance and a processing order to help the network management. The SW network can also be used as a main skeleton to combine paths' SCADA networks into an area SCADA network, which can have greater response capability. Cellular wireless telecommunications can be networked as the spider-web network to promote communication quality. SW(6,n) can optimally offer dual-pair mutually independent hamiltonian paths (MIHP) for any pair of bipartite nodes, so that information transmitted in a specific route can be assigned special meanings like the hint motion between the pitcher and the catcher in the baseball game, cooperatively with the mechanism of dynamic authentication/authorization. Furthermore, because routes of signal transmission can be specifically arranged, the impact of environmental factors related to multipath effects can be calculated to promote transmission quality. The proof of such MIHP properties is introduced by combinatorial graph patterns, logical rules, and mathematical rules in this article.\",\"PeriodicalId\":366416,\"journal\":{\"name\":\"2008 IEEE Conference on Technologies for Homeland Security\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Conference on Technologies for Homeland Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/THS.2008.4534457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Conference on Technologies for Homeland Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/THS.2008.4534457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Developing Critical/Dynamical Area Security with Dual-Surveillance/Radial-Ring Configured Networks
We prototype optimal-degree, bipartite SCADA networks, namely generalized honeycomb torus networks and spider-web networks, to provide real-time sightline-availability in critical infrastructure paths, where large passing cars can block the view of targeted objects. These network prototypes, i.e., generalized honeycomb torus (GHT) networks, spider-web (SW) networks, can offer both nodes' and edges' fault-tolerance and a processing order to help the network management. The SW network can also be used as a main skeleton to combine paths' SCADA networks into an area SCADA network, which can have greater response capability. Cellular wireless telecommunications can be networked as the spider-web network to promote communication quality. SW(6,n) can optimally offer dual-pair mutually independent hamiltonian paths (MIHP) for any pair of bipartite nodes, so that information transmitted in a specific route can be assigned special meanings like the hint motion between the pitcher and the catcher in the baseball game, cooperatively with the mechanism of dynamic authentication/authorization. Furthermore, because routes of signal transmission can be specifically arranged, the impact of environmental factors related to multipath effects can be calculated to promote transmission quality. The proof of such MIHP properties is introduced by combinatorial graph patterns, logical rules, and mathematical rules in this article.