Approximating Radio Maps. Conference Paper uri icon

abstract

  • Given a terrain T and an antenna A located on it, we would like to approximate the radio map of A over T, namely, to associate the signal strength of each point p 2 T as received from A. Several facility location algorithms, which involve locating large scale wireless networks (WiMAX), use approximated radio maps al- gorithms. In fact, computing radio maps is often the runtime bottle-neck of such facility location algorithms. This article suggests a new radar-like algorithm (RLA) for approximating radio maps. We also report on ex- periments performed to compare between the suggested new algorithm, and other well-known methods. The main conclusion is that the new algorithm (RLA) is sig- nificantly better than the others, i.e. its running time is 3-5 times faster for the same approximation accuracy. viewpoint, while the signal strength at a point p (sent from an antenna A) is a real value that is base on the visibility, distance, and terrain between p and A. Com- puting radio maps is often the runtime bottle-neck of wireless facility location algorithms as a result of its high computational complexity. For that reason, it is desirable to develop fast approximation algorithms. In this paper we present a new approach to approx- imate radio maps which is based on a radar-like radial sweep-line algorithm centered at the antenna position. Our experimental results show that the new radar-like approach is significantly faster than existing methods. In the rest of this paper, we first overview the basis of RF (diraction) models for predicting a signal strength

publication date

  • January 1, 2005

presented at event