An improved AODV Routing Protocol of wireless sensor network

Author

Li Qiong ; Yang Jun

Author_Institution

Sch. of Math. & Comput. Sci., Ningxia Univ., Yinchuan, China

fYear

2012

fDate

9-11 Nov. 2012

Firstpage

1

Lastpage

4

Abstract

This paper researches optimization problems of AODV Routing Protocol in wireless sensor networks. In order to make more extensive use of the AODV routing protocol, AODV routing protocol needs improved optimization. The routing table in AODV maintains only one route to the destination node and the source node needs to re-initiate the route discovery process as a route fails. To solve this problem, an improved method is presented. A backup routing table is built when the node movement speed is less than a threshold value. Simulation results show that this method can decrease the average delay, throughput and routing load, and improve the capability of the network.

Keywords

optimisation; routing protocols; wireless sensor networks; AODV routing protocol; ad hoc on-demand distance vector; optimization problems; route discovery process; routing table; wireless sensor network; Ad hoc networks; Delay; Load modeling; Routing; Routing protocols; Wireless sensor networks; WSNs; improvement; routing protocol; simulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Analysis and Signal Processing (IASP), 2012 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-4673-2547-9

Type

conf

DOI

10.1109/IASP.2012.6425058

Filename

6425058