使用源序列号的自组织网络中的按需无环路路由

H. Rangarajan, J. Garcia-Luna-Aceves
{"title":"使用源序列号的自组织网络中的按需无环路路由","authors":"H. Rangarajan, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2005.1542859","DOIUrl":null,"url":null,"abstract":"In any on-demand routing protocol, sources flood route requests (RREQ) to build routes to destinations, and each new RREQ is identified uniquely with a source-sequenced label (SSL) consisting of the source identifier and a locally generated sequence number. As a RREQ propagates, it creates a directed acyclic graph (DAG), because nodes relay each RREQ only once. We present the first framework for loop-free on-demand routing in ad hoc networks that is based directly on SSLs, rather than on independent mechanisms, which has been the way in which prior on-demand routing protocols have been designed. Extensive simulation results for simple protocol instantiations of our new framework operating in scenarios with 50 and 100-nodes under different traffic patterns show that our new protocols outperform AODV (Ad hoc on demand distance vector), DSR (dynamic source routing), and OLSR (optimized link state routing)","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"On-demand loop-free routing in ad hoc networks using source sequence numbers\",\"authors\":\"H. Rangarajan, J. Garcia-Luna-Aceves\",\"doi\":\"10.1109/MAHSS.2005.1542859\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In any on-demand routing protocol, sources flood route requests (RREQ) to build routes to destinations, and each new RREQ is identified uniquely with a source-sequenced label (SSL) consisting of the source identifier and a locally generated sequence number. As a RREQ propagates, it creates a directed acyclic graph (DAG), because nodes relay each RREQ only once. We present the first framework for loop-free on-demand routing in ad hoc networks that is based directly on SSLs, rather than on independent mechanisms, which has been the way in which prior on-demand routing protocols have been designed. Extensive simulation results for simple protocol instantiations of our new framework operating in scenarios with 50 and 100-nodes under different traffic patterns show that our new protocols outperform AODV (Ad hoc on demand distance vector), DSR (dynamic source routing), and OLSR (optimized link state routing)\",\"PeriodicalId\":268267,\"journal\":{\"name\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2005.1542859\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2005.1542859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在任何按需路由协议中,源发送路由请求(RREQ)来建立到目的地的路由,每个新的RREQ都用一个由源标识符和本地生成的序列号组成的源序列标签(SSL)来唯一标识。当RREQ传播时,它会创建一个有向无环图(DAG),因为节点只转发每个RREQ一次。我们提出了在自组织网络中用于无环路按需路由的第一个框架,该框架直接基于ssl,而不是基于独立机制,这是先前按需路由协议设计的方式。在不同流量模式下,我们的新框架在50和100个节点的场景下运行的简单协议实例的广泛模拟结果表明,我们的新协议优于AODV(按需距离矢量)、DSR(动态源路由)和OLSR(优化链路状态路由)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On-demand loop-free routing in ad hoc networks using source sequence numbers
In any on-demand routing protocol, sources flood route requests (RREQ) to build routes to destinations, and each new RREQ is identified uniquely with a source-sequenced label (SSL) consisting of the source identifier and a locally generated sequence number. As a RREQ propagates, it creates a directed acyclic graph (DAG), because nodes relay each RREQ only once. We present the first framework for loop-free on-demand routing in ad hoc networks that is based directly on SSLs, rather than on independent mechanisms, which has been the way in which prior on-demand routing protocols have been designed. Extensive simulation results for simple protocol instantiations of our new framework operating in scenarios with 50 and 100-nodes under different traffic patterns show that our new protocols outperform AODV (Ad hoc on demand distance vector), DSR (dynamic source routing), and OLSR (optimized link state routing)
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信