Sensors, Vol. 19, Pages 3970: Optimal Number of Message Transmissions forProbabilistic Guarantee of Latency in the IoT

We present two methods to compute the maximum number of transmissions per message required to achieve R. M F a i r is very easy to compute, whereas M O p t minimizes the total number of transmissions necessary for a message to reach the sink. M F a i r and M O p t are then integrated into a TSCH network with a load-based scheduler to evaluate the three KPIs on a generic data-gathering application. We first consider a toy example with eight nodes where the maximum number of transmissions M a x T r a n s is tuned per link and per flow. Finally, a network of 50 nodes, representative of real network deployments, is evaluated assuming M a x T r a n s is fixed. For both TSCH networks, we show that M O p t provides a better reliability and a longer lifetime than M F a i r , which provides a shorter average end-to-end latency. M O p t provides more predictable end-to-end performances than Kausa, a KPI-aware, state-of-the-art scheduler.

Source: Sensors - September 13, 2019 Category: Biotechnology Authors: Pascale Minet Yasuyuki Tanaka Tags: Article Source Type: research