Offering New Routing Method in Ad hoc Networks Using Ant Colony Algorithm

EasyChair Preprint no. 7591

Abstract

The aim of this study is to provide a novel method of routing in ad hoc networks using ant colony algorithm. Hence for this study, the researcher attempts to discover and create routes with less number of crossings, nodes sustainable and less energy transfer, to reduce latency end-to-end, save bandwidth and extend the life and increase the lifetime of the network nodes. The research methodology for the simulation algorithm has been OPNET software. Therefore, the proposed algorithm`s performance was compared with one of the most routing algorithms in mobile ad hoc networks AntHocNet. The results showed that the proposed algorithm compared with AntHocNet has more end-to-end delay, more package shipping, and less routing overhead can reduce energy consumption and thus increases the lifetime of the network nodes. The results of this study indicate that the latency end-to-end, saving bandwidth and increasing lifetime of nodes and network lifetime can be predicted by the proposed algorithm.

Keyphrases: ad hoc networks, ant colony algorithm, Routing, simulation

@Booklet{EasyChair:7591,
  author = {Shirmohammad Tavangari and Aref Yelghi},
  title = {Offering New Routing Method in Ad hoc Networks Using Ant Colony Algorithm},
  howpublished = {EasyChair Preprint no. 7591},

  year = {EasyChair, 2022}}