IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i2idhcseit172224.html

Multi-Hop Routing Algorithm Using Spanning Tree for Network Lifetime in WSN

Author

Listed:
  • Deepthi M
  • Iswarya P

Abstract

To balance the energy dissipation in the network and to provide long lifetime for network multiple paths in data gathering is used in wireless sensor network. The time where the base station from the sensors in the lifetime of the sensor, which are used in network lower lifetime and number of paths used to balance the energy will maximize the lifetime of the network when extra load is added to the specification node. To maximize the lifetime many existing protocols were used but here we use liner programming approach to solve. In this paper, we propose energy efficient spanning tree based on multi hop routing which will maximum the lifetime of network. The sequence of routing path is used to maximize the lifetime of the system, based on the location of the sensor node and base station. To maximize the lifetime of the network here an analysis in made.

Suggested Citation

  • Deepthi M & Iswarya P, 2017. "Multi-Hop Routing Algorithm Using Spanning Tree for Network Lifetime in WSN," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(2), pages 103-110, April.
  • Handle: RePEc:jbh:ijsrcs:v2:y2017:i2:id:hcseit172224
    Note: Article URL: https://ijsrcseit.com/CSEIT172224
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT172224
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT172224.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    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:jbh:ijsrcs:v2:y2017:i2:id:hcseit172224. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.