水下无线传感器网络节能路由协议的设计与仿真

Charan Kumar A M, K. Nagamani
{"title":"水下无线传感器网络节能路由协议的设计与仿真","authors":"Charan Kumar A M, K. Nagamani","doi":"10.1109/icecct52121.2021.9616762","DOIUrl":null,"url":null,"abstract":"In today’s world the Under-Water Sensor networks (UWSNs) are used for variety of applications. However, exchange of information in underwater is challenging hence it’s very much required to design a routing algorithm that increase overall Network lifetime and reduce energy consumption. The nodes are spread into multiple areas and then from each area the cluster head is chosen to perform inter cluster communication. There are several approaches in which cluster head can be selected either based on random probability or based on residual energy or by considering mobility-based factors, but they suffer from choosing a nonperforming resource as cluster head. In this work first cluster formation is optimized by making use of un-supervised k means machine learning algorithm, secondly selection of cluster head is done based on multiple parameters like distance with respect to Control Center node, residual energy and based on mobility factor of the nodes thereby having the optimized node as the cluster head election. Here the algorithm used are Depth Based routing (DBR), Depth and Energy Aware dominating set (DEADs), Region Based Courier-nodes Mobility with Incremental Cooperative (RBCMIC) and Modified RBCMIC. This paper simulates all four algorithms and checked which algorithm help in better energy efficiency. Simulation results also show comparison of all algorithms in terms of parameters like End-to-End delay, number of hops, Alive nodes, Dead nodes, Energy consumption, Lifetime ratio.","PeriodicalId":155129,"journal":{"name":"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design and Simulation of Energy Efficient Routing Protocols for Underwater Wireless Sensor Networks\",\"authors\":\"Charan Kumar A M, K. Nagamani\",\"doi\":\"10.1109/icecct52121.2021.9616762\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In today’s world the Under-Water Sensor networks (UWSNs) are used for variety of applications. However, exchange of information in underwater is challenging hence it’s very much required to design a routing algorithm that increase overall Network lifetime and reduce energy consumption. The nodes are spread into multiple areas and then from each area the cluster head is chosen to perform inter cluster communication. There are several approaches in which cluster head can be selected either based on random probability or based on residual energy or by considering mobility-based factors, but they suffer from choosing a nonperforming resource as cluster head. In this work first cluster formation is optimized by making use of un-supervised k means machine learning algorithm, secondly selection of cluster head is done based on multiple parameters like distance with respect to Control Center node, residual energy and based on mobility factor of the nodes thereby having the optimized node as the cluster head election. Here the algorithm used are Depth Based routing (DBR), Depth and Energy Aware dominating set (DEADs), Region Based Courier-nodes Mobility with Incremental Cooperative (RBCMIC) and Modified RBCMIC. This paper simulates all four algorithms and checked which algorithm help in better energy efficiency. Simulation results also show comparison of all algorithms in terms of parameters like End-to-End delay, number of hops, Alive nodes, Dead nodes, Energy consumption, Lifetime ratio.\",\"PeriodicalId\":155129,\"journal\":{\"name\":\"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icecct52121.2021.9616762\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Fourth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icecct52121.2021.9616762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在当今世界,水下传感器网络(UWSNs)被用于各种应用。然而,水下信息交换具有挑战性,因此非常需要设计一种路由算法,以增加整体网络寿命并降低能耗。节点被分散到多个区域,然后从每个区域中选择集群头进行集群间通信。有几种方法可以基于随机概率或基于剩余能量或考虑基于移动性的因素来选择簇头,但它们都存在选择不执行的资源作为簇头的问题。本文首先利用无监督k均值机器学习算法对簇的形成进行优化,然后根据与控制中心节点的距离、剩余能量等多个参数以及节点的迁移系数进行簇头的选择,以优化后的节点作为簇头的选择。这里使用的算法是基于深度的路由(DBR),深度和能量感知支配集(DEADs),基于区域的信使节点移动与增量合作(RBCMIC)和改进的RBCMIC。本文对这四种算法进行了仿真,并检验了哪种算法能更好地提高能源效率。仿真结果还显示了所有算法在端到端延迟、跳数、活节点、死节点、能耗、寿命比等参数方面的比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and Simulation of Energy Efficient Routing Protocols for Underwater Wireless Sensor Networks
In today’s world the Under-Water Sensor networks (UWSNs) are used for variety of applications. However, exchange of information in underwater is challenging hence it’s very much required to design a routing algorithm that increase overall Network lifetime and reduce energy consumption. The nodes are spread into multiple areas and then from each area the cluster head is chosen to perform inter cluster communication. There are several approaches in which cluster head can be selected either based on random probability or based on residual energy or by considering mobility-based factors, but they suffer from choosing a nonperforming resource as cluster head. In this work first cluster formation is optimized by making use of un-supervised k means machine learning algorithm, secondly selection of cluster head is done based on multiple parameters like distance with respect to Control Center node, residual energy and based on mobility factor of the nodes thereby having the optimized node as the cluster head election. Here the algorithm used are Depth Based routing (DBR), Depth and Energy Aware dominating set (DEADs), Region Based Courier-nodes Mobility with Incremental Cooperative (RBCMIC) and Modified RBCMIC. This paper simulates all four algorithms and checked which algorithm help in better energy efficiency. Simulation results also show comparison of all algorithms in terms of parameters like End-to-End delay, number of hops, Alive nodes, Dead nodes, Energy consumption, Lifetime ratio.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信