Skip to main content
SpringerLink
Log in

Node Failure Time Analysis for Maximum Stability Versus Minimum Distance Spanning Tree Based Data Gathering in Mobile Sensor Networks

  • Conference paper
  • First Online:
Networks and Communications (NetCom2013)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 284))

  • 696 Accesses

Abstract

A mobile sensor network is a wireless network of sensor nodes that move arbitrarily. In this paper, we explore the use of a maximum stability spanning tree-based data gathering (Max.Stability-DG) algorithm and a minimum-distance spanning tree-based data gathering (MST-DG) algorithm for mobile sensor networks. We analyze the impact of these two algorithms on the node failure times, specifically with respect to the node lifetime (the time of first node failure) and network lifetime (the time of disconnection of the network of live sensor nodes due to one or more node failures). Both the Max.Stability-DG and MST-DG algorithms are based on a greedy strategy of determining a data gathering tree when one is needed and using that tree as long as it exists. The Max.Stability-DG algorithm assumes the availability of the complete knowledge of future topology changes and determines a data gathering tree whose corresponding spanning tree would exist for the longest time since the current time instant; whereas, the MST-DG algorithm determines a data gathering tree whose corresponding spanning tree is the minimum distance tree at the current time instant. We observe a node lifetime – network lifetime tradeoff: the Max.Stability-DG trees incur a lower node lifetime due to repeated use of a data gathering tree for a longer time; on the other hand, the Max.Stability-DG trees incur a longer network lifetime.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. Lindsey, C. Raghavendra, K.M. Sivalingam, Data gathering algorithms in sensor networks using energy metrics. IEEE Trans. Parallel Distrib. Syst. 13(9), 924–935 (2002)

    Article  Google Scholar 

  2. W. Heinzelman, A. Chandrakasan, H. Balakarishnan, Energy-efficient communication protocols for wireless microsensor networks, in Proceedings of the Hawaiian International Conference on Systems Science, Maui, HI, USA, Jan 2000

    Google Scholar 

  3. N. Meghanathan, An algorithm to determine energy-aware maximal leaf nodes data gathering tree for wireless sensor networks. J. Theor. Appl. Inf. Tech. 15(2), 96–107 (2010)

    Google Scholar 

  4. N. Meghanathan, A data gathering algorithm based on energy-aware connected dominating sets to minimize energy consumption and maximize node lifetime in wireless sensor networks. Int. J. Interdiscip. Telecommun. Netw. 2(3), 1–17 (2010)

    Article  Google Scholar 

  5. N. Meghanathan, A comprehensive review and performance analysis of data gathering algorithms for wireless sensor networks. Int. J. Interdiscip. Telecommun. Netw. 4(2), 1–29 (2012)

    Article  MathSciNet  Google Scholar 

  6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to algorithms, 3rd edn. (MIT Press, Cambridge, MA, 2009)

    MATH  Google Scholar 

  7. H. Zhang, J.C. Hou, Maintaining sensing coverage and connectivity in large sensor networks. Wirel. Ad Hoc Sens. Netw. 1(1–2), 89–123 (2005)

    Google Scholar 

  8. A. Farago, V.R. Syrotiuk, MERIT: a scalable approach for protocol assessment. Mobile Netw. Appl. 8(5), 567–577 (2003)

    Article  Google Scholar 

  9. F. Kuhn, T. Moscibroda, R. Wattenhofer, Unit disk graph approximation, in Proceedings of the Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, Oct 2004, pp. 17–23

    Google Scholar 

  10. A.J. Viterbi, CDMA: principles of spread spectrum communication, 1st edn. (Prentice Hall, Englewood Cliffs, 1995)

    MATH  Google Scholar 

  11. T.S. Rappaport, Wireless communications: principles and practice, 2nd edn. (Prentice Hall, Upper Saddle River, 2002)

    Google Scholar 

  12. C. Bettstetter, H. Hartenstein, X. Perez-Costa, Stochastic properties of the random-way point mobility model. Wirel. Netw. 10(5), 555–567 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Jackson State University, Jackson, MS, USA

    Natarajan Meghanathan

Authors
  1. Natarajan Meghanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natarajan Meghanathan .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Jackson State University, Jackson, Mississippi, USA

    Natarajan Meghanathan

  2. Wireilla Net Solutions PTY Ltd, Melbourne, Victoria, Australia

    Dhinaharan Nagamalai

  3. Dept. of CSE, University of Connecticut, Storrs, Connecticut, USA

    Sanguthevar Rajasekaran

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Meghanathan, N. (2014). Node Failure Time Analysis for Maximum Stability Versus Minimum Distance Spanning Tree Based Data Gathering in Mobile Sensor Networks. In: Meghanathan, N., Nagamalai, D., Rajasekaran, S. (eds) Networks and Communications (NetCom2013). Lecture Notes in Electrical Engineering, vol 284. Springer, Cham. https://doi.org/10.1007/978-3-319-03692-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03692-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03691-5

  • Online ISBN: 978-3-319-03692-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation