基于仿真的移动自组织网络稳定路由、功率感知路由和负载均衡按需路由协议性能比较研究

N. Meghanathan, Leslie C. Milton
{"title":"基于仿真的移动自组织网络稳定路由、功率感知路由和负载均衡按需路由协议性能比较研究","authors":"N. Meghanathan, Leslie C. Milton","doi":"10.1109/WONS.2009.4801841","DOIUrl":null,"url":null,"abstract":"The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of on-demand routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), Min-Max Battery Cost Routing (MMBCR) and the traffic interference based Load Balancing Routing (LBR) protocol as representatives of the stability-based routing, power-aware routing and load-balancing routing protocols respectively. FORP incurs the least number of route transitions; while LBR incurs the smallest hop count and lowest end-to-end delay per data packet. Energy consumed per data packet is the least for LBR, closely followed by MMBCR. FORP incurs the maximum energy consumed per data packet, both in the absence and presence of power control. Nevertheless, in the presence of power control, the end-to-end delay per data packet and energy consumed per data packet incurred by FORP are significantly reduced compared to the scenario without power control. MMBCR is the most fair in terms of node usage and incurs the largest time for first node failure. FORP tends to repeatedly use nodes lying on the stable path and hence is the most unfair of the three routing protocols. FORP also incurs the smallest value for the time of first node failure.","PeriodicalId":292238,"journal":{"name":"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services","volume":"76 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A simulation based performance comparison study of stability-based routing, power-aware routing and load-balancing on-demand routing protocols for mobile ad hoc networks\",\"authors\":\"N. Meghanathan, Leslie C. Milton\",\"doi\":\"10.1109/WONS.2009.4801841\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of on-demand routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), Min-Max Battery Cost Routing (MMBCR) and the traffic interference based Load Balancing Routing (LBR) protocol as representatives of the stability-based routing, power-aware routing and load-balancing routing protocols respectively. FORP incurs the least number of route transitions; while LBR incurs the smallest hop count and lowest end-to-end delay per data packet. Energy consumed per data packet is the least for LBR, closely followed by MMBCR. FORP incurs the maximum energy consumed per data packet, both in the absence and presence of power control. Nevertheless, in the presence of power control, the end-to-end delay per data packet and energy consumed per data packet incurred by FORP are significantly reduced compared to the scenario without power control. MMBCR is the most fair in terms of node usage and incurs the largest time for first node failure. FORP tends to repeatedly use nodes lying on the stable path and hence is the most unfair of the three routing protocols. FORP also incurs the smallest value for the time of first node failure.\",\"PeriodicalId\":292238,\"journal\":{\"name\":\"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services\",\"volume\":\"76 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Sixth International Conference on Wireless On-Demand Network Systems and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WONS.2009.4801841\",\"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 Sixth International Conference on Wireless On-Demand Network Systems and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WONS.2009.4801841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文的高级贡献是基于仿真的移动自组织网络中三种不同类型的按需路由协议的详细性能比较:基于稳定性的路由,功率感知路由和负载平衡路由。我们分别选择基于流量的路由协议(FORP)、最小-最大电池成本路由协议(MMBCR)和基于流量干扰的负载均衡路由协议(LBR)作为基于稳定性的路由协议、功率感知路由协议和负载均衡路由协议的代表。FORP引起的路由转换次数最少;而LBR在每个数据包中产生最小的跳数和最低的端到端延迟。LBR中每个数据包消耗的能量最少,其次是MMBCR。无论是在没有电源控制还是有电源控制的情况下,FORP都会导致每个数据包消耗的最大能量。然而,在有电源控制的情况下,与没有电源控制的情况相比,FORP产生的每个数据包的端到端延迟和每个数据包的能量消耗显著降低。MMBCR在节点使用方面是最公平的,并且在第一个节点发生故障时花费的时间最长。FORP倾向于重复使用位于稳定路径上的节点,因此是三种路由协议中最不公平的。在第一个节点发生故障时,FORP的值也最小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A simulation based performance comparison study of stability-based routing, power-aware routing and load-balancing on-demand routing protocols for mobile ad hoc networks
The high-level contribution of this paper is a simulation-based detailed performance comparison of three different classes of on-demand routing protocols for mobile ad hoc networks: stability-based routing, power-aware routing and load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), Min-Max Battery Cost Routing (MMBCR) and the traffic interference based Load Balancing Routing (LBR) protocol as representatives of the stability-based routing, power-aware routing and load-balancing routing protocols respectively. FORP incurs the least number of route transitions; while LBR incurs the smallest hop count and lowest end-to-end delay per data packet. Energy consumed per data packet is the least for LBR, closely followed by MMBCR. FORP incurs the maximum energy consumed per data packet, both in the absence and presence of power control. Nevertheless, in the presence of power control, the end-to-end delay per data packet and energy consumed per data packet incurred by FORP are significantly reduced compared to the scenario without power control. MMBCR is the most fair in terms of node usage and incurs the largest time for first node failure. FORP tends to repeatedly use nodes lying on the stable path and hence is the most unfair of the three routing protocols. FORP also incurs the smallest value for the time of first node failure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信