Many analytical models have been proposed for evaluating the performance of event-driven 802.15.4 Wireless Sensor Networks (WSNs), in Non-Beacon Enabled (NBE) mode. However, existing models do not provide accurate analysis of large-scale WSNs, due to tractability issues and/or simplifying assumptions. In this paper, we propose a new approach called Event Chains Computation (ECC) to model the unslotted CSMA/CA algorithm used for channel access in NBE mode. ECC relies on the idea that outcomes of the CSMA/CA algorithm can be represented as chains of events that subsequently occur in the network. Although ECC can generate all the possible outcomes, it only considers chains with a probability to occur greater than a pre-defined threshold to reduce complexity. Furthermore, ECC parallelizes the computation by managing different chains through different threads. Our results show that, by an appropriate threshold selection, the time to derive performance metrics can be drastically reduced, with negligible impact on accuracy. We also show that the computation time decreases almost linearly with the number of employed threads. We validate our model through simulations and testbed experiments, and use it to investigate the impact of different parameters on the WSN performance, in terms of delivery ratio, latency, and energy consumption.
翻译:已经提出了许多分析模型,用于评价以非环境促进(NBE)模式为主的事件驱动802.15.4无线传感器网络(WSN)的性能,然而,由于可移动性问题和/或简化假设,现有模型无法准确分析大规模WSNS的性能。在本文中,我们提出了一种名为“事件链计算”的新方法,以模拟在NBE模式中用于频道访问的未排列的CSMA/CA算法。ECC基于这样一种想法,即CSMA/CA算法的结果可以作为随后在网络中发生的事件的链条来体现。虽然ECC可以产生所有可能的结果,但是它只考虑比预先确定的临界值更有可能发生得多的链以降低复杂性。此外,ECC通过不同线索管理不同的链进行计算。我们的结果显示,通过适当的阈值选择,得出性能指标的时间可以大幅度缩短,对准确性影响微乎其微。我们还表明,计算时间几乎线性缩短了计算时间,而使用螺旋值的参数数则在WSIS的交付参数上,我们通过模拟和实验来验证我们的模型。