Ant Colony

Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Ant Colony Optimization in Mobile Ad Hoc
Agarwal
(200711013) Networks Routing Protocol
Supervisor:
Prof. V.
Sunitha

Outline Navneet Agarwal (200711013)

Problem Supervisor: Prof. V. Sunitha
Definition

Terms and
Concepts Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
Related Work

Analysis of
existing
September 2008
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Outline

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol 1 Problem Definition
Navneet
Agarwal
(200711013)
Supervisor:
2 Terms and Concepts
Prof. V.
Sunitha

Outline
3 Related Work
Problem
Definition
4 Analysis of existing schemes
Terms and
Concepts

Related Work
5 Open Issues
Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Problem Definition

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol Problem Statement
Navneet To develop Routing Algorithm for Mobile Ad Hoc
Agarwal
(200711013) Network using Ant Colony Optimization.
Supervisor:
Prof. V.
Sunitha Assumptions
Outline 1. Every node has unique unforgeable identity.
Problem 2. All the links are bidirectional.
Definition 3. Nodes may be mobile and network topology may
Terms and
Concepts
change dynamically.
4. Nodes can have different traffic patterns and different
Related Work
energy constraints.
Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Problem Definition

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol Objectives
Navneet 1. Analyze ant colony optimization for Ad Hoc network
Agarwal
(200711013) routing.
Supervisor:
Prof. V.
2. To achieve efficient algorithm considering all issues of
Sunitha routing algorithm of ad hoc network.
Outline

Problem
Outcomes
Definition 1. Algorithm Design.
Terms and
Concepts
2. Simulation results comparing the proposed algorithm
with an existing one.
Related Work
3. Estimation of algorithm parameters.
Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Mobile Ad Hoc Routing related issues

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
(200711013)
Supervisor:
Prof. V.
Algorithm should adaptive of mobility.
Sunitha
The routing overhead should be less.
Outline
Scalable with respect to network size.
Problem
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant colony Optimization related concepts

Ant Colony
Optimization Ant Colony Optimization Concepts
in Mobile Ad
Hoc Networks
Routing
Pheromone: When an ant walking to and from food
Protocol source, it leaves some chemicals on the ground.
Navneet When they have to choose a way out of other then they
Agarwal
(200711013) choose this with probability. But this probability depends
Supervisor:
Prof. V.
on Pheromone.
Sunitha Optimal Path: Due to Shorter Path, ant covers it in less
Outline
time and due to this, Phermone update frequently on
Problem
this path. Therefore, this path attracts more ants.
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant colony Optimization related concepts

Ant Colony
Optimization
in Mobile Ad Simple-ACO [6]
Hoc Networks
Routing Forward ant probabilistic construct solution.
Protocol
Backward ant update pheromone by following same
Navneet
Agarwal path as forward ant follows.
(200711013)
Supervisor:
Prof. V.
Sunitha

Outline

Problem
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Related Work

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
ARA [3]
Agarwal
(200711013)
Reduce overhead by reducing ant size.
Supervisor:
Prof. V. AntHocNet [2]
Sunitha
Try to give efficent ant adaptive algorithm.
Outline
ARAMA [4]
Problem
Definition Localy recover link breaks.
Terms and HOPNET [5]
Concepts

Related Work
Try to improve scalabity by applying zone system.
Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Analysis

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
ACO is a iterative algorithm. Due to mobility links gets
(200711013)
Supervisor:
berk, so there is a majority of chance to not get optimal
Prof. V. path.
Sunitha
Memory requirement is high and processing at every
Outline
node get increase.
Problem
Definition
Reactive algorithms get success only in the presence
Terms and
Concepts of multipath.
Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 parameters

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
(200711013)
Pheromone: Value may be update according network
Supervisor:
Prof. V.
path condition, battery power of nodes, link states, cost
Sunitha of the path.
Outline probability: If probability more depends on pheromone
Problem
Definition
value, it amplifies the problem of initial random
Terms and
fluctuations.
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Open Issues

Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
(200711013)
Supervisor:
Prof. V.
Reduce overhead for Ant routing algorithm.
Sunitha
Control optimization in Mobility.
Outline
Improve scalability.
Problem
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
(200711013)
Supervisor:
Prof. V.
Sunitha

Outline
Thank You
Problem
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant Colony
Optimization
in Mobile Ad
Hoc Networks
Routing
Protocol
Navneet
Agarwal
(200711013)
Supervisor:
Prof. V.
Sunitha

Outline
References
Problem
Definition

Terms and
Concepts

Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant Colony
Optimization
G. Di Caro, M. Dorigo,"AntNet: distributed stigmergetic
in Mobile Ad
Hoc Networks
control for communication networks,”,Journal of
Routing
Protocol
ArtiïňAcial
˛ Intelligence Research 9 , (1998), pp. 317 -
Navneet
365.
Agarwal
(200711013) G. Di Caro, F. Ducatelle, L.M. Gambardella,"AntHocNet:
Supervisor:
Prof. V. an adaptive nature inspired algorithm for routing in
Sunitha
mobile ad hoc networks ”,uropean Transactions on
Outline Telecommunications(Special Issue on Self-Organization
Problem
Definition
in Mobile Networking) 16 (2) (2005).
Terms and
Concepts M. Gunes, U. Sorges, I. Bouazzi,"ARA - the ant-colony
Related Work based routing algorithm for MANETs,”,in Proceedings of
Analysis of the International Conference on Parallel Processing
existing
schemes Workshops (ICPPWâĂŹ02), Vancouver, BC, August
Open Issues 2002, pp. 79-85.
References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar
 Ant Colony
Optimization
O. Hossein, T. Saadawi,"Ant routing algorithm for mobile
in Mobile Ad
Hoc Networks
ad hoc networks”,: Proceedings of the 22nd IEEE
Routing
Protocol
International Performance, Computing, and
Navneet
Communications Conference, Phoenix,Arizona, USA,
Agarwal
(200711013)
April 2003, pp. 281-290.
Supervisor:
Prof. V.
Sunitha
A.J. Wang et al.,"HOPNET: A hybrid ant colony
optimization routing
Outline
algorithm”,(2008),doi:10.1016/j.adhoc.2008.06.001.
Problem
Definition
S. Doriga, T. stutzle,Ant Colony Optimization”, 2004,
Terms and
Concepts MIT press.
Related Work

Analysis of
existing
schemes

Open Issues

References
Modelling and Analysis Group of NeTworks (MAGNeT), DA-IICT, Gandhinagar