IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v2y2011i2p1-19.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

  • Gordon J. Clapworthy

    (University of Bedfordshire, UK)

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.

Suggested Citation

  • Zhihua Lai & Nik Bessis & Guillaume De La Roche & Pierre Kuonen & Jie Zhang & Gordon J. Clapworthy, 2011. "The Development of a Parallel Ray Launching Algorithm for Wireless Network Planning," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 2(2), pages 1-19, April.
    • Handle: RePEc:igg:jdst00:v:2:y:2011:i:2:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2011040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:2:y:2011:i:2:p:1-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.