MIT-World Peace University (MIT-WPU) is a top educational institute located in Pune, India. It is recognized within&nbsp;UGC under Government of Maharashtra Act No. XXXV 2017.&nbsp;

It is part of the MIT group of institutions (established in 1983) which covers 10+ campuses across India and has more than 50,000+ students enrolled across various disciplines at a given point of time. The institute houses 15 schools ranging from Engineering &amp; Technology, Design, Pharmacy, Commerce, Governance among others. It offers undergraduate, postgraduate and PhD programs among different disciplines.&nbsp;

&nbsp;

MIT World Peace University

Mobile ad-hoc network has no infrastructure, it is decentralized in nature and self configuring. MANET is dynamic that is each node can freely in any direction. Hence the main challenge in the MANET is to equip each device to maintain the information to equip the traffic. This paper evaluates analyze and compare various routing protocols in MANET like AODV, AOMDV, DSR, DSD. The simulation is carried out in ns2.35 under Unix platform. The performance metrics used for evaluation are packets delivery ratio, throughput and end-to-end delay. Keywords- AODV, DSDV, DSR, AOMDV, MANET, NS2.

School of Computer Engineering & Technology

Engineering and Technology

World University root node

International Journal of Industrial Electronics and Electrical Engineering

COMPARISON ANALYSIS AND SURVEY OF ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORK1

Congestion deteriorates the network performance. In this paper various congestion control AQM algorithm are analyzed and surveyed with their shortcomings and their advantages. The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congestion in advance and to inform the sender to reduce its sending rate, thereby reducing the number of packets sent in the network and control the congestion. There are several AQM algorithms that controls the congestion. In this paper, we have surveyed, compared and analyzed Random Early Detection (RED), Flow Random Early Detection (FRED), Stabilized Random Early Detection (SRED), Stochastic Fair Queuing (SFQ), Random Exponential Marking (REM), BLUE, Stochastic Fair BLUE (SFB) AQM algorithms. Performance parameter are tested and evaluated in NS2 simulator. After analyzing it was found that RED AQM compared with SFQ and REM achieved best result in terms of delay. SFQ had minimum average ratio and RED had max loos ratio. REM algorithm showed the best result with respect to throughput loss ratio and link utilization. Improvement: After analyzing and comparing several AQM algorithm it was found that no single algorithm can solve all the problems. Hence a research is needed to develop a new AQM algorithm that has good link utilization, is fair enough, has less loss ratio, require less space and easy for configuration

Fulltext

Indian Society for Education and Environment

Comparative Analysis and Comparison of Various AQM Algorithm for High Speed Network

IJLTEMAS, III (IV): ISSN

Survey of End-to-End TCP Congestion Control Protocols

International Journal of Science and Research (IJSR)

Survey of various open source network simulators

Active queue management and congestion control algorithms for high speed networks

Congestion Control in Broadband Multi-service Networks