Gradient Routing Cost Field for Wireless Packet Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-hop wireless access networks, determining an efficient route for packet transmission is time-consuming, especially in public safety networks that require direct signal transmission and reception between devices, such as in D2D and V2X communications, where current methods lead to increased routing overhead and unnecessary retransmissions.
Innovation Solution
A packet transmission method that uses a gradient routing technique optimized for multi-hop wireless access networks, where a cost field is generated only for the gateway node, reducing overhead by limiting the number of nodes participating in downlink gradient routing through uplink transmission recording, and determining forwarding decisions based on signal-to-noise ratio and subcarrier index values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional routing methods are used in multi-hop wireless access networks, then complete route information can be obtained, but routing overhead increases and route determination time increases
Solution Approach 1:
The patent extracts only the essential cost field information needed for routing decisions rather than maintaining complete route information. Each node stores a cost field indicating the cost to reach the gateway, which is sufficient for gradient routing decisions without requiring full route topology knowledge. This extraction principle reduces routing overhead while maintaining reliable route determination.
Solution Approach 2:
The patent performs preliminary route cost calculation and stores cost field information in advance before actual packet transmission. Nodes pre-calculate and store the cost to reach the gateway, so when a packet needs to be routed, the decision can be made immediately by comparing cost fields without performing complex real-time route calculations. This preliminary action reduces route determination time.
2Productivity
If gradient routing is implemented in multi-hop wireless networks, then routing efficiency improves, but routing overhead increases due to cost field maintenance
Solution Approach 1:
The patent applies local quality by having each node maintain cost field information specific to its local context rather than global route information. Each node stores cost values relevant to its position in the network hierarchy, enabling efficient local routing decisions without requiring all nodes to maintain identical or complete routing tables. This local approach reduces overall routing overhead while maintaining transmission efficiency.
Solution Approach 2:
The patent segments the routing information into hierarchical levels, with the gateway node maintaining root cost information and intermediate nodes maintaining cost information relative to their parent nodes. This segmentation allows the routing system to function efficiently with distributed, minimal information at each node rather than requiring centralized or complete information throughout the network, thereby reducing routing overhead.
3Reliability
If D2D communication is used in public safety networks, then direct signal transmission improves reliability, but route determination becomes more complex
Solution Approach 1:
The patent enables self-service routing where each node autonomously determines the next hop by comparing its own cost field with received packet cost fields. Nodes independently make routing decisions based on local cost information without requiring complex centralized route determination or interaction with other nodes. This self-service mechanism simplifies route determination while maintaining reliable direct signal transmission in D2D communications.
Solution Approach 2:
The patent uses parameter changes by representing route information as simple cost values rather than complex route descriptions. Each node has a cost parameter indicating its distance or expense to reach the gateway, and routing decisions are made by comparing these scalar parameters. This parameter simplification reduces the complexity of route determination while enabling reliable D2D communication routing.
Data Source
AI summary
The present invention provides a method for forwarding an uplink packet performed by a node in a wireless communication system, the method being characterized in that the uplink packet including a first cost is received, the first cost is compared with a second cost corresponding to a cost of the node to determine whether to forward the uplink packet, and on the basis of the determination the uplink packet is forwarded, the node forwards the uplink packet when a value of the second cost is smaller than a value of the first cost, and the node does not forward the uplink packet when the second cost value is not smaller than the first cost value.