17,947 research outputs found
Fixed Rank Kriging for Cellular Coverage Analysis
Coverage planning and optimization is one of the most crucial tasks for a
radio network operator. Efficient coverage optimization requires accurate
coverage estimation. This estimation relies on geo-located field measurements
which are gathered today during highly expensive drive tests (DT); and will be
reported in the near future by users' mobile devices thanks to the 3GPP
Minimizing Drive Tests (MDT) feature~\cite{3GPPproposal}. This feature consists
in an automatic reporting of the radio measurements associated with the
geographic location of the user's mobile device. Such a solution is still
costly in terms of battery consumption and signaling overhead. Therefore,
predicting the coverage on a location where no measurements are available
remains a key and challenging task. This paper describes a powerful tool that
gives an accurate coverage prediction on the whole area of interest: it builds
a coverage map by spatially interpolating geo-located measurements using the
Kriging technique. The paper focuses on the reduction of the computational
complexity of the Kriging algorithm by applying Fixed Rank Kriging (FRK). The
performance evaluation of the FRK algorithm both on simulated measurements and
real field measurements shows a good trade-off between prediction efficiency
and computational complexity. In order to go a step further towards the
operational application of the proposed algorithm, a multicellular use-case is
studied. Simulation results show a good performance in terms of coverage
prediction and detection of the best serving cell
Dynamic Resource Allocation in Conservation Planning
Consider the problem of protecting endangered species by
selecting patches of land to be used for conservation purposes.
Typically, the availability of patches changes over time, and
recommendations must be made dynamically. This is a challenging
prototypical example of a sequential optimization
problem under uncertainty in computational sustainability. Existing
techniques do not scale to problems of realistic size. In
this paper, we develop an efficient algorithm for adaptively
making recommendations for dynamic conservation planning,
and prove that it obtains near-optimal performance. We further
evaluate our approach on a detailed reserve design case study
of conservation planning for three rare species in the Pacific
Northwest of the United States
Modeling heterogeneity in random graphs through latent space models: a selective review
We present a selective review on probabilistic modeling of heterogeneity in
random graphs. We focus on latent space models and more particularly on
stochastic block models and their extensions that have undergone major
developments in the last five years
- …