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

An Extended Growing Self-Organizing Map for Selection of Clusters in Sensor Networks

Author

Listed:
  • Siddeswara Mayura Guru
  • Arthur Hsu
  • Saman Halgamuge
  • Saman Fernando

Abstract

Sensor networks consist of wireless enabled sensor nodes with limited energy. As sensors could be deployed in a large area, data transmitting and receiving are energy consuming operations. One of the methods to save energy is to reduce the communication distance of each node by grouping them in to clusters. Each cluster will have a cluster-head (CH), which will communicate with all the other nodes of that cluster and transmit the data to the remote base station. In this paper, we propose an extension to Growing Self-Organizing Map (GSOM) and describe the use of evolutionary computing technique to cluster wireless sensor nodes and to identify the cluster-heads. We compare the proposed method with clustering solutions based on Genetic Algorithm (GA), an extended version of Particle Swarm Optimisation (PSO) and four general purpose clustering algorithms. This could help to discover the clusters to reduce the communication energy used to transmit data when exact locations of all sensors are known and computational resources are centrally available. This method is useful in the applications where sensors are deployed in a controlled environment and are not moving. We have derived an energy minimisation model that is used as a criterion for clustering. The proposed method can also be used as a design tool to study and analyze the cluster formation for a given node placement.

Suggested Citation

  • Siddeswara Mayura Guru & Arthur Hsu & Saman Halgamuge & Saman Fernando, 2005. "An Extended Growing Self-Organizing Map for Selection of Clusters in Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 1(2), pages 227-243, March.
    • Handle: RePEc:sae:intdis:v:1:y:2005:i:2:p:227-243
    DOI: 10.1080/15501320590966477
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320590966477
    Download Restriction: no
    File URL: https://libkey.io/10.1080/15501320590966477?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
    ---><---

    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:1:y:2005:i:2:p:227-243. 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.