On Whitespace Identification Using Randomly Deployed Sensors
Rahul Vaze, Chandra R. Murthy

TL;DR
This paper analyzes how randomly deployed sensors can identify available whitespace and localize transmitters, revealing optimal scaling laws and deployment strategies for large sensor networks.
Contribution
It provides a comprehensive analysis of whitespace detection and transmitter localization using random sensors, establishing optimal scaling laws and deployment strategies.
Findings
Whitespace recovery scales as log(n)/n with increasing sensors.
Optimal sensor radio range also scales as log(n)/n.
Sensor unreliability does not alter the optimal scaling law.
Abstract
This work considers the identification of the available whitespace, i.e., the regions that are not covered by any of the existing transmitters, within a given geographical area. To this end, sensors are deployed at random locations within the area. These sensors detect for the presence of a transmitter within their radio range , and their individual decisions are combined to estimate the available whitespace. The limiting behavior of the recovered whitespace as a function of and is analyzed. It is shown that both the fraction of the available whitespace that the nodes fail to recover as well as their radio range both optimally scale as as gets large. The analysis is extended to the case of unreliable sensors, and it is shown that, surprisingly, the optimal scaling is still even in this case. A related problem of estimating the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
