Abstract: Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device.

Abstract: Concepts and technologies disclosed herein are directed to the optimization of over-the-air (“OTA”) file distribution for connected cars based upon a heuristic scheduling algorithm. A schedule provided by the heuristic scheduling algorithm is designed to distribute OTA data flow to connected cars over the network (geographically) and over a scheduling time horizon (timely), and is capable to reducing the negative impact of OTA file updates on overall wireless network performance. This schedule is created based upon historical statistics associated with connected car driving patterns and simulations of connected car-specific OTA traffic over the network. By leveraging connected cars that connect to different cells at different times based upon driving patterns, the heuristic scheduling algorithm is effective in reducing OTA impact on the network.

Abstract: Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device.

Abstract: Dynamic metro cell location planning is provided within the wireless communication coverage area of a macro cell. Metro cell location planning can include obtaining performance parameters associated with the macro cell and evaluating coverage parameters of the macro cell. Metro cell location planning can also include selecting, based on the performance parameters and the coverage parameters, a location within a wireless communication coverage area of the macro cell for placement of the metro cell. The selected location can be conveyed to a user and/or entity for deployment of the metro cells. Metro cells can be used by a carrier to fill a coverage hole and/or to offload capacity hot-spots within the network.

Abstract: A network device that determines RACH root sequences for AP devices within a given market. The network device can utilize a specialized graph coloring process or algorithm that has been adapted to, e.g., ensure that no two neighboring AP devices share the same RACH root sequences, provided certain additional constraints not found in graph coloring theory are met. For example, AP devices can have multiple RACH root sequence, whereas in traditional graph coloring problems, each vertex typically has only one color.

Abstract: Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device.

Abstract: Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device.

Abstract: A method and apparatus for providing planning of a plurality of base station controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one base station controller parameter in accordance with the input data. The method determines if the limit for the at least one base station controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one base station controller parameter is exceeded.

Abstract: A method and apparatus for providing planning of a plurality of base station controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one base station controller parameter in accordance with the input data. The method determines if the limit for the at least one base station controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one base station controller parameter is exceeded.

Abstract: A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range.

Abstract: A method, computer-readable storage device and an apparatus for planning tracking areas in a wireless network are disclosed. For example, the method represents geographical neighbor relations between each pair of base stations in a first set, and represents in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in a second set, represents the historical data on paging traffic among the base stations in the first set via a first parameter, and represents the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter, and determines for each base station in the first set, the optimal assignment of a tracking area in the second set.

Abstract: A method, computer-readable storage device and an apparatus for planning tracking areas in a wireless network are disclosed. For example, the method represents geographical neighbor relations between each pair of base stations in a first set, and represents in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in a second set, represents the historical data on paging traffic among the base stations in the first set via a first parameter, and represents the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter, and determines for each base station in the first set, the optimal assignment of a tracking area in the second set.

Abstract: Techniques for locating a mobile device using a time distance of arrival (TDOA) method with disturbance scrutiny are provided. In an aspect, for respective combinations of three base station devices of a number of base station devices greater than or equal to three, intersections in hyperbolic curves, generated using a closed form function with input values based on differences of distances from the device to pairs of base station devices of the respective combinations of three base station devices, are determined. The intersection points are then tested for robustness against measurement errors associated with the input values and a subset of the intersection points that are associated with a degree of resistance to the measurement errors are selected to estimate a location of the device.

Abstract: The disclosure provides a method and corresponding system for personalizing and disbursing content material in an automated fashion based on differing characteristics or profiles of the recipients. The system includes a database of potential recipients with key characteristics such as location data, revenue, product ownership, customer status, tenure with the company/organization, payment status, credit rating, whether they have recently responded to other material, and the like. Dissemination media include email communications, collaterals, brochures, textual materials, image and video information, and any similar media, where the contents of the communication material is customized based on the key characteristics profiles of the recipients and driven by a set of business rules that can be adapted to fit various scenarios.

Abstract: A method and apparatus for providing a topology for interconnection of telecommunication nodes in a communication network are disclosed. For example, the method obtains input data, and determines values of: at least one set, at least one parameter, and at least one variable associated with the communication network in accordance with the input data. The method then determines the topology for the interconnection via microwave links of the telecommunication nodes from an objective function in accordance with the at least one set, at least one parameter, and at least one variable, wherein the objective function is based on a plurality of penalty factors.

Abstract: Scrambling code conflicts can be mitigated by primary scrambling code reuse that minimizing a potential interference Primary scrambling codes are applied to a first set of cells located in a portion of the network being considered. A second set of cells are evaluated for primary scrambling code reuse based on a distance parameter and/or a coverage area. If the distance parameter is greater than a defined distance, primary scrambling code reuse can be applied. If all distance parameters evaluated are less than the distance parameter, a length of the distance parameter is reduced and the distance between cells is reevaluated.

Abstract: A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range.

Abstract: A method and apparatus for providing planning of a plurality of serving general packet radio service support nodes in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one serving general packet radio service support node parameter in accordance with the input data. The method determines if the limit for the at least one serving general packet radio service support node parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one serving general packet radio service support node parameter is exceeded.

Abstract: A method and apparatus for providing planning of a plurality of mobile switching centers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one mobile switching center parameter in accordance with the input data. The method determines if the limit for the at least one mobile switching center parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one mobile switching center parameter is exceeded.

Abstract: A location of user equipment (UE) in a wireless network is determined. Geometric calculations are leveraged for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined. The target UE time value can be searched for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network and timing in the network is correctable based on the data.