Abstract
Voronoi diagrams specify the coverage regions of base stations in cellular radio systems. Classical Voronoi diagrams are made up of regions which are convex polygons, but this is the case only for an unrealistic single-slope pathloss model. We provide a new algorithm which computes arbitrarily accurate boundaries of coverage regions under a very general pathloss model, which requires only that the radio signals decrease monotonically with distance and asymptotically as some power of the distance. The new algorithm is applicable to general cellular environments with multi-slope pathloss conditions, including those in vehicular-to-everything (V2X) communications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have