k-连通manet拓扑更新间隔优化

C. Krishna, S. Agrawal, A. Garg
{"title":"k-连通manet拓扑更新间隔优化","authors":"C. Krishna, S. Agrawal, A. Garg","doi":"10.1109/ACCT.2015.9","DOIUrl":null,"url":null,"abstract":"In this paper, we determine optimal topology update interval for fault tolerant k-edge connected topology update algorithm Local Tree-based Reliable Topology (LTRT) used in Mobile Ad-hoc Networks (MANETs). Topology update algorithms are periodically run on each participant node of MANET. This period called topology update interval (Δt), is chosen to be uniform. However, neither a high nor a low value of Δt is suitable for a MANET due to unpredictable moving speed of nodes and connectivity ratio and power consumption restrictions. In this paper a method is proposed to dynamically determine the optimal value of topology update interval for k-edge connected topology control algorithm LTRT used in MANETs. The proposed method automatically determines the appropriate value of Δt while ensuring the required connectivity ratio of the whole network for a given node speed and energy consumption goal. The results show that the dynamic method can enhance the network connectivity, allow higher moving speed and improve the performance of network on the same cost, in terms of transmission range that is directly related to power consumption.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of Topology Update Interval for k-Connected MANETs\",\"authors\":\"C. Krishna, S. Agrawal, A. Garg\",\"doi\":\"10.1109/ACCT.2015.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we determine optimal topology update interval for fault tolerant k-edge connected topology update algorithm Local Tree-based Reliable Topology (LTRT) used in Mobile Ad-hoc Networks (MANETs). Topology update algorithms are periodically run on each participant node of MANET. This period called topology update interval (Δt), is chosen to be uniform. However, neither a high nor a low value of Δt is suitable for a MANET due to unpredictable moving speed of nodes and connectivity ratio and power consumption restrictions. In this paper a method is proposed to dynamically determine the optimal value of topology update interval for k-edge connected topology control algorithm LTRT used in MANETs. The proposed method automatically determines the appropriate value of Δt while ensuring the required connectivity ratio of the whole network for a given node speed and energy consumption goal. The results show that the dynamic method can enhance the network connectivity, allow higher moving speed and improve the performance of network on the same cost, in terms of transmission range that is directly related to power consumption.\",\"PeriodicalId\":351783,\"journal\":{\"name\":\"2015 Fifth International Conference on Advanced Computing & Communication Technologies\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Fifth International Conference on Advanced Computing & Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACCT.2015.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACCT.2015.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了移动自组织网络(manet)中基于本地树的可靠拓扑(LTRT)容错k边连接拓扑更新算法的最优拓扑更新间隔。拓扑更新算法周期性地在MANET的每个参与节点上运行。此周期称为拓扑更新间隔(Δt),选择此周期是为了保持一致。但是,由于节点的移动速度不可预测,连接率和功耗的限制,Δt的高值和低值都不适合MANET。本文提出了一种动态确定网络中k边连通拓扑控制算法LTRT拓扑更新间隔最优值的方法。该方法在保证给定节点速度和能耗目标下全网所需的连接率的同时,自动确定Δt的合适值。结果表明,在与功耗直接相关的传输范围方面,动态方法可以在相同的成本下增强网络连通性,允许更高的移动速度并改善网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Topology Update Interval for k-Connected MANETs
In this paper, we determine optimal topology update interval for fault tolerant k-edge connected topology update algorithm Local Tree-based Reliable Topology (LTRT) used in Mobile Ad-hoc Networks (MANETs). Topology update algorithms are periodically run on each participant node of MANET. This period called topology update interval (Δt), is chosen to be uniform. However, neither a high nor a low value of Δt is suitable for a MANET due to unpredictable moving speed of nodes and connectivity ratio and power consumption restrictions. In this paper a method is proposed to dynamically determine the optimal value of topology update interval for k-edge connected topology control algorithm LTRT used in MANETs. The proposed method automatically determines the appropriate value of Δt while ensuring the required connectivity ratio of the whole network for a given node speed and energy consumption goal. The results show that the dynamic method can enhance the network connectivity, allow higher moving speed and improve the performance of network on the same cost, in terms of transmission range that is directly related to power consumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信