IP Library Granted Patent US 12,464,372
Granted Patent B2
US 12,464,372 · App. 18/322,757 · Granted Nov 4, 2025

Providing telecommunication network-related resources to geographies based on user mobility systems and methods

Inventors: Ashish Tuli (Ashburn, VA); Heitor Almeida (Plano, TX)
Assignee: T-Mobile USA, Inc.
H04W16/18H04W4/029
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,464,372
App. No.
18/322,757
Granted
Nov 4, 2025
Kind
B2
Abstract

Systems and methods for providing telecommunications network-related resources to geographies based on user mobility are disclosed. The system identifies a proposed-split area that fails to satisfy a network-ready condition. The system temporarily splits the proposed-split area into a set of geographically-distinct sub-areas using a geographical constraining condition. The system obtains user mobility data indicating movement of user locations from respective geographically-distinct sub-areas to geographic locations that (i) satisfy the network-ready condition and (ii) is within a threshold distance of the respective geographically-distinct sub-area. The system determines a user-mobility metric for each geographically-distinct sub-area. The system identifies a subset of geographically-distinct sub-areas of at least one of the geographically-distinct sub-areas that satisfy the network-ready condition. The system permanently splits the proposed-split area and deploys network resources to the subset of geographically-distinct sub-areas in response to the user-mobility metrics of the subset of geographically-distinct sub-areas satisfying a user mobility threshold value.

Claims (67)

1 . A method, the method comprising:

identifying from a set of geographically-distinct areas, a proposed-split area, wherein the proposed-split area fails to satisfy a network-ready condition;

temporarily splitting the proposed-split area into a set of geographically-distinct sub-areas using a geographical constraining condition;

obtaining, from a third-party resource, user mobility data indicating movement of user locations from a respective geographically-distinct sub-area of the set of geographically-distinct sub-areas to a geographic location, wherein the geographic location (i) satisfies the network-ready condition and (ii) is within a threshold distance of the respective geographically-distinct sub-area;

determining a user-mobility metric for each geographically-distinct sub-area of the set of geographically-distinct sub-areas using the user-mobility data for the respective geographically-distinct sub-area;

identifying a subset of geographically-distinct sub-areas of the geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the user-mobility metrics of at least one of the subset of geographically-distinct sub-areas satisfying a user mobility threshold value, (i) permanently splitting the proposed-split area into the set of geographically-distinct sub-areas and (ii) deploying one or more network resources to the subset of geographically-distinct sub-areas.

2 . The method of claim 1 , further comprising:

determining a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition;

in response to the number satisfying a network-ready condition threshold number, performing a second split of each geographically-distinct sub-area of the set of geographically-distinct sub-areas using a second geographical constraining condition to generate a second set of geographically-distinct sub-areas; and

updating the set of geographically-distinct sub-areas to the second set of geographically-distinct sub-areas.

3 . The method of claim 1 , further comprising:

determining a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the number satisfying a network-ready condition threshold number, updating the threshold distance to a second threshold distance that is less than that of the threshold distance.

4 . The method of claim 1 , further comprising:

determining a number of the set of geographically-distinct sub-areas that fail to satisfy the network-ready condition; and

in response to the number failing to satisfy a network-ready condition threshold value, updating the threshold distance to a second threshold distance that is greater than that of the threshold distance.

5 . The method of claim 1 , further comprising:

determining a population density of users in the proposed-split area; and

accessing a database to determine the threshold distance using the population density of the users in the proposed-split areas, wherein the database comprises information mapping population densities to threshold distance values.

6 . The method of claim 1 , wherein the geographical constraining condition is based on at least one of: (i) state boundaries, (ii) city boundaries, (iii) county boundaries, or (iv) zip code boundaries.

7 . The method of claim 1 , wherein the one or more network resources comprise at least one of: (i) a telecommunications-network antenna, (ii) a telecommunications network service location, or (iii) a telecommunications network site.

8 . A system comprising:

at least one hardware processor; and

at least one non-transitory memory storing instructions, which, when executed by the at least one hardware processor, cause the system to:

identify from a set of geographically-distinct areas, a proposed-split area, wherein the proposed-split area fails to satisfy a network-ready condition;

temporarily split the proposed-split area into a set of geographically-distinct sub-areas using a geographical constraining condition;

obtain, from a third-party resource, user mobility data indicating movement of user locations from a respective geographically-distinct sub-area of the set of geographically-distinct sub-areas to a geographic location, wherein the geographic location (i) satisfies the network-ready condition and (ii) is within a threshold distance of the respective geographically-distinct sub-area;

determine a user-mobility metric for each geographically-distinct sub-area of the set of geographically-distinct sub-areas using the user-mobility data for the respective geographically-distinct sub-area;

identify a subset of geographically-distinct sub-areas of the geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the user-mobility metrics of at least one of the subset of geographically-distinct sub-areas satisfying a user mobility threshold value, (i) permanently split the proposed-split area into the set of geographically-distinct sub-areas and (ii) deploy one or more network resources to the subset of geographically-distinct sub-areas.

9 . The system of claim 8 , further comprising the instructions to:

determine a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition;

in response to the number satisfying a network-ready condition threshold number, performing a second split of each geographically-distinct sub-area of the set of geographically-distinct sub-areas using a second geographical constraining condition to generate a second set of geographically-distinct sub-areas; and

update the set of geographically-distinct sub-areas to the second set of geographically-distinct sub-areas.

10 . The system of claim 8 , further comprising the instructions to:

determine a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the number satisfying a network-ready condition threshold number, update the threshold distance to a second threshold distance that is less than that of the threshold distance.

11 . The system of claim 8 , further comprising the instructions to:

determine a number of the set of geographically-distinct sub-areas that fail to satisfy the network-ready condition; and

in response to the number failing to satisfy a network-ready condition threshold value, update the threshold distance to a second threshold distance that is greater than that of the threshold distance.

12 . The system of claim 8 , further comprising the instructions to:

determine a population density of users in the proposed-split area; and

access a database to determine the threshold distance using the population density of the users in the proposed-split areas, wherein the database comprises information mapping population densities to threshold distance values.

13 . The system of claim 8 , wherein the one or more network resources comprise at least one of: (i) a telecommunications-network antenna, (ii) a telecommunications network service location, or (iii) a telecommunications network site.

14 . At least one non-transitory computer-readable storage medium storing instructions, which, when executed by at least one data processor of a system, cause the system to:

identifying from a set of geographically-distinct areas, a proposed-split area, wherein the proposed-split area fails to satisfy a network-ready condition;

temporarily splitting the proposed-split area into a set of geographically-distinct sub-areas using a geographical constraining condition;

obtaining, from a third-party resource, user mobility data indicating movement of user locations from a respective geographically-distinct sub-area of the set of geographically-distinct sub-areas to a geographic location, wherein the geographic location (i) satisfies the network-ready condition and (ii) is within a threshold distance of the respective geographically-distinct sub-area;

determining a user-mobility metric for each geographically-distinct sub-area of the set of geographically-distinct sub-areas using the user-mobility data for the respective geographically-distinct sub-area;

identifying a subset of geographically-distinct sub-areas of at least one of the geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the user-mobility metrics of the subset of geographically-distinct sub-areas satisfying a user mobility threshold value, (i) permanently splitting the proposed-split area into the set of geographically-distinct sub-areas and (ii) deploying one or more network resources to the subset of geographically-distinct sub-areas.

15 . The non-transitory computer-readable storage medium of claim 14 , further storing instructions, which, when executed by the at least one data processor of the system, cause the system to:

determining a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition;

in response to the number satisfying a network-ready condition threshold number, performing a second split of each geographically-distinct sub-area of the set of geographically-distinct sub-areas using a second geographical constraining condition to generate a second set of geographically-distinct sub-areas; and

updating the set of geographically-distinct sub-areas to the second set of geographically-distinct sub-areas.

16 . The non-transitory computer-readable storage medium of claim 14 , further storing instructions, which, when executed by the at least one data processor of the system, cause the system to:

determining a number of the set of geographically-distinct sub-areas that satisfy the network-ready condition; and

in response to the number satisfying a network-ready condition threshold number, updating the threshold distance to a second threshold distance that is less than that of the threshold distance.

17 . The non-transitory computer-readable storage medium of claim 14 , further storing instructions, which, when executed by the at least one data processor of the system, cause the system to:

determining a number of the set of geographically-distinct sub-areas that fail to satisfy the network-ready condition; and

in response to the number failing to satisfy a network-ready condition threshold value, updating the threshold distance to a second threshold distance that is greater than that of the threshold distance.

18 . The non-transitory computer-readable storage medium of claim 14 , further storing instructions, which, when executed by the at least one data processor of the system, cause the system to:

determining a population density of users in the proposed-split area; and

accessing a database to determine the threshold distance using the population density of the users in the proposed-split areas, wherein the database comprises information mapping population densities to threshold distance values.

19 . The non-transitory computer-readable storage medium of claim 14 , wherein the geographical constraining condition is based on at least one of: (i) state boundaries, (ii) city boundaries, (iii) county boundaries, or (iv) zip code boundaries.

20 . The non-transitory computer-readable storage medium of claim 14 , wherein the one or more network resources comprise at least one of: (i) a telecommunications-network antenna, (ii) a telecommunications network service location, or (iii) a telecommunications network site.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 27, 2023
From: TULI, ASHISH; ALMEIDA, HEITOR
To: T-MOBILE USA, INC.
Reel/Frame 065664/0377 →
Continuity (1)
Related Publication 20240397337A1 · Nov 28, 2024
References Cited (107)
US 6047186A · Yu et al. · 2000 [cited by applicant]
US 6108533A · Brohoff · 2000 [cited by applicant]
US RE38267E · Borkowski et al. · 2003 [cited by applicant]
US 6697477B2 · Fleischer et al. · 2004 [cited by applicant]
US 7181212B2 · Hogan et al. · 2007 [cited by applicant]
US 7363041B2 · Bonnard et al. · 2008 [cited by applicant]
US 7606583B2 · Spriestersbach · 2009 [cited by applicant]
US 7620402B2 · Feldman et al. · 2009 [cited by applicant]
US 7801897B2 · Egnor · 2010 [cited by applicant]
US 8145237B2 · Versteeg · 2012 [cited by applicant]
US 8385926B2 · Johansson et al. · 2013 [cited by applicant]
US 8504059B2 · Huang et al. · 2013 [cited by applicant]
US 8526961B2 · Sanders et al. · 2013 [cited by applicant]
US 8634860B2 · Huang et al. · 2014 [cited by applicant]
US 8655371B2 · Huang · 2014 [cited by applicant]
US 8660576B2 · Huang · 2014 [cited by applicant]
US 8694025B2 · Dupray et al. · 2014 [cited by applicant]
US 8779917B1 · White · 2014 [cited by applicant]
US 8897803B2 · Pylappan et al. · 2014 [cited by applicant]
US 8942708B2 · Singh et al. · 2015 [cited by applicant]
US 9042254B2 · Soulie · 2015 [cited by applicant]
US 9171301B1 · Gupta et al. · 2015 [cited by applicant]
US 9230167B2 · Miller et al. · 2016 [cited by applicant]
US 9319836B2 · Jodlauk et al. · 2016 [cited by applicant]
US 9336679B1 · Chitale et al. · 2016 [cited by applicant]
US 9585036B1 · Tektumanidze et al. · 2017 [cited by applicant]
US 9599476B2 · Mund et al. · 2017 [cited by applicant]
US 9661066B2 · Seth et al. · 2017 [cited by applicant]
US 9706411B2 · Goswami et al. · 2017 [cited by applicant]
US 9763169B2 · Mcquaid · 2017 [cited by applicant]
US 10102536B1 · Hickman et al. · 2018 [cited by applicant]
US 10229434B2 · Cheng et al. · 2019 [cited by applicant]
US 10264504B2 · Zhang et al. · 2019 [cited by applicant]
US 10296525B2 · Brewington et al. · 2019 [cited by applicant]
US 10356707B2 · Liang et al. · 2019 [cited by applicant]
US 10425832B1 · Zawadzki et al. · 2019 [cited by applicant]
US 10444954B2 · Zhang et al. · 2019 [cited by applicant]
US 10565620B1 · Chadwick · 2020 [cited by applicant]
US 10599417B2 · Marche et al. · 2020 [cited by applicant]
US 10601684B2 · Hashmi et al. · 2020 [cited by applicant]
US 10623256B2 · Zawadzki et al. · 2020 [cited by applicant]
US 10817889B2 · Zachariah et al. · 2020 [cited by applicant]
US 10931764B2 · Davis et al. · 2021 [cited by applicant]
US 10993081B2 · Mehran et al. · 2021 [cited by applicant]
US 11051207B2 · Nieminen · 2021 [cited by applicant]
US 11107099B2 · Mayster et al. · 2021 [cited by applicant]
US 20020183075A1 · Fauconnier · 2002 [cited by applicant]
US 20040203867A1 · Schmidt · 2004 [cited by applicant]
US 20040205517A1 · Lampert et al. · 2004 [cited by applicant]
US 20060206610A1 · Ling et al. · 2006 [cited by applicant]
US 20100017261A1 · Evans et al. · 2010 [cited by applicant]
US 20130263042A1 · Buening · 2013 [cited by examiner]
US 20150019294A1 · Milton et al. · 2015 [cited by applicant]
US 20150100373A1 · Ignatyev et al. · 2015 [cited by applicant]
US 20150302123A1 · Gloss et al. · 2015 [cited by applicant]
US 20160019465A1 · Milton · 2016 [cited by examiner]
US 20160055175A1 · Thompson et al. · 2016 [cited by applicant]
US 20170078412A1 · Wentz · 2017 [cited by applicant]
US 20170185685A1 · Brewer et al. · 2017 [cited by applicant]
US 20170192982A1 · Glover et al. · 2017 [cited by applicant]
US 20180165302A1 · Tanglertsampan et al. · 2018 [cited by applicant]
US 20210037351A1 · Hui · 2021 [cited by examiner]
US 20210350396A1 · Balise et al. · 2021 [cited by applicant]
US 20220027816A1 · Ritter et al. · 2022 [cited by applicant]
US 20220030382A1 · Klasson · 2022 [cited by examiner]
US 20220163347A1 · Anastassov · 2022 [cited by applicant]
US 20240406836A1 · Tuli · 2024 [cited by examiner]
CN 1302520A · 2001 [cited by applicant]
CN 102752767B · 2014 [cited by applicant]
CN 105960816A · 2016 [cited by applicant]
CN 104217244B · 2017 [cited by applicant]
CN 110831019B · 2020 [cited by applicant]
CN 111750891A · 2020 [cited by applicant]
CN 112352256A · 2021 [cited by applicant]
CN 113574830A · 2021 [cited by applicant]
CN 113647055A · 2021 [cited by applicant]
CN 113779172A · 2021 [cited by applicant]
CN 113919433A · 2022 [cited by applicant]
CN 109348488B · 2022 [cited by applicant]
CN 112950119B · 2022 [cited by applicant]
CN 115379388A · 2022 [cited by applicant]
CN 115550251B · 2023 [cited by applicant]
DE 102016110430A1 · 2017 [cited by applicant]
EP 1199902B1 · 2006 [cited by applicant]
EP 1803315A1 · 2007 [cited by applicant]
EP 2172377A1 · 2010 [cited by applicant]
EP 2359643A1 · 2011 [cited by applicant]
EP 2386995A1 · 2011 [cited by applicant]
EP 3255924A1 · 2017 [cited by applicant]
EP 3721656A1 · 2020 [cited by applicant]
EP 3791350A1 · 2021 [cited by applicant]
JP 5690837B2 · 2015 [cited by applicant]
JP 5843960B2 · 2015 [cited by applicant]
JP 2019500674A · 2019 [cited by applicant]
JP 2020518886A · 2020 [cited by applicant]
JP 6987891B2 · 2021 [cited by applicant]
KR 100885775B1 · 2009 [cited by applicant]
KR 101631932B1 · 2016 [cited by applicant]
WO 0004734A1 · 2000 [cited by applicant]
WO 03102839A1 · 2003 [cited by applicant]
WO 2013088402A1 · 2013 [cited by applicant]
WO 2015047603A1 · 2015 [cited by applicant]
WO 2017127592A1 · 2017 [cited by applicant]
WO 2017193783A1 · 2017 [cited by applicant]
WO 2018026262A2 · 2018 [cited by applicant]
WO 2018185407A1 · 2018 [cited by applicant]
WO 2021239520A1 · 2021 [cited by applicant]