Simulation and Analysis of Polynomial Congestion Control Algorithms over Mobile Ad Hoc Networks with Various Mobility Scenarios

Vol.1 No.1

Year: 2006

Issue: Jul-Sep

Title: Simulation and Analysis of Polynomial Congestion Control Algorithms over Mobile Ad Hoc Networks with Various Mobility Scenarios   

Author Name: Kalpana M, Chandrasekaran M   

Synopsis:   

This paper deals with the analysis of the TCP (Transmission Control Protocol) performance over Mobile Ad Hoc Networks. These networks are assumed with an implementation of a class of non-linear congestion control algorithms called polynomial congestion control algorithms. Two models of these algorithms are introduced in this paper. They generalize the Additive Increase and Multiplicative Decrease (AIMD) algorithms used for the TCP connections. These algorithms provide additive increase using a polynomial of the inverse of the current window size and provide multiplicative decrease using the polynomial of the current window size. There are infinite numbers of TCP-compatible polynomial algorithms by assuming polynomial of different order. This paper compares the performance of the two models for mobile ad hoc TCP networks with the other TCP algorithms. The analysis is based on the simulations. These simulations are performed using ns2, a discrete event network simulator. The effects of varying transmitting antenna power and height are also studied. Effects of signal interference on the proposed models are also studied. The results show that one of the proposed models performs better under various simulated conditions.