
Instances for Sensor Network Localization
README
(I) Sparse Networks
(I.a) Simulated Networks:
Connectivity model: Disk Connectivity Model
Connectivity model: Edge Length Distribution Model, alpha = 0
Connectivity model: Edge Length Distribution Model, alpha = 0.5
Connectivity model: Edge Length Distribution Model, alpha = 1
(I.b) Sampling real data (measurments)
(II) Dense networks
Sampling real data (measurement)- 3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
Sampling real data (measurement)- 3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
Sampling real data (measurement) 3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
Sampling real data (measurement)-12 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
Sampling real data (measurement)-3 Beacons
| Hardness | Nodes correct location | Distance matrix |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
(III) Hard instances based on bumpiness of objective function
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
| Hard 1 | N | A |
Sampling real data (measurement)- 3 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
| Hard 2 | N | A |
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
| Hard 3 | N | A |
Sampling real data (measurement)- 3 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
| Hard 4 | N | A |
Sampling real data (measurement)- 3 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
| Hard 5 | N | A |
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
| Hard 6 | N | A |
Sampling real data (measurement)- 3 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
| Hard 7 | N | A |
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
| Hard 8 | N | A |
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
| Hard 9 | N | A |
Sampling real data (measurement)- 12 beacons
| Hardness | Nodes location | Distance matrix |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
| Hard 10 | N | A |
(IV) Explicitly Hard Instances
There are 3 beacons in all instances
designed to be hard
| Number of nodes | Nodes correct location | Distance matrix |
| 20 | N | A |
| 20 | N | A |
| 20 | N | A |
| 20 | N | A |
| 20 | N | A |
designed to be hard
| Number of nodes | Nodes correct location | Distance matrix |
| 30 | N | A |
| 30 | N | A |
| 30 | N | A |
| 30 | N | A |
| 30 | N | A |
designed to be hard
| Number of nodes | Nodes correct location | Distance matrix |
| 50 | N | A |
| 50 | N | A |
| 50 | N | A |
| 50 | N | A |
| 50 | N | A |
designed to be hard
| Number of nodes | Nodes correct location | Distance matrix |
| 100 | N | A |
| 100 | N | A |
| 100 | N | A |
| 100 | N | A |
| 100 | N | A |