Can I read Interference-constrained Wireless Coverage in a Protocol Model on EtoBox?

Interference-constrained Wireless Coverage in a Protocol Model by Prateek R. Kapadia; Om P. Damani is a scholarly article available to read on EtoBox.

What is Interference-constrained Wireless Coverage in a Protocol Model about?

We present an O(n log n) 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.

Author

Prateek R. Kapadia; Om P. Damani

Publisher

ACM

Published

2006

Language

EN