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

Energy-Efficient Adaptive Routing and Context-Aware Lifetime Maximization in Wireless Sensor Networks

Author

Listed:
  • Shaohua Wan

    (School of Information and Safety Engineering, Zhongnan University of Economics and Law, Wuhan 430073, China)

Abstract

We design and implement a Bezier-based multipath routing algorithm that allows a given source node to send samples of data to a given sink node in large scale sensor networks. Multipath routing can distribute the energy load onto the multiple routes and thus increase the lifetime and quality of the network. It is important to stress the fact that evenly regulating the routing task among the more nodes of the network can also protect a node from failure considering that a node with heavy duty is likely to deplete its power quickly. On the contrary, all the traffic would be shipped along the shortest path routing, corresponding to the heavily congested path case, which in turn leads to overload of the nodes along the optimal routes between the sink and source pair and finally shortens the lifetime of the network. Also, multipath routing can increase end-to-end throughput and provide load balancing. Our view is that minimizing energy consumption while meeting acceptable latency for applications can lead to significant power savings. Our simulation results demonstrate that Bezier-based multipath routing approach significantly outperforms previous SWEEP, Tributaries and Deltas, and the shortest path approaches in terms of lifetime and latency.

Suggested Citation

  • Shaohua Wan, 2014. "Energy-Efficient Adaptive Routing and Context-Aware Lifetime Maximization in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(11), pages 321964-3219, November.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:11:p:321964
    DOI: 10.1155/2014/321964
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/321964
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/321964?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:11:p:321964. 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.