ACM Home Page
Please provide us with feedback. Feedback
RANBAR: RANSAC-based resilient aggregation in sensor networks
Full text PdfPdf (166 KB)
Source Workshop on Security of ad hoc and Sensor Networks archive
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks table of contents
Alexandria, Virginia, USA
SESSION: Secure data aggregation and transmission table of contents
Pages: 83 - 90  
Year of Publication: 2006
ISBN:1-59593-554-1
Authors
Levente Buttyán  Budapest University of Technology and Economics, Hungary
Péter Schaffer  Budapest University of Technology and Economics, Hungary
István Vajda  Budapest University of Technology and Economics, Hungary
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 36,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1180345.1180356
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
 
5
V. Bychkovskiy, S. Megerian, D. Estrin, M. Potkonjak. A collaborative approach to in-place sensor calibration. In Proceedings of the Second International Workshop on Information Processing in Sensor Networks (IPSN)2003.
 
6
A. J. Lacey, N. Pinitkarn, N. A. Thacker.An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration. In Proceedings of the British Machine Vision Conference (BMVC)2000.
 
7
O. Chum, J. Matas. Randomized RANSAC with T d,d test. In Proceedings of the 13th British Machine Vision Conference (BMVC)September 2002.
 
8
J. Yan, M. Pollefeys. Articulated Motion Segmentation Using RANSAC With Priors. In Proceedings of the ICCV Workshop on Dynamical Vision 2005.
 
9
M. Zuliani,C. S. Kenney, B. S. Manjunath. The MultiRANSAC Algorithm and its Application to Detect Planar Homographies. In Proceedings of the IEEE International Conference on Image Processing September 2005.
10
 
11
12
 
13
14

CITED BY  9

Collaborative Colleagues:
Levente Buttyán: colleagues
Péter Schaffer: colleagues
István Vajda: colleagues