Wireless Multihop Routing via TDMA and Registration Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad-hoc multihopping wireless networks face challenges in efficiently utilizing channel bandwidth and minimizing delay while ensuring reliable communication for various classes of data, including voice, file transfer, and multimedia, due to overhead and interference issues.
Innovation Solution
The method employs tree dependency and time division multiple access (TDMA) techniques to route data packets based on packet type, using registration tables and time slot management to minimize pipeline delay and optimize channel usage, with nodes broadcasting utilization tables to select unused time slots and adjust transmission slots for efficient data transfer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If TDMA protocol is used for routing data packets in wireless multihopping networks, then channel bandwidth utilization is improved, but pipeline delay increases due to time slot allocation and overhead
Solution Approach 1:
The patent establishes routing paths and allocates time slots in advance before data transmission begins. Registration tables are pre-populated with routing information, and time slot assignments are determined beforehand, allowing data to flow through the network without waiting for real-time routing decisions or slot allocation, thus reducing pipeline delay while maintaining efficient bandwidth utilization
Solution Approach 2:
The patent segments the network into hierarchical levels (Level 0 to Level N) based on distance from the access point, with each level having dedicated time slots for transmission. This segmentation allows parallel transmission across different levels, reducing overall pipeline delay while efficiently utilizing channel bandwidth through structured time division
2Reliability
If tree dependency structure is implemented for routing, then communication reliability is improved, but device complexity increases due to registration tables and slot management
Solution Approach 1:
The registration table serves multiple functions simultaneously: it stores routing information, tracks time slot assignments, manages hierarchical level information, and maintains node dependency relationships. This multi-functionality reduces the need for separate data structures and simplifies overall device complexity while ensuring reliable communication through comprehensive information management
3Productivity
If time slot allocation is optimized for different data classes, then data transfer efficiency is improved, but overhead increases due to slot management and broadcasting
Solution Approach 1:
The patent combines routing information, time slot assignments, and hierarchical level data into a single registration table structure. Control messages carry multiple types of information simultaneously, and utilization tables merge channel status, slot availability, and interference information. This consolidation reduces the number of separate messages and data structures, lowering overhead while maintaining efficient differentiated data transfer
Data Source
AI summary
A method for routing data packets from a source to a destination in a wireless communication network comprising a plurality of nodes, wherein each node is in uplink-downlink association with at least one neighboring node, and wherein each node comprises a registration table identifying all downlink nodes that are associated with the node, the method comprising: sending an Open Stream message from a source node which specifies a destination node; and receiving the Open Stream message at the uplink node of the source node, wherein the uplink node relays the Open Stream message to the destination node if the destination node is registered in the registration table of the uplink node.