## RANBAR: RANSAC-Based Resilient Aggregation in Sensor Networks (2006)

### Cached

### Download Links

- [www.ist-ubisecsens.org]
- [ebizlab.hit.bme.hu]
- [www.crysys.hu]
- [www.hit.bme.hu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. of SASN |

Citations: | 14 - 5 self |

### BibTeX

@INPROCEEDINGS{Buttyan06ranbar:ransac-based,

author = {Levente Buttyan and Peter Schaffer and Istvan Vajda},

title = {RANBAR: RANSAC-Based Resilient Aggregation in Sensor Networks},

booktitle = {In Proc. of SASN},

year = {2006}

}

### OpenURL

### 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.

### Citations

2452 |
Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography
- Fischler, Bolles
- 1981
(Show Context)
Citation Context ...per bound on the percentage of compromised nodes? In this paper we propose a novel technique for resilient sensor data aggregation to handle this problem using a common principle: the RANSAC paradigm =-=[3]-=-. The RANSAC paradigm aims at finding data elements in the sample that correspond to a specified data model. This paradigm is described in several papers that deal with camera calibration, hyphotesis ... |

176 | SIA: Secure information aggregation in sensor networks
- Przydatek, Song, et al.
(Show Context)
Citation Context ... (Message Authentication Code) on the aggregated value computed by their child. Przydatek et al. present cryptography based countermeasures against the attacker who wants to distort the aggregate in =-=[14]-=-. The secure aggregation approach proposed in that paper is based on cryptographic commitment and interactive proof techniques. The aggregator sends the aggregate statistics to the home server togethe... |

141 | Medians and beyond: New aggregation techniques for sensor networks - Shrivastava, Buragohain, et al. - 2004 |

119 | Secure aggregation for wireless networks
- Hu, Evans
(Show Context)
Citation Context ...ty is called eavesdropping vulnerability and it depends on the set of eavesdropped nodes, on the adversary’s error tolerance and on the aggregation function used to calculate the aggregate. Hu et al. =-=[13]-=- consider large sensor networks where the sensor nodes organize themselves into a tree for the purpose of routing data packets to a single base station represented by the root of the tree. The authors... |

105 |
Resilient Aggregation in Sensor Networks
- Wagner
(Show Context)
Citation Context ...sence of an adversary who can modify the input of the aggregation function. One of the first research paper on resilient data aggregation was written by David Wagner and it was published at SASN 2004 =-=[1]-=-. The author investigated the resilience of commonly known aggregation functions and found that the average, the minimum and the maximum calculations are not resilient even against only one compromise... |

83 | Robust Statistical Methods for Securing Wireless Localization
- Li, Trappe, et al.
- 2005
(Show Context)
Citation Context ...rowsing through the literature, we can also find several papers on applications of robust techniques for securing measurement data without citing the problem of resilient aggregation. For example, in =-=[4]-=- and [5] statistical tools are deployed for securing the localization in sensor networks as well as allowing in-place sensor calibration. The applied statistical tools are the median and the method of... |

52 | A collaborative approach to in-place sensor calibration
- Bychkovskiy, Megerian, et al.
- 2003
(Show Context)
Citation Context ...through the literature, we can also find several papers on applications of robust techniques for securing measurement data without citing the problem of resilient aggregation. For example, in [4] and =-=[5]-=- statistical tools are deployed for securing the localization in sensor networks as well as allowing in-place sensor calibration. The applied statistical tools are the median and the method of cutting... |

44 |
J.Matas. Randomized ransac with td,d test
- Chum
- 2002
(Show Context)
Citation Context ... a RANSAC-based algorithm with traditional optimization schemes and find that in case of stereo camera calibration the use of RANSAC seems unjustified, while in motion estimation it is beneficial. In =-=[7]-=-, RANSAC was improved by randomising its hyphotesis evaluation step and it was shown that under some conditions this approach is significantly more efficient than the standard RANSAC method. In [8], t... |

42 | Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis - Chen, Pandurangan, et al. - 2005 |

26 | The multiransac algorithm and its application to detect planar homographies
- Zuliani, Kenney, et al.
- 2005
(Show Context)
Citation Context ...rticulated motion segmentation, and test their algorithm with both synthetic and real data. They have found that their algorithm shows both the properties of efficiency and robustness. The authors of =-=[9]-=- extended RANSAC to handle the problem of simultaneous parameter estimation of multiple models in data sets with a high percentage of outliers. Experimental results on synthetic data seem to support t... |

10 | Quantifying eavesdropping vulnerability in sensor networks
- Anand, Ives, et al.
- 2005
(Show Context)
Citation Context ...have adopted it for the purposes of resilient aggregation in sensor networks. A large number of papers are concerned with securing some aggregation related functions with the help of cryptography. In =-=[12]-=- the adversary wants to estimate the networkwide aggregate as accurately as possible. To achieve this, the adversary can eavesdrop the communication between some of the sensors. The authors show a way... |

8 |
Articulated motion segmentation using ransac with priors
- Yan, Pollefeys
- 2005
(Show Context)
Citation Context ...In [7], RANSAC was improved by randomising its hyphotesis evaluation step and it was shown that under some conditions this approach is significantly more efficient than the standard RANSAC method. In =-=[8]-=-, the authors use RANSAC for articulated motion segmentation, and test their algorithm with both synthetic and real data. They have found that their algorithm shows both the properties of efficiency a... |

6 | An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration
- Lacey, Pinitkarn, et al.
- 2000
(Show Context)
Citation Context ...but the algorithm is still in an early development phase. There are several publications about applications of RANSAC. The main orientation of these papers is computer vision and image processing. In =-=[6]-=-, the authors compare a RANSAC-based algorithm with traditional optimization schemes and find that in case of stereo camera calibration the use of RANSAC seems unjustified, while in motion estimation ... |

6 | Resilient aggregation with attack detection in sensor networks - Buttyán, Schaffer, et al. - 2006 |

3 | Resilient Aggregation with Attack Detection in Sensor Networks - Buttyan, Schaffer, et al. - 2006 |

1 |
Articulated Motion Segmentation RANSAC With Priors
- Yan, Pollefeys
- 2005
(Show Context)
Citation Context ...In [7], RANSAC was improved by randomising its hyphotesis evaluation step and it was shown that under some conditions this approach is significantly more efficient than the standard RANSAC method. In =-=[8]-=-, the authors use RANSAC for articulated motion segmentation, and test their algorithm with both synthetic and real data. They have found that their algorithm shows both the properties of efficiency a... |