Advertisement

Chain Routing for Convergecast Small Scale Wireless Sensor Networks

  • C. R. Yamuna Devi
  • Deepak Sunder
  • S. H. Manjula
  • K. R. Venugopal
  • Lalit M. Patnaik
Part of the Communications in Computer and Information Science book series (CCIS, volume 420)

Abstract

Wireless sensor networks have many applications involving autonomous sensors transmitting their data to a sink placed in the network. A protocol by name Chain Routing for Convergecast Small Scale (CRCSS) Wireless sensor networks is proposed in this paper. The set of sensor nodes in the network send the data periodically to the sink located in the area of interest. The nodes who cannot reach sink in one hop choose one of the neighbours for forwarding the data to the sink by forming a chain of links. The selection of forwarding node and the waiting period before forwarding plays an important role in the protocol. The proposed CRCSS protocol exhibits improvement in energy spent per packet and latency per packet for a wireless sensor network as compared to ConverSS protocol for small scale wireless sensor networks. In CRCSS protocol energy spent per packet is independent of the network radius.

Keywords

Communication System Convergecast Routing Energy Latency Multi-hop Networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, T.-S., Tsai, H.-W., Chu, C.-P.: Adjustable Convergecast Tree Protocol for Wireless Sensor Networks. Elsevier Journal on Computer Communications (33), 559–570 (2010)Google Scholar
  2. 2.
    Fu, L., Qin, Y., Wang, X., Liu, X.: Throughput and Delay Analysis for Convergecast with MIMO in Wireless Networks. In: Proceedings of IEEE INFOCOM, pp. 1–20 (2011)Google Scholar
  3. 3.
    Hong, S.-H., Kim, H.-K.: A Multi-hop Reservation Method for End-to-End Latency Performance Improvement in Asynchronous MAC-based Wireless Sensor Networks. IEEE Transactions on Consumer Electronics 55(3), 1214–1220 (2009)CrossRefGoogle Scholar
  4. 4.
    Bernsen, J., Manivannan, D.: Greedy Routing Protocols for Vehicular Ad Hoc Networks. In: Proceedings of International Wireless Communication and Mobile Computing Conference, IWCMC 2008 (2008)Google Scholar
  5. 5.
    Kam, C., Schurgers, C.: ConverSS: A Hybrid MAC/Routing Solution for Small-Scale Wireless Networks. IEEE Transactions on Mobile Computing 10(9), 1227–1236 (2011)CrossRefGoogle Scholar
  6. 6.
    Zhang, X., Liang, W., Yu, H., Feng, X.: Optimal Convergecast Scheduling Limits for Clustered Industrial Wireless Sensor Networks. International Journal of Distributed Sensor Networks, 1–12 (October 2012)Google Scholar
  7. 7.
    Zhang, H., Osterlind, F., Soldati, P., Voigt, T., Johansson, M.: Rapid Convergecast on Commodity Hardware: Performance Limits and Optimal Policies. In: 7th Annual IEEE Secon, Sensor Mesh and Ad Hoc Communications and Networks (SECON), pp. 1–9 (2010)Google Scholar
  8. 8.
    Augustine, J., Han, Q., Loden, P., Lodha, S., Roy, S.: Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. International Journal of Foundations of Computer Science 24(1), 31–50 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Theoleyre, F.: A Route-Aware MAC for Wireless Multihop Networks with a Convergecast Traffic Pattern. The International Journal of Computer and Telecommunications Networking 55(3), 822–837 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • C. R. Yamuna Devi
    • 1
  • Deepak Sunder
    • 1
  • S. H. Manjula
    • 1
  • K. R. Venugopal
    • 1
  • Lalit M. Patnaik
    • 2
  1. 1.Department of Computer Science and EngineeringUniversity Visvesvaraya College of EngineeringBangaloreIndia
  2. 2.Indian Institute of ScienceBangaloreIndia

Personalised recommendations