Implementation of Adaptive Tunicate Swarm Algorithm for Congestion Control and Link Failure Avoidance in Mobile Ad Hoc Networks

-Recently, there has been an increased focus on mobile Ad Hoc networks, or MANETs, and their infrastructure-less plug-and-play model. A MANET is made up of randomly distributed nodes with wireless connections. In a MANET, packet loss may result from node or link failure. As a result, strategies for selecting an alternate route or relieving traffic through diversion routes receive minimal thought. In order to reduce congestion and route faults caused by skipped routes in MANETs, a congestion control routing approach was developed. To transport data effectively, a lot of roads are constructed, and the shortest pathways are discovered. Here, a traffic-distribution method called the adaptive tunicate swarm approach (adaptive TSA) is created to prevent congestion by spreading traffic along many channels. Additionally, a newly developed fitness function that takes throughput, latency, and distance into account. Whenever a source node detects congestion along a path, it uses its neighbor’s congestion indicator bit to disperse traffic over other pathways. Through simulation-based experiments, it is shown that the suggested paradigm is workable and achieves higher throughput with lower overhead and packet losses. Packet delivery ratio (PDR), throughput, and latency measurements are used in this investigation.

Authors

Institutions

Publication Details

Published
2024-08-29
DOI
https://doi.org/10.1109/iceect61758.2024.10738882
Citations
1
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Implementation of Adaptive Tunicate Swarm Algorithm for Congestion Control and Link Failure Avoidance in Mobile Ad Hoc Networks

Anil Kumar Bandani, K. Satya Prasad, Makam Venkata Subramanyam
1 citations
Mobile Ad Hoc Networks
0.35
article

Implementation of Adaptive Tunicate Swarm Algorithm for Congestion Control and Link Failure Avoidance in Mobile Ad Hoc Networks

Anil Kumar Bandani, K. Satya Prasad, Makam Venkata Subramanyam
article en
1 citations

Abstract

-Recently, there has been an increased focus on mobile Ad Hoc networks, or MANETs, and their infrastructure-less plug-and-play model. A MANET is made up of randomly distributed nodes with wireless connections. In a MANET, packet loss may result from node or link failure. As a result, strategies for selecting an alternate route or relieving traffic through diversion routes receive minimal thought. In order to reduce congestion and route faults caused by skipped routes in MANETs, a congestion control routing approach was developed. To transport data effectively, a lot of roads are constructed, and the shortest pathways are discovered. Here, a traffic-distribution method called the adaptive tunicate swarm approach (adaptive TSA) is created to prevent congestion by spreading traffic along many channels. Additionally, a newly developed fitness function that takes throughput, latency, and distance into account. Whenever a source node detects congestion along a path, it uses its neighbor’s congestion indicator bit to disperse traffic over other pathways. Through simulation-based experiments, it is shown that the suggested paradigm is workable and achieves higher throughput with lower overhead and packet losses. Packet delivery ratio (PDR), throughput, and latency measurements are used in this investigation.

Jawaharlal Nehru Technological University, Kakinada (IN)
Openalex Percentile: Top 37%
Mobile Ad Hoc Networks
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.