A Position Based Ant

Colony Routing Algorithm

for Mobile Ad-hoc
Networks

Under the guidance of

Ms. JAYASHREE S By
Lecturer, CS & E SHARATH S SHEKAR

22-Mar-11 1
Content
Introduction
Network model
Position based routing algorithm
Ant Colony based routing algorithm
POSANT routing algorithm
Conclusion
References

12/8/21 2
Introduction

A Mobile Ad-hoc Network (MANET) is a

self-configuring network of mobile devices
connected by wireless links.

12/8/21 3
Challenging problems in this type of networks is how
to find routes between nodes
Proactive if it calculates routes before they are needed
and tries to keep routing-information to all nodes
every time up-to date.
Reactive routing algorithm establishes one (i.e. or
more) route only when it is needed and does not try to
keep routing information to all nodes always up-to-
date.

12/8/21 4
Position based routing algorithm
 they may fail to find a route or they may find a non-
optimum route in some situations
Face routing
 find a route to the destination if it is possible to extract
locally a planar sub network of a given network
POSANT based on ant colony optimization
 establish optimum paths to the destination using a
number of artificial ants that communicate indirectly
with each other by stigmergy.

12/8/21 5
2.Network Model And Related Routing
Algorithm
To match real situations, considering:
Ad-hoc network is a collection of nodes, each node
having a wireless transmitter and receiver of a
limited range.
The nodes are not assumed to be identical.
A node may have different transmission ranges in
different directions
Different nodes may have different maximal
transmission ranges

12/8/21 6
All communications are bi-directional, i.e. a node
maintains a link to another node if they are able to
exchange a message directly.

Each node is assumed to be aware of its position,

the position of its neighbors and the position of
the destination node.

The time required for an ant to move from one

node to a neighbor node is the same for all nodes.

12/8/21 7
3.Position based routing algorithm
Routing decision is made locally in each node that is
reached in the routing process
GPSR & Compass routing uses this.
GPSR uses 2 modes
 Greedy mode - always progressively closer to the
destination
 Perimeter mode - traverses successively closer faces of a
planar sub graph of the full network connectivity graph,
until reaching a node closer to the destination

12/8/21 8
The route from S to D GPSR fail to find a route
found by GPSR is from S to D.
SABCEFD while the
shortest path is SGHID

12/8/21 9
4.Ant Colony based routing algorithm
The ant colony optimization algorithm (ACO),
is a probabilistic technique for solving
computational problems which can be reduced to
finding good paths through graphs.
In the real world, ants (initially) wander randomly
and upon finding food return to their colony while
laying down pheromone trails.
They have a very high delivery rate and find routes
whose lengths are very close to the length of the
shortest path.

12/8/21 10
Ant colony based algorithm

ANTNET which is proactive:

 Drawback is the number of routing messages that needs
to be sent in the network for establishing routes to the
destination

ANTHOCNET which is reactive routing:

 Drawback is the time needed before a system of paths
between the nodes of the network is established i.e
convergence time

12/8/21 11
(a) Forward ant is sent (b) Backward ant is sent
1. Guarantee message delivery
2. They converge to a route which is very close to the
optimum route

12/8/21 12
Drawbacks
ANTNET requires more number of ants to converge to
a route, results in long convergence time.
ANTHOCNET broadcasts an ant which implies a large
overhead on the network especially when the size of
the network is too big
ANTHOCNET contains a list of the visited nodes, its
size will grow as it goes far from the source and the
routing overhead will be increased

12/8/21 13
5.POSANT routing algorithm
 POSANT is reactive, thus a route is searched for
only when there is a collection of data packets
that are to be sent from a source to destination
node.
 Sending the data packets will start after the
routes are established.
 Concepts:
(a) Zones
(b) Pheromone initialization
(c) Route establishment
(d) Sending data packets
(e) Failure recovery

12/8/21 14
Zones

Zone 1 if θH ≤ π/4
Zone 2 if π/4 ≤ θH ≤ 3π/4
Zone 3 if 3π/4 ≤ θH ≤ π

12/8/21 15
Pheromone Initialization
To start route establishment step, the amount of
pheromone deposited in the edges of the graph
must be initialized
For each node, a pheromone trail is assigned to
each of its outgoing links.
If B is one of the neighbors of A. To initialize the
value of deposited pheromone on AB we follow a
greedy policy, the assigned values decrease with
the zone number.
Amount of pheromone equal to νi will be given to
AB if B belongs to zonei i.e ν1 ≥ ν2 ≥ ν3
12/8/21 16
Route establishment
To establish a route, source launches n forward
ants with unique sequence numbers from each
zone at regular time intervals (3n ants each time).
Here n to be 1.
If forward ant is currently residing in node N and
this node has k neighbors H1, H2, ...,Hk, and φi is
the amount of pheromone assigned to NHi. The
forward ant will select Hi as the next node with a
probability pi which is calculated using the
following equation … (1)

12/8/21 17
Moving from node B to node A, the backward ant
increases the amount of pheromone stored in AB
using the following formula
…….(2)
‘d’ is the length of the traveled path by ant.
g(d) is the decreasing function of d.
w is wait function given by

…..(3)
An evaporation process is given where α < 1

12/8/21 18
Sending data packets
It is important to start sending data packets at an
appropriate time
 Sending them too early, they may be lost or follow long
routes because optimum routes are not established yet.
 Sending them too late increases data delivery delay
Whenever a backward ant is received by the source
node, the average and standard deviation of packet
delays for the corresponding zone is updated

12/8/21 19
Hence, define a fixed size window for each zone
that contains recently received backward ants from
that zone.
The average and standard deviation of delays will
be calculated only for the backward ants in the
window.
When a new backward ant is received we put it in
the window of the corresponding zone and discard
the oldest ant when the widow size has been
reached

12/8/21 20
Suppose αi and σi are the average and standard
deviation of the delays reported by the backward
ants received from zonei and residing in the
window.
 If σi is less than a threshold t, sending forward ants from
zonei is stopped and sending data packets is started.
 If σi, σj < t and αj > αi + c, sending forward ants or data
packets from zonej is stopped. In this formula c is a
constant value which determines how different the
length of the established routes can be.

12/8/21 21
Failure recovery
There are two modes of working
Regular mode: works normally if no link is broken or
no fault exists

Broken mode: if a link between two nodes which are in

data transferring state is broken

12/8/21 22
Algorithm 1: POSANT routing algorithm

for each clock time do

if C = S then
if one of the conditions in Section III-D is true
then
send one datapacket from each of the three
zones of C
else
send one forward ant from each of the three
zones of C
end if
end if
12/8/21 23
for each message m in C’s buffer do
if (m→type = ForwardAnt) or
(m→type = DataPacket) then
NextHop = SelectNextHop(n)
send m to NextHop
if NextHop = D then
m →type = BackwardAnt
end if
else if m→type = BackwardAnt then
find NextHop in C’s BackRouting table
send m to NextHop
IncreasePheromone(NextHop,m)

12/8/21 24
 if NextHop = S then
update averages of packet delay
for the corresponding zone
drop m
end if
end if
end for
Evaporate()
end for

12/8/21 25
Algorithm 2: Select Next Hop

Input: node N
for i = 1 to the number of N’s neighbors do

return neighbor i with probability pi

end for

12/8/21 26
6.Conclusion
Can be used where high data rate transfer is
requires like audio and video transmission
When Convergence time to be short
POSANT does not fail when the network contains
nodes with different transmission ranges
POSANT converges to routes which are close in
length to the shortest path
POSANT is a robust scalable reactive routing
algorithm suitable for mobile ad hoc networks
with irregular transmission ranges

12/8/21 27
REFERENCES
•Shahab Kamali, Jaroslav Opatrny. “A Position Based Ant
Colony Routing Algorithm For Mobile Ad-hoc”, Networks
Journal, VOL 3, NO. 4, APRIL 2008
•M.M.Goswami, R.V. Dharaskar. “Fuzzy Ant colony Based
Routing Protocol for Mobile Ad Hoc Network.
•B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless
routing for wireless networks. In Proc. ACM/IEEE MobiCom
conference, pages 243–254, 2000.
•Mohaamed G. Gouda: “Elements of Network Protocol Design”,
John Wiley & Sons 2004
Websites:
•http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4138126
•http://en.wikipedia.org/wiki/Ant_colony_optimization
•www.britannica.com/.../A-Position-Based-Ant-Colony-Routing
-Algorithm-for-Mobile-Adhoc-Networks

12/8/21 28