Name
Abstract | ||
|---|---|---|
Wireless LANs are becoming increasingly common in both home and office networks. Additionally, wireless Internet service providers have begun installing public WLANs in airports, hotels, and other frequently trafficked areas. This article analyzes deployment strategies for such networks, specifically for possible future systems utilizing bands of up to 60 GHz. A major part of the installation cost stems from network planning, wiring, and manpower for setting up base stations. It is therefore crucial to find ways to simplify the network installation and reduce the deployment costs, while at the same time maintaining the desired system performance. We show that even simple installation rules can often achieve adequate coverage results. However, proper network planning is in some situations necessary to achieve adequate coverage. Therefore, we examine different combinatorial optimization methods for obtaining close to optimal positioning of WLAN access points and compare the performance of the proposed algorithms to the simple installation methods. The optimization algorithms used in this article evaluate an objective function that aims to maximize both the coverage area and the overall signal quality over a discrete search space. Random search algorithms can yield very good solutions, but often exhibit difficult convergence properties. Successive removal algorithms, such as pruning, converge in polynomial time, but usually produce suboptimal solutions. We therefore propose a combination of the two approaches, using pruning to obtain an initial set of the base station positions and refining these by using neighborhood search or simulated annealing. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/MWC.2003.1265855 | Wireless Communications, IEEE |
Keywords | Field | DocType |
neighborhood search,adequate coverage result,installation cost,network planning,adequate coverage,network installation,picocellular wireless infrastructure,discrete search space,simple installation rule,simple installation method,coverage area,combinatorial optimization,search space,simulated annealing,system performance,random search,polynomial time,convergence,polynomials,base station,objective function,internet,telecommunication services | Simulated annealing,Base station,Random search,Wireless,Software deployment,Network planning and design,Computer science,Computer network,Combinatorial optimization,Cost reduction,Distributed computing | Journal |
Volume | Issue | ISSN |
10 | 6 | 1536-1284 |
Citations | PageRank | References |
29 | 3.08 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Unbehaun | 1 | 63 | 8.13 |
| Kamenetsky, M. | 2 | 29 | 3.08 |