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

Authors

  • Deepthi M  Department of Electronic & Communication Engineering, SNS College of Engineering, Coimbatore, Tamil Nadu, India
  • Iswarya P  Department of Electronic & Communication Engineering, SNS College of Engineering, Coimbatore, Tamil Nadu, India

Keywords:

EESR PEDAPPA, PEDAP, CMLDA

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.

References

  1. Mani B. Srivastava Curt Schurgers. Energy efficient routing in wireless sensor networks. MILCOM’01, pages 357–361, October 28-31 2001.
  2. I. Matta V. Erramilli and A. Bestavros. On the interaction between data aggregation and topology control in wireless sensor networks. In Proc. of SECON,, pages 557–565,, Oct 2004.
  3. S. Bandyopadhyay and E. J. Coyle. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), 2003.
  4. S. Ghiasi, A. Srivastava, X. Yang, and M. Sarrafzadeh. Optimal energy aware clustering in sensor networks. Sensors, 2:258–259, 2002.
  5. Anathan P. Chandraskan Wendi B. Heinzelman and Hari Blakrisshnan. An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. on Wireless Communications, 1(4):660–670, OCT 2002.
  6. Konstantinos Kalpakis Koustuv Dasgupta and Parag Namjoshi. An effi- cient clustering-based heuristic for data gathering and aggregation in sensor networks. In IEEE Wireless Communications and Networking Conference, 2003.
  7. Koustuv Dasgupta Konstantinos Kalpakis and Parag Namjoshi. Maximum lifetime data gathering and aggregation in wireless sensor networks. In IEEE International Conference on Networking, pages 685–696, August 2002.
  8. Daniel Kofman Ravi Mazumdar Ness Shroff Vivek P. Mhatre, Catherine Rosenberg.
  9. Nandini.M.D.S, Kiruthika.M “Life Time Balanced Routing Algorithm for Wireless Sensor Networks”, IJARCSMS published 2014.
  10. Nandini.M.D.S ,Sangeetha.K”Energy Based Routing Algorithm Using Spanning Tree For Multicluster Formation In WSN” IJAICT Volume 1, Issue 2, June 2014.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-04-30

Issue

Volume 2, Issue 2, March-April-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Deepthi M, Iswarya P, " Multi-Hop Routing Algorithm Using Spanning Tree for Network Lifetime in WSN, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 2, pp.103-110, March-April-2017.