Skip to main content

SMSR: A Scalable Multipath Source Routing Protocol for Wireless Sensor Networks

  • Conference paper
Ubiquitous Intelligence and Computing (UIC 2009)

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

Included in the following conference series:

Abstract

In wireless sensor networks (WSNs), providing resilience (fault tolerance) is a challenging issue. A lot of multipath routing protocols, therefore, have been proposed to achieve the goal; however, they usually suffer from control message overhead or a lack of scalability. Although some protocols utilize partially disjoint paths or longer alternate paths in order to reduce such overhead, they cannot guarantee resilience, because a single failure on a shared node breaks all the paths. In this paper, we therefore propose a scalable multipath source routing (SMSR) protocol. In SMSR, a sink node collects each sensor node’s one-hop upstream neighbor information during an initialization phase which the sink node then uses in order to construct several shortest node-disjoint downstream (sink-to-sensor) paths. When transmitting downstream packets, the source routing technique is exploited. On the other hand, each sensor node forwards upstream (sensor-to-sink) packets to one of its upstream neighbors, through the concept of gradient-based routing. The initialization phase depends on only one-time flooding and n (network size) times unicasting, and each sensor node manages only one-hop upstream neighbor information. In this sense, SMSR is scalable in terms of the overhead and the size of routing tables in sensor nodes. Particularly, since SMSR provides several node-disjoint paths with low overhead, it can guarantee resilience efficiently. Through experiments using both ns-2 simulation and our real world test-bed, we verify that SMSR achieves the goal better than other existing routing protocols.

This work was supported by Electronics and Telecommunications Research Institute (ETRI).

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. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8), 102–114 (2002)

    Article  Google Scholar 

  2. Al-Karaki, J.N., Kamal, A.E.: Routing Techniques in Wireless Sensor Networks: A Survey. IEEE Wireless Communications 11(6), 6–28 (2004)

    Article  Google Scholar 

  3. Ganesan, D., Govindan, R., Shenker, S., Estrin, D.: Highly Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks. ACM SIGMOBILE Mobile Comp. Commun. Rev. 5(4), 11–25 (2001)

    Article  Google Scholar 

  4. Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Proc. of ACM MobiCom 2000 (August 2000)

    Google Scholar 

  5. Thulasiraman, P., Ramasubramanianand, S., Krunz, M.: Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network. In: Proc. of IEEE INFOCOM 2007 (May 2007)

    Google Scholar 

  6. Nasipuri, A., Castaneda, R., Das, S.R.: Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks. ACM/Kluwer Mobile Networks and Applications (MONET) Journal 6(4), 339–349 (2001)

    Article  MATH  Google Scholar 

  7. Wang, L., Zhang, L., Shu, Y., Dong, M.: Multipath Source Routing in Wireless Ad Hoc Networks. In: Proc. of IEEE CCECE 2000 (March 2000)

    Google Scholar 

  8. Marina, M.K., Das, S.R.: On-demand Multipath Distance Vector Routing in Ad Hoc Networks. In: Proc. of IEEE ICNP 2001 (November 2001)

    Google Scholar 

  9. Suurballe, J.W.: Disjoint Paths in a Network. Networks 4(2), 125–145 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  10. Sidhu, D., Nair, R., Abdallah, S.: Finding Disjoint Paths in Networks. ACM SIGCOMM Computer communication Review 21(4), 43–51 (1991)

    Article  Google Scholar 

  11. Ogier, R., Rutenburg, V., Shacham, N.: Distributed Algorithms for Computing Shortest Pairs of Disjoint Paths. IEEE Transactions on Information Theory, 443–455 (March 1993)

    Google Scholar 

  12. Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. RFC4728 (February 2007)

    Google Scholar 

  13. Chakeres, I.D., Perkins, C.E.: Dynamic MANET On-demand (DYMO) Routing, draft-ietf-manet-dymo (work in progress), Internet Draft (November 2007)

    Google Scholar 

  14. Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Ad hoc On-demand Distance Vector (AODV) routing. RFC 3561 (July 2003)

    Google Scholar 

  15. Embedded S/W research division web site, Electronics & Telecommunications Research Institute (ETRI), http://www.qplus.or.kr/

  16. VINT Group, UCB/LBNL/VINT Network Simulator ns (version 2), http://www.isi.edu/nsnam/ns/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oh, S., Kim, D., Kang, H., Jeong, HJ. (2009). SMSR: A Scalable Multipath Source Routing Protocol for Wireless Sensor Networks. In: Zhang, D., Portmann, M., Tan, AH., Indulska, J. (eds) Ubiquitous Intelligence and Computing. UIC 2009. Lecture Notes in Computer Science, vol 5585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02830-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02830-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-02830-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics