Abstract
To deal with invalid route reconstruction problems in Destination Sequenced Distance Vector (DSDV) routing protocol, a Double-Links scheme for DSDV, DLDSDV is proposed. The most distinguished characteristic of DLDSDV is that it needs not any new message exchange for invalid route reconstruction. However, it has to use more memory to store an extra routing table, the secondary routing table. When a node detects a link is broken, the node in DLDSDV employs the secondary routing table to find the neighbor quickly which has a valid route to the destination. We extend the path availability model for MANETs and derive an expression of path holding probability of DLDSDV. Simulation results show that DLDSDV improves the packet delivery ratio and has almost the same routing overhead and end-to-end delay as DSDV.
This research is supported by NSF(Grant No. 61103010, 61103190, 60803100), 863(Grant No. 2012CB933500) and 973(Grant No. 2012AA011001, 2012AA011902).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Perkins, C.E., Bhagwat, P.: Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers. In: Proc. ACM SIGCOMM 1994, London, UK, pp. 234–244 (October 1994)
Khan, K.U.R., Reddy, A.V., Zaman, R.U., Reddy, K.A., Harsha, T.S.: An Efficient DSDV Routing Protocol for WirelessMobile Ad Hoc Networks and its PerformanceComparison. In: The Second UKSIM European Symposium on Computer Modeling and Simulation, India, pp. 506–511 (2008)
Liu, T., Liu, K.: Improvement on DSDV in Mobile Ad Hoc Networks. In: International Conference on Wireless Communications, Networking and Mobile Computing, China, pp. 1637–1640 (2007)
Fotis Diamantopoulos, A.A.: Economides: A performnance study of DSDV-based CLUSTERPOW and DSDV routing algorithms for sensor network applications. In: Proc. 1st International Symposium on Wireless Pervasive Computing, pp. 1–6 (January 2006)
Lee, U., Midkiff, S.F., Park, J.S.: A Proactive Routing Protocol for Multi-Channel. In: Proc. Information Technology: Coding and Computing (ITCC 2005), Las Vegas, Nevada, vol. 2, pp. 710–771 (April 2005)
Kumar, R., Joshi, V., Dhir, V.: Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks. International Journal of Engineering Science and Technology 2(8), 3494–3502 (2010)
Tyagi, S.S., Chauhan, R.K.: Performance Analysis of Proactive and Reactive Routing Protocols for Ad hoc Networks. International Journal of Computer Applications 1(14), 0975–8887 (2010)
Rahman, A.H.A., Zukarnain, Z.A.: Performance Comparison of AODV, DSDV and I-DSDV Routing Protocols in Mobile Ad Hoc Networks. European Journal of Scientific Research 31(4), 566–576 (2009)
Wan, P.-J., Yi, C.-W.: Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In: Proceedings of ACM MobiHoc 2004, p. 108. ACM Press (2004)
Liu, J., Guo, W., Xiao, B.-L., Huang, F.: Path Holding Probability Based Ad Hoc On-Demand Routing Protocol. Journal of Software 18(3), 693–701 (2007)
Fall, K., Varadhan, K.: The ns Manual, University of Southern California, Information Sciences Institute, ISI (2002), http://www.isi.edu/nsnam/ns/nsdocumentation.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, J., Wang, J., Han, G., Li, B., Dou, W. (2012). A Double-Links Scheme for DSDV in Mobile Ad Hoc Networks. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-34038-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34037-6
Online ISBN: 978-3-642-34038-3
eBook Packages: Computer ScienceComputer Science (R0)