A PROJECT ON

ANT COLONY
OPTIMIZATION
TECHNIQUE FOR
MANETS.
TO
MRS. DEEPTI GAUR MAM

SUBMITTED BY:
ANKIT GUPTA
14CSU028
B.TECH CSE

(FOURTH SEM)

ABOUT THE PROJECT

The purpose of this project is to provide a clear understanding of the Ants-based
algorithm , by giving a formal and comprehensive systemization of the project.

The ant colony aptimization algorithm(ACO) is a probabilistic technique for solving

computational problems which can be reduced to finding good paths through graphs.
This algorithm is a member of ant colony algoritms family,in swarm intelligence metods,
the first algorithm was aiming to search for optimal path in a graph;based on the
behaviour of ants seeking a path between their colony and a source of food. The original
ideas has since diversified to solve a wider class of Numerical problems, and as a result
several problems have emerged, drawing on various aspects of the behaviour of ants.

Mobile ad hoc networks (MANETs) are collection of distributed nodes which communicate
using multi-hop wireless links. In MANET, nodes work for tasks of similar goal (common
interest). So, most of the nodes try to access the similar data at different period. By
using Data cache system (DCS), we can improve the efficiency of MANET to some
extent. Ant Colony Optimization (ACO) technique is used to enhance the efficiency of
data cache system in MANET at higher level. ACO technique improves the data transfer
speed by finding optimal path between nodes of MANET in dynamic fashion.

ANT COLONY OPTIMIZATION

When searching for food ants follow a relatively basic set of rules. Although simple, it's
these rules which allow ants to communicate and cooperatively optimize their paths to
food sources. One of the key characteristics behind all these rules is the use of
pheromone trails. Pheromone trails are essentially what ants use to communicate to
other ants that a food source has been found, and how to get to it. When other ants
come across pheromone trails they can typically expect to find food if they decide to
follow it. However, ants don't follow every pheromone trail they find. Depending on the
strength of the pheromone trail, an ant may decide to take a different path, or perhaps a
completely random path which has no pheromone on. However, on average the stronger
a pheromone trail is, the more chance there is of an ant taking it.

Although the original pheromone trail may be stronger at this point, a second pheromone
trail has started to develop from the few ants randomly taking it. What's important is
that in this scenario the second path has an advantage because the ants taking it will
reach, and retrieve, the food quicker than ants following the other path. For example, it
may take 3 minutes for one ant to lay a single pheromone trail from the food back to the
colony taking the original path, but in that time an ant may be able to lay two

pheromone trails when taking the shorter path. Due to this characteristic the shorter
path will usually begin to acquire more pheromone than the original path. This then
leads to the original pheromone trail being used less and eventually evaporating in favor
of the new shorter path.

E-R DIAGRAM

Cust_Name

Model no

Customer Id

Buys a

Custome
r

Mobile

Type

Name
Company Name

Has a

Network

Price
Number

Address

Distributed

May Have
Location

Node
Repair Cost

Damag
e

IP Address
Act as

Description
IP Address
Host
MAC Address

Reaches At

Location
Destination
Node

IP Address

NORMALIZATION
Normalization is the process of reorganizing data in a database so that it meets two
basic requirements: (1) There is no redundancy of data (all data is stored in only one
place), and (2) data dependencies are logical (all related data items are stored
together). Normalization is important for many reasons, but chiefly because it allows
databases to take up as little disk space as possible, resulting in increased performance.

Normalization is also known as data normalization.

The three main types of normalization are listed below:

1NF

2NF

3NF

Primary key
Custom Custome
er
r
Id
Name
Pankaj
Smith
Wilson
Smith

Mobile
Bought
Moto-X
Karbon
n

Address

Networ
k

Supplie
r

Supplier
Phone

Price

FIRST NORMAL FORM(1NF)

The first normal form states that:

Domain of each attribute must be atomic

Every column in the table must be unique
Separate tables must be created for each set of related data
no row/column intersections contain a null value & multivalued fields

Primary key
Custom Custom
er Id
er
Name

Mobile
Bought

Address

Network

Supplier

Supplier
phone

Price

SECOND NORMAL FORM(2NF)

A table is said to be in 2NF if both the following conditions hold:

Table is in 1NF (First normal form)

No non-prime attribute is dependent on the proper subset of any candidate key of

table i.e there must not be any partial dependency of any column on primary key.

An attribute that is not part of any candidate key is known as non-prime

attribute.

Primary key
Customer Custome
Id
r
Name

Primary key
Mobile
Supplier
Bought

Customer
Id

Mobile
Bought

Address

Supplier
Phone

Network

Price

THIRD NORMAL FORM(3NF)

For a relation to be in Third Normal Form, it must be in Second Normal form and the
following must satisfy

No non-prime attribute is transitively dependent on prime key attribute.

For any non-trivial functional dependency, X A, then either

o

X is a super key or

A is prime attribute.

Primary key
Customer Custome
Id
r
Name

Primary key
Mobile
Supplier
Bought

Address

Price

Network

Customer
Id

Mobile
Bought

Supplier

Supplier
Phone