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

A Mutual Algorithm for Optimizing Distributed Source Coding in Wireless Sensor Networks

Author

Listed:
  • Nashat Abughalieh
  • Kris Steenhaut
  • Bart Lemmens
  • Ann Now©

Abstract

Wireless Sensor Networks (WSNs) are composed of small wireless nodes equipped with sensors, a processor, and a radio communication unit, all normally powered by batteries. For most WSN applications, the network is expected to function for several months or years. In the common monitoring application scenario, adjacent nodes in a WSN often sense spatially correlated data. Suppressing this correlation can significantly improve the lifetime of the network. The maximum possible network data compression can be achieved using distributed source coding (DSC) techniques when nodes encode at Slepian-Wolf rates. This paper presents contributions to the lifetime optimization problem of WSNs in the form of two algorithms: the Updated-CMAX (UCMAX) power-aware routing algorithm to optimize the routing tree and the Rate Optimization (RO) algorithm to optimize the encoding rates of the nodes. The two algorithms combined offer a solution that maximizes the lifetime of a WSN measuring spatially correlated data. Simulations show that our proposed approach may significantly extend the lifetime of multihop WSNs with nodes that are observing correlated data.

Suggested Citation

  • Nashat Abughalieh & Kris Steenhaut & Bart Lemmens & Ann Now©, 2012. "A Mutual Algorithm for Optimizing Distributed Source Coding in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(2), pages 783798-7837, February.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:2:p:783798
    DOI: 10.1155/2012/783798
    as

    Download full text from publisher

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