IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

The Development of a Parallel Ray Launching Algorithm for Wireless Network Planning

The Development of a Parallel Ray Launching Algorithm for Wireless Network Planning
View Sample PDF
Author(s): Zhihua Lai (University of Bedfordshire, UK), Nik Bessis (University of Bedfordshire, UK), Guillaume De La Roche (University of Applied Science of Western Switzerland, Switzerland), Pierre Kuonen (University of Applied Science of Western Switzerland, Switzerland), Jie Zhang (University of Bedfordshire, UK)and Gordon J. Clapworthy (University of Bedfordshire, UK)
Copyright: 2011
Volume: 2
Issue: 2
Pages: 19
Source title: International Journal of Distributed Systems and Technologies (IJDST)
Editor(s)-in-Chief: Nik Bessis (Edge Hill University, UK)
DOI: 10.4018/jdst.2011040101

Purchase

View The Development of a Parallel Ray Launching Algorithm for Wireless Network Planning on the publisher's website for pricing and purchasing information.

Abstract

Propagation modeling has attracted much interest because it plays an important role in wireless network planning and optimization. Deterministic approaches such as ray tracing and ray launching have been investigated, however, due to the running time constraint, these approaches are still not widely used. In previous work, an intelligent ray launching algorithm, namely IRLA, has been proposed. The IRLA has proven to be a fast and accurate algorithm and adapts to wireless network planning well. This article focuses on the development of a parallel ray launching algorithm based on the IRLA. Simulations are implemented, and evaluated performance shows that the parallelization greatly shortens the running time. The COST231 Munich scenario is adopted to verify algorithm behavior in real world environments, and observed results show a 5 times increased speedup upon a 16-processor cluster. In addition, the parallelization algorithm can be easily extended to larger scenarios with sufficient physical resources.

Related Content

Honglong Xu, Zhonghao Liang, Kaide Huang, Guoshun Huang, Yan He. © 2024. 17 pages.
Sherin Eliyas, P. Ranjana. © 2024. 10 pages.
Shuang Li, Xiaoguo Yao. © 2024. 16 pages.
Jialan Sun. © 2024. 21 pages.
Mei Gong, Bingli Mo. © 2024. 15 pages.
Qian He, Ke Wang. © 2024. 19 pages.
Sunil Kumar, Rashmi Mishra, Tanvi Jain, Achyut Shankar. © 2024. 12 pages.
Body Bottom