# US 12,772,135 B2 · Managing software updates to radio nodes in a wireless mobile network > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,772,135 B2 - Document ID: US12772135B2 - Status: Granted - Kind: B2 - Application number: 18/644,114 - Filed: 2024-04-24 - Published: 2025-10-30 - Granted: 2026-10-20 - Earliest claimed: 2024-04-24 - Assignees: Rakuten Symphony, Inc. - Applicants: Rakuten Symphony, Inc. - Inventors: Tasnim Ahmed - Web page: https://patentgrep.com/patent/US12772135B2 ## CPC - H04W 36/32: by location or mobility data, e.g. speed data - H04W 24/08: Testing, {supervising or monitoring} using real traffic - H04W 36/0061: {of neighbour cell information} - H04W 36/249: {according to timing information} - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract Radio nodes are monitored to obtain radio node coverage information and to obtain radio node status information. Based on the monitoring, coverage information and handover information for the radio nodes is collected, and transport traffic information and subscriber count information for the radio nodes are collected. Based on the radio node coverage information, node clustering is performed to identify one or more batches of source nodes to update based on a compensation capacity of neighbor nodes to the source nodes. Based on the one or more batches of source nodes identified from the node clustering, and on the radio node status information, a scheduling operation is performed to choose a time-slot for executing an update to at least one of the one or more batches of source nodes. ## Claims ### Claim 1 A method, comprising: monitoring radio nodes to obtain radio node coverage information and to obtain radio node status information; based on the radio node coverage information, performing node clustering to identify one or more batches of source nodes to update based on a compensation capacity of neighbor nodes to the source nodes; and based on the one or more batches of source nodes identified from the node clustering, and on the radio node status information, performing a scheduling operation to choose a time-slot for executing an update to at least one of the one or more batches of source nodes. ### Claim 2 (depends on 1) The method of claim 1, wherein the monitoring the radio nodes to obtain the radio node coverage information includes collecting coverage information and handover information for the radio nodes, and wherein the monitoring the radio nodes to obtain the radio node status information includes collecting transport traffic information and subscriber count information for the radio nodes. ### Claim 3 (depends on 1) The method of claim 1, wherein the performing node clustering to identify one or more batches of source nodes to update based on the compensation capacity of the neighbor nodes to the source nodes includes: determining the source nodes; identifying the neighbor nodes to the source node; and sequencing the neighbor nodes according to a combined coverage capacity clustered by Coverage, Handover Success (HOS) Ratio, and HO Attempts. ### Claim 4 (depends on 1) The method of claim 1, wherein the performing the scheduling operation to choose the time-slot for executing an update to the at least one of the one or more batches of source nodes includes: forecasting traffic volume and a subscriber count for the source nodes in the one or more batches; ranking time-slots for the one or more batches based on a forecast traffic volume and subscriber count for the source nodes in the one or more batches; ranking the one or more batches according to a priority based on a hotspot count; filtering the time-slots that are compatible for the one or more batches based on a batch schedule criteria; selecting a highest priority compatible time-slot having a least number of allocated batches; and assigning the selected highest priority compatible time-slot to a highest ranked batch of the one or more batches. ### Claim 5 (depends on 1) The method of claim 1 further comprising performing geographic analytics to generate a geographic map showing a maximum compensation coverage of the neighbor nodes. ### Claim 6 (depends on 1) The method of claim 1, wherein the performing node clustering includes prioritizing hotspots to determine a scheduled time-slot having a lowest traffic and to determine an additional coverage backup for the source nodes associated with the prioritized hotspots. ### Claim 7 (depends on 1) The method of claim 1, wherein the performing the scheduling operation to choose the time-slot for executing the update to the at least one of the one or more batches of source nodes includes performing a scheduling risk assessment to identify the at least one of the one or more batches of source nodes to shut down having a minimal impact on data traffic and connected subscribers. ### Claim 8 A smart scheduler configured to: monitor radio nodes to obtain radio node coverage information and to obtain radio node status information; based on the radio node coverage information, perform node clustering to identify one or more batches of source nodes to update based on a compensation capacity of neighbor nodes to the source nodes; and based on the one or more batches of source nodes identified from the node clustering, and on the radio node status information, perform a scheduling operation to choose a time-slot for executing an update to at least one of the one or more batches of source nodes. ### Claim 9 (depends on 8) The smart scheduler of claim 8, further configured to monitor the radio nodes to obtain the radio node coverage information by collecting coverage information and handover information for the radio nodes, and wherein the monitoring the radio nodes to obtain the radio node status information includes collecting transport traffic information and subscriber count information for the radio nodes. ### Claim 10 (depends on 8) The smart scheduler of claim 8, further configured to perform the node clustering to identify the one or more batches of source nodes to update based on the compensation capacity of the neighbor nodes to the source nodes by determining the source nodes, identifying the neighbor nodes to the source node, and sequencing the neighbor nodes according to a combined coverage capacity clustered by Coverage, Handover Success (HOS) Ratio, and HO Attempts. ### Claim 11 (depends on 8) The smart scheduler of claim 8, further configured to perform wherein the performing the scheduling operation to choose the time-slot for executing an update to the at least one of the one or more batches of source nodes by forecasting traffic volume and a subscriber count for the source nodes in the one or more batches, ranking time-slots for the one or more batches based on a forecast traffic volume and subscriber count for the source nodes in the one or more batches, ranking the one or more batches according to a priority based on z hotspot count, filtering the time-slots that are compatible for the one or more batches based on a batch schedule criteria, selecting a highest priority compatible time-slot having a least number of allocated batches, and assigning the selected highest priority compatible time-slot to a highest ranked batch of the one or more batches. ### Claim 12 (depends on 8) The smart scheduler of claim 8, further configured to perform geographic analytics to generate a geographic map showing a maximum compensation coverage of the neighbor nodes. ### Claim 13 (depends on 8) The smart scheduler of claim 8, further configured to perform the node clustering to identify the one or more batches of source nodes to update based on the compensation capacity of the neighbor nodes to the source nodes by prioritizing hotspots to determine a scheduled time-slot having a lowest traffic and to determine an additional coverage backup for the source nodes associated with the prioritized hotspots. ### Claim 14 (depends on 8) The smart scheduler of claim 8, further configured to perform the scheduling operation to choose the time-slot for executing the update to the at least one of the one or more batches of source nodes by performing a scheduling risk assessment to identify the at least one of the one or more batches of source nodes to shut down having a minimal impact on data traffic and connected subscribers. ### Claim 15 A non-transitory computer-readable media having computer-readable instructions stored thereon, which when executed perform operations comprising: monitoring radio nodes to obtain radio node coverage information and to obtain radio node status information; based on the radio node coverage information, performing node clustering to identify one or more batches of source nodes to update based on a compensation capacity of neighbor nodes to the source nodes; and based on the one or more batches of source nodes identified from the node clustering, and on the radio node status information, performing a scheduling operation to choose a time-slot for executing an update to at least one of the one or more batches of source nodes. ### Claim 16 (depends on 15) The non-transitory computer-readable media of claim 15, wherein the monitoring the radio nodes to obtain the radio node coverage information includes collecting coverage information and handover information for the radio nodes, and wherein the monitoring the radio nodes to obtain the radio node status information includes collecting transport traffic information and subscriber count information for the radio nodes. ### Claim 17 (depends on 15) The non-transitory computer-readable media of claim 15, wherein the performing node clustering to identify one or more batches of source nodes to update based on the compensation capacity of the neighbor nodes to the source nodes includes: determining the source nodes; identifying the neighbor nodes to the source node; sequencing the neighbor nodes according to a combined coverage capacity clustered by Coverage, Handover Success (HOS) Ratio, and HO Attempts; and prioritizing hotspots to determine a scheduled time-slot having a lowest traffic and to determine an additional coverage backup for the source nodes associated with the prioritized hotspots. ### Claim 18 (depends on 15) The non-transitory computer-readable media of claim 15, wherein the performing the scheduling operation to choose the time-slot for executing an update to the at least one of the one or more batches of source nodes includes: forecasting traffic volume and a subscriber count for the source nodes in the one or more batches; ranking time-slots for the one or more batches based on a forecast traffic volume and subscriber count for the source nodes in the one or more batches; ranking the one or more batches according to a priority based on hotspot count; filtering the time-slots that are compatible for the one or more batches based on a batch schedule criteria; selecting a highest priority compatible time-slot having a least number of allocated batches; and assigning the selected highest priority compatible time-slot to a highest ranked batch of the one or more batches. ### Claim 19 (depends on 15) The non-transitory computer-readable media of claim 15 further comprising performing geographic analytics to generate a geographic map showing a maximum compensation coverage of the neighbor nodes. ### Claim 20 (depends on 15) The non-transitory computer-readable media of claim 15, wherein the performing the scheduling operation to choose the time-slot for executing the update to the at least one of the one or more batches of source nodes includes performing a scheduling risk assessment to identify the at least one of the one or more batches of source nodes to shut down having a minimal impact on data traffic and connected subscribers.