The abundance of data available on Wireless Sensor Networks makes online processing necessary. In industrial applications for example, the correct operation of equipment can be the point of interest while raw sampled data is of minor importance. Classication algorithms can be used to make state classications based on the available data. The distributed nature of Wireless Sensor Networks is a complication that needs to be considered when implementing classication algorithms. In this work, we investigate the bottlenecks that limit the options for distributed execution of three widely used algorithms: Feed Forward Neural Networks, naive Bayes classiers and decision trees. By analyzing theoretical boundaries and using simulations of various network topologies, we show that the naive Bayes classier is the most ﬂexible algorithm for distribution. Decision trees can be distributed efficiently but are unpredictable. Feed Forward Neural Networks show severe limitations.
|Number of pages||8|
|Journal||Procedia computer science|
|Publication status||Published - 2012|
|Event||Second International Symposium on Frontiers in Ambient and Mobile Systems (FAMS-2012) - Niagara Falls, Canada|
Duration: 27 Aug 2012 → 29 Aug 2012