IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i10p491910.html
   My bibliography  Save this article

LKM: A LDA-Based K-Means Clustering Algorithm for Data Analysis of Intrusion Detection in Mobile Sensor Networks

Author

Listed:
  • Yuhua Zhang
  • Kun Wang
  • Min Gao
  • Zhiyou Ouyang
  • Siguang Chen

Abstract

Mobile sensor networks (MSNs), consisting of mobile nodes, are sensitive to network attacks. Intrusion detection system (IDS) is a kind of active network security technology to protect network from attacks. In the data gathering phase of IDS, due to the high-dimension data collected in multidimension space, great pressure has been put on the subsequent data analysis and response phase. Therefore, traditional methods for intrusion detection can no longer be applicable in MSNs. To improve the performance of data analysis, we apply K -means algorithm to high-dimension data clustering analysis. Thus, an improved K -means clustering algorithm based on linear discriminant analysis (LDA) is proposed, called LKM algorithm. In this algorithm, we firstly apply the dimension reduction of LDA to divide the high-dimension data set into 2-dimension data set; then we use K -means algorithm for clustering analysis of the dimension-reduced data. Simulation results show that LKM algorithm shortens the sample feature extraction time and improves the accuracy of K -means clustering algorithm, both of which prove that LKM algorithm enhances the performance of high-dimension data analysis and the abnormal detection rate of IDS in MSNs.

Suggested Citation

  • Yuhua Zhang & Kun Wang & Min Gao & Zhiyou Ouyang & Siguang Chen, 2015. "LKM: A LDA-Based K-Means Clustering Algorithm for Data Analysis of Intrusion Detection in Mobile Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 491910-4919, October.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:491910
    DOI: 10.1155/2015/491910
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/491910
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/491910?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:491910. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.