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

A Top-Down Clustering and Cluster-Tree-Based Routing Scheme for Wireless Sensor Networks

Author

Listed:
  • H. M. N. Dilum Bandara
  • Anura P. Jayasumana
  • Tissa H. Illangasekare

Abstract

Cluster-based organization of large sensor networks is the basis for many techniques aimed at enhancing power conservation and network management. A backbone network in the form of a cluster tree further enhances routing, broadcasting, and in-network processing. We propose a configurable top-down cluster and cluster-tree formation algorithm, a cluster-tree self-optimization phase, a hierarchical cluster addressing scheme, and a routing scheme. Such self-organization makes it possible to effectively deliver messages to a sink as well as within the network. For example, a circular sensor field with a sink in the center can establish cross-links and circular-paths within the cluster tree to deliver messages through shorter routes while reducing hotspots and consequently increasing network lifetime. Cluster and cluster-tree formation algorithm is independent of physical topology, and does not require a priori neighborhood information, location awareness, or time synchronization. Algorithm parameters allow for formation of cluster trees with desirable properties such as controlled breadth/depth, uniform cluster size, and circular clusters. Characteristics of clusters, cluster tree, and routing are used to demonstrate the effectiveness of the schemes over existing techniques.

Suggested Citation

  • H. M. N. Dilum Bandara & Anura P. Jayasumana & Tissa H. Illangasekare, 2011. "A Top-Down Clustering and Cluster-Tree-Based Routing Scheme for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 7(1), pages 940751-9407, May.
    • Handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:940751
    DOI: 10.1155/2011/940751
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2011/940751
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2011/940751?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:7:y:2011:i:1:p:940751. 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.