Anomaly Detection Based Secure in – Network Aggregation for Wireless Sensor Networks
 |
International Journal of Recent Engineering Science (IJRES) |  |
| © 2014 by IJRES Journal | ||
| Volume-1 Issue-4 |
||
| Year of Publication : 2014 | ||
| Authors : K.Rajesh |
||
| DOI : 10.14445/23497157/IJRES-V1I4P102 |
How to Cite?
K.Rajesh, "Anomaly Detection Based Secure in – Network Aggregation for Wireless Sensor Networks," International Journal of Recent Engineering Science, vol. 1, no. 4, pp. 6-10, 2014. Crossref, https://doi.org/10.14445/23497157/IJRES-V1I4P102
Abstract
Secure in-network aggregation in wireless sensor networks (WSNs) is a necessary and challenging task. This project first proposes integration of system monitoring modules and intrusion detection modules in the context of WSNs. And propose an extended Kalman filter (EKF) based mechanism to detect false injected data. Specifically, by monitoring behaviors of its neighbors and using EKF to predict their future states (actual in-network aggregated values), each node aims at setting up a normal range of the neighbors’ future transmitted aggregated values. This task is challenging because of potential high packet loss rate, harsh environment, and sensing uncertainty. The project illustrates how to use EKF to address this challenge to create effective local detection mechanisms. Using different aggregation functions (average, sum, max, and min), presents how to obtain a theoretical threshold. The project further applies an algorithm of combining cumulative summation and generalized likelihood ratio to increase detection sensitivity. To overcome the limitations of local detection mechanisms, it illustrates how The proposed local detection approaches work together with the system monitoring module to differentiate between malicious events and emergency events. The project simulates to evaluate local detection mechanisms under different aggregation functions.
Keywords
Channel resolution, Garbage output, constant input, power consumption, omni-directional antenna.
Reference
[1] M. Basseville and I. V. Nikiforov, Detection of Abrupt Changes: Theory and Application. Englewood Cliffs, NJ: Prentice- Hall/Simon and Schuster Company, 1993.
[2] D. Wagner, ―Resilient aggregation in sensor networks,‖ in Proc. ACM SASN, 2004, pp. 78–87.
[3] C. Castelluccia, E. Mykletun, and G. Tsudik, ―Efficient aggregation of encrypted data in wireless sensor networks,‖ in Proc. MOBIQUITOUS, Jul. 2005, pp. 109–117.
[4] H. Cam, S. Ozdemir, P. Nair, and D. Muthuavinashiappan, ―Espda: Energy efficient and secure pattern-based data aggregation for wireless sensor networks,‖ in Proc. IEEE Sensors, Oct. 2003, pp. 732–736.
[5] D. Chu, A. Deshpande, J. M. Hellerstein, and W. Hong, ―Approximate data collection in sensor networks using probabilistic models,‖ in Proc. IEEE ICDE, Apr. 2006, pp. 48–59.
[6] J.-Y. Chen, G. Pandurangan, and D. Xu, ―Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis,‖ IEEE Trans. Parallel Distributed Syst., vol. 17, no. 9, pp. 987–1000, Sep. 2006.
[7] H. Chan, A. Perrig, and D. Song, ―Secure hierarchical InNetwork aggregation in sensor networks,‖ in Proc. ACM CCS, 2006, pp. 278– 287.
[8] K. Wu, D. Dreef, B. Sun, and Y. Xiao, ―Secure data aggregation without persistent cryptographic operations in wireless sensor networks,‖ Elsevier Ad Hoc Networks J., vol. 15, no. 1, pp. 100– 111, 2007.
[9] L. Hu and D. Evans, ―Secure aggregation for wireless networks,‖ in Proc. Workshop Security Assurance Ad Hoc Netw., Jan. 2003, pp. 384– 391.
[10] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, ―Impact of network density on data aggregation in wireless sensor networks,‖ in Proc. ICDCS, 2002, pp. 457 458.
[11] S. Madden, M. J. Franklin, J. Hellerstein, and W. Hong, ―TAG: A tiny aggregation service for ad-hoc sensor networks,‖ in Proc. OSDI, Dec. 2002, pp. 131–146.