HEUSSE , Martin

This paper presents a model for the packet delivery rate of LoRaWAN frames in presence of receive antenna diversity. Based on this model we study the the redundancy level between the transmission so as to reach a reliable data delivery rate without overloading the channel. We show that the combination of antenna diversity with a properly chosen...

This paper considers a LoRaWAN cell in which devices access the channel using the unslotted ALOHA protocol. We propose a model of this access method that combines the effects of collisions with channel fading, by which reception may get buried in noise. Unlike the existing models of LoRaWAN, our model takes into account the frame arrival...

International audience

This paper explores the capacity limits and the tradeoff between the antagonistic means of enabling reliable data delivery in a loaded LoRaWAN cell. In fact, channel attenuation and variability call for robust transmission settings but the associated load increase causes more collisions between frames. In addition to the physical layer...

This paper presents a model of Aloha access in LoRaWAN which takes into account the timing of packet arrivals. We draw 3 observations regarding the packet reception ratio. First, repeating is all but always beneficial, even though it increases the load; next, using a spreading factor lower than SF7 sometimes allows to increase the coverage...

We propose a theoretical framework for maximizing the LoRaWAN capacity interms of the number of end nodes, when they all have the same trafficgeneration process. The model optimally allocates the spreading factor tothe nodes so that attenuation and collisions are optimized. We use anaccurate propagation model considering Rayleigh channel, and...

We propose an optimization model for single-cell LoRaWAN planning which computes the limit range of each spreading factor (SF) in order to maximize the minimum packet delivery ratio (PDR) of every node in the network. It allows to balance the opposite effects of attenuation and collision of the transmissions and guarantee fairness among the...

Nous présentons un modèle d'optimisation pour la planification d'un réseau LoRa avec une passerelle, dont le but est de déterminer les bornes des zones de facteur d'étalement (SF) de manière à maximiser le taux de livraison des paquets (PDR) minimum des noeuds du réseau. Grâce à notre modèle, nous améliorons le PDR minimum de plus de 13% en...

This paper explores the capacity limits and the tradeoff between the antagonistic means of enabling reliable data delivery in a loaded LoRaWAN cell. In fact, channel attenuation and variability call for robust transmission settings but the associated load increase causes more collisions between frames. In addition to the physical layer...

Size-based scheduling improves data transfer response times by favoring flows at an early stage. Although appealing, these techniques raise concerns as they require to keep track of the volume of data sent by each and every ongoing connections and they may starve long-lived flows even if they use up limited bandwidth. Early Flow Discard (EFD)...

Size-based scheduling improves data transfer response times by favoring flows at an early stage. Although appealing, these techniques raise concerns as they require to keep track of the volume of data sent by each and every ongoing connections and they may starve long-lived flows even if they use up limited bandwidth. Early Flow Discard (EFD)...

Size-based scheduling methods receive a lot of attention as they can greatly enhance the responsiveness perceived by the users. In effect, they give higher priority to small interactive flows which are the important ones for a good user experience. In this paper, we propose a new packet scheduling method, Early Flow Discard (EFD), which belongs...

no abstract

We consider the case of scheduling packets over access links for which traditional FIFO scheduling leads to significant performance problems especially when flows in opposite directions interfere with each other. We propose a new packet scheduling scheme called Least Attained Recent Service (LARS) that schedules packets by giving higher...

We consider the case of scheduling packets over access links for which traditional FIFO scheduling leads to significant performance problems especially when flows in opposite directions interfere with each other. We propose a new packet scheduling scheme called Least Attained Recent Service (LARS) that schedules packets by giving higher...

no abstract

In this paper, we consider the problem of evaluating the capacity of a LoRaWAN cell. Previous analytical studies investigated LoRaWAN performance in terms of the Packet Delivery Ratio (PDR) given a number of devices around a gateway and its range. We improve the model for PDR by taking into consideration that the following two events are...