Efficient Data Collection in Interference-Aware Wireless Sensor Networks

Min Kyung An, Hyuk Cho
{"title":"Efficient Data Collection in Interference-Aware Wireless Sensor Networks","authors":"Min Kyung An, Hyuk Cho","doi":"10.4304/jnw.10.12.658-667","DOIUrl":null,"url":null,"abstract":"In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. First, we describe an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network. Then, we validate the latency performance of the proposed algorithm with various simulated networks, demonstrate the robustness of the algorithms with different network parameters, and discuss the effect of the interference models’ parameter values on the latency","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"38 5","pages":"658-667"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4304/jnw.10.12.658-667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. First, we describe an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network. Then, we validate the latency performance of the proposed algorithm with various simulated networks, demonstrate the robustness of the algorithms with different network parameters, and discuss the effect of the interference models’ parameter values on the latency
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
干扰感知无线传感器网络中的高效数据采集
本文研究了无线传感器网络(WSNs)中的最小延迟采集调度(MLCS)问题,采用两种干扰模型:图模型和更现实的物理干扰模型,即信噪比(SINR)。MLCS问题的主要问题是计算最小延迟调度,即计算一个具有最小时隙数的调度,使所有节点的所有数据都能收集到一个汇聚节点,而不发生碰撞或干扰。首先,我们描述了一种具有O(1)-近似比的近似算法,该算法通过产生一个延迟以O(n)为界的调度来在两种干扰模型中工作,其中n是网络中的节点数。然后,我们用各种模拟网络验证了所提出算法的延迟性能,证明了算法在不同网络参数下的鲁棒性,并讨论了干扰模型参数值对延迟的影响
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Asynchronous Multi-Channel MAC Protocol A Wireless Charging Infrastructure for Future Electrical Vehicular Adhoc Networks Application of Predictive Analytics in Telecommunications Project Management Secondary User Aggressiveness Optimization in Sensing-Transmission Scheduling for Cognitive Radio Networks Enhanced Chunk Regulation Algorithm for Superior QoS in Heterogeneous P2P Video on Demand
×
引用
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