zone based ant colony routing

8/6/2019 Zone Based Ant Colony Routing

1/23

1

Zone Based Ant Colony RoutingFor MANETS

A Seminar On

BySripad Raj K.R.

USN:1AP07IS042VIII Semester

Information Science


2/23

2

Agenda

Introdution

Ant Colony Approach

POSANT algorithm

Zone Based Routing using Cluster and Ant Colony Routing with Zones

Comparative study Of Overhead Of POSANT And Ant Colony Routing algorithm

Advantages of Ant Colony Algorithm

Applications


3/23

3

Introduction

What Is Mobile Ad-hoc Network(MANETS)?

a kind of wireless ad-hoc network

Self Configuring

Flexible and does not require an Infrastructure


4/23

4

Ant Colony Approach

Ant colony algorithm aims to find shortest paths from source to destination nodes while also constructing a low cost routing

network.

Ants randomly follow any route to the food source, laying down pheromone trails as they go.

Ants smell the pheromone trails and decide whether to follow the

path or not.

More pheromone concentration in shorter path.

More ants follow the path, making the pheromone scent more


5/23

5

Zone Based Ant Colony Approach

Zone based routing algorithms concentrate on the knowledge of position of nodes for routing in mobile adhoc networks.

In Zone based algorithms, whole network area is being divided into some

regions or zones.

Nodes located in same zone / region are treated as of same group.

This zone based approach increases the network speed as instead of

adhoc basis search, some direction wise search takes place here.

Ant Colony Algorithm is being merged with Zone Based approach tooptimize the speed of networking and minimize the size of storage area.


6/23

6

POSANTAlgorithm

POSANT is reactive, thus a route is searched for only when there is acollection of data packets that are to be sent from a source node to thedestination node.

source node should be supplied probable location of the destination.Information of the position of nodes is used as a heuristic value whichis used to take intelligent decision of routing ants.

In the scenario of real ants, this probable location of destination is beingsupplied by smell of the food particle which acts as the destination.


7/23

7

Zones In POSANT

Zone Selection algorithm:

=absolute ();

if (>= 2 ) = 2;

if ( (=0.0) OR (>7/4 AND 5/4 AND


8/23

8

Route establishment in POSANT

To establish a route from source S to destination D, S launches n forwardants with unique sequence numbers from each zone (3n ants).

At each node forward ant makes a stochastic decision which is based on the

relative position of its neighbor with respect to destination node to selectthe next hop.

After destination node is found, forward ant is being destroyed andbackward ant is being generated with the same sequence number as theforward ant.


9/23

9

Forward ant

Backward ant


10/23

10

Routing with Clustering

Concept of clustering needs grouping of nodes in the network. Thisgrouping depends upon transmission range and number of hop in a group.

Each node group will have a group head called Cluster head having the

responsibility of communication among its member nodes and other clusterheads.

Cluster head should contain addresses of its member nodes as well asboundary information of all clusters in the network.

Member nodes need to store address information of their cluster head andneighbor nodes only.


11/23

11

Routing with Clustering (Cont.)

When information needs to pass from one node to another, member nodesends this information to its corresponding cluster head, which decideswhether the destination node is its own member or not.

If yes, it directly sends the information to the destination node.

If no, it sends the information alone with the id of the destination node toother cluster heads which then start to search in their own clusters.


12/23

12

Ant colony Routing with cluster

Concept of Ant Colony algorithm is merged with clustering algorithm toform ant colony routing algorithm with cluster. This algorithm will

provide advantage of both ant colony and clustering algorithm.

Like ant colony algorithm, here we need not store large routing tables innodes, we need to store only neighboring node information and

previous traversed node information.

As clustering concept only cluster head node need to store pathinformation of its member nodes as well as cluster boundary

information for all clusters in the network.


13/23

13

MaxMinDCluster Formation algorithm:

Step I: At some common time interval, each node initiates 2d rounds of flooding ofinformation exchange (node id) where d is the given heuristic. Each nodemaintains a logged entry ofWINNERarray of length 2d+1 to store the resultsof each round.

Step II: Initially each node sets its winner to be equal to its own node id.

Step III: This is the phase forFLOODMAX where a node chooses the largestvalue among its own WINNERarray and this process continues ford rounds.

Step IV: This FLOODMINphase follows FLOODMAX where a node choosesthe smallest rather than the largest value as its new WINNER.

Step V : After these two d rounds of information exchange a node is able to determine its clusterhead.


14/23

14

Cluster Boundary Formation algorithm

Step I: The cluster head broadcasts get_Position_forAll ( ) request message along with its own location information to get percolated within d hop.

Step II: All member nodes in turn unicasts back the message node_Position ( ) to

the clusterhead.

Step III: Clusterhead receives all the Position values of its members and calculates the maximum limiting coordinates for Left, Right, Up and Down values to

define its boundary.

Step IV: The cluster head then broadcasts the message get_Boundary_values( ) within the d hop transmission range to notify all the member nodes about

the clusterboundary.


15/23

15

Node Clustering with their ClusterHeads


16/23

16

Route establishment in Ant ColonyRouting

Consider a set of data packets comes to source node S with destinationnode D.

S will contact with its Cluster head to confirm whether thedestination node is within the same cluster.

If the destination node is in the same cluster of the source node,cluster head reply back to the source node and algorithm ends execution.

If the destination node is not in the same cluster of the source node,then cluster head of the source node creates n-1 number (n is total clusternumber in this network) of forward ants with unique sequence numbersand send those ants to each and every reachable cluster boundaries,


17/23

17

Route establishment in Ant ColonyRouting (Cont.)

Whenever a forward ant enters a node from one of its neighbors, an entry in the Backward Routing table will be created that stores 1. Identifier of the neighbor which the forward ant is coming from 2. The sequence number of the ant and 3. The identifier of the destination.

After getting destination id from the forward ants, each cluster head start searching the destination id within its member list.

If any of the cluster heads finds that the destination id is its member node, then it destroys the forward ant and creates backward ant.

This backward ant has the same sequence number as the corresponding forward ant and traverses the same path to the source using the information

stored in Backward Routing tables.


18/23

18

Comparision of Overhead of POSANTand Ant Colony Algorithm

(a)Varying zone size (b)Varying Number of Nodes

(c)Varying Mobility (d)Throughput with varying number nodes


19/23

19

Advantage of Zone based ANT colonyover POSANT

The position of the node is known

more accurately than POSANT

More robust

Less overhead


20/23

20

Conclusion and Future work

In the above described approaches, Ant Colony technique merged with Zone

based technique to optimize memory utilization and speed of networking.

Zone based Ant Colony can be used in various mobile networks to reduce

overhead of wire less transmission.

In Zone Based ANT Colony routing algorithm, we are always using shortest

path for routing the data packets. Ants always traverse the shortest path from

source to destination through the source cluster head and destination cluster

head.

Here always the shortest path is selected for routing and load balancing

concept has not been incorporated in this routing algorithm.

We may introduce load balancing by selecting second shortest path sometimes so that the same

set of nodes should not remain selected in the route path always. Thus load


21/23

21

References [1]: F.L. LEWIS, Wireless Sensor Networks, the University of Texas at Arlington.

[2]: Partha Mukhopadhyay, Sandip Boral, Partha Bhattacharyya and Hiranmay Saha, Smart Wireless Sensor Network in Underground Coalmines,Jadavpur University, Kolkata700032,India.

[3]: Yong Yao, Johannes Gehrke, Query Processing for Sensor Networks, Department of Computer Science Cornell University Ithaca, NY 14850.

[4]: Jason Lester Hill, System Architecture for Wireless Sensor Networks, University of California, Berkley.

[5]: Kay Romer and Friedemann Mattern, The Design Space of Wireless Sensor Networks, Institute for Pervasive Computing ETH Zurich.

[6]: Fan Bai, Ahmed Helmy, Comparative Analysis of Algorithms for Tree Structure Restoration in Sensor Network, Department of ElectricalEngineering Univ. of Southern California

[7]: McMahan, M.L., Evolving Cellular Handset Architectures but a Continuing, Insatiable Desire for DSP MIPS. 2000, Texas InstrumentsIncorporated.

[8]: Benjamin McBride, Caterina Scoglio, Sanjoy Das, Distributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing,2061, Kansas State University.

[9]: Payman Arabshahi, Andrew Gray, Ioannis Kassabalidis, Arindam Das, Sreeram Narayanan, Mohamed ElSharkawi, and Robert J. Marks II ,

Adaptive Routing inWireless Communication Networks using Swarm Intelligence, Jet Propulsion Laboratory, University of Washington.

[10]: Soumya Banerjee, Crina Grosan, Ajith Abraham and P. K. Mahanti, Intrusion Detection on Sensor Networks Using Emotional Ants, Institute ofManagement Studies, India, BabesBolyai University, ClujNapoca,BabesBolyai University, ClujNapoca, University of New Brunswick, Canada

[11]: Niranjan Kumar, G. Shankara Narayan, Implementation of Wireless Sensors for Landmine Detection, Hindustan College of Engineering.

[12]: Rajani Muraleedharan and Lisa Ann Osadciw, A Predictive Sensor Network Using Ant System, Department of Electrical Engineering andComputer Science


22/23

22

Any Questions???


23/23

23

CHEERS!!!

HAVE A NICE DAY!!! :D

zone based ant colony routing

Documents