Ad Hoc Network Message Priority Transmission Method
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad hoc networks face challenges in reducing collision wait times and prioritizing message reception, as existing methods treat all messages equally, leading to inefficient transmission of high-priority messages like alerts and prolonged waiting times for low-priority messages.
Innovation Solution
The method involves dividing nodes into groups based on a distribution rule, allowing low-priority messages to be transmitted once per frame and high-priority messages to be transmitted multiple times in specific frames, with the number of transmissions calculated to optimize reception probability based on neighboring nodes and frame structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all messages are transmitted with the same probability and using the same time slots, then collision reduction is achieved through distribution rules, but high-priority messages do not receive preferential treatment and waiting times remain prolonged
Solution Approach 1:
The patent applies local quality by differentiating transmission probabilities and time slot allocations based on message priority levels. High-priority messages are assigned higher transmission probabilities and access to additional time slots, while low-priority messages use standard probabilities and limited slots. This localized differentiation resolves the contradiction by ensuring reliable reception for critical messages without completely blocking lower-priority traffic.
Solution Approach 2:
The patent implements dynamics by making transmission probabilities and time slot assignments variable rather than fixed. Nodes dynamically adjust their transmission behavior based on message priority, current network conditions, and collision history. This dynamic approach allows the system to adapt to changing requirements, providing preferential treatment to high-priority messages when needed while maintaining overall network stability.
2Reliability
If high-priority messages are transmitted multiple times in the same frame, then reception probability increases, but collision probability and network congestion increase
Solution Approach 1:
The patent applies partial or excessive action by allowing high-priority messages to be transmitted multiple times (excessive action) while low-priority messages are transmitted once (partial action). This selective multiplication of transmissions for high-priority messages increases their reception probability without requiring all messages to be over-transmitted, thus balancing reliability improvement with collision management.
Solution Approach 2:
The patent segments the transmission opportunities by creating distinct time slots and probability regimes for different message priorities. High-priority messages are segmented into multiple transmission attempts with higher probabilities, while low-priority messages are segmented into single transmissions with lower probabilities. This segmentation allows the system to increase high-priority message reliability without uniformly increasing overall collision probability.
3Reliability
If transmission probabilities are increased for all messages to ensure reception, then message delivery reliability improves, but network congestion and collision frequency increase
Solution Approach 1:
The patent applies local quality by assigning different transmission probabilities to different message priority levels rather than using a uniform probability for all messages. High-priority messages receive elevated transmission probabilities to ensure reliable delivery, while low-priority messages use lower probabilities to conserve network resources. This localized probability assignment improves overall delivery reliability for critical messages without causing network-wide congestion.
Data Source
Figure 1
Figure 2
Figure 2
AI summary
The message transmission method in an ad hoc network comprises at least two transmitting and receiving nodes, each capable of receiving and transmitting messages. The nodes communicate with each other by sending messages in randomly accessed time slots organized into frames. The network nodes are divided into groups according to a basic allocation rule. The nodes in each group are entitled to transmit messages in one time slot per frame from a predefined subset of frames specific to their group, according to the basic allocation rule. The messages include at least low-priority messages and high-priority messages. Each node transmits low-priority messages only in one time slot per frame from the predefined subset of frames specific to its group.Each node transmits high-priority messages in a time slot (c1) per frame of its group's predefined subset of frames (T2) and in at least one other time slot (c2, c3). The node transmits any high-priority message more times than any low-priority message.