An Incentive Mechanism-Based Stackelberg Game for Scheduling of LoRa Spreading Factors
| dc.contributor.author | Kumari P.; Gupta H.P.; Dutta T. | |
| dc.date.accessioned | 2025-05-23T11:31:04Z | |
| dc.description.abstract | Wireless Local Area Networks (WLANs) are one of the most popular networks for the Internet-of-Things (IoT) applications. Among various WLAN technologies, the Long-Range WAN (LoRaWAN) has gained a high demand in recent years because of its low power consumption and long-range communication. However, the Long-Range (LoRa) network suffers from interference problem among LoRa Devices (LDs) that are connected to the LoRa gateway by using the same Spreading Factors (SFs). In this article, we propose a game theory-based approach for estimating the time duration of transmission of data on suitable SFs such that interference problem is reduced and network devices maximize their utilities. We next propose a scheduling algorithm that schedules the allocated time duration on the SFs such that the waiting time of the network can be minimized. We finally use the network simulator-3 for validating the propose work. Various experiments are performed which demonstrate the improvement in the network performance. © 2004-2012 IEEE. | |
| dc.identifier.doi | https://doi.org/10.1109/TNSM.2020.3027730 | |
| dc.identifier.uri | http://172.23.0.11:4000/handle/123456789/12863 | |
| dc.relation.ispartofseries | IEEE Transactions on Network and Service Management | |
| dc.title | An Incentive Mechanism-Based Stackelberg Game for Scheduling of LoRa Spreading Factors |