Artigo sobre o protocolo aodv

Disponível somente no TrabalhosFeitos
  • Páginas : 12 (2767 palavras )
  • Download(s) : 0
  • Publicado : 21 de março de 2013
Ler documento completo
Amostra do texto
Amandeep et al. / International Journal of Engineering Science and Technology (IJEST)

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS
AMANDEEP
University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com

GURMEET KAUR
University College of Engineering, Punjabi University Patiala, Punjab, India Abstract- Wireless Communication is one of thepopular areas of research these days. The Mobile Adhoc Networks (MANETs) is an infrastructureless network consisting of wireless mobile nodes. MANET is a self configuring network and the topology of the network keeps on changing as the nodes move randomly and organize themselves in an arbitrarily manner. Many protocols have been proposed for such networks. One such protocol is Adhoc On DemandDistance Vector (AODV) routing protocol. AODV is preferred because it minimizes the routing overhead than the other protocols and hence enhancing the performance of the network. In this paper, the performance analysis of AODV routing protocol is done on the basis of few performance metric parameters such as average end-to-end delay, throughput and packet delivery ratio. The simulation is done in MATLAB.Keywords- MANET, AODV, MATLAB 1. Introduction Wireless Communication is one of the emerging technologies which allow users to access information and services electronically, despite their geographical position. Wireless communication can be classified as: Infrastuctured network and Infrastructureless network. Mobile Adhoc network is a special kind of infrastructureless network. It is a collectionof mobile nodes that move randomly and dynamically [1]. Due to the mobile nature of the nodes the network topology keeps on changing. Each node acts as a host and a router forwarding and receiving packets from the other nodes in the network that may not be in the transmission range of the network. The nodes in MANETs discover other nodes dynamically. Routing in such networks is a challenging taskdue to the highly dynamic network topology. The aim of deploying these networks is to provide communication in areas where limited or no connectivity or any communication infrastructure exists. These networks are flexible and can be employed in military rescue operations, interactive lectures, business sharing information and emergency situations [6]. The features of MANETs are highly dynamictopology, bandwidth constrained links, limited physical security and energy constrained nodes. For providing connectivity a MANET uses multi-hop routing rather than a static infrastructure based network. Many protocols have been proposed so far. One such protocol is Adhoc On Demand Distance Vector (AODV) routing protocol. AODV is preferred because it minimizes the routing overhead than the otherprotocols and hence enhancing the performance of the network. In this paper, the performance analysis of AODV routing protocol is done on the basis of few performance metric parameters such as average end-to-end delay, throughput and packet delivery ratio. The simulation is done in MATLAB. The paper is structured as follows: In Section 2, MANET routing protocols are discussed. In Section 3, overviewof AODV routing protocol is given. Section 4 describes the simulation of AODV routing protocol. In Section 5, performance matrices parameters are presented and in Section 6, results and analysis are described. 2. Types of Routing Protocols in MANETs MANET routing protocols are classified as following: 2.1 Table Driven (Proactive) Routing protocols In these protocols, every node maintains one ormore tables containing routing information to every node in the network. All nodes update these tables so as to maintain a consistent and up-to-date view of the network. These protocols are also called as proactive because routing information is maintained by them even before it is required. Since, these protocols maintain node entries for each and every node in the form of table; it causes more...
tracking img