Open Access

Energy harvested end nodes and performance improvement of LoRa networks

Gunjan Gupta

Gunjan Gupta

Department of Electrical, Electronics and Computer Engineering, French South African Institute of Technology, Cape Peninsula University of TechnologyCape Town, South Africa
Search for this author on
Sciendo|Google Scholar
Gupta, Gunjan
 and 
Robert Van Zyl

Robert Van Zyl

Department of Electrical, Electronics and Computer Engineering, French South African Institute of Technology, Cape Peninsula University of TechnologyCape Town, South Africa
Search for this author on
Sciendo|Google Scholar
Van Zyl, Robert
  
Mar 01, 2021
Energy harvested end nodes and performance improvement of LoRa networks's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Published Online: Mar 01, 2021
Page range: 1 - 15
Received: Nov 15, 2020
DOI: https://doi.org/10.21307/ijssis-2021-002
Keywords
© 2021 Gunjan Gupta et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Figure 1:

Model of LoRaWAN.
Model of LoRaWAN.

Figure 2:

Illustration of collision time for nodes as a function of their harvesting time, time on air and reception time.
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.
Flowchart of PRIORLoRa algorithm.

Figure 4:

Data extraction rate vs spreading factor (SF) for three different densities 10nodeskm2,20nodeskm2 and 500nodeskm2 square km.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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,7⩽s⩽12: 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=[7…12] 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
Publication timeframe:
1 times per year
Journal Subjects:
Engineering, Introductions and Overviews, Engineering, other
Journal RSS Feed