Throughput vs. Resilience in Multi-hop Wireless Sensor Networks with Periodic Packet Traffic

Bartlomiej Ostrowski, M. Pióro, A. Tomaszewski, M. Nowak, I. Kalesnikau
{"title":"Throughput vs. Resilience in Multi-hop Wireless Sensor Networks with Periodic Packet Traffic","authors":"Bartlomiej Ostrowski, M. Pióro, A. Tomaszewski, M. Nowak, I. Kalesnikau","doi":"10.1109/DRCN48652.2020.1570610581","DOIUrl":null,"url":null,"abstract":"In this paper we consider multi-hop wireless sensor networks using time division multiple access to radio channel. It is assumed that packets, periodically generated at the sensors at the beginning of each consecutive time frame, are to be delivered to (Internet) gateways. Although in the nominal network condition it is sufficient when the packet streams produced by each sensor reach one of the gateways, from resilience viewpoint it would be advantageous to deliver them to multiple gateways, preferably using the broadcast capability of wireless nodes. Clearly, under the assumption of periodic packet traffic, a longer frame must be used when packets are to be delivered (without losses) to multiple gateways rather to single gateways. Since traffic throughput (one packet per stream per frame) is inversely proportional to the frame length, a clear tradeoff between resilience and traffic throughput arises. In the paper we present a numerical study, using a modification of our previous optimization model for frame length minimization in the considered kind of networks, that illustrates the relation between the frame length and the number of gateways each packet stream is supposed to reach. A general conclusion is that the frame length increase is non-negligible when multiple gateways are assumed, and depends heavily on the way the resulting multicast traffic is handled and how the particular subsets of gateways are selected for particular streams.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"40 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN48652.2020.1570610581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper we consider multi-hop wireless sensor networks using time division multiple access to radio channel. It is assumed that packets, periodically generated at the sensors at the beginning of each consecutive time frame, are to be delivered to (Internet) gateways. Although in the nominal network condition it is sufficient when the packet streams produced by each sensor reach one of the gateways, from resilience viewpoint it would be advantageous to deliver them to multiple gateways, preferably using the broadcast capability of wireless nodes. Clearly, under the assumption of periodic packet traffic, a longer frame must be used when packets are to be delivered (without losses) to multiple gateways rather to single gateways. Since traffic throughput (one packet per stream per frame) is inversely proportional to the frame length, a clear tradeoff between resilience and traffic throughput arises. In the paper we present a numerical study, using a modification of our previous optimization model for frame length minimization in the considered kind of networks, that illustrates the relation between the frame length and the number of gateways each packet stream is supposed to reach. A general conclusion is that the frame length increase is non-negligible when multiple gateways are assumed, and depends heavily on the way the resulting multicast traffic is handled and how the particular subsets of gateways are selected for particular streams.
具有周期性分组流量的多跳无线传感器网络的吞吐量与弹性
本文研究了无线信道时分多址的多跳无线传感器网络。假设在每个连续时间段的开始,传感器周期性地生成数据包,并将其发送到(Internet)网关。虽然在标称网络条件下,每个传感器产生的数据包流到达其中一个网关就足够了,但从弹性的角度来看,将它们发送到多个网关是有利的,最好使用无线节点的广播能力。显然,在周期性数据包流量的假设下,当要将数据包(无丢失)发送到多个网关而不是单个网关时,必须使用更长的帧。由于流量吞吐量(每帧每流一个数据包)与帧长度成反比,因此在弹性和流量吞吐量之间产生了明显的权衡。在本文中,我们提出了一个数值研究,在考虑的网络类型中,使用我们之前的帧长度最小化优化模型的修改,说明了帧长度与每个数据包流应该到达的网关数量之间的关系。一般的结论是,当假设有多个网关时,帧长度的增加是不可忽略的,并且在很大程度上取决于处理多播流量的方式以及如何为特定的流选择特定的网关子集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信