Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the International Congress on Information and Communication Technology pp 213–222Cite as

On the Dynamic Maintenance of Spanning Tree

  • Conference paper
  • First Online:

  • 1171 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 439))

Abstract

The paper presents a centralized heuristic algorithm for the secure and dynamic maintenance of spanning tree in wireless networks. Initially, we construct the minimum spanning tree that models the given network. Later, in order to reflect the topological dynamics in secure manner, we reorganize the minimum spanning tree. The resulting logical structure is a spanning tree; however, it may not be minimum spanning tree. Our findings have been substantiated with simulation results.

This is a preview of subscription content, 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum weight spanning trees. ACM Trans. Programming Languages and Systems. 5, 1, 66–77 (1983).

    Google Scholar 

  2. Chin, F., Ting, H.: An almost linear time and O(n log n + e) messages distributed algorithm for minimum weight spanning trees. In: 26th IEEE Symp. Foundations of Computer Science. pp. 257–266 (1985).

    Google Scholar 

  3. Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In: 4th ACM Symp. Principles of Distributed Computing. pp. 175–185 (1985).

    Google Scholar 

  4. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: 19th ACM Symp. Theory of Computing, pp. 230–240 (1987).

    Google Scholar 

  5. Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum weight spanning trees. SIAM J. Comput. 27, 302–316 (1998).

    Google Scholar 

  6. Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. J. Algorithms, 28, 40–66 (1998).

    Google Scholar 

  7. Elkin, M.: A faster distributed protocol for constructing minimum spanning tree. In: ACM-SIAM Symp. Discrete Algorithms. pp. 352–361 (2004).

    Google Scholar 

  8. Peleg, D., Rabinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: Proc. of the 40th IEEE Symp. on Foundations of Computer Science, pp. 253–261 (1999).

    Google Scholar 

  9. Tel, G.: Introduction to Distributed Algorithms. 2/e, Cambridge Univ. Press, New York, pp. 209–210 (2000).

    Google Scholar 

  10. Dynia1, M., Korzeniowski, M., Kutylowski, J.: Competitive maintenance of minimum spanning trees in dynamic graphs. In: Proc. Jan van Leeuwen et al. (Eds.): SOFSEM 2007, LNCS 4362, pp. 260–271 (2007).

    Google Scholar 

  11. Flocchini, P., Mesa Enriquez, T., Pagli, L., Prencipe, G., Santoro, N.: Distributed minimum spanning tree maintenance for transient node failures. IEEE Transactions on Computers, 61, 3, 408–414 (2012).

    Google Scholar 

  12. Cattaneo, G., Faruolo, P., Petrillo, U., Italiano, G.: Maintaining dynamic minimum spanning trees: an experimental study. Discrete Applied Mathematics, 158, 404–425 (2010).

    Google Scholar 

  13. Awerbuch, B., Cidon, I., Kutten, S.: Optimal maintenance of a spanning tree. Journal of the ACM, 55, 4, 18:1–18:45 (2008).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology, Kurukshetra, India

    Isha Singh,  Bharti Sharma & Awadhesh Kumar Singh

Authors
  1. Isha Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bharti Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Awadhesh Kumar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isha Singh .

Editor information

Editors and Affiliations

  1. Anil Neerukonda Inst. of Tech. & Sci., Prof., Dept. of Computer Sci. & Engg., Visakhapatnam, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. College of Technology and Engineering, Maharana Pratap Univer. of Agri. & Tech., Udaipur, Rajasthan, India

    Yogesh Chandra Bhatt

  3. Sabarkantha, Sabar Institute of Technology, Tajpur, Gujarat, India

    Amit Joshi

  4. Near MR-10 Crossing SH, Sri Aurobindo Institute of Technology, Indore, Madhya Pradesh, India

    Durgesh Kumar Mishra

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Isha Singh, Bharti Sharma, Singh, A.K. (2016). On the Dynamic Maintenance of Spanning Tree. In: Satapathy, S., Bhatt, Y., Joshi, A., Mishra, D. (eds) Proceedings of the International Congress on Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 439. Springer, Singapore. https://doi.org/10.1007/978-981-10-0755-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0755-2_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0754-5

  • Online ISBN: 978-981-10-0755-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation