Skip to main content

Time-Synchronized Neighbor Nodes Based Redundant Robust Routing (TSN2R3) for Mobile Sensor Networks

  • Conference paper
Wireless Sensor Networks (EWSN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2920))

Included in the following conference series:

Abstract

This paper proposes a new on-demand redundant-path routing protocol considering time synchronization based path redundancy as one of route selection criteria. Path redundancy implies how many possible redundant paths may exist on a route to be built up. Our proposal aims to establish a route that contains more redundant paths toward the destination by involving intermediate nodes with relatively mode adjacent nodes in a possible route. Our approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. We have evaluated the performance of our routing scheme through a series of simulations using the Network Simulator 2 (ns-2).

This paper was supported by the Samsung Advanced Institute of Technology, under the project “Research on Core Technologies ant its Implementation for Service Mobility under Ubiquitous Computing Environment”

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. Bertsekas, D., Gallager, R.: Data Networks, pp. 297–333. Prentice-Hall, New Jersey (1987)

    Google Scholar 

  2. Broch, J., Johnson, D.B., Maltz, D.A.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. Internet Draft, draft-ietf-manet-dsr-00.txt (March 1998)

    Google Scholar 

  3. Agrawal, D.P., Zeng, Q.-A.: Introduction To Wireless and Mobile Systems. Brooks/Cole, a division of Thomson Learning (2003)

    Google Scholar 

  4. Jhonson, D., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  5. Lee, S., Gerla, M.: A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network, 48–54 (July/August 1999)

    Google Scholar 

  6. Leiner, B., Nielson, D., Tobagi, F.: Issues in Packet Radio Network Design. Proceedings of the IEEE 75(1) (January 1987)

    Google Scholar 

  7. Malkin, G.: RIP Version 2 – Carrying Additional Information. Internet Draft, draft-ietfripv2- protocol-v2-05.txt (June 1998) (work in progress)

    Google Scholar 

  8. Moy, J.: Link-State Routing. In: Steenstrup, M.E. (ed.) Routing in Communications Networks, pp. 135–157. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  9. Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced vector routing (DSDV) for mobile computers. ACM SIGCOMM (October 1994)

    Google Scholar 

  10. Perkins, C., Royer, E.: Ad Hoc On-Demand Distance Vector Routing. Proceeding of IEEE WMCSA (February 1999)

    Google Scholar 

  11. Royer, E.M., Toh, C.-K.: A Review of Current Routing Protocols for Ad-Hoc Mobile Networks. IEEE Personal Communications 6(2), 46–55 (1999)

    Article  Google Scholar 

  12. The CMU Monarch Project, The CMU Monarch Project’s Wireless and Mobility Extensions to ns, CS Dept. Carnegie Mellon University (August 1999), http://www.monarch.cs.emu.edu/

  13. The VINT Project, The UCB/LBNL/VINT Network Simulator-ns (version2), http://www.isi.edu/nsnam/ns

  14. Toh, C.-K.: Associativity-based routing for ad hoc mobile networks. Wireless Personal Communications 4(2), 1–36 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Noh, W., Lim, K., Lee, J., An, S. (2004). Time-Synchronized Neighbor Nodes Based Redundant Robust Routing (TSN2R3) for Mobile Sensor Networks. In: Karl, H., Wolisz, A., Willig, A. (eds) Wireless Sensor Networks. EWSN 2004. Lecture Notes in Computer Science, vol 2920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24606-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24606-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20825-9

  • Online ISBN: 978-3-540-24606-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics