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

A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks

Author

Listed:
  • Jian Peng
  • Xiaohai Chen
  • Tang Liu

Abstract

Energy efficiency and energy balance are two important issues for wireless sensor networks. In previous clustering routing algorithms, multihop transmission, sleep scheduling, and unequal clustering are always used to improve energy efficiency and energy balance. In these algorithms, only the cluster heads share the burden of data forwarding in each round. In this paper, we propose a flow-partitioned unequal clustering routing (FPUC) algorithm to achieve better energy efficiency and energy balance. FPUC consists of two phases: clustering and routing. In the clustering phase, the competition radius is computed according to the node density and the distance from sensor nodes to the sink. The sensor nodes that have more residual energy and larger overlapping degree have higher probability to be selected as cluster heads. In the routing phase, each cluster head first finds the gateway nodes and then distributes the data flow to each of its gateway nodes depending on residual energy. After that, each gateway node forwards the data to the next hop with minimum cost. Two metrics called network lifetime and coverage lifetime are used to compare the performance of FPUC with that of the existing ones. Simulation results show that FPUC can achieve longer network lifetime and coverage lifetime than previous algorithms.

Suggested Citation

  • Jian Peng & Xiaohai Chen & Tang Liu, 2014. "A Flow-Partitioned Unequal Clustering Routing Algorithm for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(4), pages 875268-8752, April.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:4:p:875268
    DOI: 10.1155/2014/875268
    as

    Download full text from publisher

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