No abstract

Low-power wide-area network (LPWAN) technologies are gaining momentum for internet-of-things (IoT) applications since they promise wide coverage to a massive number of battery-operated devices using grant-free medium access. LoRaWAN, with its physical (PHY) layer design and regulatory efforts, has emerged as the widely adopted LPWAN solution. By using chirp spread spectrum modulation with qausi-orthogonal spreading factors (SFs), LoRa PHY offers coverage to wide-area applications while supporting high-density of devices. However, thus far its scalability performance has been inadequately modeled and the effect of interference resulting from the imperfect orthogonality of the SFs has not been considered. In this paper, we present an analytical model of a single-cell LoRa system that accounts for the impact of interference among transmissions over the same SF (co-SF) as well as different SFs (inter-SF). By modeling the interference field as Poisson point process under duty-cycled ALOHA, we derive the signal-to-interference ratio (SIR) distributions for several interference conditions. Results show that, for a duty cycle as low as 0.33%, the network performance under co-SF interference alone is considerably optimistic as the inclusion of inter-SF interference unveils a further drop in the success probability and the coverage probability of approximately 10% and 15%, respectively for 1500 devices in a LoRa channel. Finally, we illustrate how our analysis can characterize the critical device density with respect to cell size for a given reliability target.Index Terms-Low power wide area networks, LoRaWAN, interference analysis, coverage probability, fading channels A. Mahmood, L. Guntupalli, R. Rondón and M. Gidlund are with the

No abstract

Wireless Sensor Networks (WSN) are gaining popularity as a flexible and economical alternative to field-bus installations for monitoring and control applications. For missioncritical applications, communication networks must provide endto-end reliability guarantees, posing substantial challenges for WSN. Reliability can be improved by redundancy, and is often addressed on the MAC layer by re-submission of lost packets, usually applying slotted scheduling. Recently, researchers have proposed a strategy to optimally improve the reliability of a given schedule by repeating the most rewarding slots in a schedule incrementally until a deadline. This Incrementer can be used with most scheduling algorithms but has scalability issues which narrows its usability to offline calculations of schedules, for networks that are rather static. In this paper, we introduce SchedEx, a generic heuristic scheduling algorithm extension which guarantees a user-defined end-to-end reliability. SchedEx produces competitive schedules to the existing approach, and it does that consistently more than an order of magnitude faster. The harsher the end-to-end reliability demand of the network, the better SchedEx performs compared to the Incrementer. We further show that SchedEx has a more evenly distributed improvement impact on the scheduling algorithms, whereas the Incrementer favors schedules created by certain scheduling algorithms.

No abstract