Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Article ID

X6J2M

Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Dr. Shweta Modi
Dr. Shweta Modi
Jitendra Prithviraj
Jitendra Prithviraj SRIT
DOI

Abstract

Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Ant colony optimization (ACO) is a population based meta-heuristic for combinatorial optimization problems such as communication network routing problem. In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way, back they choose the path with the highest pheromones which becomes the shortest path. But Ant net Algorithms may cause the network congestion and stagnation. Here, multiple optimal paths are proposed with negligible overhead in spite of single optimal path in Ant net routing algorithm, so that the problem of stagnation can be rectified. This paper proposes an improved Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead.

Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Ant colony optimization (ACO) is a population based meta-heuristic for combinatorial optimization problems such as communication network routing problem. In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way, back they choose the path with the highest pheromones which becomes the shortest path. But Ant net Algorithms may cause the network congestion and stagnation. Here, multiple optimal paths are proposed with negligible overhead in spite of single optimal path in Ant net routing algorithm, so that the problem of stagnation can be rectified. This paper proposes an improved Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead.

Dr. Shweta Modi
Dr. Shweta Modi
Jitendra Prithviraj
Jitendra Prithviraj SRIT

No Figures found in article.

Jitendra Prithviraj. 1970. “. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 4): .

Download Citation

Journal Specifications
Classification
Not Found
Keywords
Article Matrices
Total Views: 20530
Total Downloads: 10714
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Dr. Shweta Modi
Dr. Shweta Modi
Jitendra Prithviraj
Jitendra Prithviraj SRIT

Research Journals