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

An Overlapping Clustering Approach for Routing in Wireless Sensor Networks

Author

Listed:
  • Zhenquan Qin
  • Can Ma
  • Lei Wang
  • Jiaqi Xu
  • Bingxian Lu

Abstract

The design and analysis of routing algorithm is an important issue in wireless sensor networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k -connected overlapping clustering approach with energy awareness, namely, k -OCHE, for routing in WSNs. The basic idea of this approach is to select a cluster head by energy availability (EA) status. The k -OCHE scheme adopts a sleep scheduling strategy of CKN, where neighbors will remain awake to keep it k connected, so that it can balance energy distributions well. Compared with traditional routing algorithms, the proposed k -OCHE approach obtains a balanced load distribution, consequently a longer network lifetime, and a quicker routing recovery time.

Suggested Citation

  • Zhenquan Qin & Can Ma & Lei Wang & Jiaqi Xu & Bingxian Lu, 2013. "An Overlapping Clustering Approach for Routing in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(3), pages 867385-8673, March.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:3:p:867385
    DOI: 10.1155/2013/867385
    as

    Download full text from publisher

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