By Topic

A Performance Evaluation of Distributed Framework for Mining Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Boukerche, A. ; PARADISE Res. Lab., Ottawa Univ., Ont. ; Samarah, S.

In this paper, we introduce a comprehensive framework for extracting and mining sensor data. This framework consists of a new formulation for the association rules, distributed extraction mechanism, and a compressed structure for the data along with the mining algorithm that is able to extract the knowledge out of it. The new formulation define the temporal relations between sensors and map them to the association rules, a well know data mining technique, a direct application of the extracted relations is predicting the sources of future events, estimating the value of missed events, or identifying faulty nodes. The proposed distributed extraction is designed to improve the network life time by reducing number of messages needed to generate the required data for the mining process, experiments have shown that our distributed extraction solution is able to reduce number of exchanged messages by 50% compared to a centralized solution. The compressed representation structure, which we call it positional lexicographic tree (PLT), is able to partition and compressed the data and provides an easy access mechanism for manipulating the data, we successfully compared the mining process of the PLT with the FP-Growth, a well know mining algorithm, results have shown that PLT outperform FP-Growth in both CPU time and memory usage

Published in:

Simulation Symposium, 2007. ANSS '07. 40th Annual

Date of Conference:

March 2007