Wireless Data Transmission via Triad Polling Mechanism
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication networks face inefficiencies in transmitting data files through multi-hop paths due to half-duplex limitations, leading to underutilization of communication links and potential collisions, especially in mesh networks where nodes cannot send and receive simultaneously, and existing solutions like CSMA-CA and RTS-CTS mechanisms are not adaptive to varying transmission conditions.
Innovation Solution
A method involving a computer-implemented two-hop polling mechanism where child, parent, and grandparent nodes exchange polling messages to ensure availability before transmitting data fragments, allowing for adaptive timing and simultaneous use of multiple communication links, thereby optimizing transmission rates and avoiding collisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multi-fragment transmission is used to exploit parallelism and speed up transmission, then productivity is improved, but collisions occur between simultaneous transmissions on different hops
Solution Approach 1:
The patent applies preliminary action by implementing a two-hop polling mechanism where child nodes send polling messages to parent nodes before transmitting data fragments. This advance checking of node availability prevents collisions by ensuring that no transmissions occur on overlapping hops, thus maintaining reliability while enabling parallel multi-fragment transmission for improved productivity.
2Reliability
If arbitrary pause times are set to avoid collisions in multi-fragment transmission, then collision avoidance is improved, but transmission latency increases
Solution Approach 1:
The patent implements feedback through a polling response mechanism where parent nodes reply to child node polling messages with availability status information. This feedback allows transmitting nodes to adapt their transmission timing dynamically based on actual network conditions rather than using fixed arbitrary pause times, thereby reducing transmission latency while maintaining collision avoidance.
3Reliability
If nodes check channel silence before transmission (CSMA-CA), then collision avoidance is improved, but transmission efficiency decreases due to conservative timing
Solution Approach 1:
The patent applies segmentation by dividing the network into hierarchical zones (child nodes, parent nodes, grandparent nodes) with defined transmission relationships. This structured segmentation replaces the conservative blanket channel silence checking of CSMA-CA with targeted polling within specific zones, allowing nodes to transmit more efficiently while maintaining collision avoidance through the organized hierarchical control structure.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
The present invention relates to a computer-implemented method for transmitting data blocks consisting of several data fragments, in a wireless network comprising a plurality of nodes, the network having at least one routing path defined between a source node and a destination node and composed of a plurality of nodes such that three nodes in position n/n+1/n+2 on the routing path define a child/parent/grandparent triad, the method comprising at least the following steps performed on a triad of child, parent and grandparent nodes: sending from a child node a child/parent polling message, called a "ping" message, to a parent node; sending from the parent node that received the "ping" message, a parent/grandparent polling message, called a "yin" message, to a grandparent node, if the parent node is available in a standby state;send from said grandparent node that received the "yin" message, a parent/grandparent poll response message, called the "yang" message, to said parent node, if the grandparent node is available; send from said parent node that received the "yang" message, a child/parent poll response message, called the "pong" message, to said child node if the parent node is still available; and upon receipt of the "pong" message by the child node, transmit a data fragment from the child node to said parent node.