UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 5 | May 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 6
June-2019
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR1907S32


Registration ID:
215185

Page Number

836-840

Share This Article


Jetir RMS

Title

Congestion Controlled Adaptive Routing in Wireless Networks

Abstract

The wide deployment of Wireless network has increased the network traffic. Long congestion and frequent link failures in wireless network lead to more number of packets being dropped and incur high end-to-end delay, thereby degrading the overall performance of the network. For solving the issue of congestion in Wireless network, congestion controlled the adaptive routing mechanism is proposed. The proposed work has three phases namely congestion detection, alternative path computation and Fast retransmit and fast recovery the packets on a new path. Congestion control is mainly incorporated at the transport layer. Congestion in the path can be detected based on the free space available in the buffer. To identify multipath routing and load aware of each node to minimize the data drop but all given approach are using routing base congestion control. Different approaches to congestion avoidance have been introduced in the past few years. The traditional flooding and gossiping algorithm can cause loss of data. Random Early Detection (RED) is an alternative way to reduce packet loss as congestion measure. Instead of dropping only at a full buffer, RED maintains an exponentially weighted-queue length and drops packets with a probability. If the weighted queue length is less than a minimum threshold no arrival packets are dropped. When it exceeds a maximum threshold all packets are dropped. When it is in between minimum and maximum threshold a packet is dropped with a probability that is piecewise linear and increasing function of the CR (Congestion resistant) algorithm. This algorithm will find another way to send the packets and to maintain that, this way is shortest safe way and controls congestion.

Key Words

wireless network, Congestion control, Alternative path computation

Cite This Article

"Congestion Controlled Adaptive Routing in Wireless Networks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.836-840, June 2019, Available :http://www.jetir.org/papers/JETIR1907S32.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"Congestion Controlled Adaptive Routing in Wireless Networks", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp836-840, June 2019, Available at : http://www.jetir.org/papers/JETIR1907S32.pdf

Publication Details

Published Paper ID: JETIR1907S32
Registration ID: 215185
Published In: Volume 6 | Issue 6 | Year June-2019
DOI (Digital Object Identifier):
Page No: 836-840
Country: -, -, - .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002796

Print This Page

Current Call For Paper

Jetir RMS