Congestion control algorithm in wireless networks

Abstract

Congestion control is a vital element of computer networks such as the Internet It has been widely discussed in literature that the lack of appropriate congestion control mechanism will lead to undesirable situations such as congestion collapse in a network Due to congestion the network capacity in these situations is almost exclusively used by traffic that never reaches its destination as packets are dropped by intermediate systems A network is congested when one or more network components discard the packets due to lack of buffer space A source of data flow on the network cannot reserve bandwidth across the network to it and the destination If a source transmits the data at a rate too high to be sustained between it and the destination one or more router will begin to queue the packets in the buffers If the queuing continues the buffer will become full and the packets from the source will be discarded causing data loss As the rate of data transmission through the network increases the rate of data reaching the destination also newlineincreases linearly However as the load reaches the networks capacity the buffers become full This increases the response time and lowers the throughput The main objective of this thesis is to reduce the rate of transmissions which can be sustained by the network thus preventing the loss of data due to congestion One prime aim is that the proposed cluster based congestion control algorithm seems to achieve the available bandwidth in a fair manner with TCP based applications Thus creating the category of TCP friendly congestion control mechanisms newline newline