Wireless coverage prediction via parametric shortest paths

05/16/2018
by   David Applegate, et al.
0

When deciding where to place access points in a wireless network, it is useful to model the signal propagation loss between a proposed antenna location and the areas it may cover. The indoor dominant path (IDP) model, introduced by Wölfle et al., is shown in the literature to have good validation and generalization error, is faster to compute than competing methods, and is used in commercial software such as WinProp, iBwave Design, and CellTrace. Previously, the algorithms known for computing it involved a worst-case exponential-time tree search, with pruning heuristics to speed it up. We prove that the IDP model can be reduced to a parametric shortest path computation on a graph derived from the walls in the floorplan. It therefore admits a quasipolynomial-time (i.e., n^O( n)) algorithm. We also give a practical approximation algorithm based on running a small constant number of shortest path computations. Its provable worst-case additive error (in dB) can be made arbitrarily small via appropriate choices of parameters, and is well below 1dB for reasonable choices. We evaluate our approximation algorithm empirically against the exact IDP model, and show that it consistently beats its theoretical worst-case bounds, solving the model exactly (i.e., no error) in the vast majority of cases.

READ FULL TEXT
research
11/29/2019

Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity

In this paper we are interested in the all-pairs shortest paths problem ...
research
08/06/2018

Time-Dependent Shortest Path Queries Among Growing Discs

The determination of time-dependent collision-free shortest paths has re...
research
07/24/2018

Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings

In this thesis, we design algorithms for several NP-hard problems in bot...
research
11/08/2020

Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs

Given a plane undirected graph G with non-negative edge weights and a se...
research
04/26/2019

Learning to Prune: Speeding up Repeated Computations

It is common to encounter situations where one must solve a sequence of ...
research
10/11/2017

The Provable Virtue of Laziness in Motion Planning

The Lazy Shortest Path (LazySP) class consists of motion-planning algori...
research
08/05/2021

Bifactor Approximation for Location Routing with Vehicle and Facility Capacities

Location Routing is a fundamental planning problem in logistics, in whic...

Please sign up or login with your details

Forgot password? Click here to reset