SLV: Sweep line Voronoi ad hoc routing algorithm

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. © 2011 Springer-Verlag.