Presented By: ARYA.B.S Roll.

No: 32 S7 CS MACE

ABSTRACT

Ant colony optimization (ACO)

Stochastic approach for solving combinatorial optimization problems like routing in computer networks

Food accumulation methodology

Position based routing algorithms (POSANT) Drawback This paper presents
A new routing algorithm for MANET by combining the concept of Ant Colony approach and Zone based routing approach Using clustering to get shortest path with small number of control messages to minimize the overhead.

INTRODUCTION
Wireless Sensor Network Routing Ant colony optimization Zone based routing algorithms

OVERVIEW OF ANT COLONY ROUTING ALGORITHM

Ant colony algorithm (ACO)

It is a stochastic approach for solving combinatorial optimization problems like routing in computer networks.

To find the shortest paths from source to destination nodes The idea of this optimization is based on the observation of how ants optimize food gathering in the nature

The Shortest Path Problem In A Real Ant Colony

A real ant colony is able to find food and follow the shortest path from the nest to the food.

POSANT ROUTING ALGORITHM

POSANT is ant colony optimization based routing algorithm which uses location information to improve its efficiency Zones In Posant

Zone Selection Algorithm of POSANT

if (abs(H) >= z5) H = abs(H) - z5; if(((abs(H) < z1) && (abs(H) >= 0.0)) || ((abs(H) > z4) && (abs(H) <= z5))) ret = 1; elseif (((abs(H) < z2) && (abs(H) >= z1)) || ((abs(H) > z3) && (abs(H) <= z4))) ret = 2; elseif((abs(H) <= z3) && (abs(H) >= z2)) ret = 3; return ret; Where, z5 = 2, z4 = 7/4, z3 = 5/4, z2 = 3/4, z1 = /4.

Route Establishment In Posant

ZONE BASED ANT ROUTING USING CLUSTER

Clustering
Grouping of nodes in the networks

Cluster head Back routing table

Route Establishment Procedure of Zone based ANT Colony

Route establishment Algorithm of Zone based ANT Colony

S unicast data-packet DP to ClusterHead(S) [Data Packet DP consists of Destination Node address + Message M which need to be delivered to D]. CH(S) searches its Member List Table to see if D is a member of CH(S) If CH(S) finds that D is its own member, send feedback to S and deliver the message M to D If CH(S) finds that D is not its own member, CH(S) generates (n-1) forward ants with unique sequence numbers to send them to (n-1) reachable Cluster heads through multi-hop paths. Each forward Ant, is forwarded towards boundary nodes of Cluster(S). From these boundary nodes, forward Ants are sent to those neighbour nodes, which are boundary nodes of other clusters.

Route establishment Algorithm of Zone based ANT Colony (Cont.)

From this boundary nodes of other clusters, forward ants travels to the Cluster head of other Clusters. When forward Ant comes to a Cluster head, sequence number of this forward ant is stored in this Cluster head to keep track of duplicate entry. Each Cluster head checks the sequence number of the forward ant and see if it already has the sequence stored in it.If no, it searches its Member List Table to see if D is its member. Otherwise it kills the forward and as it has already searches for this ant. Thus this algorithm avoids loops.

Route establishment Algorithm of Zone based ANT Colony (Cont.)

When any of the Cluster heads finds that D is its member, it kills the forward Ant and generates Backward Ant with same sequence number. Cluster head which has D as its member node,delivers the message M to D. Then sends back the Backward Ant to the Source node S as a feedback. When a Cluster head finds that D is not its member,it sends the forward ant to its neighbour cluster to search.

Route establishment Flow Chart of Zone based ANT Colony

COMPARATIVE STUDY OF OVERHEAD OF POSANT WITH THAT OF ZONE BASED ANT COLONY ROUTING

Overhead Comparison
By varying Zone size

COMPARATIVE STUDY OF OVERHEAD OF POSANT WITH THAT OF ZONE BASED ANT COLONY ROUTING (Cont..)

By varying Node Number

COMPARATIVE STUDY OF OVERHEAD OF POSANT WITH THAT OF ZONE BASED ANT COLONY ROUTING (Cont..)

By varying Mobility

COMPARATIVE STUDY OF OVERHEAD OF POSANT WITH THAT OF ZONE BASED ANT COLONY ROUTING (Cont..)

Delay Comparison Throughput Comparison

By varying number of nodes

COMPARATIVE STUDY OF OVERHEAD OF POSANT WITH THAT OF ZONE BASED ANT COLONY ROUTING (Cont..) By varying Mobility:

Advantage of Zone based ANT colony over POSANT

Overhead HOP Count Throughput

CONCLUSION

Zone based routing using ant colony optimization aims to support zone based routing with minimum routing overhead for mobile ad hoc networks. The idea behind this zone based routing is to allow the nodes within each zone to get referred with the zone boundaries and control the node. Ant Colony technique merged with Zone based technique to optimize memory utilization, overhead and throughput. In zone based routing, each zone member is aware of its mobility using the zone boundary values. It allows the node to inform about their mobility and thereby enabling the protocol to find the mobile destination quickly with minimum overhead.

Future Work

It always uses 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 using geographical shortest path forwarding technique. So here always the shortest path is selected for routing and load balancing concept has not been incorporated in this routing algorithm. Load balancing can be introduced by selecting second shortest path sometimes in case we have large number of data packets to send so that the same set of nodes should not remain selected in the route path always. Thus load balancing can also be handled in Zone

REFERENCES
1.

Parama Bhaumik, Somprakash Bandyopadhyay. A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network. Dept. Of Information Technology, Jadavpur. MIS group, Indian Institute of Management, Calcutta, India Shahab Kamali, Jaroslav Opatrny. A Position Based Ant Colony Routing Algorithm for Mobile Adhoc Networks. Department of Computer Science and Software Engineering, Concordia University, Montreal, Canada. Alan D, Amis Ravi, Prakash Thai, H.P. Vuong, Dung T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. Department of Computer Science University of Texas at Dallas Richardson, Texas 75083-0688. Silvia Giordano, Ivan Stojmenovic, Ljubica Blazevic. Position Based Routing Algorithms For AD HOC Networks. ICADSC-EPFL CH-1015 Lausanne (Switzerland), SITE, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada and DISCA,IIMAS, UNAM, Direccion Circuito Escolar s/n, Ciudad Universitaria, Coyoacan, Mexico D.F., Mexico, ICA-DSCEPFL CH-1015 Lausanne (Switzerland). Benjamin McBride, Caterina Scoglio, Sanjoy Das. Ant Colony Algorithm for Low Cost Overlay network Routing. 2061, Kansas State University. Distributed Biobjective Payman Arabshahi, Andrew Gray, Ioannis Kassabalidis,Arindam Das, Sreeram Narayanan, Mohamed El-Sharkawi, and Robert J. Adaptive Routing in Wireless Communication Networks using Swarm intelligence. Marks II, Jet Propulsion Laboratory, University of Washington. S. Kamali, J. Opatrny. Ant-Colony Routing in Position-aware Mobile Ad-Hoc Networks. Department of Computer Science and Software Engineering, Concordia University, Montreal,Canada. Fernando, C. and V. Simple ant routing algorithm. Teresa, Proceeding of International Conference on Information Networking, 486{493, Busan, South Korea, 2008. Wu, Z. Y., X. J. Dong, and H. T. Song. Ant-based energy aware disjoint multipath routing algorithm in MANETs. Proceeding of 1st International Symposium on Pervasive Computing and applications, 752{757, Aug. 2006.

2.

3.

4.

5.

6.

7.

8.

9.