Skip to main content
SpringerLink
Log in

SLV: Sweep Line Voronoi Ad Hoc Routing Algorithm

  • Conference paper
Book cover Information Technology and Mobile Communication (AIM 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 147))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Skiena, S.S.: The algorithm design manual

    Google Scholar 

  2. http://en.wikipedia.org/wiki/Euclidean_space

  3. Subbarao, M.W.: Performance of Routing Protocols for Mobile Ad-Hoc Networks

    Google Scholar 

  4. Mahdipour, E., et al.: Performance Evaluation of DSDV Routing Protocol

    Google Scholar 

  5. http://en.wikipedia.org/wiki/Nearest_neighbor_search

  6. Voronoi Diagrams and a Day at the Beach, David Austin Grand Valley State University

    Google Scholar 

  7. http://ww.cs.umd.edu/class/spring2010/cmsc754/Lects/lect11.pdf

  8. Gorbach, M.: Image Stained Glass using Voronoi Diagrams

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VITS, Karimnagar, Andhra Pradesh, India

    E. Rama Krishna & G. Rajesh Kumar

  2. JITS, Karimnagar, Andhra Pradesh, India

    A. Venkat Reddy

  3. SCCE, Karimnagar, Andhra Pradesh, India

    N. Rambabu

Authors
  1. E. Rama Krishna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Venkat Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Rambabu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Rajesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. MES College of Engineering, Kuttippuram, Kerala, India

    Gylson Thomas

  3. Binus University, Jakarta, Indonesia

    Ford Lumban Gaol

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation