Enhanced AODV for wireless networks

Author

Suman, Sandeep ; Balkrishan

Author_Institution

Dept. of Comput. Sci. & Eng., Baba Hira Singh Bhattal Inst. of Eng. & Technol., Lehragaga, India

fYear

2010

Firstpage

246

Lastpage

249

Abstract

Routing Overhead is an important issue of any Routing Protocol in wireless networks. It incurs during broadcast of Route Request packets (RREQ) during route discovery & broadcast of HELLO packets during link connectivity. A new routing protocol called Enhanced Ad-hoc on Demand Distance Vector (E-AODV) routing protocol has been proposed in this paper which merges the Blocking Expanding Ring Search (B-ERS) & Routing packets as HELLO packets techniques to reduce routing overhead. Results shows that, performance of E-AODV routing protocol is better than existing AODV in wireless networks.

Keywords

ad hoc networks; routing protocols; wireless sensor networks; HELLO packets; blocking expanding ring search; enhanced AODV; enhanced ad-hoc on demand distance vector routing protocol; link connectivity; route discovery; route request packets; routing overhead; wireless ad-hoc networks; Ad hoc networks; Analytical models; Bit error rate; Broadcasting; Computer science; Educational institutions; Performance analysis; Routing protocols; Wireless communication; Wireless networks; AODV; Ad hoc network; Hello Message; Routing protocols; Stop instruction;

fLanguage

English

Publisher

ieee

Conference_Titel

Advance Computing Conference (IACC), 2010 IEEE 2nd International

Conference_Location

Patiala

Print_ISBN

978-1-4244-4790-9

Electronic_ISBN

978-1-4244-4791-6

Type

conf

DOI

10.1109/IADCC.2010.5423001

Filename

5423001