Base Station Channel Negotiation via Coordinator Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for channel negotiation between neighbor base stations in broadband wireless access networks are inefficient, particularly when new stations join, as they require extensive re-planning and can lead to interference and increased terminal costs.
Innovation Solution
A method where a new base station adjusts the working channels of neighboring base stations through information exchange to provide an available channel, allowing dynamic allocation and minimizing interference by selecting an alternative channel for each affected station, thereby optimizing resource distribution and reducing maintenance costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If centralized mode is used for channel allocation, then optimal performance can be achieved by using minimum number of channels, but channel distribution computation becomes complex and requires extensive re-planning when new BSs join
Solution Approach 1:
The patent segments the channel allocation problem by introducing a coordinator BS that handles computation centrally while other BSs execute switching decisions locally. This divides the complex global optimization into manageable components: the coordinator performs computation once, and individual BSs perform simple channel switching operations when needed.
Solution Approach 2:
The coordinator BS acts as an intermediary between the channel allocation algorithm and the individual BSs. It receives topology information, computes the optimal channel distribution, and broadcasts the results to affected BSs, thereby simplifying the interaction complexity and enabling efficient channel reallocation without requiring all BSs to participate in computation.
2Ease of operation
If distributed mode is used for channel allocation, then computation is performed simultaneously by all BSs, but most BSs in the community must switch channel when new BSs join, increasing terminal cost
Solution Approach 1:
The patent extracts the heavy computation task from all BSs and concentrates it in the coordinator BS. Only the coordinator performs the complex channel distribution computation, while other BSs only perform the simple operation of switching channels if assigned by the coordinator. This extraction significantly reduces the number of BSs that need to actively participate in computation and reduces terminal costs.
3Reliability
If static channel allocation is used, then BSs in common coverage area occupy different channels, but re-planning is required when network topology changes, reducing efficiency
Solution Approach 1:
The patent transforms static channel allocation into a dynamic system where channels can be reallocated when needed. The coordinator BS continuously monitors network topology changes and can trigger channel redistribution when new BSs join or topology changes occur. This dynamic adaptation allows the network to maintain interference avoidance while efficiently responding to topology changes without requiring complete re-planning.
Data Source
AI summary
A method and system of channel negotiation between neighbor BSs are provided. The method includes: a first BS obtaining channel information of all second BSs which neighboring to the first BS in response to starting of the first BS; selecting a channel in the network as a first working channel of the first BS, and requesting all third BSs which are the second BSs occupying the first working channel to switch channel; and determining another channel for each of the third BSs excluding the first working channel as the target channel of the third BS, and switching the working channel of the third BS to the target channel, then occupying the first working channel. The method and system of channel negotiation between neighbor BSs adjust channels between neighbor BSs by negotiation automatically, and resource distribution for the whole network is optimized.