Ant routing, searching and topology estimation algorithms for ad hoc netwoks
Read Online
Share

Ant routing, searching and topology estimation algorithms for ad hoc netwoks by Santpal Singh Dhillon

  • 693 Want to read
  • ·
  • 8 Currently reading

Published by IOS Press in Amsterdam .
Written in English

Subjects:

  • Ad hoc networks (Computer networks) -- Programming,
  • Electric network topology,
  • Computer algorithms

Book details:

Edition Notes

Statementdoor Santpal Singh Dhillon.
Classifications
LC ClassificationsTK5105.77 .D46 2008
The Physical Object
Paginationxii, 150 p. :
Number of Pages150
ID Numbers
Open LibraryOL23983332M
ISBN 101586039016
ISBN 109781586039011
LC Control Number2009417186

Download Ant routing, searching and topology estimation algorithms for ad hoc netwoks

PDF EPUB FB2 MOBI RTF

We propose a new routing algorithm based on ant colony optimization for MANETs with global positioning system (GPS) and heuristic methods. In mobile ad hoc networks, every node in different positions has different probabilities to forward the ant to the next hop, so as to greatly reduce the overhead of the packets used for maintaining the Author: Wang Anbao, Zhu Bin. We are propose the ant routing algorithm for Mobile Ad-hoc networks (ARAMA), which is a biological based routing algorithm. This algorithm is inspired from the ant colonies' life. In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and maintain good routes in such networks. Especially reliability and e–ciency are impor- . ] is a routing algorithm for both vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communications in VANETs. MEDAL takes advantage of both the moving directions of vehicles and the destination location to select a neighbor vehicle as the next hop for forwarding Size: 1MB.

the interaction of a multitude of simultaneously interacting agents. A survey of few such algorithms for ad hoc networks is presented here. Keywords: ad-hoc networks, swarm intelligence. GJCST-E Classification: C Ant-Based Routing Schemes for Mobile Ad Hoc Networks. Strictly as per the compliance and regulations of. requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with. Ants-Based Routing in Mobile Ad-Hoc Networks Diplomarbeit der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von: David Jörg Leiter der Arbeit: Prof. Dr. Torsten Braun Forschungsgruppe Rechnernetze und Verteilte Systeme (RVS) Institut für Informatik und angewandte Mathematik. POSITION BASED ROUTING ALGORITHMS FOR AD HOC NETWORKS: A TAXONOMY Silvia Giordano [email protected] ICA-DSC-EPFL CH Lausanne (Switzerland), Ivan Stojmenovic [email protected] SITE, University of .

and we evaluate the performance of the AntHocNet routing algorithm in these scenarios compared to AODV [29], a state-of-the-art MANET algorithm. 2 Routing in mobile ad hoc networks The task of routing is particularly hard in MANETs. Due to the ad hoc and dy-namic nature of these networks, the topology can change continuously, and pathsCited by: Proposal on Multi agent Ants based Routing Algorithm for Mobile Ad-Hoc Networks are free to move, thus the network topology may change dynamically. Therefore, routing protocols must be able However the ant-based algorithms in wireless ad hoc networks have certain drawbacks. In that the nodes depend solely on the ant. central administration. Mobile ad-hoc networks are suitable for temporary communication links. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. The Enhanced Ant Routing Algorithm (EARA) is based on ant algorithms. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive by: 1.