Sciweavers

Share
MSWIM
2006
ACM

Interference-constrained wireless coverage in a protocol model

10 years 8 months ago
Interference-constrained wireless coverage in a protocol model
We present an efficient 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 centered at the transmitter location. 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. Our algorithm takes O(n log n) time. We use Voronoi diagrams and power diagrams for representing these proximity regions.
Prateek R. Kapadia, Om P. Damani
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where MSWIM
Authors Prateek R. Kapadia, Om P. Damani
Comments (0)
books