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

Kalpana M*, M. Chandrasekaran**
*Senior Lecturer, Department of ECE, Jayaram College of Engineering and Technology, Trichy
**Assistant Professor, Department of ECE, Government College of Engineering, Salem
Periodicity:July - September'2006
DOI : https://doi.org/10.26634/jse.1.1.773

Abstract

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.

Keywords

Congestion Control, TCP, Non-Linear Algorithms, AIMD, Ns2, Mobile Ad Hoc Networks.

How to Cite this Article?

Kalpana M and Chandrasekaran M (2006). Simulation and Analysis of Polynomial Congestion Control Algorithms over Mobile Ad Hoc Networks with Various Mobility Scenarios. i-manager’s Journal on Software Engineering, 1(1), 46-52. https://doi.org/10.26634/jse.1.1.773

References

[1] Van Jacobson, "Congestion Avoidance and Control," ACM Computer Communication Review, vol,18, pp~ 314-329, Aug. 1988. Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August 1988.
[2] Douglas E. Comer, internetworking withTCP/IP Volume I, Englewood Cliffs, New Jersey, Prentice Hall, I 991 .
[3] W. R. Stevens, TCPllP IIiustrated, Volume 1, Addison- Wesley, Reading, MA, November I 994.
[4] M. Allman and V. Paxson, TCP Congestion Control, Internet Engineering Task Force, April 1 999, RFC 2581 .
[5] Sally Floyd and Kevin Fall, "Promoting the use of end- to-end congestion control in the Internet" /EEEIACM Transactions on Networking, vol. 7(4), pp. 458472, August 1999.
[6] R, Rejaie, M, Handley, and D. Estrin, "RAP: An End-to- end Rate-based Congestion Control Mechanism for Real time Streams in the Internet" in Proc. IEEE /NFOCOM, March I 999, vol. 3, pp, 13371345.
[7] Sally Floyd, "TCP and Explicit Congestion Notification," ACM Computer Commun!cation Rev!ew, vol. 24, pp, 8- 23, Oct. 1995.
[8] Shudong Jin, Liang Guo, Ibrahim Mafia, and Azer 8estavros, "A spectrum of TCP-friendly window-based congestion control algorithms," Tech. Rep, BU-CS-200 I - 015, Computer Science Department, Boston University, July 200 I Available at http://www,cs~bu. eductechreports/200 I -0 I 5-spectrum- tcp-friendly. ps.Z.
[9] Deepak 8ansal and Hari 8alakrishnan, "Binomial congestion control algorithms," in Proceedings of iEEE INFOCOM, April 2001
[10] Y, Richard Yang and Simon S. Lam, "General AIMD congestion control," in Proceed!ngs of ICNP, November 2000,
[11] Zheng Wang and Jon Crowcroft, "A New Congestion Control Scheme: Slow Start and Search (Tri-S)," ACM Computer Commun\cafion Rev!ew, vol, 21, pp 32-43, Janl99l
[12] Lawrence S, Brakmo and Sean W. O'Malley, "TCP Vegas: New Techniques for Congestion Detection and Avoidance," in S/GCOMM '94 Conference on Communications Archifectures and Protocols, (London, United Kingdom), pp. 24-35, Oct. I 994.
[ I 3] D. Bonsai and H. Balakrishnan, "TCP-friendly Congestion Control for Real-time Streaming Applicatlons," Tech. Rep. MIT-LCS-TR-806, MIT Laboratory for Computer Science, May 2000
[ I 4]"ns-2 Network Simulator," http://www.isi.edu/nsnam/ns/, 2000.
[ I 5] S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," /EEE/ACM Transact!ons onNetwork\ng, vol. I , no. 4, Aug. 1993
[ I 6] Tejas Kokje Vijay Kakadia, " Analysis of Congestion Control Strategies For TCP Variants Using Droptail and RED Queuing Disciplines Department of Computer Science University of Southern California, Los Angeles
[17] Xiang Chen, Hongqiang Zhai,Jianfeng Wang, and Yuguang Fang, "TCP Performance over Mobile Ad Hoc Networks"
[18] Jorg Widmer, Robert denda, and Martin Mauve, "A Survey onTCP-Friendly Congestion Control" .
[19] K,Sundaresan, V,Anantharaman, H-Y Hsieh, and R.Sivakumar. "ATP: a reliable transport protocol for ad hoc networks", ACMMoblhoc, Jun.2003.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.