城域网服务区网关预测算法性能分析

M. Chaudhari, P. Koleva, V. Poulkov
{"title":"城域网服务区网关预测算法性能分析","authors":"M. Chaudhari, P. Koleva, V. Poulkov","doi":"10.1109/TSP.2017.8075939","DOIUrl":null,"url":null,"abstract":"In this paper the performance analysis of a routing algorithm for MANETs called Service Zone Gateway Prediction (SZGP) is presented. This is a non-cooperative and hybrid type of routing with a hierarchical multilayered structure, incorporating pre-computed multipath hop-by-hop distributed connectivity. The goal is balance of the load among the nodes and reliable and energy efficient communication based on the formation of zones of service (ZS) and choice of nodes as Default Gateways (DG). A weight parameter that is function of the nominal available power and the transmission range of the nodes in the network is introduced. The routing is based on the formation of ZS in each network layer and choice of DG for each ZS considering this weight parameter. Simulation scenarios where the performance of the SZGP algorithm is compared to the well-known Ad-hoc On Demand Distance Vector (AODV) routing are developed. The results show that the performance of SZGP related to parameters such as reporting ratio, packet delivery, delay and throughput are similar to those of AODV, but in relation to power efficiency the proposed algorithm outperforms the latter significantly.","PeriodicalId":256818,"journal":{"name":"2017 40th International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance analysis of service zone gateway prediction algorithm for MANETs\",\"authors\":\"M. Chaudhari, P. Koleva, V. Poulkov\",\"doi\":\"10.1109/TSP.2017.8075939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the performance analysis of a routing algorithm for MANETs called Service Zone Gateway Prediction (SZGP) is presented. This is a non-cooperative and hybrid type of routing with a hierarchical multilayered structure, incorporating pre-computed multipath hop-by-hop distributed connectivity. The goal is balance of the load among the nodes and reliable and energy efficient communication based on the formation of zones of service (ZS) and choice of nodes as Default Gateways (DG). A weight parameter that is function of the nominal available power and the transmission range of the nodes in the network is introduced. The routing is based on the formation of ZS in each network layer and choice of DG for each ZS considering this weight parameter. Simulation scenarios where the performance of the SZGP algorithm is compared to the well-known Ad-hoc On Demand Distance Vector (AODV) routing are developed. The results show that the performance of SZGP related to parameters such as reporting ratio, packet delivery, delay and throughput are similar to those of AODV, but in relation to power efficiency the proposed algorithm outperforms the latter significantly.\",\"PeriodicalId\":256818,\"journal\":{\"name\":\"2017 40th International Conference on Telecommunications and Signal Processing (TSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 40th International Conference on Telecommunications and Signal Processing (TSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSP.2017.8075939\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 40th International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2017.8075939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文对一种用于manet的路由算法——服务区网关预测算法(SZGP)进行了性能分析。这是一种非合作和混合类型的路由,具有分层多层结构,包含预先计算的多路径逐跳分布式连接。目标是基于服务区域(ZS)的形成和节点作为默认网关(DG)的选择,在节点之间平衡负载和可靠节能的通信。引入了一个权重参数,它是网络中节点的标称可用功率和传输范围的函数。路由是基于在每个网络层中形成的ZS,并考虑该权重参数为每个ZS选择DG。开发了仿真场景,将SZGP算法的性能与著名的Ad-hoc随需应变距离矢量(AODV)路由进行了比较。结果表明,SZGP在报告率、分组投递、延迟和吞吐量等参数方面的性能与AODV相似,但在功率效率方面明显优于AODV。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance analysis of service zone gateway prediction algorithm for MANETs
In this paper the performance analysis of a routing algorithm for MANETs called Service Zone Gateway Prediction (SZGP) is presented. This is a non-cooperative and hybrid type of routing with a hierarchical multilayered structure, incorporating pre-computed multipath hop-by-hop distributed connectivity. The goal is balance of the load among the nodes and reliable and energy efficient communication based on the formation of zones of service (ZS) and choice of nodes as Default Gateways (DG). A weight parameter that is function of the nominal available power and the transmission range of the nodes in the network is introduced. The routing is based on the formation of ZS in each network layer and choice of DG for each ZS considering this weight parameter. Simulation scenarios where the performance of the SZGP algorithm is compared to the well-known Ad-hoc On Demand Distance Vector (AODV) routing are developed. The results show that the performance of SZGP related to parameters such as reporting ratio, packet delivery, delay and throughput are similar to those of AODV, but in relation to power efficiency the proposed algorithm outperforms the latter significantly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信