16.11.2012 Views

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

134 Jeff Kennington, Jason Kratz, <strong>and</strong> Gheorghe Spiride<br />

Minimize ∑ Wi jIi j<br />

(i, j)∈E<br />

The third version is identical to the second with all weights set to 1. The third model<br />

is the well-known graph coloring problem <strong>and</strong> the second is the weighted graph coloring<br />

problem. They present two distributed algorithms for problem solution. Their<br />

simulation experiments indicate that the use of overlapping channels can yield improvements<br />

over the restricted use of only 3 non-overlapping channels. Some of<br />

the simulation results indicated improvements of up to 30%. It should be noted<br />

that channel assignment is not required for some design problems. Some AP vendors<br />

(see [15]) design their equipment so that it can choose the best frequency for<br />

communication. Each AP listens for traffic on the various frequencies <strong>and</strong> selects a<br />

frequency that results in the best reception.<br />

6.2.4 Access Point Placement<br />

Sherali et al. [18] developed a set of nonlinear optimization models to determine<br />

optimal access point location. Mobile devices are placed at grid points <strong>and</strong> st<strong>and</strong>ard<br />

models are used to determine gi(x,y,z), the path loss at grid point i associated<br />

with a access point at (x,y,z). One objective function is to minimize the sum of<br />

all weighted path losses. A penalty term may be defined for mobiles at grid points<br />

where communication is not possible. A second objective function is to minimize<br />

the maximum path loss plus the aforementioned penalty. The third model is a combination<br />

of the first two. The authors evaluate three nonlinear techniques for solution<br />

(Hooke <strong>and</strong> Jeeves, a quasi-Newton method, <strong>and</strong> a conjugate gradient method) <strong>and</strong><br />

report solving several small problems successfully.<br />

Adickes et al. [1] use a genetic algorithm based on a circle covering heuristic to<br />

solve the transceiver placement problem. Three objective functions are developed<br />

<strong>and</strong> a Pareto ranking is used to evaluate solutions. The first objective is the fraction<br />

of covered grid points. The second uses the Shannon-Hartley law (http://www.factindex.com/s/sh/shannon<br />

hartley law.html) to estimate capacity, while the third model<br />

involves average signal strength over the set of grid points. Using a population size<br />

of 30, the authors develop the Genetic Algorithm Optimizer (GAO) software tool<br />

for problem solution.<br />

6.2.5 Proprietary <strong>Design</strong> Tools<br />

The problem of determining the location, number, <strong>and</strong> power of a set of access<br />

points that will provide coverage for a given building at minimum cost was investigated<br />

by Fortune et al. in [3]. They developed the <strong>Wireless</strong> System Engineering<br />

(WISE) software tool to assist design personnel with this problem. WISE is de-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!