Advertisement

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

  • A. S. M. Sanwar Hosen
  • Gihwan Cho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7425)

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.

Keywords

Wireless Sensor Network Cluster Formation Data Routing and Energy Efficiency 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Luo, H., Liu, Y., Das, S.: Routing Correlated Data in Wireless Sensor Network. Proc. on the IEEE, 40–47 (2007)Google Scholar
  3. 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. 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. 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. 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. 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. 8.
    Wu, B., Chao, K.: Spanning Trees and Optimization Poblems. Chapman and Hall (2004)Google Scholar
  9. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • A. S. M. Sanwar Hosen
    • 1
  • Gihwan Cho
    • 1
  1. 1.Division of Computer Science and EngineeringChonbuk National UniversityJeonjuSouth Korea

Personalised recommendations