AD-HOC WIRELESS NETWORK ROUTING PROTOCOLS AND IMPROVED AODV

Abstract

An ad-hoc network is a collection of mobile nodes forming a temporary network without any centralized administration, so nodes cooperate to route a packet. Limited bandwidth and power are two salient characteristics of this kind of network. Therefore, route construction should consume a minimum of overhead and bandwidth. This paper presents a comparison of routing protocols. Moreover, an improvement is proposed to the Ad-hoc On-demand Distance Vector (AODV) routing protocol that is more suitable for large networks. It is shown that, if node movement is not excessive, the proposed protocol can reduce routing overhead and routing delay under a heavy traffic load, while improving throughput and reducing delay.