IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4419-0534-5_5.html
   My bibliography  Save this book chapter

Reliability-Based Routing Algorithms for Energy-Aware Communication in Wireless Sensor Networks

In: Performance Models and Risk Management in Communications Systems

Author

Listed:
  • Janos Levendovszky

    (Budapest University of Technology and Economics)

  • Andras Olah

    (Peter Pazmany Catholic University)

  • Gergely Treplan

    (Peter Pazmany Catholic University)

  • Long Tran-Thanh

    (Budapest University of Technology and Economics)

Abstract

In this chapter, some novel routing algorithms and packet forwarding strategies are presented forWireless Sensor Networks (WSNs). The new algorithms provide energy balancing under reliability constraints, as opposed to traditional wireless routing protocols (e.g. PEDAP, Directed Diffusion and LEACH), which fail to provide guarantees for reliable communication while attempting to achieve energy balancing. As reliable packet transfer to the Base Station (BS) is instrumental in many applications when there are no redundancies in the observed signals collected by the sensors, these new protocols can be of better use in real systems targeting such applications. Reliability is defined in terms of keeping the packet loss ration under a predefined threshold. The novel contribution of this chapter lies in developing new routing and packet forwarding mechanisms which can achieve energy balancing and reliable communication in WSNs. In order to provide energy balancing under such reliability constraints, first a randomized packet forwarding mechanism is introduced termed as “random shortcut” protocol. The performance of the new protocol is optimized by using large deviation theory. Secondly, new routing algorithms are developed which can select optimal paths to the BS ensuring minimum energy consumption and guarantee a given level of reliability at the same time. In this case, the wireless sensor network is modeled as a random graph, where optimal routes are found by the means of combinatorial optimization. The new algorithm OERA (Overall Energy Reliability Algorithm) selects a path which minimizes the overall energy needed to transfer a packet to the BS subject to a predefined reliability constraint, while algorithm BERA (Bottleneck Energy Reliability Algorithm) selects path over which the remaining energy of the bottleneck node (the one having the smallest energy) is maximized under the same constraint. It will be proven that these algorithms can find the optimal path in polynomial time and can be implemented in a distributed manner. The performance of the new methods compared to the traditional ones is also demonstrated by extensive numerical analysis and simulations.

Suggested Citation

  • Janos Levendovszky & Andras Olah & Gergely Treplan & Long Tran-Thanh, 2011. "Reliability-Based Routing Algorithms for Energy-Aware Communication in Wireless Sensor Networks," Springer Optimization and Its Applications, in: Nalân Gülpınar & Peter Harrison & Berç Rüstem (ed.), Performance Models and Risk Management in Communications Systems, pages 93-126, Springer.
    • Handle: RePEc:spr:spochp:978-1-4419-0534-5_5
    DOI: 10.1007/978-1-4419-0534-5_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-1-4419-0534-5_5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.