Analysis of AODV for finding out ideal queue size

Mobile ad hoc network is a network of wireless node connected using wireless media. Each node operates as a router for all other nodes in the network. Nodes in MANET are mobile and hence change their topology dynamically. From one source to destination node there may be multiple paths. Due to wireless link mobile ad hoc networks are susceptible to many attacks. One popular attack on mobile ad hoc network is packet drop attack (grey hole, black hole). The basic routing protocols used for mobile ad hoc network will handle the issues arise due to mobility and dynamic changing topology of network but do not have any mechanism to detect malicious activities of any node. The other possibility of packet drop is due to limited queue size. In this paper I find out ideal queue size for AODV routing in Mobile ad hoc network so that less chances of packet drop due to limited queue size. I set up an experiment in OPNET and implemented a WLAN with five wireless nodes and generated large amount of TCP traffic. I have created multiple scenarios with different queue size (1,3,5,8, Infinite) set in AODV protocol for each node and compare the throughput of the network and found the ideal queue size for AODV routing.