Name
Abstract | ||
|---|---|---|
We study the geometric aspects of the sentryselection problem for a sensor network with randomlydistributed sensors each of which covers a small disc. Theproblem is to partition the sensors into a predeterminednumber of groups, so that, for each group, the sensingregions of the sensors in that group together coverthe region of interest. After presenting some theoreticalresults, we include descriptions of two fast partitioningalgorithms, together with the results of simulating themon moderate-sized networks. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1504/IJSNET.2017.085759 | INTERNATIONAL JOURNAL OF SENSOR NETWORKS |
Keywords | Field | DocType |
wireless sensor networks, sentry selection, Gilbert model, random coverings, recolouring algorithms, geometric probability | Sentry,Computer science,Algorithm,Geometric probability,Gilbert model,Region of interest,Partition (number theory),Wireless sensor network | Journal |
Volume | Issue | ISSN |
24 | 3 | 1748-1279 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Balister | 1 | 238 | 32.82 |
| Béla Bollobás | 2 | 2696 | 474.16 |
| Martin Haenggi | 3 | 4480 | 292.10 |
| Amites Sarkar | 4 | 113 | 15.53 |
| Mark Walters | 5 | 23 | 4.07 |