Learning from class-imbalanced data in wireless sensor networks
Predrag Radivojac, Uttara Korad, Krishna Moorthy Sivalingam, Zoran Obradović · 2003
In this paper, we study wireless sensor networks used for detection of rare events (e.g. intrusion). The task of the sensor node is to collect data points (examples) at regular time intervals and communicate them to the central base station (BS) using wireless links. Since sensor nodes have limited battery power, it is necessary to minimize their energy consumption. One way is to reduce the amount of sensor data packets transmitted. In this paper, we incorporate machine learning strategies to intelligently reduce the amount of transmitted data, in order to increase life-span of the sensors and thus profitability of the system. In our proposed approach, after a short initialization period, the sensors obtain a classification model from the BS based upon which they detect interesting (positive) data points. Positive examples are, together with selected negative examples, then reported to the BS. In time, BS would have stored an abundant number of negatives and a limited number of positives causing what is termed as a class-imbalance problem in learning. In order to understand the impact of network architecture on learning performance, two different architectures are studied: cluster-based (LEACH) and tiered (UNPF). With the aid of experiments using generated data sets, the paper analyzes the tradeoffs between prediction success, learning cost, packets transmitted and energy consumed. The results show that the proposed learning mechanism significantly reduces energy consumption compared to the baseline system.