Abstract
Mobile Ad hoc routing is challenging issue due to dynamic and distributed nature of mobile nodes required frequent observed updations of node information to route the packets appropriately, there are several proactive and reactive routing methods and geographical hierarchical routing techniques to route the packets from source to destination effectively. Based on the characteristics of Mobile Ad Hoc Network (MANET) routing protocols the routing techniques should address the distributed, dynamic topology, periodic updates and physical security. We proposed a novel mechanism concentrating to minimize the existing DSDV routing limitations; it is originated from computational geometric concepts. Fortune’s Algorithm (Sweep line method) which address the characteristic complexities of MANET routing and representing the route information in binary search method which minimizes the searching for optimal route.
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
Skiena, S.S.: The algorithm design manual
Subbarao, M.W.: Performance of Routing Protocols for Mobile Ad-Hoc Networks
Mahdipour, E., et al.: Performance Evaluation of DSDV Routing Protocol
Voronoi Diagrams and a Day at the Beach, David Austin Grand Valley State University
http://ww.cs.umd.edu/class/spring2010/cmsc754/Lects/lect11.pdf
Gorbach, M.: Image Stained Glass using Voronoi Diagrams
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rama Krishna, E., Venkat Reddy, A., Rambabu, N., Rajesh Kumar, G. (2011). SLV: Sweep Line Voronoi Ad Hoc Routing Algorithm. In: Das, V.V., Thomas, G., Lumban Gaol, F. (eds) Information Technology and Mobile Communication. AIM 2011. Communications in Computer and Information Science, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20573-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-20573-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20572-9
Online ISBN: 978-3-642-20573-6
eBook Packages: Computer ScienceComputer Science (R0)