Downlink Routing via Linkage Tables in Wireless Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless communication networks face inefficiencies in downlink data packet routing due to excessive transmissions caused by flooding mechanisms, especially in networks with high device densities and complex topologies, which consume energy and resources unnecessarily.
Innovation Solution
A routing system where head devices store linkage information in routing tables based on Quality of Service (QoS) values and downlink response information, forwarding downlink data packets only to linked member devices, and using member limited flooding or broadcasting only when necessary, to reduce unnecessary transmissions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If flooding mechanism is used for downlink routing, then all devices can potentially receive the packet, but the number of transmissions increases exponentially consuming excessive energy and spectral resources
Solution Approach 1:
The patent applies preliminary action by having devices pre-establish routing tables during network initialization and maintenance phases. These routing tables contain forwarding information for downlink packets, allowing efficient direct routing without flooding. The routing tables are proactively updated based on network topology changes, so when downlink packets arrive, they can be immediately forwarded using pre-computed paths rather than exploring the network through flooding.
Solution Approach 2:
The patent introduces routing tables as an intermediary mechanism between the downlink packet source and destination. Instead of direct flooding to all devices, the routing table acts as a mediator that stores and provides optimal forwarding paths. This intermediary layer enables intelligent packet forwarding based on pre-established routing information, dramatically reducing the number of transmissions compared to blind flooding.
2Productivity
If comprehensive routing tables are maintained at each router device, then efficient routing is achieved, but memory requirements and network traffic overhead increase significantly
Solution Approach 1:
The patent applies local quality by making routing table maintenance localized rather than universal. Only head devices (sink devices and router devices) maintain comprehensive routing tables, while member devices do not need to store routing information. This localized approach reduces overall memory requirements in the network while maintaining routing efficiency at the devices that actually perform routing decisions.
Solution Approach 2:
The patent implements partial action by having only necessary routing information stored at head devices rather than complete routing tables at every device. The routing tables at head devices contain information sufficient for efficient forwarding, without requiring every device to maintain comprehensive routing data. This partial maintenance strategy reduces total memory usage while preserving routing efficiency.
3Reliability
If routing information is propagated to each affected router device when changes occur, then routing tables remain updated, but excessive transmissions collapse the wireless communication network
Solution Approach 1:
The patent extracts the routing information propagation burden from the regular data traffic flow. Instead of propagating routing updates through normal routing paths which would cause excessive transmissions, the system uses dedicated routing maintenance mechanisms where head devices directly update their routing tables based on topology changes. This extraction separates control plane updates from data plane operations, preventing network collapse from excessive transmissions.
Data Source
AI summary
Routing system is disclosed. The system comprises one or more head devices participating in routing operations and one or more destination devices. Each head device has one or more member devices. At least one head device is configured to in response to receiving from a member device an uplink data packet DPU, forward the DPU and store into a routing table linkage information representing a linkage of a destination device generated the DPU to the member device. In response to receiving a downlink data packet DPD addressed to a destination device, forward the DPD only to its member device to which the destination device, to which the DPD is addressed, is linked based on the routing table, if linkage information related to the destination device, to which the DPD is addressed, is stored in the routing table. Also routing methods, head device, computer program, and computer readable medium are disclosed.