IP Library Granted Patent US 12,389,285
Granted Patent B2
US 12,389,285 · App. 18/410,839 · Granted Aug 12, 2025

Optimizing key allocation during roaming using machine learning

Inventors: Gopal Gupta (Bangalore, IN); Abhinesh Mishra (Bangalore, IN); Isaac Theogaraj (Bangalore, IN); Sachin Ganu (San Jose, CA); Bernd Bandemer (Santa Clara, CA); Jose Tellado (Santa Clara, CA)
Assignee: Hewlett Packard Enterprise Development LP
H04W36/0038G06N20/00H04L41/16H04W12/041H04W36/0061H04W88/08H04W36/00835
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,389,285
App. No.
18/410,839
Granted
Aug 12, 2025
Kind
B2
Abstract

Systems and methods are provided for optimizing resource consumption by bringing intelligence to the key allocation process for fast roaming. Specifically, embodiments of the disclosed technology use machine learning to predict which AP a wireless client device will migrate to next. In some embodiments, machine learning may also be used to select a subset of top neighbors from a neighborhood list. Thus, instead of allocating keys for each of the APs on the neighborhood list, key allocation may be limited to the predicted next AP, and the subset of top neighbors. In some embodiments, a reinforcement learning model may be used to dynamically adjust the size of the subset in order to optimize resources while satisfying variable client demand.

Claims (39)

1. A non-transitory computer-readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to perform a method comprising:

learning migration behavior associated with a client device including patterns of migration amongst access points (APs) and to which APs the client device connects most often;

receiving a notification that comprises a current and a neighborhood list, wherein the current AP is the AP to which the client device is currently connected, and the neighborhood list is a list of APs in the neighborhood of the current AP;

predicting an AP in the neighborhood of the current AP to which the client device will migrate next based on predicted probabilities of connections to the APs in the neighborhood, the predicted probabilities being based on the current AP and the learned migration behavior;

generating an authentication client key for the predicted next AP; and

propagating the authentication client key to the predicted next AP to facilitate pre-authentication of the client device prior to migration of the client device to the predicted next AP.

2. The non-transitory computer-readable storage medium of claim 1 , wherein the authentication client key is a cryptographic key associated with the client device.

3. The non-transitory storage medium of claim 1 , wherein the client device one of skips or undergoes shortened authentication procedures upon attempting to associate to the predicted next AP, the authentication client key having been cached by the predicted next AP.

4. The non-transitory storage medium of claim 1 , wherein the instructions that when executed cause the learning of the migration behavior comprise further instructions causing the computing system to track movement of the client device between APs over time.

5. The non-transitory storage medium of claim 4 , wherein the instructions that when executed cause the learning of the migration behavior comprise further instructions causing the computing system to record to which AP the client device is connected at various points over the time during which the movement of the client device is tracked.

6. The non-transitory computer-readable storage medium of claim 1 including further instructions that when executed by the at least one processor of the computing system, causes the computing system to derive the neighborhood list based on path loss value relative to the current AP.

7. The non-transitory computer-readable storage medium of claim 6 , wherein the instructions that when executed cause the derivation of the neighborhood list comprise further instructions to cause the computing system to calculate path loss values between the current AP and APs neighboring the current AP.

8. The non-transitory computer-readable storage medium of claim 7 , wherein the instructions that when executed cause the predicting of the AP to which the client device will migrate next comprise further instructions to cause the computing system to execute one or more machine learning operations to determine a probability of being an AP to which the client device will migrate next.

9. The non-transitory computer-readable storage medium of claim 8 , wherein the instructions that when executed cause the predicting of the AP to which the client device will migrate next comprise further instructions to cause the computing system to select that AP having the highest probability of being the AP to which the client device will migrate next.

10. A system, comprising:

at least one processor; and

a memory storing instructions that, when executed by the at least one processor, cause the system to perform a method comprising:

learning migration behavior of a client device including patterns of migration amongst access points (APs) and to which APs the client device connects most often;

determining a current AP to which the client device is currently connected

allocating a cryptographic authentication key associated with the client device to a predicted target AP to which the client is expected to migrate, the predicted target AP having been determined based on predicted probabilities of connections to the APs in a neighborhood list, the predicted probabilities being based on the current AP and the learned migration behavior of the client device; and

reestablishing at least one of existing security or quality of service (Qos) parameters relevant to the client device prior to reconnecting to the predicted target AP.

11. The system of claim 10 , wherein the instructions that when executed cause the system to learn the migration behavior comprise further instructions that cause the system to track movement of the client device between APs over time.

12. The system of claim 11 , wherein the instructions that when executed cause the learning of the migration behavior comprise further instructions that cause the system to record to which AP the client device is connected at various points over the time during which the movement of the client device is tracked.

13. The system of claim 10 , wherein the memory stores further instructions that when executed by the at least one processor of the computing system, causes the system to derive the neighborhood list based on path loss value relative to the current AP.

14. The system of claim 13 , wherein the instructions that when executed cause the derivation of the neighborhood list comprise further instructions that cause the system to calculate path loss values between the current AP and APs neighboring the current AP.

15. The system of claim 10 , wherein the instructions that when executed cause the predicting of the target AP to which the client device will migrate next comprise further instructions to cause the computing system to execute one or more machine learning operations to determine a probability of being an AP to which the client device will migrate next.

16. The system of claim 15 , wherein the instructions that when executed cause the predicting of the target AP to which the client device will migrate next comprise further instructions to cause the computing system to select that AP having the highest probability of being the AP to which the client device will migrate next.

17. The method of claim 13 , wherein the instructions that when executed cause the system to learn the migration behavior comprise further instructions that cause the system to build a Markov chain where each connection point of the Markov chain represents an AP on neighborhood list.

18. The system of claim 10 , wherein the client device one of skips or undergoes shortened authentication procedures upon attempting to associate to the predicted target AP, prior to connection of the client device to the predicted target AP, the cryptographic authentication key having been cached by the predicted target AP.

19. A method, comprising:

receiving at a target access point (AP) predicted to be an AP to which a client device will connect, a cryptographic authentication key indicative of the client device, the predicted target AP having been identified based on learned patterns of migration amongst APs and to which APs the client device connects most often;

caching at the target AP, the cryptographic key, prior to a BSS transition;

upon the client device associating to the target AP, pre-authenticating the client device by reestablishing at least one of existing security or quality of service (QOS) parameters relevant to the client device at the target AP; and

after associating the client device to the target AP and after the pre-authentication of the client device by the target AP, effectuating the BSS transition of the client device to the target AP.

20. The method of claim 19 , wherein the cryptographic authentication key is received from a key management service operating to:

learn migration behavior of the client device;

determine a current AP to which the client device is currently associated; and

allocate the cryptographic authentication key to the target AP, the target AP having been predicted based on the current AP and the learned migration behavior of the client device.

21. The method of claim 20 , further comprising determining a neighborhood list of APs based on the current AP and the learned migration behavior of the client device, the target AP being one AP in the neighborhood list of APs.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 24, 2024
From: GUPTA, GOPAL; MISHRA, ABHINESH; THEOGARAJ, ISAAC; GANU, SACHIN; BANDEMER, BERND; TELLADO, JOSE
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 066226/0865 →
Continuity (2)
Continuation 17391559 · Aug 2, 2021
Related Publication 20240147314A1 · May 2, 2024
References Cited (39)
US 10390273B2 · Sankaranarayan · 2019 [cited by examiner]
US 10511931B1 · Khawand · 2019 [cited by examiner]
US 11690113B2 · Eom · 2023 [cited by examiner]
US 11910249B2 · Gupta · 2024 [cited by examiner]
US 20070250713A1 · Rahman · 2007 [cited by examiner]
US 20070253369A1 · Abhishek · 2007 [cited by examiner]
US 20080146230A1 · Pandian · 2008 [cited by examiner]
US 20120008776A1 · Ishida · 2012 [cited by examiner]
US 20130232542A1 · Cheng · 2013 [cited by examiner]
US 20140113623A1 · Garg · 2014 [cited by examiner]
US 20140334336A1 · Chen · 2014 [cited by examiner]
US 20150120930A1 · Kamthe · 2015 [cited by examiner]
US 20170265108A1 · Chen · 2017 [cited by examiner]
US 20180234900A1 · Sankaranarayan · 2018 [cited by examiner]
US 20190239158A1 · Wulff · 2019 [cited by examiner]
US 20190319868A1 · Svennebring · 2019 [cited by examiner]
US 20190364380A1 · Khawand · 2019 [cited by examiner]
US 20200059356A1 · Shveykin · 2020 [cited by examiner]
US 20200076520A1 · Jana · 2020 [cited by examiner]
US 20200092718A1 · Ohlsson · 2020 [cited by examiner]
US 20200320397A1 · Liu · 2020 [cited by examiner]
US 20210406696A1 · Liu · 2021 [cited by examiner]
US 20220038359A1 · Svennebring · 2022 [cited by examiner]
US 20220292827A1 · Chen · 2022 [cited by examiner]
US 20230029760A1 · Gupta · 2023 [cited by examiner]
US 20230033287A1 · Agarwal · 2023 [cited by examiner]
US 20230300687A1 · Mattaparti · 2023 [cited by examiner]
US 20240147314A1 · Gupta · 2024 [cited by examiner]
WO 2020159430A1 · 2020 [cited by applicant]
WO 2020254859A1 · 2020 [cited by applicant]
“4G LTE Network Throughput Modelling and Prediction”; Elsherbiny et al.; GLOBECOM 2020-2020 IEEE Global Communications Conference | 978-1-7281-8298-8/20/$31.00 ©2020 IEEE; Dec. 7, 2020 (Year: 2020). [cited by applicant]
“A Novel Online Machine Learning Based RSU Prediction Scheme for Intelligent Vehicular Networks”; Aljeri et al.; 2019 IEEE/ACS 16th International Conference on Computer Systems and Applications (AICCSA); Nov. 3, 2019 (Y… [cited by applicant]
“Artificial Intelligence-Enabled Cellular Networks: A Critical Path to Beyond-5G and 6G”; Shafin et al.; IEEE Wireless Communications (vol. 27, Issue: 2, Apr. 2020) (Year: 2020). [cited by applicant]
“Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing”; Zhou et al.; Proceedings of the IEEE | vol. 107, No. 8, Aug. 2019 (Year: 2019). [cited by applicant]
“Forecasting Quality of Service for Next-Generation Data-Driven WiFi6 Campus Networks”; Ak et al.; IEEE Transactions on Network and Service Management, vol. 18, No. 4, Dec. 2021 (Year: 2021). [cited by applicant]
“Predictive UAV Base Station Deployment and Service Offloading With Distributed Edge Learning”; Zhao et al.; IEEE Transactions on Network and Service Management, vol. 18, No. 4, Dec. 2021 (Year: 2021). [cited by applicant]
Arista Networks, Inc., “Roaming in WI-FI Network,” 2022, https://wifihelp.arista.com/post/roaming-in-wifi-networks. [cited by applicant]
Memon S. et al., Using Machine Learning for Handover Optimization in Vehicular Fog Computing, (Research Paper), SAC '19: Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, Dec. 18, 2018, 9pgs, ACM, Limas… [cited by applicant]
slideshare.com, “Optimizing Aruba WLANs for Roaming Devices,” Apr. 14, 2014, https://www.slideshare.net/ArubaNetworks/optimizing-aruba-wlans-for-roaming-devices. [cited by applicant]