Research on Optimizing Lifetime of Underwater Acoustic Networks Based on Ant Colony Algorithm

Haobo Hu, Hongjiang Zeng, Zhangjun Guan
{"title":"Research on Optimizing Lifetime of Underwater Acoustic Networks Based on Ant Colony Algorithm","authors":"Haobo Hu, Hongjiang Zeng, Zhangjun Guan","doi":"10.1145/3491315.3491345","DOIUrl":null,"url":null,"abstract":"With the advancement and implementation of national ocean strategies, the application of underwater acoustic sensor networks is of great significance. Due to the difficulty of charging or replacing batteries, how to extend the lifetime of underwater sensor networks is one of the key issues that needs to be solved. Typical acoustic routing algorithms mostly use static routing to confirm an energy optimal path and transmit information along this path. Although adopting static routing algorithms cost less energy for transmission, the energy of some specific nodes is quickly consumed, resulting in a short system lifetime. In this paper, we proposed a dynamic ant colony routing algorithm, which updates the routing table after each transmission, so as to make full use of the energy of most nodes. Simultaneously, an optimal path is selected in each transmission based on ant colony algorithm. Therefore, the proposed algorithm achieves both energy balance and minimum energy consumption at the same time, which greatly improves the system lifetime. Comparing with static ant colony routing and dynamic random routing, dynamic ant colony routing has the longest life span.","PeriodicalId":191580,"journal":{"name":"Proceedings of the 15th International Conference on Underwater Networks & Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th International Conference on Underwater Networks & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3491315.3491345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the advancement and implementation of national ocean strategies, the application of underwater acoustic sensor networks is of great significance. Due to the difficulty of charging or replacing batteries, how to extend the lifetime of underwater sensor networks is one of the key issues that needs to be solved. Typical acoustic routing algorithms mostly use static routing to confirm an energy optimal path and transmit information along this path. Although adopting static routing algorithms cost less energy for transmission, the energy of some specific nodes is quickly consumed, resulting in a short system lifetime. In this paper, we proposed a dynamic ant colony routing algorithm, which updates the routing table after each transmission, so as to make full use of the energy of most nodes. Simultaneously, an optimal path is selected in each transmission based on ant colony algorithm. Therefore, the proposed algorithm achieves both energy balance and minimum energy consumption at the same time, which greatly improves the system lifetime. Comparing with static ant colony routing and dynamic random routing, dynamic ant colony routing has the longest life span.
基于蚁群算法的水声网络寿命优化研究
随着国家海洋战略的推进和实施,水声传感器网络的应用具有重要意义。由于充电和更换电池的困难,如何延长水下传感器网络的使用寿命是需要解决的关键问题之一。典型的声路由算法大多采用静态路由来确定能量最优路径,并沿此路径传输信息。采用静态路由算法虽然传输能量较少,但某些特定节点的能量消耗很快,导致系统生命周期较短。本文提出了一种动态蚁群路由算法,该算法在每次传输后更新路由表,以充分利用大多数节点的能量。同时,基于蚁群算法在每次传输中选择最优路径。因此,该算法同时实现了能量平衡和能量消耗最小化,大大提高了系统的寿命。与静态蚁群路由和动态随机路由相比,动态蚁群路由具有最长的生命周期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信