无线传感器网络中路径约束移动接收器速度控制的最大数据采集

Dr. Naween Kumar, D. Dash
{"title":"无线传感器网络中路径约束移动接收器速度控制的最大数据采集","authors":"Dr. Naween Kumar, D. Dash","doi":"10.1109/ISED.2017.8303933","DOIUrl":null,"url":null,"abstract":"Recently, mobile sink based data gathering has been getting popularity among researchers in Wireless Sensor Networks (WSNs. As, sink mobility achieves prolonged network lifetime of the network by distributing load among the sensors. In certain applications, a mobile sink has to be moved along a given fixed path. But, due to fixed path and relatively slower speed of mobile sink, data gathering is delayed. Which can be reduced through optimizing the motion of the mobile sink. In this paper, our focus is to find the speed-schedule of the path-constrained mobile sink along a fixed path such that, the mobile sink will collect maximum data from the network within a given time. We refer the proposed problem as maximum data gathering motion planning of a mobile sink within a fixed time deadline (MDMPMS). We propose a deterministic polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.","PeriodicalId":147019,"journal":{"name":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Maximum data gathering through speed control of path-constrained mobile sink in WSN\",\"authors\":\"Dr. Naween Kumar, D. Dash\",\"doi\":\"10.1109/ISED.2017.8303933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, mobile sink based data gathering has been getting popularity among researchers in Wireless Sensor Networks (WSNs. As, sink mobility achieves prolonged network lifetime of the network by distributing load among the sensors. In certain applications, a mobile sink has to be moved along a given fixed path. But, due to fixed path and relatively slower speed of mobile sink, data gathering is delayed. Which can be reduced through optimizing the motion of the mobile sink. In this paper, our focus is to find the speed-schedule of the path-constrained mobile sink along a fixed path such that, the mobile sink will collect maximum data from the network within a given time. We refer the proposed problem as maximum data gathering motion planning of a mobile sink within a fixed time deadline (MDMPMS). We propose a deterministic polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.\",\"PeriodicalId\":147019,\"journal\":{\"name\":\"2017 7th International Symposium on Embedded Computing and System Design (ISED)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 7th International Symposium on Embedded Computing and System Design (ISED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISED.2017.8303933\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2017.8303933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

近年来,基于移动汇聚的数据采集技术受到了无线传感器网络研究人员的广泛关注。由于sink迁移通过在传感器之间分配负载来延长网络的生存期。在某些应用中,移动接收器必须沿着给定的固定路径移动。但由于移动sink的路径固定,速度相对较慢,导致数据采集延迟。这可以通过优化移动水槽的运动来减少。在本文中,我们的重点是找到路径约束的移动接收器沿固定路径的速度调度,使移动接收器在给定时间内从网络中收集最大的数据。我们将所提出的问题称为移动接收器在固定时间期限内的最大数据收集运动规划。我们提出了一个确定性多项式时间算法来解决这个问题。此外,我们在MATLAB中使用仿真来评估所提出算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Maximum data gathering through speed control of path-constrained mobile sink in WSN
Recently, mobile sink based data gathering has been getting popularity among researchers in Wireless Sensor Networks (WSNs. As, sink mobility achieves prolonged network lifetime of the network by distributing load among the sensors. In certain applications, a mobile sink has to be moved along a given fixed path. But, due to fixed path and relatively slower speed of mobile sink, data gathering is delayed. Which can be reduced through optimizing the motion of the mobile sink. In this paper, our focus is to find the speed-schedule of the path-constrained mobile sink along a fixed path such that, the mobile sink will collect maximum data from the network within a given time. We refer the proposed problem as maximum data gathering motion planning of a mobile sink within a fixed time deadline (MDMPMS). We propose a deterministic polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
OTORNoC: Optical tree of rings network on chip for 1000 core systems A new memory scheduling policy for real time systems All optical design of cost efficient multiplier circuit using terahertz optical asymmetric demultiplexer Application of variational mode decomposition and ABC optimized DAG-SVM in arrhythmia analysis An empirical study on performance of branch predictors with varying storage budgets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1