A scheduling method to ensure real-time transmission of wireless sensor network information

Abstract

The present invention relates to a scheduling method for ensuring real-time transmission of wireless sensor network information, comprising the following steps: 1) prioritizing the data received by sensor nodes according to the wireless sensor network application environment and monitoring objects; 2) according to the divided priority, Prioritize the buffer queues of wireless sensor nodes with routing functions; 3) Configure the corresponding parameters of the L-RQS algorithm and determine the initial values; 4) Set up a wireless sensor network and perform network initialization operations, so that each The sensor works normally; 5) When the sensor node receives the data packet, the buffer management algorithm in L-RQS performs corresponding operations according to the current queue status and the priority of the data packet; 6) The queue scheduling algorithm in L-RQS selects the corresponding The data packets are scheduled, and the high-priority queue status is set according to the number of continuously forwarded high-priority data packets or the waiting time; 7) After the scheduling of a data packet is completed, the scheduler Select a state. The invention is used in the application field of the wireless sensor network which requires higher real-time performance.

Description

technical field [0001] The invention relates to the field of wireless sensor networks, in particular to a scheduling method for ensuring real-time transmission of wireless sensor network information. Background technique [0002] With the development of wireless sensor networks, a large number of application fields require it to provide quality of service (QoS) guarantees, such as low latency and high reliability. However, wireless sensor nodes are generally small in size, powered by batteries, with weak computing power and memory Resources are limited, so it is very challenging to provide QoS guarantee in wireless sensor networks. At present, many new applications based on wireless sensor networks have high requirements for real-time data, that is, it is necessary to ensure that data packets arrive at the data processing center from the monitoring site within a specified time, and the data processing center responds accordingly. The time consumed for forwarding in the netw...

AI Technical Summary

Problems solved by technology

[0004] With the continuous development of research, many scholars have found that the first-come-first-served queue scheduling method can no longer meet the needs of applications, so other types of queue scheduling methods have been proposed, such as: priority-based queue scheduling, redundant information-based Queue scheduling methods, and dynamic priority scheduling methods that take into account both priority and fairness, but these queue scheduling methods still adopt the first-come-first-served (FCFS) method inside each priority, and most of the monitoring, tracking, etc. In the application of wireless sensor networks, the newly generated data can always represent the most current situation of the monitored (or tracked) object. However, compared with the previously generated data packets, the newly generated data packets always have the same route The queue that arrives at the forwarding node later, if the first-come-first-served queue scheduling method is adopted, the newly generated data will always be delayed to a certain extent

In addition, when a large number of data packets arrive at the sensor node in a relatively short period of time, the queue of the sensor node is likely to be congested. At this time, it is particularly important to select, schedule and discard data packets. At present, most sensor nodes adopt tail The discarding method, that is to say, the most current information is likely to be discarded, but the "historical" information is retained

Images