Title:

New Congestion Control Algorithm

For

Wireless Network

Presented By

S.Rajkumar,Mphil (Research Scholar),Alagappa University,Karaikudi.

Guided By

Mr.T.Meyyappan., M.Sc. ,MBA., MPhil., [Ph.D].

Alagappa University, Karaikudi.

Motivation

This research work focuses on congestion control on multi-hop, wireless networks.

In a wireless network, an important constraint is due to the MAC (Media Access Control) layer.

Many wireless MACs use a time –division strategy for channel access. At any point in space, the physical channel can be accessed by a single

user at each instant of time. In this research work, a fair hop-by-hop congestion control algorithm

is proposed. It uses optimization based framework.

In the presence of delay, the hop-by-hop control algorithm has the property of spatial spreading.

Focused loads at a particular spatial location in the network get “smoothed” over space.

Bounds on the “peak load” at a node are derived using both hop-by-hop controls.

Analytical results of this research work are compared with simulated results for time delay, packet loss, and periodic dropping delay variance with wireless network.

Continue….

Introduction

Congestion occurs when the source sends more packets than the destination can handle.

If the source sends more number of packets than the destination buffer can handle, then this congestion occurs.

When congestion occurs, the destination has only two options with the arriving packets, to drop it or keep it.

If the destination drops the new arriving packets and keeps the old packets then this mechanism is called `Y’ model.

If the destination drops the old packets and fills them with new packet, then this mechanism is called Milk model.

In both the cases packets are dropped. Two common ways to detect congestion are timeout and duplicate

acknowledgement

Congestion control

Congestion control can be used to calculate the amount of data the sender can send to the destination on the network.

Determining the amount of data is not easy, as the bandwidth changes from time to time, the connections get connected and disconnected.

Based on these factors the sender should be able to adjust the traffic. TCP congestion control algorithms are used to detect and control

congestion.

Existing Method JELLYFISH ATTACK METHOD

A critical strength of the JellyFish Attack is that it maintains compliance with all control plane and data plane protocols in order to make detection and diagnosis costly and time consuming.

The key principle that JF use to facilitate the attack is targeting end-to-

end congestion control. CONGESTION CONTROL WITH DELAY METHOD

The time resource was large enough so that queuing in the presence of feedback delay.

Proposed Methods JF Reorder Attack:

In this attack, JF deliver all packets, yet after placing them in a re-

ordering buffer rather than a FIFO buffer. JF Periodic Dropping Attack:

JF periodic dropping attack in which attacking nodes drop all packets

for a short duration. JF Delay Variance Attack:

JF delay variance attackers are wait for a variable amount of time before servicing each packet, maintaining FIFO order, but significantly

increasing delay variance.

Results & Discussion In this wireless congestion control with out scheduling,

although time delay is minimum., there are chances for packet loss.

In wireless congestion control with scheduling time delay is high but packet loss is eliminated and packet reach the correct destination.

In existing methods, the following problems are prevailing: 1. Packet loss 2. Time Delay 3. Source to destination communication loss

In proposed method, the problem of packet loss, time delay, are removed to the maximum extent possible. The packets reaching destination are ensured

JF-Reorder effect on throughput

JF-Drop effect on Throughput

Jelly Fish Reorder Attacks

JF Reorder Attack- Time Delay Packet Loss Tracking

Jelly Fish Periodic Dropping Attacks

JF Dropping Attack- Time Delay Packet Loss Tracking

Jelly Fish Delay Variance Attacks

JF Delay Variance Attack- Time Delay Packet Loss Tracking

Congestion Control

without Scheduling with Scheduling

Graph Showing

Without Scheduling With Scheduling

CONCLUSION Attacks are studied in a variety of settings and the quantification of the

damage they can inflict are provided. Such attacks can actually increase the capacity of ad hoc networks as

they will starve all multihop flows. System clearly considers fairness measures and the mean number of

hops for a received packet, as critical performance measures for a system under attack.

One Tower using wireless connection, controls all the transfer of data from source to destination.

The congestion control parameters such as, Packet loss(through Graph) and time delay are measured in two proposed methods namely congestion control with scheduling and congestion control without scheduling.

In this wireless congestion control with out scheduling, although time delay is minimum, there are chances for packet loss.

In wireless congestion control with scheduling time delay is high but packet loss is eliminated and packet reaches the correct destination.

In existing methods the following problems are prevailing.1. Packet loss2. Time Delay3. Source to destination communication loss

In proposed method, the problem of packet loss, time delay, are removed to the maximum extent possible.

The packets reaching destination are ensured.

Continue…..

QUERIES???

THANK YOU