Method for optimizing cell-site placement
First Claim
1. A computer-implemented method for generating an optimized cellular-network cell-site plan for an area, the method comprising the steps of:
- providing a plurality of cellular-traffic demand nodes distributed across the area, each cellular-traffic demand node of the plurality of cellular-traffic demand nodes having an associated weighting characteristics set;
consolidating the plurality of nodes into a plurality of centroids such that each centroid represents a number of nodes that come within a traffic threshold;
positioning a potential cell site on each of the centroids, the potential cell site having an associated base-transmitter-station parameter characteristics set;
determining the demand node coverage of each potential cell site with respect to a signal strength of the potential cell site; and
selecting from the plurality of potential cell sites a minimized cell-site subset while maintaining sufficient cellular service coverage of the plurality of demand nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
Provided herein is a computer-implemented method for generating an optimized cellular-network cell-site plan for an area. A plurality of cellular-traffic demand nodes distributed across the area is provided. Each cellular-traffic demand node of the plurality of cellular-traffic demand nodes has an associated weighting characteristics set. The plurality of nodes are consolidated into a plurality of centroids. Each centroid represents a number of nodes that come within a traffic threshold. A potential cell site is positioned on each of the centroids. Each potential cell site has an associated base-transmitter-station parameter characteristics set. The demand node coverage of each potential cell site is determined with respect to a signal strength of the potential cell site. From the plurality of potential cell sites a minimized cell-site subset is selected while maintaining sufficient cellular service coverage of the plurality of demand nodes.
-
Citations
26 Claims
-
1. A computer-implemented method for generating an optimized cellular-network cell-site plan for an area, the method comprising the steps of:
-
providing a plurality of cellular-traffic demand nodes distributed across the area, each cellular-traffic demand node of the plurality of cellular-traffic demand nodes having an associated weighting characteristics set; consolidating the plurality of nodes into a plurality of centroids such that each centroid represents a number of nodes that come within a traffic threshold; positioning a potential cell site on each of the centroids, the potential cell site having an associated base-transmitter-station parameter characteristics set; determining the demand node coverage of each potential cell site with respect to a signal strength of the potential cell site; and selecting from the plurality of potential cell sites a minimized cell-site subset while maintaining sufficient cellular service coverage of the plurality of demand nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer-implemented method for generating an optimized cellular-network plan from a pre-existing cellular network having a plurality of pre-existing cell sites, the met hod comprising the steps of:
-
providing a plurality of cellular-traffic demand nodes distributed across the area, each cellular-traffic demand node of the plurality of cellular-traffic demand nodes having an associated weighting characteristics set, comprising information relating to either or both infrastructure costs and financial return; positioning a potential cell site on each of the pre-existing cell sites, each of the potential cell sites having an associated base-transmitter-station parameter characteristics set; determining the demand node coverage of each potential cell site with respect to a signal strength characteristic of the potential cell site; and selecting from the plurality of potential cell sites a minimized cell-site subset with relation to at least the demand node coverage while maintaining sufficient cellular service coverage of the plurality of demand nodes. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A computer-implemented method for accounting for interference in a non-deployed cellular network having a plurality of potential cell sites, the method comprising the steps of:
determining the interference from a first mobile user distant from an edge of a current cell according to the algorithm;
##EQU43## where;
##EQU44## determining the interference from the first mobile user adjacent to the edge of the current cell according to the algorithm;
##EQU45## where;
##EQU46## and determining the interference from at least the first and a second a mobile belonging to the current cell according to the algorithm;
##EQU47## where;
c is the average number of users that belong to the current cell, Iext is the interference caused from mobiles outside the current cell,NO is the white noise spectral height, W is the bandwidth of the signal, Rb is the data rate (in bps), ρ
v is the voice activity factor, and ##EQU48## where, m.sub.ε
and (σ
.sub.ε
)2 are the mean and variance of the required Eb /IO.
-
24. A computer-implemented method for optimizing coverage of a plurality of demand nodes by a cellular network having a set of potential cell sites, the method comprising the steps of
applying to the set of potential cell sites a linear program relaxation algorithm where the Linear Program objective function is: - ##EQU49## where cJ is the cost of set J, xJ is "1" if set J is selected in the solution, otherwise xJ is "0" if not selected,
pi is the penalty cost for not covering demand node i, em is an m-vector of all 1'"'"'s, aij is matrix element defined to be 1, 1/2, or 1/3 depending on whether the demand node i is covered by set J directly, through 2-way soft hand-off, or three-way soft hand-off, accordingly. aij is "0" if the demand node i is not covered by the set J, n is the number of demand nodes, and m is the number of sets in the set covering problem; the linear program objective function having the constraints;
##EQU50## where Ik is the collection of sets generated for the potential cell site k, andapplying a greedy algorithm with respect to a demand node weighting ratio and a stopping criteria. - View Dependent Claims (25, 26)
- ##EQU49## where cJ is the cost of set J, xJ is "1" if set J is selected in the solution, otherwise xJ is "0" if not selected,
Specification