Abstract
Accurate coverage maps are an important tool for network planning and operation but it is often impossible to obtain these maps completely from measurements. In this paper we describe two new methods that enable operators to minimize the cost for obtaining a complete coverage map at high accuracy. Our first method applies the Singular Value Thresholding (SVT) algorithm to reconstruct a complete map from a sparse matrix of coverage data. We then use the Query by Committee (QbC) rationale to identify the areas where further measurements would maximize accuracy of the completed map. This second method allows operators to plan their drive tests such that a given budget is spent at highest efficiency. Our numerical examples illustrate that our proposed completion technique outperforms relevant state of the art and that QbC further enhances reconstruction accuracy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.