Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Computational geometry in C
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present an O(nlogn) algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within the transmission range of one transmitter and lie outside the interference range of every other transmitter. To our knowledge, there is no existing satisfactory algorithm for this purpose. We assume that the transmission and interference ranges of each transmitter are circular disks.We show that for an appropriate choice of 'distance measure', coverage at each point can be computed by considering only certain 'proximate' transmitters. Hence, we partition the plane into proximity regions and the coverage in these proximity regions is computed considering only proximate transmitters. We use an extension of Voronoi diagrams, called 'Power' diagrams, to represent the proximity regions.