## 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 ϵ T as received from A. Several facility location algorithms, which involve locating large scale wireless networks (WiMAX), use approximated radio maps algorithms. 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 experiments performed to compare between the suggested new algorithm, and other well-known methods. The main conclusion is that the new algorithm (RLA) is significantly better than the others, i.e. its running time is 3-5 times faster for the same approximation accuracy.

Original language | English |
---|---|

Pages | 72-75 |

Number of pages | 4 |

State | Published - 1 Jan 2005 |

Event | 17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada Duration: 10 Aug 2005 → 12 Aug 2005 |

### Conference

Conference | 17th Canadian Conference on Computational Geometry, CCCG 2005 |
---|---|

Country/Territory | Canada |

City | Windsor |

Period | 10/08/05 → 12/08/05 |

## ASJC Scopus subject areas

- Geometry and Topology
- Computational Mathematics