Parallel algorithms for wireless LAN planning

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nowadays wireless services are a part of the everyday life of billions of people around the world. To decrease not only their design and maintenance costs but also to enhance user comfort there is a high demand for specialized software that helps during theirs designing. Unfortunately commonly available and used software is demanding in terms of computing power in order for receiving the results in the reasonable time. The aim of the presented research is verification whether using GPU it is possible accelerate computation in reasonable way. The paper presents a study of possible parallelization of algorithms used for signal power simulation as well as algorithms that optimize placement of routers. The main goal of the paper is to show the impact of GPU usage on different stages of wireless network planning process. The first received results are very promising, the speedup received is even up to 46 for simulation algorithm and up to 15 for optimization algorithms.

Cite

CITATION STYLE

APA

Gnatowski, A., & Kwiatkowski, J. (2016). Parallel algorithms for wireless LAN planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9573, pp. 399–410). Springer Verlag. https://doi.org/10.1007/978-3-319-32149-3_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free