Skip to main content

Applying a Minimum Routing Cost Spanning Tree to Many-to-Many in Wireless Sensor Networks

  • Conference paper
Convergence and Hybrid Information Technology (ICHIT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7425))

Included in the following conference series:

  • 2371 Accesses

Abstract

The consequential WSN is one of the faster growing technologies which have many applications in different areas for making various decisions without the human intervention. To enable the enhanced services with many-to-many communication, we have to resolve the major constraints in this sector. On the data routing, imbalanced traffic load and exceeded node involvement would be the foremost factors of frequent death of nodes of intermediate and/or sensing nodes. To mitigate these situations, we propose a novel network design method based on the minimum routing cost spanning tree, and an optimized clustering scheme for many-to-many communication in WSNs. The taking part of routing centroid-cluster head nodes to gather data from the sensing nodes and to forward the data to multiple destinations could be the proficient approach to reduce the number of nodes associated in the network lifetime. This efficient approach is mutually competent to design an effective sensor network with minimum routing cost and to make consequentially lengthen the network lifetime effectively.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandrakasan, A., Amirtharajah, R., Cho, S., Goodman, J., Konduri, G., Kulik, J., Rabiner, W., Wang, A.: Design Considerations for Distributed Microsensor Systems. Proc. on IEEE, 279–286 (May 1999)

    Google Scholar 

  2. Luo, H., Liu, Y., Das, S.: Routing Correlated Data in Wireless Sensor Network. Proc. on the IEEE, 40–47 (2007)

    Google Scholar 

  3. Awang, A.: Multi-sink Routing using Path loss in Multihop Wireless Sensor Networks. In: Proc. on Communications (APCC), pp. 139–144 (October 2011)

    Google Scholar 

  4. Mottola, L., Picco, G.: MUSTER: Adaptive Energy-Aware Multisink Routing in Wireless Sensor Networks. In: Proc. on Mobile Computing, pp. 1694–1709. IEEE (December 2011)

    Google Scholar 

  5. Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.: Collection Tree Protocol. In: Proc on Seventh int’l Conf. Embeded Network Sensor Systems (2009)

    Google Scholar 

  6. Intanagonwiwat, C., Govindan, D., Estrin, D., Heidemann, J., Silva, F.: Direct Deffusion for Wireless Sensor Networking. In: Proc. on IEEE/ACM Trans. Networking, vol. 11, pp. 2–16 (February 2003)

    Google Scholar 

  7. Woo, A., Tong, T., Culler, D.: Tamming The Underlying Challenges of Reliable Multihop Routing in Sensor Networks. In: Proc. on Int’l Conf. Embedded Networked Sensor Systems (2003)

    Google Scholar 

  8. Wu, B., Chao, K.: Spanning Trees and Optimization Poblems. Chapman and Hall (2004)

    Google Scholar 

  9. Dahnil, D.: Energy-Efficient Cluster Formation in Heterogeneous Wireless Sensor Networks: A Comparative Study. In: Proc. on Advanced Communication Technology (ICACT), pp. 746–751 (February 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hosen, A.S.M.S., Cho, G. (2012). Applying a Minimum Routing Cost Spanning Tree to Many-to-Many in Wireless Sensor Networks. In: Lee, G., Howard, D., Kang, J.J., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Lecture Notes in Computer Science, vol 7425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32645-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32645-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32644-8

  • Online ISBN: 978-3-642-32645-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics