Message Scheduling via Virtual Links for Aerial Vehicle Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Aerial vehicle networks face challenges with high latency and jitter, which affect the efficient communication between end systems, leading to resource imbalances and inefficient message scheduling.
Innovation Solution
The system schedules messages by creating virtual links with assigned transmission times, using offsets and intervals to manage latency and jitter, prioritizing messages based on virtual link numbers, and adjusting transmission times according to maximum latency and intervals to maintain efficient communication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If messages are transmitted immediately when available, then latency is reduced, but jitter increases due to variable network conditions
Solution Approach 1:
The system pre-calculates and stores optimal transmission times for messages before actual transmission is needed. By computing transmission times in advance based on virtual link schedules, the system prepares message queues ahead of time, allowing immediate transmission when the scheduled time arrives without introducing jitter from real-time calculations.
Solution Approach 2:
The system dynamically adjusts transmission schedules by creating multiple virtual links with different transmission time patterns. Each virtual link has configurable parameters (interval, offset, maximum latency) that allow the system to adapt transmission timing to different message priorities and network conditions, balancing latency and jitter requirements.
2Productivity
If multiple messages are transmitted simultaneously across different virtual links, then throughput increases, but resource conflicts and scheduling complexity increase
Solution Approach 1:
The system segments the communication network into multiple virtual links, each representing a distinct transmission path with its own scheduling parameters. By dividing the network traffic into separate virtual link streams, the system can manage each stream independently with simple scheduling rules, avoiding the complexity of coordinating multiple simultaneous transmissions across a shared medium.
Solution Approach 2:
Each virtual link operates on a periodic transmission schedule defined by interval and offset parameters. Messages are transmitted at regular intervals according to their virtual link's timing parameters, creating a rhythmic, predictable transmission pattern that simplifies scheduling coordination while maintaining high throughput through parallel periodic transmissions.
3Loss of time
If transmission times are frequently adjusted to optimize latency, then message delivery speed improves, but computational overhead increases
Solution Approach 1:
The system pre-calculates transmission times using the formula (absolute_count * interval) + offset during message queuing, before actual transmission occurs. This preliminary calculation eliminates the need for complex real-time optimization algorithms, reducing computational overhead while maintaining optimized latency through pre-determined transmission schedules.
Data Source
Figure 1
Figure 2A~2B
Figure 2C~2D
AI summary
One example aspect of the present disclosure is directed to a method for scheduling a message 310, 312, 314, 316, 318. The method 400 includes receiving 402, by one or more processors 504, an offset and an interval associated with a virtual link 202, 204, 206, 208. The method includes receiving 404, by the one or more processors 504, an absolute count representing a start time. The method includes designating 406, by the one or more processors 504, a plurality of transfer times for the virtual link 202, 204, 206, 208 as a function of the offset and the interval. The method includes receiving 408, by the one or more processors 504, a message 310, 312, 314, 316, 318 associated with the virtual link 202, 204, 206, 208 at a first time. The method includes transmitting 410, by the one or more processors 504, the message 310, 312, 314, 316, 318 at a next transfer time in the plurality of transfer times.