Scribd
Upload
37 views

S CC CSC C CC CCC C CCC CCCC CC C C C CC CCC CCC CC CC CCCSCCC

The document discusses ant colony optimization (ACO) and its application to routing in mobile ad-hoc networks. It proposes a zone-based ant colony routing algorithm using clustering that divides the network into zones. The algorithm aims to discover routes with minimum overhead and manage mobility through direction routing and initial cluster formation. Comparisons of the proposed zone-based approach are made against POSANT routing in terms of overhead, hop count, delay, and throughput under varying zone sizes, node numbers, and mobility.

Uploaded by

Kumar Bittu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views

S CC CSC C CC CCC C CCC CCCC CC C C C CC CCC CCC CC CC CCCSCCC

The document discusses ant colony optimization (ACO) and its application to routing in mobile ad-hoc networks. It proposes a zone-based ant colony routing algorithm using clustering that divides the network into zones. The algorithm aims to discover routes with minimum overhead and manage mobility through direction routing and initial cluster formation. Comparisons of the proposed zone-based approach are made against POSANT routing in terms of overhead, hop count, delay, and throughput under varying zone sizes, node numbers, and mobility.

Uploaded by

Kumar Bittu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Abstract

Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms are built on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be further utilized to discover routes by the Ants in optimized way. Zone based ANT colony using Clustering which assures to find shortest route using the Direction Routing principle (In this principle, the source or intermediate node transmits message to several neighbors and the node whose direction is closest to the direction of destination gets selected as the next hop forwarding node.) together with minimum overhead for route discovery and mobility management.

ACKNOWLEDGEMENT
It is matter of great pleasure for me to submit the technical seminar report on Zone based ant colony routing as a part of curriculum for award of Bachelor Of Engineering (Information Science) .

I would like to thanks to my seminar guide Dr. Nirmala Shivananda Prof. and HOD of Dept. of IS&E for her continuous encouragement for selection of seminar topic. Last but not least, I take this opportunity to express my deep sense of gratitude towards all Lecturers , who have helped us in various ways, for preparing my seminar.

ABHAY NARAYAN 4JN08IS001

ii

CONTENTS
1. Introduction 2. Ant Colony routing algorithm 2.1 POSANT routing algorithm 2.1.1 Zones in POSANT 2.1.2 Zone selection algorithm 2.1.3 Route establishment in POSANT 2.1.4 Limitation of POSANT 2.2 Zone based routing algorithm using Cluster 2.3 Ant colony routing with Zones 2.3.1 Initial cluster formation 2.4 Route establishment procedure of Zone based Ant Colony 2.5 Route establishment algorithm of Zone based Ant Colony 2.6 Loop avoidance of Zone based Ant colony algorithm 2 3 3-4 4-5 5 6 6-7 7-9 9-10 10-11 12 1

3. Comparison of POSANT with Zone based Ant colony routing 3.1 Overhead Comparison Between POSANT and Zone based Ant colony using clustering with varying Zone size 3.2 Overhead comparison between POSANT and Zone based Ant colony with varying node number 3.3 Overhead comparison between POSANT and Zone based Ant colony using clustering with varying mobility 3.4 HOP Count Comparison between POSANT and Zone based Ant Colony With Varying number of nodes

13

13-14

14-15

15-16

16-17

iii

3.5.

HOP count comparison between POSANT and Zone based Ant colony with varying mobility 17-18

3.6 Delay comparison between POSANT and Zone based Ant colony algorithm 3.7 Throughput comparison between POSANT and Zone based Ant colony with varying number of nodes 3.8 Throughput comparison between POSANT and Zone based Ant colony with varying mobility 3.9 Advantages of Zone based Ant colony over POSANT 19-20 20 18-19 18

Conclusions References

21

iv

List Of Figures

2.1 Finding angle between SH and SD, and destination node for different zones of network 2.2 2.3 2.4 3.1 3.2 3.3 3.4 3.5 3.6 3.7 Distribution of ant for finding destination. Phase-I divides networks into four networks each with cluster head. Zone based Ant Colony Routing using Clustering Zone size Vs Overhead Number of Node Vs Overhead Mobility Vs Overhead Number of Node Vs HOP Count Mobility Vs HOP Count Number of Node Vs Throughput Mobility Vs Throughput 3 5 7 10 14 15 16 17 18 19 20

You might also like