Mobile Station Distributed Routing for Base Station Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-hop cell networks, existing methods for sending packet data result in high resource overhead and communication complexity for the base station due to the need for frequent relay requests and centralized link processing.
Innovation Solution
The method involves packet data being sent by mobile stations (MS) based on their access status, using a cluster head table to select a relay node or send data directly to the base station, thereby reducing the need for relay requests and performing link processing at the MS, which decreases resource overhead and communication complexity for the base station.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the BS performs centralized link processing and maintains statuses of all links among MSs, then routing paths can be selected centrally, but resource overhead and communication complexity for the BS increase significantly
Solution Approach 1:
The patent segments the centralized routing function by introducing distributed routing capabilities at each MS. Each MS maintains its own routing table and independently determines next-hop nodes, dividing the原本 centralized routing task into multiple distributed decision-making units. This reduces the BS's processing burden while maintaining routing functionality.
Solution Approach 2:
Each MS performs self-service routing by maintaining local routing tables and independently determining transmission paths. The MS autonomously queries its routing table to find next-hop nodes without requiring BS intervention for each packet forwarding decision, thereby reducing communication overhead with the BS.
2Adaptability or versatility
If relay requests are sent frequently for packet relay distribution, then multi-hop routing can be established, but resource overhead increases
Solution Approach 1:
The patent implements preliminary action by pre-establishing routing tables at each MS before actual data transmission. The routing tables contain pre-calculated next-hop information for various destinations, allowing MS to forward packets immediately without sending relay requests during transmission. This eliminates frequent signaling overhead while maintaining routing adaptability.
Solution Approach 2:
The system uses feedback mechanisms where MSs report link status changes to the BS, which then updates routing tables. This feedback loop allows the system to adapt to changing network conditions without requiring continuous relay requests, reducing overhead while maintaining multi-hop routing capability.
Data Source
AI summary
A method for sending packet data is provided, which includes the following steps. Packet data from a source mobile station (MS) is received. The packet data includes an identity of a destination MS. A routing cache table is searched for a path to the destination MS. An interface is selected if the path to the destination MS is found. The packet data is forwarded through the selected interface according to the found path. Other two methods for sending packet data corresponding to the method for sending packet data as well as an MS and a base station (BS) corresponding to the method for sending packet data are provided. Therefore, link processing can be performed at the MS.