LoRaWAN attracted lots of attention with its capacity for large device numbers, long-range, and low-power consumption. In order to simplify the transmission procedure, a pure Aloha protocol is implemented into its MAC layer. However, as the number of connected devices to the base station increases, the devices’ transmission parameters allocation becomes a vital issue related to network performance. This research contributes to the decentralized dynamic spreading factor (SF) allocation strategies during transmission by proposing a score table-based evaluation and parameters surfing (STEPS) approach. STEPS is a reinforcement learning-based method that evaluates and changes the parameters based on probability and score tables. It provides a nondeterministic parameter selection method by updating the table while transmitting. Some variants of STEPS with different algorithms are proposed. Moreover, an estimation-based initialization is proposed to improve learning performance. Simulations and statistical tests are carried out with MULANE, a lightweight LoRaWAN Simulator developed in our previous work. The results show that the estimation has a high confidence level. Compared with the baseline methods, the proposed methods reduce energy consumption by 24%–27% in different numbers of nodes. For bi-directional transmission, the proposed methods increase the 18% network throughput in a small number of nodes and 33% in a large number of nodes. Moreover, the proposed methods provide a framework of decentralized parameter allocation, which gives the extendability of this work.

Queueing networks are used to model the performance of the Internet, of manufacturing and job-shop systems, supply chains, and other networked systems in transportation or emergency management. Composed of service stations where customers receive service, and then move to another service station till they leave the network, queueing networks are based on probabilistic assumptions concerning service times and customer movement that represent the variability of system workloads. Subject to restrictive assumptions regarding external arrivals, Markovian movement of customers, and service time distributions, such networks can be solved efficiently with “product form solutions” that reduce the need for software simulators requiring lengthy computations. G-networks generalise these models to include the effect of “signals” that re-route customer traffic, or negative customers that reject service requests, and also have a convenient product form solution. This paper extends G-networks by including a new type of signal, that we call an “Adder”, which probabilistically changes the queue length at the service center that it visits, acting as a load regulator. We show that this generalisation of G-networks has a product form solution.

We present the new version of XBorne a software tool for the probabilistic modeling with Markov chains. The tool which has been developed initially as a testbed for the algorithmic stochastic comparisons of stochastic matrices and Markov chains, is now a general purpose framework which can be used for the Markovian modelling in education and research.

We analyze Energy Packet Networks (EPNs) in which the service centers consist of multiclass queues and the Data Packets (DPs) initiate the transfer (i.e., the arrival of a DP at the battery triggers the movement) with multiple energy packet requirements. In other words, a class-k DP in cell i is sent successfully to the next cell if there are $c_i^{(k)}$ energy packets and it is dropped otherwise. Besides, we consider that the queues handling DPs operate under one of the following disciplines: First-Input-First-Output (FIFO), Processor Sharing (PS), or Preemptive Last-Input-First-Output (LIFO-PR). This model is an extension of previously studied EPNs [6,16] where the steady-state distribution of the number of jobs in the queues has a product form. In our model, we show the existence of a product form of the steady-state stationary distribution, where the load of the servers is given by a fixed point expression. We study the existence of a solution to the derived fixed point problem and we provide sufficient conditions for the stability of our model. Finally, we show that, for feed forward EPNs, the load of all the queues can be fully characterized.