{"title":"网状网络的分布式ID/定位器解析系统","authors":"M. Ohnishi, Kazuyuki Shudo","doi":"10.1109/ICOIN.2019.8718162","DOIUrl":null,"url":null,"abstract":"We propose an ID/Locator resolution system for super wide area wireless mesh networks constructed using Delaunay overlay networks. Unlike conventional mobile ad-hoc network protocols, the proposed system does not use flooding to spread the locator notification messages of each node. The proposed method sends one-hop locator notifications on skip links such as skip graphs. The proposed system realized scalability by controlling the route, frequency, and storing locations of the locator notification message. Specifically, when the number of nodes increases, the average load on communication links and the message database of each node are approximately O(log n), where n is the total number of nodes. The scalability of the proposed method is confirmed through simulations.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"360 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed ID/Locator Resolution System for Inter Mesh Networks\",\"authors\":\"M. Ohnishi, Kazuyuki Shudo\",\"doi\":\"10.1109/ICOIN.2019.8718162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an ID/Locator resolution system for super wide area wireless mesh networks constructed using Delaunay overlay networks. Unlike conventional mobile ad-hoc network protocols, the proposed system does not use flooding to spread the locator notification messages of each node. The proposed method sends one-hop locator notifications on skip links such as skip graphs. The proposed system realized scalability by controlling the route, frequency, and storing locations of the locator notification message. Specifically, when the number of nodes increases, the average load on communication links and the message database of each node are approximately O(log n), where n is the total number of nodes. The scalability of the proposed method is confirmed through simulations.\",\"PeriodicalId\":422041,\"journal\":{\"name\":\"2019 International Conference on Information Networking (ICOIN)\",\"volume\":\"360 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2019.8718162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed ID/Locator Resolution System for Inter Mesh Networks
We propose an ID/Locator resolution system for super wide area wireless mesh networks constructed using Delaunay overlay networks. Unlike conventional mobile ad-hoc network protocols, the proposed system does not use flooding to spread the locator notification messages of each node. The proposed method sends one-hop locator notifications on skip links such as skip graphs. The proposed system realized scalability by controlling the route, frequency, and storing locations of the locator notification message. Specifically, when the number of nodes increases, the average load on communication links and the message database of each node are approximately O(log n), where n is the total number of nodes. The scalability of the proposed method is confirmed through simulations.