ISSN - 3785 - 0855 JOURNAL OF COMPUTER SCIENCE AND ENGINEERING VOL 2 ISSUE 4 APRIL 2015 Paper 23 A novel approach for congestion control in wireless network Mehta Ishani *1 , Udit Narayan Kar #2 , Dr. Atul Gonsai #3 * M.Tech. Student, Computer Science, Gardi Vidyapith Rajkot, Gujarat, India 1 ishani.mehta91@gmail.com #2 Research Scholar #3 Associate Professor Computer Science, Saurastra University Rajkot, Gujarat, India 2 uditnarayankar@gmail.com 3 atul.gosai@gmail.com Abstract— Congestion control in packet switching networks became a high priority in network design and research due to ever-growing network bandwidth and intensive network applications. Dozens of various congestion control strategies have been proposed, and more are forthcoming. Based on control theory concepts congestion control can be viewed as control policy to achieve prescribed goals (e.g., round-trip delay or throughput) in a distributed network environment. This paper discusses the advantages, disadvantages and the applications of various congestion control protocols for wireless networks. It explores the motivation behind the design of congestion control protocols which is suitable to large scale wireless network and abolish drawbacks of the most widely accepted two algorithms of TCP and RCP. Keywords— TCP- Transmission control protocol, RCP- Rate control protocol 1. INTRODUCTION Congestion in packet switched network is a state in which performance degrades due to the saturation of network resources such as communication links, processor such as communication links, processor cycles, and memory buffers. Adverse effects resulting from such congestion include the long delay of message and possible network collapse, when all communication in the entire network ceases. Network congestion is like traffic jams in big cities and is becoming real threats to the growth of network interconnections and communication applications A large number of various congestion control schemes have been implemented in real networks. Consider the networking situation from ISP’s viewpoint. When all the internet users start sending data at their full speed, they may create bottleneck condition. In metro cities, much of the corporate work is depended on Internet especially during crowded office hours. ISP’s networks, when combined for the entire city, makes it a large crowded network, where end users are generally wireless making it even a larger scale wireless network. The interesting part of data network is that, the traffic is bursty and in most situations, bursty traffics are unpredictable and random by behaviour. The irregular pattern of traffic makes the situation even more difficult to control and networking processes induce complexity into the computation as well. In such a situation there is an immense need of researchers’ contribution to the solution for this problem. By means of this paper, the authors have shown the strategy of congestion control and tried to improve the situation by means of new approach based on existing protocols like RCP and TCP[4]. Here we come up with a novel approach enhanced rcp in wireless network. 2. TCP TCP fulfills two important functions: (1) Reliable and ordered delivery and (2) Congestion control. Congestion can be detected by Packet loss or Packet delay. Solution of this problem is limiting sender’s transmission rate. Now question arise, at what rate should the data be sent for the current network path? [5, 8] The approach given in [1] paper improves the bandwidth utilization for each epoch. It improves the fairness and throughput of the network. The basic concept of this algorithm is based on the decrease in the initial window size for occurrence of every congestion event. w(t+1) = w(t) + α, if congestion is not detected, or w(t+1) = (w(t) * β) + k, if congestion is detected, (1) Where k is the increment in congestion window size (w) in t cycles or epoch. The graph (see fig-2.1) shows the bandwidth utilization in improved Additive Increase Multiplicative Decrease (AIMD) for each round trip time. When the flow exceeds the threshold, only the initial window is decreased,