A New Strategy for Indoor Propagation Fast Computation with MR-FDPF Algorithm

Guillaume De La Roche 1 Raphael Rebeyrortte Katia Jaffrès-Runser 1 Jean-Marie Gorce 1, *
* Auteur correspondant
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : The multi-resolution frequency domain ParFlow (MR FDPF) algorithm has been developed since 2001 for the purpose of Indoor wave propagation simulation. This algo rithm derives from a TLM like formalism, and implements a multi-resolution (MR) approach to compute efficiently full coverage of several access points (AP). This approach is well-designed for a wireless LAN planning because the computation load required to process an AP candidate is fast. The heart of the proposed approach holds in the MR nodes that are obtained by gathering recursively pixels into bricks. This requires a MR binary tree structure which should be adapted to the environment. In this paper, dif ferent strategies are evaluated to compute this binary tree. Computation load and memory consumption are evaluated on a real example. It is shown that an appropriate choice of the binary tree may decrease significantly the computation load associated with the method.
Type de document :
Communication dans un congrès
Acta Press. Antennas, Radar and Wave Propagation, Jul 2005, Banff, Canada. 2005
Liste complète des métadonnées

https://hal.inria.fr/inria-00405192
Contributeur : Jean-Marie Gorce <>
Soumis le : dimanche 19 juillet 2009 - 22:16:22
Dernière modification le : mercredi 11 avril 2018 - 01:51:51

Identifiants

  • HAL Id : inria-00405192, version 1

Collections

Citation

Guillaume De La Roche, Raphael Rebeyrortte, Katia Jaffrès-Runser, Jean-Marie Gorce. A New Strategy for Indoor Propagation Fast Computation with MR-FDPF Algorithm. Acta Press. Antennas, Radar and Wave Propagation, Jul 2005, Banff, Canada. 2005. 〈inria-00405192〉

Partager

Métriques

Consultations de la notice

138