{"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}
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)