MARATTO

article

Evaluation and critical comparison of two methods: AG and ACO in ad hoc network

Abstract

In this work, the primary objective is the optimization of routing in ad hoc networks big map, which we studied through two different aspects of artificial intelligence. In the first part, we propose the Genetics algorithm (AG) as a solution to resolve the np-difficult problem of routing optimization in ad hoc networks big map. In the second part, we propose Ant Colony algorithms (ACO) to solve the unicast routing problem for quality of service (QoS) improvement by using parallel programming to significantly reduce the computation time required by this type of problem.

Research topics

  • Mobile Ad Hoc Networks
  • Vehicular Ad Hoc Networks (VANETs)
  • Wireless Networks and Protocols

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.1145/3607720.3607786

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.