{"title":"基于局部泛洪的倾斜轨道巨型星座网络可生存路由算法","authors":"Jun He, Hefei Hu, Simin Feng","doi":"10.1117/12.3032089","DOIUrl":null,"url":null,"abstract":"Low-orbit satellite communication has the advantages of global coverage and low latency, and the satellite network is developing in the direction of gigantism, low orbital altitude, tilted orbit, and inter-satellite link networking, which brings more challenges to the design of routing algorithms. Aiming at the characteristics of mega-constellation networks (MCNs), this paper proposes a local flooding-based survivable routing algorithm (LFSA) that obtains the local link-state information by limiting the flooding range, to reduce the flooding and computation overheads of the network. Based on the topological characteristics of MCNs, a next-hop selection mechanism based on minimum Manhattan distance is proposed. Simulation results show that the LFSA algorithm improves the pathfinding capability and reduces end-to-end delay in the face of random link failure and regional satellite failure.","PeriodicalId":342847,"journal":{"name":"International Conference on Algorithms, Microchips and Network Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A local flooding-based survivable routing algorithm for mega-constellations networks with inclined orbits\",\"authors\":\"Jun He, Hefei Hu, Simin Feng\",\"doi\":\"10.1117/12.3032089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Low-orbit satellite communication has the advantages of global coverage and low latency, and the satellite network is developing in the direction of gigantism, low orbital altitude, tilted orbit, and inter-satellite link networking, which brings more challenges to the design of routing algorithms. Aiming at the characteristics of mega-constellation networks (MCNs), this paper proposes a local flooding-based survivable routing algorithm (LFSA) that obtains the local link-state information by limiting the flooding range, to reduce the flooding and computation overheads of the network. Based on the topological characteristics of MCNs, a next-hop selection mechanism based on minimum Manhattan distance is proposed. Simulation results show that the LFSA algorithm improves the pathfinding capability and reduces end-to-end delay in the face of random link failure and regional satellite failure.\",\"PeriodicalId\":342847,\"journal\":{\"name\":\"International Conference on Algorithms, Microchips and Network Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Algorithms, Microchips and Network Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.3032089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithms, Microchips and Network Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3032089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A local flooding-based survivable routing algorithm for mega-constellations networks with inclined orbits
Low-orbit satellite communication has the advantages of global coverage and low latency, and the satellite network is developing in the direction of gigantism, low orbital altitude, tilted orbit, and inter-satellite link networking, which brings more challenges to the design of routing algorithms. Aiming at the characteristics of mega-constellation networks (MCNs), this paper proposes a local flooding-based survivable routing algorithm (LFSA) that obtains the local link-state information by limiting the flooding range, to reduce the flooding and computation overheads of the network. Based on the topological characteristics of MCNs, a next-hop selection mechanism based on minimum Manhattan distance is proposed. Simulation results show that the LFSA algorithm improves the pathfinding capability and reduces end-to-end delay in the face of random link failure and regional satellite failure.