Dynamic multi-frame multi-spreading factor scheduling algorithm for LoRaWAN

Abstract

Abstract Long-Range Wide Area Network (LoRaWAN), as Low Power Wide Area Network that connects battery-powered devices, has gained much attention lately. The LoRaWAN technology uses ALOHA as the medium access control where the End Devices (EDs) transmit data randomly and re-transmit up to eight times if collisions occur, which is not feasible in large networks. Several techniques, including synchronization and scheduling schemes, to address the challenge have been reported. However, the existing synchronization and scheduling algorithms transmit synchronization messages randomly using one super frame with fixed time slots that accommodate devices using different Spreading Factors (SFs). This phenomenon can result in collisions, idle slots, and inefficient energy use, hence limiting the LoRaWAN network scalability. To alleviate the aforementioned problems, this work proposes a dynamic Multi-Frame Multi-Spreading Factor (MFMSF) scheduling algorithm with slotted synchronization approach. In the proposed algorithm, the time slots are assigned dynamically to EDs on first to synchronize first to be assigned basis. It was revealed that the proposed dynamic MFMSF TDMA algorithm is more energy-efficient than the existing algorithm in a denser network with devices arranged in a circular disk with different radii. The packet delivery rate for the dynamic MFMSF TDMA is about 99% signifying reduced collisions during data transmission. This implies that the use of the proposed dynamic MFMSF scheduling algorithm in LoRaWAN allows large number of EDs to communicate with reduced collisions and enhanced energy efficiency of the battery-powered devices.

Keywords

• Long-range wide area network
• Network scalability
• Spreading factor