In this paper, we present results of a study of the data rate fairness among nodes within a LoRaWAN cell. Since LoRa LoRaWAN supports various data rates, we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability. LoRa LoRaWAN, like other frequency modulation based radio interfaces, exhibits the in which only the stronger signal of colliding signals will be extracted. This leads to unfairness, where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly. Therefore, we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction. Simulations show that our approach achieves higher fairness in data rate than the state-of-art in almost all network configurations.
Furthermore, recent work has proposed transmission parameter allocation approaches for LoRaWAN with different objectives. For example, authors in @cite_6 proposed a transmission parameter selection approach for LoRa to achieve low energy consumption at a specific link reliability. Here a LoRa node probes a link using a transmission parameter combination to determine the link reliability. It then chooses the next probe combination based on whether the new combination achieves lower energy consumption while maintaining at least the same link reliability. Finally, the approach terminates when reaching the optimal combination from an energy consumption perspective.
@cite_6
2597140867 2120101192 2952044966 2094169594
Low-Power Wide-Area Network (LPWAN) technologies such as Long Range (LoRa) are emerging that enable power efficient wireless communication over very long distances. LPWAN devices typically communicate directly to a sink node which removes the need of constructing and maintaining a complex multi-hop network. However, to ensure efficient and reliable communication LPWAN devices often provide a large number of transmission parameters. For example, a LoRa device can be configured to use different spreading factors, bandwidth settings, coding rates and transmission powers, resulting in over 6720 possible settings. It is a challenge to determine the setting that minimises transmission energy cost while meeting the required communication performance. This paper is the first to present a thorough analysis of the impact of LoRa transmission parameter selection on communication performance. We study in detail the impact of parameter settings on energy consumption and communication reliability. Using this study we develop a link probing regime which enables us to quickly determine transmission settings that satisfy performance requirements. The presented work is a first step towards an automated mechanism for LoRa transmission parameter selection that a deployed LoRa network requires, but is not yet specified within the Long Range Wide Area Network (LoRaWAN) framework. We investigate the problem of energy efficiency in TDMA link scheduling with transmission power control using a realistic SINR-based interference model, given packets of a set of links to be transmitted within a latency bound. First we formulate a fundamental optimization problem (TJSPC) that provides tunable tradeoffs between energy, throughput and latency through a single parameter β. We present both expo- nential and polynomial complexity solutions to this problem and evaluate their performance. Our results show that for moderate traffic loads, with appropriate tuning of parameters, major energy savings can be obtained without significantly sacrificing throughput. We then investigate the scheduling and power control problem with the objective of minimizing the total transmission energy cost under the constraint that all transmission requests are satisfied (JSPC-TR). We present an iterative approach to solve JSPC-TR that leverages the heuristics for TJSPC and converges rapidly to the setting of β which achieves energy efficiency while guaranteeing data delivery. We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of any online algorithm to minimize the total transmission time in an energy harvesting system. The upper bound is obtained using a lazy' transmission policy that chooses its transmission power to minimize the transmission time assuming that no further energy arrivals are going to occur in future. The lazy transmission policy is shown to be strictly two-competitive. We also derive an adversarial lower bound that shows that competitive ratio of any online algorithm is at least 1.325. In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.