On Optimising Route Discovery in Absence of Previous Route Information in MANETs

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
2009 IEEE 69th Vehicular Technology Conference Proceedings, 2009, pp. 1 - 5
Issue Date:
2009-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009006335OK.pdf188.11 kB
Adobe PDF
This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYMO, and OLSR and it reduces overheads as number of nodes and traffic increase.
Please use this identifier to cite or link to this item: