A telecommunications network is established via a complex arrangement and configuration of many cell sites that are deployed across a geographical area. For example, there can be different types of cell sites (e.g., macro cells, microcells, and so on) positioned in a specific geographical location, such as a city, neighborhood, and so on). These cell sites strive to provide adequate, reliable coverage for mobile devices (e.g., smart phones, tablets, and so on) via different frequency bands and radio networks such as a Global System for Mobile (GSM) mobile communications network, a code/time division multiple access (CDMA/TDMA) mobile communications network, a 3rd or 4th generation (3G/4G) mobile communications network (e.g., General Packet Radio Service (GPRS/EGPRS)), Enhanced Data rates for GSM Evolution (EDGE), Universal Mobile Telecommunications System (UMTS), or Long Term Evolution (LTE) network), 5G mobile communications network, IEEE 802.11 (WiFi), or other communications networks. The devices can seek access to the telecommunications network for various services provided by the network, such as services that facilitate the transmission of data over the network and/or provide content to the devices.
As device usage continues to rise at an impressive rate, there are too many people using too many network (and/or data)-hungry applications in places where the wireless edge of the telecommunications network has limited or no capacity. As a result, most telecommunications networks have to contend with issues of network congestion. Network congestion is the reduced quality of service that occurs when a network node carries more data than it can handle. Typical effects include queueing delay, packet loss or the blocking of new connections, overall resulting in degraded customer experience. brief description of the drawings.
When performance of a cell site in a telecommunications network degrades below a threshold value (for example, an LTE site gets congested), different solutions have been suggested to address and resolve the degradation issues. However, it is difficult for wireless telecommunication service providers to determine which solution would be effective, optimal and cost-effective for the degraded site.
In the drawings, some components and/or operations can be separated into different blocks or combined into a single block for discussion of some of the implementations of the present technology. Moreover, while the technology is amenable to various modifications and alternative forms, specific implementations have been shown by way of example in the drawings and are described in detail below. The intention, however, is not to limit the technology to the specific implementations described. On the contrary, the technology is intended to cover all modifications, equivalents, and alternatives falling within the scope of the technology as defined by the appended claims.
An aim of a telecommunications service provider is to minimize customer experience degradation. This is typically achieved by deploying congestion management and/or network improvement solutions at one or more cell sites. To combat network congestion, different capacity planning solutions have been suggested to address and resolve the degradation issues. However, since a wide variety of capacity planning solutions are available as options to resolve degradation issues, it is difficult to determine which solutions, if any, are the best candidates to deploy at particular locations. As a result, the process for identifying which capacity planning solutions to deploy to alleviate network congestion and/or improve capacity is more of a trial and error process. This results in inefficiencies as well as wasted costs as telecommunications service providers try (and fail) deploying sub-optimum capacity planning solutions that are not tailored to the particular location of network traffic usage and congestion.
To solve the above and other problems, the inventors have developed an optimum capacity composite gain system and related method to identify optimum capacity planning solutions to improve telecommunications network performance for a particular location (“optimum capacity solution system”). One purpose of the optimum capacity solution system is to summarize complex, multi-dimensional indicators to support decision making by wireless telecommunication service providers on changes that may be needed to infrastructure repair, modification, planning and development. The optimum capacity solution system does this by analyzing data related to capacity planning solutions deployed at specific locations (e.g., historical data), learning from this data by creating clusters, and applying classification techniques to determine optimum capacity planning solutions capable of being deployed at a new location. As a result, a telecommunications service provider is able to efficiently and economically identify targeted solutions and locations to expand capacity of cell sites and improve customer experiences.
The optimum capacity solution system uses historical data comprising capacity gain solutions and their associated gains at various locations to train a machine learning model. The trained machine learning model then, upon receiving a new location (e.g., latitude and longitude coordinates), recommends the top n (e.g., the top 3) solutions that should be deployed at the new location to improve telecommunications network performance. The machine learning model uses clustering techniques to perform the recommendations. In some implementations, the optimum capacity solution system builds/accesses a dataset comprising information of previously deployed capacity improvement solutions, such as gain, cost, location, duration, and solution type. It then performs clustering on the dataset per market for each solution to categorize solutions within an area. Then, it ranks the solutions in each cluster based on one or more of the following criterion: spectrum, duration, area (latitude/longitude), and cost. Once a customer inputs a new location (e.g., by entering latitude/longitude, clicking on a location on a map, etc.), the optimum capacity solution system finds the nearest cluster and shows the top n solutions in the cluster. (While the term “customer” is used in the application, one of skill in the art will understand that the concepts discussed herein will similarly apply to other users, who may or may not be customers of a telecommunications service provider.)
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of implementations of the present technology. It will be apparent, however, to one skilled in the art that implementations of the present technology can be practiced without some of these specific details.
The phrases “in some implementations,” “in several implementations,” “according to some implementations,” “in the implementations shown,” “in other implementations,” and the like generally mean the specific feature, structure, or characteristic following the phrase is included in at least one implementation of the present technology and can be included in more than one implementation. In addition, such phrases do not necessarily refer to the same implementations or different implementations.
Suitable Computing Environments
One or more user devices 110, such as mobile devices or user equipment (UE) associated with users (such as mobile phones (e.g., smartphones), tablet computers, laptops, and so on), Internet of Things (IoT) devices, devices with sensors, and so on, receive and transmit data, stream content, and/or perform other communications or receive services over a telecommunications network 130, which is accessed by the user device 110 over one or more cell sites 120, 125. For example, the user device 110 can access a telecommunication network 130 via a cell site at a geographical location that includes the cell site, in order to transmit and receive data (e.g., stream or upload multimedia content) from various entities, such as a content provider 140, cloud data repository 145, and/or other user devices 155 on the network 130 and via the cell site 120.
The cell sites may include macro cell sites 120, such as base stations, small cell sites 125, such as picocells, microcells, or femtocells, and/or other network access component or sites (including IEEE 802.11 WLAN access points). The cell sites 120, 125 can store data associated with their operations, including data associated with the number and types of connected users, data associated with the provision and/or utilization of a spectrum, radio band, frequency channel, and so on, provided by the cell sites 120, 125, and so on. The cell sites 120, 125 can monitor their use, such as the provisioning or utilization of PRBs provided by a cell site physical layer in LTE network. For example, a cell site 120 having a channel bandwidth of 5 MHz that provides 25 available physical resource blocks through which data can be transmitted to/from the user device 110.
Other components provided by the telecommunications network 130 can monitor and/or measure the operations and transmission characteristics of the cell sites 120, 125 and other network access components. For example, the telecommunications network 130 can provide a network monitoring system, via a network resource controller (NRC) or network performance and monitoring controller, or other network control component, in order to measure and/or obtain the data associated with the utilization of cell sites 120, 125 when data is transmitted within a telecommunications network.
The computing environment 100 includes an optimum capacity solution system 150 configured to monitor aspects of the network 130 based on, for example, data received from the network monitoring system. The optimum capacity solution system 150 can evaluate and select optimum network performance improvement solutions to be deployed at cell sites to improve their performance as described in detail below.
Aspects of the system can be embodied in a special purpose computing device or data processor that is specifically programmed, configured, or constructed to perform one or more of the computer-executable instructions explained in detail herein. Aspects of the system can also be practiced in distributed computing environments where tasks or modules are performed by remote processing devices, which are linked through any communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), or the Internet. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
Aspects of the system can be stored or distributed on computer-readable media (e.g., physical and/or tangible non-transitory computer-readable storage media), including magnetically or optically readable computer discs, hard-wired or preprogrammed chips (e.g., EEPROM semiconductor chips), nanotechnology memory, or other data storage media. Indeed, computer implemented instructions, data structures, screen displays, and other data under aspects of the system can be distributed over the Internet or over other networks (including wireless networks), on a propagated signal on a propagation medium (e.g., an electromagnetic wave(s), a sound wave, etc.) over a period of time, or they can be provided on any analog or digital network (packet switched, circuit switched, or other scheme). Portions of the system reside on a server computer, while corresponding portions reside on a client computer such as a mobile or portable device, and thus, while certain hardware platforms are described herein, aspects of the system are equally applicable to nodes on a network. In an alternative implementation, the mobile device or portable device can represent the server portion, while the server can represent the client portion.
In some implementations, the user device 110 and/or the cell sites 120, 125 can include network communication components that enable the devices to communicate with remote servers or other portable electronic devices by transmitting and receiving wireless signals using a licensed, semi-licensed, or unlicensed spectrum over communications network, such as network 130. In some cases, the communication network 130 can be comprised of multiple networks, even multiple heterogeneous networks, such as one or more border networks, voice networks, broadband networks, service provider networks, Internet Service Provider (ISP) networks, and/or Public Switched Telephone Networks (PSTNs), interconnected via gateways operable to facilitate communications between and among the various networks. The telecommunications network 130 can also include third-party communications networks such as a Global System for Mobile (GSM) mobile communications network, a code/time division multiple access (CDMA/TDMA) mobile communications network, a 3rd or 4th generation (3G/4G) mobile communications network (e.g., General Packet Radio Service (GPRS/EGPRS)), Enhanced Data rates for GSM Evolution (EDGE), Universal Mobile Telecommunications System (UMTS), or Long Term Evolution (LTE) network), 5G mobile communications network, IEEE 802.11 (WiFi), or other communications networks. Thus, the user device is configured to operate and switch among multiple frequency bands for receiving and/or transmitting data.
Further details regarding the operation and implementation of the optimum capacity solution system 150 will now be described.
Examples of Identifying Optimum Network Performance Improvement Solutions
Historical Data Module
The historical data module 210 is configured and/or programmed to generate/access/receive/collect a set of network improvement solutions records for one or more locations over a period of time (e.g., daily, weekly, monthly, quarterly, yearly, etc.) (which can be stored in the capacity solution database 255). The set of network improvement solutions records comprises information about one or more of the following parameters: location (e.g., latitude/longitude), market(s) associated with the location, network performance improvement solution(s) deployed at the location, and an associated gain profile for the deployed network performance improvement solutions. Additionally or alternatively, the set of network improvement solutions records comprises information about one or more of the following solutions metrics associated with the deployed network performance improvement solutions: gain index, gain measures, time to deploy solution, lead time to deploy solution, cost to deploy solution, cost to maintain solution, total cost of solution, expected lifetime of solution, average median income, user demographics (e.g., age, income, crime statistics, occupation, education level, ethnicity, and so on), duration of gain to customers, change in customers after deploying solution, change in revenue after deploying solution, change in sales after deploying solution, traffic, number of users, Physical Resource Block (PRB) utilization, Channel Quality Indicator (CQI), throughput, carrier aggregation, advanced Quadrature Amplitude Modulation (QAM), duration of deploying the network performance improvement solution, lifetime of the network performance improvement solution, efficacy of the network performance improvement solution, location of the telecommunications network site, lease information of the telecommunications network site, duration of deployment of the network performance improvement solution, entitlements and permits required to deploy the network performance improvement solution, tower height, nearest available site, population served by the telecommunications network site, households served by the telecommunications network site, rent cost associated with the network performance improvement solution, backhaul availability, and so on. The term market is used to denote a geographic area, such as a portion (or all) of a city, town, state, country, other similar geographic construct (e.g., Pacific Northwest, Southeast, etc.), and so on. Each market can be associated with a group of locations (e.g., latitude/longitude pairs).
U.S. Pat. No. 10,555,191, the contents of which are incorporated herein in its entirety, describes methods and systems for computing gain metric values (gain measures) for network improvement solutions deployed at a location. In some implementations, the historical data module 210 collects capacity gain measure values for a set of key performance indicators (KPIs) for both before and after deployment of network improvement solutions at locations. Examples of KPIs include, but are not limited to traffic, number of users, PRB utilization, CQI, and throughput. For example, the historical data module 210 collects three years of capacity gain measure values for the selected KPIs as well as three years of each solution's lead time, cost for each market, and location.
Clustering Module
The clustering module 220 is configured and/or programmed to generate market clusters for each solution to categorize solutions based on one or more solutions metrics. In some implementations, the clustering module 220 selects, for a market, a set of sites to consider for performing the clustering analysis. For example, the clustering module 220 selects the sites whose locations fall within the geographic boundaries of the market (e.g., North Seattle, Midtown New York City, Florida, etc.). Additionally, or alternatively, the clustering module 220 can compute a score/priority for sites in the market using weights based on one or more of the following parameters: traffic, unique users, count of superphones (e.g., phone with certain characteristics such as release dates), revenue, throughput, duration of congestion, cost of lease/rent, median income, average household income, location of site, cost of hardware installed, age demographic distribution, and so on. The parameter values can be of different time granularities, such as weekly, monthly, quarterly, one time, and so on.
After identifying the set of sites to consider for the clustering analysis, the clustering module 220 generates, for each market, clusters of network improvement solutions records for the market. The clustering module can use techniques, such as k-means clustering, to generate the clusters. The clusters can be generated based on a group of locations associated with the market and/or values of one or more of the solution metrics discussed above. The clustering module 220 can select a subset of the solution metrics discussed above based on solution metrics selection criteria, such as user selection, output optimization criteria (e.g., expected gain, length of solution to deploy, best solution, desired location characteristics, and so on), correlation between solution metric and efficacy of solution/gain measures, top n KPIs, and so on.
Ranking Module
The ranking module 230 is configured and/or programmed to rank clusters and/or network performance improvement solutions in the generated clusters based on one or more of the following cluster ranking parameters: spectrum, duration, location, gain, cost to deploy solution, and so on.
Optimum Solution Selection and Ranking Module
The optimum solution selection and ranking module 240 is configured and/or programmed to select and recommend one (or more) network performance improvement solutions to deploy at particular locations/sites. Examples of network performance improvement solutions include, but are not limited to adding spectrum, removing spectrum, adding a proximate cell site, removing a proximate cell site, displacing a proximate cell site, adding or enhancing at least one technology capability, cell split, small cell deployment, sector addition, sector removal, sector capacity enhancement, cell on wheels addition, cell on wheel removal, tower addition, tower removal, hot spots addition, hot spots removal, capacity modification, and so on.
The optimum solution selection and ranking module 240 receives a candidate location at which a user desires to deploy network performance improvement solution(s). For example, the optimum capacity solution system 150 can receive a user selection of a location via a user interface (e.g., a user can enter a location name, latitude/longitude, click on a location on a map, etc.). Upon receiving a desired location details, the optimum solution selection and ranking module 240 identifies a prioritized set of network performance improvement solutions capable of being deployed at the received location. The optimum solution selection and ranking module 240 identifies the prioritized set of network performance improvement solutions based on values of a set of prioritization parameters and the generated clusters. The set of prioritization parameters comprises one or more of the following: gain index, gain measures, time to deploy solution, lead time to deploy solution, cost to deploy solution, cost to maintain solution, total cost of solution, expected lifetime of solution, average median income, user demographics (e.g., age, income, crime statistics, occupation, education level, ethnicity, and so on), duration of gain to customers, change in customers after deploying solution, change in revenue after deploying solution, change in sales after deploying solution, traffic, number of users, Physical Resource Block (PRB) utilization, Channel Quality Indicator (CQI), throughput, carrier aggregation, advanced Quadrature Amplitude Modulation (QAM), duration of deploying the network performance improvement solution, lifetime of the network performance improvement solution, efficacy of the network performance improvement solution, location of the telecommunications network site, lease information of the telecommunications network site, duration of deployment of the network performance improvement solution, entitlements and permits required to deploy the network performance improvement solution, tower height, nearest available site, population served by the telecommunications network site, households served by the telecommunications network site, rent cost associated with the network performance improvement solution, backhaul availability, and so on. Alternatively or additionally, the optimum solution selection and ranking module 240 receives one or more prioritization parameters as output metrics that are to be optimized at the desired location, such as expected gain, length of solution to deploy, best solution, and so on.
To identify the prioritized set of network performance improvement solutions, the optimum solution selection and ranking module 240 identifies one or more candidate markets such that a group of locations associated with the candidate market are closest to the candidate location in light of the received prioritization parameters. Closeness between the group of locations associated with a candidate market and the candidate location can be determined based on closeness metrics, such as geographic distance, similarity between location characteristics, and so on. For example, similarity between location characteristics can be determined based on location similarity factors, such as demographics of users associated with a location, location type (e.g., urban, suburban, rural, etc.), legal regulations associated with the location, location coverage area, points of interest at the location, and so on.
As an example, the optimum capacity solution system 150 receives a candidate location selection from a user (e.g., when a user enters a latitude/longitude of a location and/or selects a desired location on a map). Upon receiving the candidate location, the optimum solution selection and ranking module 240 identifies one or more clusters based on the following characteristics: nearest site with previous solution, gains measured, time to deploy solution, cost of solution, best solution, and other measured KPIs. Then, the optimum solution selection and ranking module 240 can predict based on the ranked solutions in the identified clusters (which are based on historical data), a prioritized set of network performance improvement solutions (e.g., comprising the top n solutions in an identified cluster) and their expected gain, time to deploy solution, and so on.
Additionally or alternatively, the optimum solution selection and ranking module 240 computes a rank value for each network performance improvement solution in the prioritized set of network performance improvement solutions based on the values of the set of prioritization parameters. The optimum solution selection and ranking module 240 can then select and/or implement, at the candidate location, an optimum network performance improvement solution from the prioritized set of network performance improvement solutions based on the computed rank values.
Flow Diagrams
At block 525, process 500 receives a candidate location to identify a prioritized set of network performance improvement solutions capable of being deployed at the candidate location. At block 530, process 500 receives a set of prioritization parameters. Using the candidate location and the set of prioritization parameters, at block 535, process 500 identifies a prioritized set of network performance improvement solutions capable of being deployed at the candidate location. At block 540, process 500 computes a rank value for each network performance improvement solution in the prioritized set of network performance improvement solutions based on, for example, the values of the set of prioritization parameters. Finally, at block 545, process 500 selects and/or implements, at the candidate location, an optimum network performance improvement solution selected from the prioritized set of network performance improvement solutions based on the computed rank values.
Conclusion
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” As used herein, the terms “connected,” “coupled,” or any variant thereof, means any connection or coupling, either direct or indirect, between two or more elements; the coupling of connection between the elements can be physical, logical, or a combination thereof. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number can also include the plural or singular number respectively. The word “or,” in reference to a list of two or more items, covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
The above detailed description of implementations of the system is not intended to be exhaustive or to limit the system to the precise form disclosed above. While specific implementations of, and examples for, the system are described above for illustrative purposes, various equivalent modifications are possible within the scope of the system, as those skilled in the relevant art will recognize. For example, some network elements are described herein as performing certain functions. Those functions could be performed by other elements in the same or differing networks, which could reduce the number of network elements. Alternatively, or additionally, network elements performing those functions could be replaced by two or more elements to perform portions of those functions. In addition, while processes, message/data flows, or blocks are presented in a given order, alternative implementations can perform routines having blocks, or employ systems having blocks, in a different order, and some processes or blocks can be deleted, moved, added, subdivided, combined, and/or modified to provide alternative or subcombinations. Each of these processes, message/data flows, or blocks can be implemented in a variety of different ways. Also, while processes or blocks are at times shown as being performed in series, these processes or blocks can instead be performed in parallel, or can be performed at different times. Further, any specific numbers noted herein are only examples: alternative implementations can employ differing values or ranges.
The teachings of the methods and system provided herein can be applied to other systems, not necessarily the system described above. The elements, blocks and acts of the various implementations described above can be combined to provide further implementations.
Any patents and applications and other references noted above, including any that can be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the technology can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further implementations of the technology.
These and other changes can be made to the invention in light of the above Detailed Description. While the above description describes certain implementations of the technology, and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the system can vary considerably in its implementation details, while still being encompassed by the technology disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the technology should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the technology with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific implementations disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed implementations, but also all equivalent ways of practicing or implementing the invention under the claims.
While certain aspects of the technology are presented below in certain claim forms, the inventors contemplate the various aspects of the technology in any number of claim forms. For example, while only one aspect of the invention is recited as implemented in a computer-readable medium, other aspects can likewise be implemented in a computer-readable medium. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the technology.
Number | Name | Date | Kind |
---|---|---|---|
6262980 | Leung et al. | Jul 2001 | B1 |
6526010 | Morioka et al. | Feb 2003 | B1 |
6891694 | Hetzler et al. | May 2005 | B2 |
6973312 | Ngan et al. | Dec 2005 | B1 |
7038993 | Minamino et al. | May 2006 | B2 |
7142874 | Oleniczak | Nov 2006 | B1 |
7343375 | Dulac | Mar 2008 | B1 |
7539111 | Ishida et al. | May 2009 | B2 |
7539919 | Hwang et al. | May 2009 | B2 |
7680495 | Abed et al. | Mar 2010 | B2 |
7710841 | Hwang et al. | May 2010 | B2 |
7739578 | Hwang et al. | Jun 2010 | B2 |
7813952 | Eskandari | Oct 2010 | B2 |
7823042 | Hwang et al. | Oct 2010 | B2 |
7849027 | Koran et al. | Dec 2010 | B2 |
7898921 | Ishida et al. | Mar 2011 | B2 |
7929459 | Silva et al. | Apr 2011 | B2 |
7941148 | Roskowski et al. | May 2011 | B2 |
7945837 | Hwang et al. | May 2011 | B2 |
7957993 | Macgregor | Jun 2011 | B2 |
7966233 | Khowash et al. | Jun 2011 | B1 |
7987122 | Bevente et al. | Jul 2011 | B2 |
8060079 | Goyal et al. | Nov 2011 | B1 |
8060602 | Singh et al. | Nov 2011 | B2 |
8073119 | Bevente et al. | Dec 2011 | B2 |
8199901 | Rani et al. | Jun 2012 | B2 |
8270979 | Vargantwar | Sep 2012 | B1 |
8332256 | Dey et al. | Dec 2012 | B2 |
8429270 | Singh et al. | Apr 2013 | B2 |
8522108 | Hwang et al. | Aug 2013 | B2 |
8526320 | Puthenpura et al. | Sep 2013 | B2 |
8538379 | Jessen et al. | Sep 2013 | B1 |
8572464 | Hwang et al. | Oct 2013 | B2 |
8665835 | Hussein et al. | Mar 2014 | B2 |
8676799 | Vaver | Mar 2014 | B1 |
8694018 | Budic et al. | Apr 2014 | B2 |
8782045 | Vaver | Jul 2014 | B1 |
8782216 | Raghavendran et al. | Jul 2014 | B2 |
8861691 | De et al. | Oct 2014 | B1 |
8891746 | Stachiw et al. | Nov 2014 | B2 |
8914372 | Cao et al. | Dec 2014 | B2 |
8918108 | Arad et al. | Dec 2014 | B2 |
8918397 | Cao et al. | Dec 2014 | B2 |
8954791 | Kataria et al. | Feb 2015 | B2 |
8966055 | Mittal et al. | Feb 2015 | B2 |
9031561 | Nuss et al. | May 2015 | B2 |
9047226 | Thomas et al. | Jun 2015 | B2 |
9113365 | Tang et al. | Aug 2015 | B2 |
9154550 | Abgrall et al. | Oct 2015 | B1 |
9204319 | Ouyang et al. | Dec 2015 | B2 |
9226178 | Tarraf et al. | Dec 2015 | B2 |
9253334 | Rai et al. | Feb 2016 | B1 |
9264932 | Chen et al. | Feb 2016 | B2 |
9332458 | Nuss | May 2016 | B2 |
9411653 | Trammel et al. | Aug 2016 | B2 |
9413890 | Mccormack et al. | Aug 2016 | B2 |
9424121 | Kushnir et al. | Aug 2016 | B2 |
9430944 | Grimm et al. | Aug 2016 | B2 |
9437081 | Hoffman | Sep 2016 | B2 |
9439081 | Knebl et al. | Sep 2016 | B1 |
9456362 | Flanagan | Sep 2016 | B2 |
9479981 | Dimou et al. | Oct 2016 | B2 |
9491285 | Vaderna et al. | Nov 2016 | B2 |
9503919 | Sofuoglu et al. | Nov 2016 | B2 |
9563491 | Scouller et al. | Feb 2017 | B2 |
9628363 | Singh et al. | Apr 2017 | B2 |
9674374 | Bolton et al. | Jun 2017 | B1 |
9706438 | Kadmon et al. | Jul 2017 | B1 |
9712295 | Park et al. | Jul 2017 | B2 |
9753477 | Berka et al. | Sep 2017 | B2 |
9826412 | Henderson et al. | Nov 2017 | B2 |
9826420 | Tarraf et al. | Nov 2017 | B2 |
9867080 | Sung et al. | Jan 2018 | B2 |
9892026 | Isman et al. | Feb 2018 | B2 |
9894215 | Bolton et al. | Feb 2018 | B1 |
9924045 | Guha et al. | Mar 2018 | B1 |
10039013 | Periyasamy et al. | Jul 2018 | B2 |
10044878 | Guha et al. | Aug 2018 | B2 |
10050844 | Flanagan et al. | Aug 2018 | B2 |
10079735 | Martone et al. | Sep 2018 | B2 |
10091679 | Munar et al. | Oct 2018 | B1 |
10159111 | De Pasquale | Dec 2018 | B2 |
10231147 | Sung et al. | Mar 2019 | B2 |
10555191 | Jat et al. | Feb 2020 | B1 |
11064382 | Jat | Jul 2021 | B1 |
20030171976 | Farnes et al. | Sep 2003 | A1 |
20060064346 | Steenstra et al. | Mar 2006 | A1 |
20060167777 | Shkedy | Jul 2006 | A1 |
20070156673 | Maga et al. | Jul 2007 | A1 |
20100041408 | Caire et al. | Feb 2010 | A1 |
20120190380 | Dupray et al. | Jul 2012 | A1 |
20120244869 | Song | Sep 2012 | A1 |
20120244898 | Guey et al. | Sep 2012 | A1 |
20130095872 | Sediq et al. | Apr 2013 | A1 |
20130229914 | Suerbaum | Sep 2013 | A1 |
20130331109 | Dhillon | Dec 2013 | A1 |
20140278035 | Nortrup | Sep 2014 | A1 |
20160125456 | Wu et al. | May 2016 | A1 |
20160381580 | Kwan | Dec 2016 | A1 |
20170243484 | Li et al. | Aug 2017 | A1 |
20170272319 | Sheen et al. | Sep 2017 | A1 |
20180006957 | Ouyang et al. | Jan 2018 | A1 |
20180184307 | Periyasamy | Jun 2018 | A1 |
20190141580 | Oktay et al. | May 2019 | A1 |
20190159048 | Feldkamp | May 2019 | A1 |
20190208438 | Yang et al. | Jul 2019 | A1 |
20190239238 | Calabrese | Aug 2019 | A1 |
20200076520 | Jana et al. | Mar 2020 | A1 |
20200314683 | Imran et al. | Oct 2020 | A1 |
20200322814 | Tofighbakhsh | Oct 2020 | A1 |
20210014698 | Meier-Hellstern | Jan 2021 | A1 |
20210037394 | Wainer | Feb 2021 | A1 |
20210037399 | Jat et al. | Feb 2021 | A1 |
20210049656 | Jat et al. | Feb 2021 | A1 |
Number | Date | Country |
---|---|---|
20120089467 | Aug 2012 | KR |
20150021561 | Mar 2015 | KR |
20170076700 | Jul 2017 | KR |
Entry |
---|
Ahas, R. et al. “Mobile Positioning in Space-Time Behaviour Studies: Social Positioning Method Experiments in Estonia” Cartography and Geographic Information Science vol. 34, No. 4, 2007, p. 259-273. |
Bi, Suzhi et al. “Engineering Radio Maps for Wireless Resource Management” IEEE Wireless Communications, Apr. 2019, p. 133-141. |
De Reuver, M. et al. “Designing viable business models for context-aware mobile services” Elsevier Telematics and Informatics 26 (2009) p. 240-248. |
Lee, Seung-Cheol et al. “Efficient Mining of User Behaviors by Temporal Mobile Access Patterns” International Journal Computer Science and Network Security, vol. 7, No. 2, Feb. 2007, p. 285-291. |
Ratti, C. et al. “Mobile Landscapes: using location data from cell phones for urban analysis” Environment and Planning B: Planning and Design 2006, vol. 33, p. 727-748. |
Roth, John D. et al. “Efficient System Geolocation Architecture in Next-Generation Cellular Networks” IEEE Systems Journal, vol. 12, No. 4, Dec. 2018, p. 3414-3425. |
Tseng, V. S. et al. “Mining Temporal Mobile Sequential Patterns in Location-Based Service Environments” IEEE International Conference 2007, 8 pages. |
European Patent Office, Extended European Search Report, EP Patent Application 21172462, dated Sep. 23, 2021, 13 pages. |
Kuruvatti, Nandish P. et al. “Monitoring Vehicular User Mobility to Predict Traffic Status and Manage Radio Resources,” 2017 IEEE 85th Vehicular Technology Conference (VTC Spring), IEEE, Jun. 4, 2017, 6 pages. |
Shabir, Balawal et al. “Congestion Avoidance in Vehicular Networks: A Contemporary Survey,” IEEE Access vol. 7, Nov. 27, 2019, 20 pages. |
Number | Date | Country | |
---|---|---|---|
20210337400 A1 | Oct 2021 | US |