论文标题
通过事件链计算,精确有效的802.15.4 CSMA/CA的建模未经缝隙
Accurate and Efficient Modeling of 802.15.4 Unslotted CSMA/CA through Event Chains Computation
论文作者
论文摘要
已经提出了许多分析模型,用于评估事件驱动的802.15.4无线传感器网络(WSNS)的性能,并在非Beacon启用(NBE)模式下。但是,由于障碍性问题和/或简化的假设,现有模型无法对大规模WSN进行准确的分析。在本文中,我们提出了一种称为事件链计算(ECC)的新方法,以建模用于在NBE模式下用于通道访问的未塞CSMA/CA算法。 ECC依赖于CSMA/CA算法的结果可以表示为随后发生在网络中的事件的链。尽管ECC可以产生所有可能的结果,但它仅考虑链的发生率大于预定义的阈值以降低复杂性。此外,ECC通过通过不同的线程管理不同的链条并行计算。我们的结果表明,通过适当的阈值选择,可以大幅度降低得出性能指标的时间,对准确性的影响可忽略不计。我们还表明,计算时间几乎随着使用的线程数量而线性减少。我们通过模拟和测试实验来验证我们的模型,并使用它来研究不同参数对WSN性能的影响,以交付比率,延迟和能耗。
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.