Shared Transmission Queue for Wireless Packet Collision Avoidance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless ad-hoc networks with reduced radio capacity, such as underwater sensor networks and IoT deployments, traditional collision avoidance techniques like CSMA become inefficient due to long propagation delays and noisy environments, leading to excessive delays and computational burdens, especially when many nodes share a single channel.
Innovation Solution
Implementing a method that uses shared information about a transmission queue to avoid packet collisions, where nodes store and manage queue turns in data packets, allowing for transmission based on available turns without relying on carrier sensing, or using limited carrier sensing to detect open turns in the shared queue.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional CSMA collision avoidance technique is used in wireless ad-hoc networks with reduced radio capacity, then collision avoidance is provided, but excessive delays and computational burdens occur due to long propagation delays and noisy environments
Solution Approach 1:
The patent segments the transmission process into discrete turns in a shared queue, where each node is assigned a specific turn number. Instead of continuous carrier sensing and collision avoidance handshakes, nodes transmit only during their assigned turns, dividing the channel access into manageable segments that reduce waiting time and computational overhead.
Solution Approach 2:
The patent implements preliminary action by having nodes pre-register their data packets in a shared transmission queue before actual transmission. The queue maintains turn numbers and node identifiers in advance, allowing nodes to know their transmission timing beforehand without continuous sensing, thus reducing delays associated with real-time collision avoidance.
2Reliability
If traditional CSMA collision avoidance technique is used in wireless ad-hoc networks, then collision avoidance is provided, but computational burden increases especially when many nodes share a single channel
Solution Approach 1:
The patent implements self-service by having each node independently determine its transmission timing based on pre-assigned turn numbers from the shared queue, without requiring complex real-time sensing and collision detection algorithms. Nodes autonomously transmit during their assigned turns, significantly reducing computational burden while maintaining collision avoidance.
Solution Approach 2:
The patent uses copying by maintaining a shared queue data structure that is replicated across all nodes in the network. Each node has a local copy of the queue information (turn numbers, node identifiers), allowing independent decision-making without complex inter-node communication and computation, thus reducing overall system computational burden.
3Productivity
If shared transmission queue with turn-based transmission is implemented, then channel utilization increases and delays reduce, but nodes must store and manage queue turn information in data packets
Solution Approach 1:
The patent applies universality by using a single shared queue data structure that serves multiple functions: it tracks transmission turns, identifies active nodes, manages channel access timing, and provides collision avoidance information. This multi-functional approach increases channel utilization without requiring separate complex management systems for each function.
Solution Approach 2:
The patent changes parameters by representing queue information in a compact format within data packets (turn numbers, node identifiers). This parameter optimization allows efficient storage and transmission of queue state without excessive overhead, balancing improved channel utilization with manageable device complexity.
Data Source
AI summary
Techniques for transmitting data packets on a shared channel in a data communications network include storing, on a local node, a current number of turns in a transmitting queue and a current turn based on packets received from other nodes on the channel. For a first local data packet to transmit, a local transmit turn is obtained based on successfully transmitting the packet in a time interval following a last turn in the queue. A data link layer header includes queue fields for the current number of turns, the local transmit turn, and a request for adding the local transmit turn. While there is still a remaining packet to transmit and when the current turn is the local transmit turn, the packet is transmitted with queue fields indicating the current number of turns, the current turn, and an indication of no new turn. An acknowledgement control packet indicates successful transmission.