Have a personal or library account? Click to login
Energy harvested end nodes and performance improvement of LoRa networks Cover

Energy harvested end nodes and performance improvement of LoRa networks

By: Gunjan Gupta and  Robert Van Zyl  
Open Access
|Mar 2021

Figures & Tables

Figure 1:

Model of LoRaWAN.

Figure 2:

Illustration of collision time for nodes as a function of their harvesting time, time on air and reception time.

Figure 3:

Flowchart of PRIORLoRa algorithm.

Figure 4:

Data extraction rate vs spreading factor (SF) for three different densities 10nodeskm2,20nodeskm2 and 500nodeskm2 square km.

Figure 5:

The rate of increase of packet error as a function of increase in number of LoRa nodes for constant SF = 7.

Figure 6:

The rate of increase of packet error as a function of increase in number of LoRa nodes for constant SF = 7.

Figure 7:

The rate of increase of packet error as a function of increase in number of LoRa nodes for constant SF = 11.

Figure 8:

The rate of increase of packet error as a function of increase in number of LoRa nodes for constant SF = 11.

Figure 9:

The rate of increase of packet error as a function of increase in number of LoRa nodes and duty cycle for constant SF = 7.

Figure 10:

Time on air (ms) as a function of payload (bytes) for different CR and constant SF = 7.

Figure 11:

Time on air (ms) as a function of payload (bytes) for different CR and constant SF =12.

Figure 12:

Comparison of energy efficiency of LoRa node versus distance between LoRa node and gateway for different SF.

Figure 13:

Comparison of energy efficiency of LoRa node versus distance between LoRa node and gateway for SF = 9 and 10 with different transmission powers.

Algorithm PRIORLoRa
1. Input:
2. dtotal – number of devices covered by a gateway
SFs,7s12: denotes number of SF of  value s,
SENS: denotes sensitivity of the devices,
RSSI – nodes power levels.
PRSSI – priority nodes power levels.
3. Output:SFo
4. function PRIORLoRa-SF ([PRSSI]m×n,[SF]1×n).
5. [SF]1×n=[712] of n end devices.
6. for l = 1 to length (SFs)
7. c=count(PRSSI(l)>SENS)
8. ifc>dtotallength(SFs)
9. r=dtotallength(SFs)
10. else
11. r = c
12. End if
13. for k = 0 to r
14. [p,q]=max(PRSSI)
15.
16. PRSSI[:,q]=200dBm
17. End for
18. End for
19. return SFo.

Notations_

NotationDefinition
RcChip rate
TcChip duration
RsSymbol rate
TsSymbol duration
RbData rate
SFSpreading factor
CRCoding rate
taiTime on air of ith node
Language: English
Page range: 1 - 15
Submitted on: Nov 15, 2020
|
Published on: Mar 1, 2021
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2021 Gunjan Gupta, Robert Van Zyl, published by Professor Subhas Chandra Mukhopadhyay
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.