Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems

Simple item page
dc.contributor.authorHe, Jianen
dc.contributor.committeechairWatson, Layne T.en
dc.contributor.committeememberSantos, Eunice E.en
dc.contributor.committeememberRibbens, Calvin J.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2014-03-14T20:44:22Zen
dc.date.adate2002-08-30en
dc.date.available2014-03-14T20:44:22Zen
dc.date.issued2002-08-22en
dc.date.rdate2003-08-30en
dc.date.sdate2002-08-28en
dc.description.abstractThe DIRECT (DIviding RECTangles) algorithm JONESJOTi, a variant of Lipschitzian methods for bound constrained global optimization, has been applied to the optimal transmitter placement for indoor wireless systems. Power coverage and BER (bit error rate) are considered as two criteria for optimizing locations of a specified number of transmitters across the feasible region of the design space. The performance of a DIRECT implementation in such applications depends on the characteristics of the objective function, the problem dimension, and the desired solution accuracy. Implementations with static data structures often fail in practice because of unpredictable memory requirements. This is especially critical in S⁴W (Site-Specific System Simulator for Wireless communication systems), where the DIRECT optimization is just one small component connected to a parallel 3D propagation ray tracing modeler running on a 200-node Beowulf cluster of Linux workstations, and surrogate functions for a WCDMA (wideband code division multiple access) simulator are also used to estimate the channel performance. Any component failure of this large computation would abort the entire design process. To make the DIRECT global optimization algorithm efficient and robust, a set of dynamic data structures is proposed here to balance the memory requirements with execution time, while simultaneously adapting to arbitrary problem size. The focus is on design issues of the dynamic data structures, related memory management strategies, and application issues of the DIRECT algorithm to the transmitter placement optimization for wireless communication systems. Results for two indoor systems are presented to demonstrate the effectiveness of the present work.en
dc.description.degreeMaster of Scienceen
dc.identifier.otheretd-08282002-141114en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-08282002-141114/en
dc.identifier.urihttp://hdl.handle.net/10919/34817en
dc.publisherVirginia Techen
dc.relation.haspartJHthesis.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectbit error rateen
dc.subjectdirect searchen
dc.subjectDIRECT algorithmen
dc.subjectglobal optimizationen
dc.subjecttransmitter placementen
dc.subjectdynamic data structuresen
dc.subjectpower coverageen
dc.titleGlobal Optimization of Transmitter Placement for Indoor Wireless Communication Systemsen
dc.typeThesisen
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
JHthesis.pdf
Size:
600.92 KB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses