RANBAR

RANSAC-based resilient aggregation in sensor networks

L. Buttyán, Péter Schaffer, István Vajda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)

Abstract

We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, which is well-known in computer vision and in automated cartography. The RANSAC paradigm gives us a hint on how to instantiate a model if there are a lot of compromised data elements.However,the paradigm does not specify an algorithm and it uses a guess for the number of compromised elements, which is not known in general in real life environments. We developed the RANBAR algorithm following this paradigm and we eliminated the need for the guess. Our RANBAR algorithm is therefore capable to handle a high percent of outlier measurement data by leaning on only one preassumption,namely that the sample is i.i.d. in the unattacked case. We implemented the algorithm in a simulation environment and we used it to filter out outlier elements from a sample before an aggregation procedure. The aggregation function that we used was the average. We show that the algorithm guarantees a small distortion on the output of the aggregator even if almost half of the sample is compromised. Compared to other resilient aggregation algorithms, like the trimmed average and the median, our RANBAR algorithm results in smaller distortion, especially for high attack strengths.

Original languageEnglish
Title of host publicationProceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06
Pages83-90
Number of pages8
DOIs
Publication statusPublished - 2006
Event4th ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06 - Alexandria, VA, United States
Duration: Oct 30 2006Oct 30 2006

Other

Other4th ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06
CountryUnited States
CityAlexandria, VA
Period10/30/0610/30/06

Fingerprint

Sensor networks
Agglomeration
Computer vision

Keywords

  • Outlier elimination
  • Random sample consensus
  • Resilient aggregation
  • Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Buttyán, L., Schaffer, P., & Vajda, I. (2006). RANBAR: RANSAC-based resilient aggregation in sensor networks. In Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06 (pp. 83-90) https://doi.org/10.1145/1180345.1180356

RANBAR : RANSAC-based resilient aggregation in sensor networks. / Buttyán, L.; Schaffer, Péter; Vajda, István.

Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06. 2006. p. 83-90.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Buttyán, L, Schaffer, P & Vajda, I 2006, RANBAR: RANSAC-based resilient aggregation in sensor networks. in Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06. pp. 83-90, 4th ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06, Alexandria, VA, United States, 10/30/06. https://doi.org/10.1145/1180345.1180356
Buttyán L, Schaffer P, Vajda I. RANBAR: RANSAC-based resilient aggregation in sensor networks. In Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06. 2006. p. 83-90 https://doi.org/10.1145/1180345.1180356
Buttyán, L. ; Schaffer, Péter ; Vajda, István. / RANBAR : RANSAC-based resilient aggregation in sensor networks. Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06. 2006. pp. 83-90
@inproceedings{91411256b358436f80069d4532806349,
title = "RANBAR: RANSAC-based resilient aggregation in sensor networks",
abstract = "We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, which is well-known in computer vision and in automated cartography. The RANSAC paradigm gives us a hint on how to instantiate a model if there are a lot of compromised data elements.However,the paradigm does not specify an algorithm and it uses a guess for the number of compromised elements, which is not known in general in real life environments. We developed the RANBAR algorithm following this paradigm and we eliminated the need for the guess. Our RANBAR algorithm is therefore capable to handle a high percent of outlier measurement data by leaning on only one preassumption,namely that the sample is i.i.d. in the unattacked case. We implemented the algorithm in a simulation environment and we used it to filter out outlier elements from a sample before an aggregation procedure. The aggregation function that we used was the average. We show that the algorithm guarantees a small distortion on the output of the aggregator even if almost half of the sample is compromised. Compared to other resilient aggregation algorithms, like the trimmed average and the median, our RANBAR algorithm results in smaller distortion, especially for high attack strengths.",
keywords = "Outlier elimination, Random sample consensus, Resilient aggregation, Sensor networks",
author = "L. Butty{\'a}n and P{\'e}ter Schaffer and Istv{\'a}n Vajda",
year = "2006",
doi = "10.1145/1180345.1180356",
language = "English",
isbn = "1595935541",
pages = "83--90",
booktitle = "Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06",

}

TY - GEN

T1 - RANBAR

T2 - RANSAC-based resilient aggregation in sensor networks

AU - Buttyán, L.

AU - Schaffer, Péter

AU - Vajda, István

PY - 2006

Y1 - 2006

N2 - We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, which is well-known in computer vision and in automated cartography. The RANSAC paradigm gives us a hint on how to instantiate a model if there are a lot of compromised data elements.However,the paradigm does not specify an algorithm and it uses a guess for the number of compromised elements, which is not known in general in real life environments. We developed the RANBAR algorithm following this paradigm and we eliminated the need for the guess. Our RANBAR algorithm is therefore capable to handle a high percent of outlier measurement data by leaning on only one preassumption,namely that the sample is i.i.d. in the unattacked case. We implemented the algorithm in a simulation environment and we used it to filter out outlier elements from a sample before an aggregation procedure. The aggregation function that we used was the average. We show that the algorithm guarantees a small distortion on the output of the aggregator even if almost half of the sample is compromised. Compared to other resilient aggregation algorithms, like the trimmed average and the median, our RANBAR algorithm results in smaller distortion, especially for high attack strengths.

AB - We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, which is well-known in computer vision and in automated cartography. The RANSAC paradigm gives us a hint on how to instantiate a model if there are a lot of compromised data elements.However,the paradigm does not specify an algorithm and it uses a guess for the number of compromised elements, which is not known in general in real life environments. We developed the RANBAR algorithm following this paradigm and we eliminated the need for the guess. Our RANBAR algorithm is therefore capable to handle a high percent of outlier measurement data by leaning on only one preassumption,namely that the sample is i.i.d. in the unattacked case. We implemented the algorithm in a simulation environment and we used it to filter out outlier elements from a sample before an aggregation procedure. The aggregation function that we used was the average. We show that the algorithm guarantees a small distortion on the output of the aggregator even if almost half of the sample is compromised. Compared to other resilient aggregation algorithms, like the trimmed average and the median, our RANBAR algorithm results in smaller distortion, especially for high attack strengths.

KW - Outlier elimination

KW - Random sample consensus

KW - Resilient aggregation

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=34547471023&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547471023&partnerID=8YFLogxK

U2 - 10.1145/1180345.1180356

DO - 10.1145/1180345.1180356

M3 - Conference contribution

SN - 1595935541

SN - 9781595935540

SP - 83

EP - 90

BT - Proceedings of the Fourth ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006. A workshop held in conjuction with the 13th ACM Conference on Computer and Communications Security, CCS'06

ER -