一种同时最小化稳定跳数权衡和端到端延迟的单播MANET路由协议

N. Meghanathan
{"title":"一种同时最小化稳定跳数权衡和端到端延迟的单播MANET路由协议","authors":"N. Meghanathan","doi":"10.1109/ITNG.2012.17","DOIUrl":null,"url":null,"abstract":"The high-level contribution of this paper is the design and development of a unicast routing protocol to effectively minimize the stability-hop count tradeoff observed in mobile ad hoc networks (MANETs) and thereby incur lower end-to-end delay per data packet. The proposed unicast routing protocol, referred to as SILET, uses the predicted link expiration times (LETs) as part of the link weights. SILET is a source-initiated on-demand routing protocol that initiates a global broadcast query-reply cycle to discover routes, the destination chooses the route with the lowest sum of the link weights, the weight assigned to a link is '1' plus the inverse of the LET of the link. The term '1' as part of the link weight minimizes the hop count per path and the term comprising of the inverse of the LET maximizes the lifetime of the routes. Through extensive simulations and comparison with contemporary minimum-hop based and stability-based routing protocols, we demonstrate that SILET discovers long-living stable routes with hop count close to that of the minimum, thus, minimizing the stability-hop count tradeoff. By virtue of incurring lower route discovery control overhead (due to long-living stable routes) and lower hop count per route, the end-to-end delay per data packet is also optimized and has been observed to be the lowest among all the routing protocols simulated in this paper.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A Unicast MANET Routing Protocol to Simultaneously Minimize the Stability-Hop Count Tradeoff and End-to-End Delay\",\"authors\":\"N. Meghanathan\",\"doi\":\"10.1109/ITNG.2012.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The high-level contribution of this paper is the design and development of a unicast routing protocol to effectively minimize the stability-hop count tradeoff observed in mobile ad hoc networks (MANETs) and thereby incur lower end-to-end delay per data packet. The proposed unicast routing protocol, referred to as SILET, uses the predicted link expiration times (LETs) as part of the link weights. SILET is a source-initiated on-demand routing protocol that initiates a global broadcast query-reply cycle to discover routes, the destination chooses the route with the lowest sum of the link weights, the weight assigned to a link is '1' plus the inverse of the LET of the link. The term '1' as part of the link weight minimizes the hop count per path and the term comprising of the inverse of the LET maximizes the lifetime of the routes. Through extensive simulations and comparison with contemporary minimum-hop based and stability-based routing protocols, we demonstrate that SILET discovers long-living stable routes with hop count close to that of the minimum, thus, minimizing the stability-hop count tradeoff. By virtue of incurring lower route discovery control overhead (due to long-living stable routes) and lower hop count per route, the end-to-end delay per data packet is also optimized and has been observed to be the lowest among all the routing protocols simulated in this paper.\",\"PeriodicalId\":117236,\"journal\":{\"name\":\"2012 Ninth International Conference on Information Technology - New Generations\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Ninth International Conference on Information Technology - New Generations\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITNG.2012.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Ninth International Conference on Information Technology - New Generations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNG.2012.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

本文的高级贡献是设计和开发了一种单播路由协议,以有效地减少移动自组织网络(manet)中观察到的稳定性跳数权衡,从而降低每个数据包的端到端延迟。提出的单播路由协议,称为SILET,使用预测的链路过期时间(let)作为链路权重的一部分。SILET是一种源发起的按需路由协议,它启动一个全局广播的查询-应答循环来发现路由,目的端选择链路权值总和最小的路由,分配给链路的权值为1 +链路的LET的倒数。作为链路权值的一部分,“1”项使每条路径的跳数最小化,而由LET的逆项组成的项使路由的生存期最大化。通过广泛的模拟和与当前基于最小跳数和基于稳定性的路由协议的比较,我们证明了SILET发现的长寿命稳定路由的跳数接近最小值,从而最大限度地减少了稳定跳数的权衡。由于路由发现控制开销较低(由于长时间的稳定路由)和每条路由的跳数较低,每个数据包的端到端延迟也得到了优化,并且在本文模拟的所有路由协议中观察到最低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Unicast MANET Routing Protocol to Simultaneously Minimize the Stability-Hop Count Tradeoff and End-to-End Delay
The high-level contribution of this paper is the design and development of a unicast routing protocol to effectively minimize the stability-hop count tradeoff observed in mobile ad hoc networks (MANETs) and thereby incur lower end-to-end delay per data packet. The proposed unicast routing protocol, referred to as SILET, uses the predicted link expiration times (LETs) as part of the link weights. SILET is a source-initiated on-demand routing protocol that initiates a global broadcast query-reply cycle to discover routes, the destination chooses the route with the lowest sum of the link weights, the weight assigned to a link is '1' plus the inverse of the LET of the link. The term '1' as part of the link weight minimizes the hop count per path and the term comprising of the inverse of the LET maximizes the lifetime of the routes. Through extensive simulations and comparison with contemporary minimum-hop based and stability-based routing protocols, we demonstrate that SILET discovers long-living stable routes with hop count close to that of the minimum, thus, minimizing the stability-hop count tradeoff. By virtue of incurring lower route discovery control overhead (due to long-living stable routes) and lower hop count per route, the end-to-end delay per data packet is also optimized and has been observed to be the lowest among all the routing protocols simulated in this paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Brain Imaging for Diagnosis of Schizophrenia: Challenges, Successes and a Research Road Map User-centric Trust-based Recommendation Do Videowikis on the Web Support Better (Constructivist) Learning in the Basics of Information Systems Science? An MDA-Based Approach for WS Composition Using UML Scenarios A Mobile Data Analysis Framework for Environmental Health Decision Support
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1