Please use this identifier to cite or link to this item:
http://nopr.niscpr.res.in/handle/123456789/62011| metadata.dc.identifier.doi: | https://doi.org/10.56042/jsir.v82i06.1827 |
| Title: | QoS Improvement using Enhanced Manhattan Mobility Model on Proposed Ant Colony Optimization Technique in MANETs |
| Authors: | Kour, Satveer Ubhi, Jagpal Singh Singh, Manjit |
| Keywords: | Bonnmotion-3.0.1;Mobility Models;NS-2.35;Optimization;Routing protocols |
| Issue Date: | Jun-2023 |
| Publisher: | NIScPR-CSIR, India |
| Abstract: | In the current Mobile Ad-hoc Network (MANET) route discovery procedure, traffic overflow and overhead may pose a major challenge for a path finding between communicating nodes. Swarm intelligence technique has been applied for various routing problems. We suggest an ant-based bottleneck routing method for MANET to identify weak links in the chosen route for routing overhead and delay issues. During data exchange, it selects the route using a swarm based technique called Ant Colony Optimization (ACO). Initially, we have created node movements by Enhanced Manhattan Mobility Model (EMMM) and then a bottleneck value based ant colony optimization technique is applied. The simulation results show the improvement over existing ACO technique in terms of mobility and pause time. The Quality of Service (QoS) performance metrics showed improvement of 66% in drop rate, 141% in the packet delivery ratio, 42% in packet overhead, 171% in throughput, and 34% in the average end-to-end delay for mobility experiment. There is an improvement of 82% in drop rate, 108% in the packet delivery ratio, 45% in packet overhead, 171% in throughput, and 49% in the average end-to-end delay for a pause time experiment. |
| Page(s): | 616-628 |
| ISSN: | 0022-4456 (Print); 0975-1084 (Online) |
| Appears in Collections: | JSIR Vol.82(06) [June 2023] |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| JSIR 82(6) 616-628.pdf | 5.43 MB | Adobe PDF | View/Open |
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.