基于稳定性和跳数的MANET路由计算方法

Sridhar K, M. Chan
{"title":"基于稳定性和跳数的MANET路由计算方法","authors":"Sridhar K, M. Chan","doi":"10.1109/ICCCN.2005.1523800","DOIUrl":null,"url":null,"abstract":"In this paper, we present an approach for MANET routing based on stability and hop-count, where the stability metric considered is the residual lifetime of a link. We view stability based routing not as a separate routing protocol but as an enhancement to a hop-count based routing protocol (e.g. DSR or AODV), so that the expected residual lifetime as well as hop count of a route are taken into account. First, we investigate how residual link lifetime is affected by parameters such as speed and mobility pattern using simulation. The result shows that residual link lifetime is a function of current link age, mobility speed and mobility pattern and does not vary monotonically with age. Therefore, intuitive idea such as older links are more stable, which is used in existing stability-based routing algorithms like associativity based routing (ABR), does not hold across a large spectrum of mobility speeds and models. Instead, the reverse can be true. We propose stability and hop-count based routing algorithm (SHARC) using DSR as the basic routing protocol. The stability of a path is calculated using a simple histogram based estimator. Simulation results show that SHARC performs better than a hop-count only algorithm (DSR) and a stability only algorithm for both throughout of long-lived TCP and response time of short data transfer. SHARC also performs close to an algorithm with perfect knowledge of link residual lifetime in many cases.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Stability and hop-count based approach for route computation in MANET\",\"authors\":\"Sridhar K, M. Chan\",\"doi\":\"10.1109/ICCCN.2005.1523800\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an approach for MANET routing based on stability and hop-count, where the stability metric considered is the residual lifetime of a link. We view stability based routing not as a separate routing protocol but as an enhancement to a hop-count based routing protocol (e.g. DSR or AODV), so that the expected residual lifetime as well as hop count of a route are taken into account. First, we investigate how residual link lifetime is affected by parameters such as speed and mobility pattern using simulation. The result shows that residual link lifetime is a function of current link age, mobility speed and mobility pattern and does not vary monotonically with age. Therefore, intuitive idea such as older links are more stable, which is used in existing stability-based routing algorithms like associativity based routing (ABR), does not hold across a large spectrum of mobility speeds and models. Instead, the reverse can be true. We propose stability and hop-count based routing algorithm (SHARC) using DSR as the basic routing protocol. The stability of a path is calculated using a simple histogram based estimator. Simulation results show that SHARC performs better than a hop-count only algorithm (DSR) and a stability only algorithm for both throughout of long-lived TCP and response time of short data transfer. SHARC also performs close to an algorithm with perfect knowledge of link residual lifetime in many cases.\",\"PeriodicalId\":379037,\"journal\":{\"name\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"volume\":\"196 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2005.1523800\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

摘要

在本文中,我们提出了一种基于稳定性和跳数的MANET路由方法,其中考虑的稳定性度量是链路的剩余生存期。我们认为基于稳定性的路由不是一个单独的路由协议,而是对基于跳数的路由协议(例如DSR或AODV)的增强,因此路由的预期剩余寿命和跳数都被考虑在内。首先,我们通过仿真研究了剩余链路寿命如何受到速度和移动模式等参数的影响。结果表明,剩余链路寿命是当前链路年龄、迁移速度和迁移模式的函数,不随年龄单调变化。因此,在现有的基于稳定性的路由算法(如基于关联的路由(ABR))中使用的旧链路更稳定的直观想法,并不适用于大范围的移动速度和模型。相反,情况可能正好相反。我们提出了一种基于稳定性和跳数的路由算法(SHARC),该算法使用DSR作为基本路由协议。路径的稳定性是用一个简单的基于直方图的估计器来计算的。仿真结果表明,SHARC算法在TCP的长寿命和短数据传输的响应时间方面都优于仅跳数算法(DSR)和仅稳定性算法。在许多情况下,SHARC的性能也接近于一种完全了解链路剩余生存期的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stability and hop-count based approach for route computation in MANET
In this paper, we present an approach for MANET routing based on stability and hop-count, where the stability metric considered is the residual lifetime of a link. We view stability based routing not as a separate routing protocol but as an enhancement to a hop-count based routing protocol (e.g. DSR or AODV), so that the expected residual lifetime as well as hop count of a route are taken into account. First, we investigate how residual link lifetime is affected by parameters such as speed and mobility pattern using simulation. The result shows that residual link lifetime is a function of current link age, mobility speed and mobility pattern and does not vary monotonically with age. Therefore, intuitive idea such as older links are more stable, which is used in existing stability-based routing algorithms like associativity based routing (ABR), does not hold across a large spectrum of mobility speeds and models. Instead, the reverse can be true. We propose stability and hop-count based routing algorithm (SHARC) using DSR as the basic routing protocol. The stability of a path is calculated using a simple histogram based estimator. Simulation results show that SHARC performs better than a hop-count only algorithm (DSR) and a stability only algorithm for both throughout of long-lived TCP and response time of short data transfer. SHARC also performs close to an algorithm with perfect knowledge of link residual lifetime in many cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信