Energy Aware Localized Routing in Rendezvous Point Based Mobile Sink Strategy for Wireless Sensor Networks

A. R. Kumar, A. Sivagami
{"title":"Energy Aware Localized Routing in Rendezvous Point Based Mobile Sink Strategy for Wireless Sensor Networks","authors":"A. R. Kumar, A. Sivagami","doi":"10.1109/i-PACT44901.2019.8960021","DOIUrl":null,"url":null,"abstract":"In recent years several studies have been carried to explore the potential metrics of a mobile sink node to optimize the complex WSN routing and also to regulate the packet delivery rate among the sensor nodes. However, it has major limitations particularly in delay-bound applications, where all data gathered must be forwarded within a given time delay. These bound delays are dependent on the travelling path taken by the mobile sink. Here in order to regulate the mobile sink path a hybrid approach is proposed to address this challenge and also formulated new moving pattern where the mobile-sink node visits only rendezvous points (RPs), as opposed to travelling each nodes in WSN. Information from all other nodes all Sensor nodes that are not RPs forward their payload data via multi-hopping to the nearest RP. Then two basic fundamental problems are arises: computation of mobile sink travelling paths that can visit all RPs within a given time delay and conserving the energy consumption of mobile sink to improve the life time of the WSN. To address the first problem, a heuristic called adoptive rendezvous planning (WRP) is proposed, where each sensor node is assigned a priority corresponding to its hop distance from the mobile sink path taken and the traffic rate that forwards to the closest RP. And energy aware local routing is used for energy efficiency. Finally RP based mobile sink model is validated via extensive network simulation, and through simulation results we proved that proposed RP model allows mobile sink to gather all information within a given time while. Local routing for each RP node reduces energy consumption by 39% and increases network lifetime by 12%, as compared with all other state-of-the-art algorithms.","PeriodicalId":214890,"journal":{"name":"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Innovations in Power and Advanced Computing Technologies (i-PACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/i-PACT44901.2019.8960021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent years several studies have been carried to explore the potential metrics of a mobile sink node to optimize the complex WSN routing and also to regulate the packet delivery rate among the sensor nodes. However, it has major limitations particularly in delay-bound applications, where all data gathered must be forwarded within a given time delay. These bound delays are dependent on the travelling path taken by the mobile sink. Here in order to regulate the mobile sink path a hybrid approach is proposed to address this challenge and also formulated new moving pattern where the mobile-sink node visits only rendezvous points (RPs), as opposed to travelling each nodes in WSN. Information from all other nodes all Sensor nodes that are not RPs forward their payload data via multi-hopping to the nearest RP. Then two basic fundamental problems are arises: computation of mobile sink travelling paths that can visit all RPs within a given time delay and conserving the energy consumption of mobile sink to improve the life time of the WSN. To address the first problem, a heuristic called adoptive rendezvous planning (WRP) is proposed, where each sensor node is assigned a priority corresponding to its hop distance from the mobile sink path taken and the traffic rate that forwards to the closest RP. And energy aware local routing is used for energy efficiency. Finally RP based mobile sink model is validated via extensive network simulation, and through simulation results we proved that proposed RP model allows mobile sink to gather all information within a given time while. Local routing for each RP node reduces energy consumption by 39% and increases network lifetime by 12%, as compared with all other state-of-the-art algorithms.
无线传感器网络中基于汇聚点移动汇聚策略的能量感知局部路由
近年来,人们进行了一些研究,探索移动汇聚节点的潜在度量,以优化复杂的WSN路由,并调节传感器节点之间的数据包传输速率。但是,它有很大的局限性,特别是在延迟绑定的应用程序中,其中收集的所有数据必须在给定的时间延迟内转发。这些绑定延迟依赖于移动接收器所采取的行进路径。为了调节移动汇聚路径,提出了一种混合方法来解决这一挑战,并制定了新的移动模式,其中移动汇聚节点只访问集合点(rp),而不是在WSN中移动每个节点。来自所有其他节点的信息,所有不是RP的传感器节点通过多跳转发其有效载荷数据到最近的RP。在此基础上提出了两个基本问题:在给定的时间延迟内计算能够访问所有rp的移动sink行进路径和节约移动sink的能量消耗以提高无线传感器网络的寿命。为了解决第一个问题,提出了一种启发式的自适应交会规划(WRP),其中每个传感器节点根据其与移动汇聚路径的跳距离和转发到最近RP的流量速率分配优先级。能源敏感的本地路由用于提高能源效率。最后,通过广泛的网络仿真验证了基于RP的移动sink模型,通过仿真结果证明了RP模型允许移动sink在给定时间内收集所有信息。与所有其他最先进的算法相比,每个RP节点的本地路由减少了39%的能耗,并将网络寿命延长了12%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信