کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
459951 696295 2014 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Bloom filter based processing algorithms for the multi-dimensional event query in wireless sensor networks
ترجمه فارسی عنوان
الگوریتم پردازش بر اساس فیلتر بلوم برای پرس و جو رویداد چند بعدی در شبکه های حسگر بی سیم
کلمات کلیدی
پرس و جو رویداد چند بعدی، فیلتر بلوم، الگوریتم تقریبی شبکه های حسگر بی سیم
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
چکیده انگلیسی

To solve the multi-dimensional event based query in wireless sensor networks, this paper proposes four bloom filter based query processing algorithms UBP, BBP, SRBP and PBP. The four algorithms proposed can be classified into two classes: two bloom filter based precise algorithms, which are UBP and BBP, and two bloom filter based approximate algorithms, which are SRBP and PBP. By using the bloom filter and introducing the inaccuracy, the communication cost involved by the query processing can be reduced.For the two precise algorithms UBP and BBP, simulation results show that UBP consumes 51% less energy than BBP on average. UBP is better than BBP on energy consumption. For energy consumption comparison between the approximate algorithms and the precise algorithm UBP, simulation results show that SRBP consumes 18% less energy than UBP on average as while as PBP consume approximately the same energy as UBP on average. For query accuracy comparison between the approximate algorithms and the precise algorithm UBP, simulation results show that the average relative error between UBP and PBP is 14% and the average relative error between UBP and SRBP is 2%. SRBP is better than PBP on energy consumption and query accuracy respectively. UBP and SRBP are two preferred bloom filter based query processing algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Network and Computer Applications - Volume 37, January 2014, Pages 323–333
نویسندگان
, , , ,