Energy efficient routing for Mobile underwater wireless sensor networks

Sihem Souiki, M. Hadjila, M. Feham
{"title":"Energy efficient routing for Mobile underwater wireless sensor networks","authors":"Sihem Souiki, M. Hadjila, M. Feham","doi":"10.1109/ISPS.2015.7244965","DOIUrl":null,"url":null,"abstract":"Similar to the terrestrial sensor networks, the design of underwater wireless sensor networks (UWSN) has several challenges such as limited bandwidth, defective underwater channels and high propagation delay. Another primordial problem in UWSN is energy resource depletion of sensor node, which cannot be recharged; also solar energy cannot be exploited. In the coming years the number of sensor used in UWSN will be increased, thus our motivation of this study was to propose a routing algorithm for energy-constrained underwater system environments. In this paper two new clustering algorithms are proposed for Mobile underwater wireless sensor networks KEER and its enhanced version EKEER that aim to extend the network's lifetime. In both the algorithms, k-means clustering is used in the clustering phase. In the CH-selection step, the cluster head is elected initially based on the closeness to the center of the cluster, then the node having the higher residual energy elects itself as a cluster head in the next rounds. The extended version of KEER algorithm use a multihop transmission between the CHs and underwater sink and this brought significant improvement in terms of energy consumption. These algorithms are extensively simulated using random mobility model, with different speeds to evaluate their performance. Simulation results show that both KEER and EKEER are successful in achieving their goals.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th International Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2015.7244965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Similar to the terrestrial sensor networks, the design of underwater wireless sensor networks (UWSN) has several challenges such as limited bandwidth, defective underwater channels and high propagation delay. Another primordial problem in UWSN is energy resource depletion of sensor node, which cannot be recharged; also solar energy cannot be exploited. In the coming years the number of sensor used in UWSN will be increased, thus our motivation of this study was to propose a routing algorithm for energy-constrained underwater system environments. In this paper two new clustering algorithms are proposed for Mobile underwater wireless sensor networks KEER and its enhanced version EKEER that aim to extend the network's lifetime. In both the algorithms, k-means clustering is used in the clustering phase. In the CH-selection step, the cluster head is elected initially based on the closeness to the center of the cluster, then the node having the higher residual energy elects itself as a cluster head in the next rounds. The extended version of KEER algorithm use a multihop transmission between the CHs and underwater sink and this brought significant improvement in terms of energy consumption. These algorithms are extensively simulated using random mobility model, with different speeds to evaluate their performance. Simulation results show that both KEER and EKEER are successful in achieving their goals.
移动水下无线传感器网络的节能路由
与地面传感器网络类似,水下无线传感器网络(UWSN)的设计也面临带宽有限、水下信道缺陷和传播时延高等问题。UWSN存在的另一个基本问题是传感器节点的能量耗尽,无法得到补充;此外,太阳能也不能被利用。在未来几年,UWSN中使用的传感器数量将会增加,因此我们的研究动机是提出一种能量受限的水下系统环境的路由算法。本文针对移动水下无线传感器网络KEER及其增强版EKEER提出了两种新的聚类算法,旨在延长网络的生存期。在这两种算法中,聚类阶段都使用k-means聚类。在ch选择步骤中,首先根据与簇中心的接近程度选出簇头,然后在接下来的几轮中选出剩余能量较高的节点作为簇头。KEER算法的扩展版本在CHs和水下sink之间使用多跳传输,这在能耗方面带来了显着改善。采用随机迁移模型对这些算法进行了广泛的仿真,以不同的速度来评估它们的性能。仿真结果表明,KEER和EKEER都成功地实现了目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信