{"title":"l2rp:链路状态RAID路由协议","authors":"N. Tabbane","doi":"10.1109/ICN.2009.76","DOIUrl":null,"url":null,"abstract":"We introduce here a novel routing protocol for a class of reconfigurable wireless ad hoc networks. The main features of these ad hoc networks are increased nodes mobility, a larger number of nodes, and a large network span. We argue that current routing protocols do not provide a satisfactory solution for routing in this type of environment. We propose a scheme, called the Link-State RAID Routing Protocol: LS2RP, which dynamically adjusts itself to operational conditions by sizing a cluster. More specifically, LS2RP reduces the cost of frequent updates to the constantly changing network topology by limiting the scope of the updates to the immediate neighbourhood of the change. We study the performance of the scheme, evaluating the average number of control messages required to discover a route within the network. Furthermore, we compare the scheme's performance with reactive flood search and LS2RP protocols.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"LS2RP: Link-State RAID Routing Protocol\",\"authors\":\"N. Tabbane\",\"doi\":\"10.1109/ICN.2009.76\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce here a novel routing protocol for a class of reconfigurable wireless ad hoc networks. The main features of these ad hoc networks are increased nodes mobility, a larger number of nodes, and a large network span. We argue that current routing protocols do not provide a satisfactory solution for routing in this type of environment. We propose a scheme, called the Link-State RAID Routing Protocol: LS2RP, which dynamically adjusts itself to operational conditions by sizing a cluster. More specifically, LS2RP reduces the cost of frequent updates to the constantly changing network topology by limiting the scope of the updates to the immediate neighbourhood of the change. We study the performance of the scheme, evaluating the average number of control messages required to discover a route within the network. Furthermore, we compare the scheme's performance with reactive flood search and LS2RP protocols.\",\"PeriodicalId\":299215,\"journal\":{\"name\":\"2009 Eighth International Conference on Networks\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Eighth International Conference on Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICN.2009.76\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Eighth International Conference on Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICN.2009.76","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce here a novel routing protocol for a class of reconfigurable wireless ad hoc networks. The main features of these ad hoc networks are increased nodes mobility, a larger number of nodes, and a large network span. We argue that current routing protocols do not provide a satisfactory solution for routing in this type of environment. We propose a scheme, called the Link-State RAID Routing Protocol: LS2RP, which dynamically adjusts itself to operational conditions by sizing a cluster. More specifically, LS2RP reduces the cost of frequent updates to the constantly changing network topology by limiting the scope of the updates to the immediate neighbourhood of the change. We study the performance of the scheme, evaluating the average number of control messages required to discover a route within the network. Furthermore, we compare the scheme's performance with reactive flood search and LS2RP protocols.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
