Analysis of Round-Robin and Random Scheduling Algorithms on Sensor Node Activation Towards Latency of Wireless Sensor Network

A Wireless Sensor Network (WSN) is a network system consisting of wireless sensor nodes that collect and transmit data. One crucial factor that affects WSN performance is latency, which is the time required to send data to the gateway. High latency can cause data delivery delays, resulting in data becoming irrelevant. At the same time, receiving real-time data quickly is the primary monitoring method. In addition, high latency can cause greater energy consumption because the sensor node device must be active longer. One way to overcome latency is to implement traffic management techniques such as scheduling data delivery or using priority delivery methods, which can reduce congestion and latency. This paper discusses the effect of latency on WSN using scheduling algorithms, namely Round-Robin and Random scheduling. The results were then taken 30 times to obtain a statistical comparison. The results obtained in the experiment received a Round-Robin scheduling algorithm that was superior to the random scheduling algorithm with a mean and standard deviation value of 12.68 and 2.33, respectively.