Wireless Link Recovery Between Base Stations Using Management Server

The patent pre-establishes alternative paths and maintains minimal link state information in advance, so when a link interruption occurs, the BS can immediately switch to a pre-planned alternative path without performing periodic control message exchanges. This resolves the contradiction by preparing recovery mechanisms beforehand, achieving fast recovery without continuous resource consumption.

The patent replaces continuous periodic control message exchanges with event-triggered communication. Control messages are only exchanged when necessary (e.g., when link interruption actually occurs), rather than following a fixed periodic schedule. This eliminates unnecessary radio resource waste while maintaining the ability to provide fast link recovery when needed.

The patent performs preliminary actions by pre-calculating and storing alternative paths in a database, and maintaining essential link state information. When link interruption occurs, the BS can immediately query the pre-prepared alternative path information without needing to exchange extensive control messages with neighboring BSs. This reduces both radio resource consumption and recovery time simultaneously.

The patent introduces a database or information storage mechanism as an intermediary that holds pre-computed alternative path information. Instead of directly exchanging control messages between BSs during link failure, the system queries this intermediary for pre-prepared recovery information, significantly reducing communication overhead and recovery time.

The patent pre-computes and stores alternative paths and link state information in advance, so when link interruption occurs, the system can immediately retrieve and activate a pre-planned alternative path. This eliminates the need for time-consuming on-demand path detection, enabling fast recovery that supports delay-sensitive applications while maintaining low radio resource overhead.

The patent implements a dynamic hybrid approach that adapts between table-driven and on-demand methods based on real-time conditions. For delay-sensitive applications or critical links, the system uses pre-computed alternative paths (table-driven behavior). For non-critical scenarios, it uses on-demand detection. This dynamic adaptation optimizes both resource efficiency and application performance.