Ant Colony optimization for routing in Mobile and Adhoc Networks
Active In SP
Joined: Dec 2009
29-12-2009, 01:14 PM
plz provide me complt info abt this topic as early as possible..... n even suggest me any better seminar and presentation topic with complte info plzzzz make it fast
Joined: Dec 2009
30-12-2009, 07:11 PM
Using the Ant colony optimisation (ACO) , available pheromone ratio of ant agent release is firstly proposed an dapplied to routing and according to multi agent mechanism, introduces the service agents to reduce the expense of ant agents. Routing algorithm is a pivotal technology that allows the network transmission.Ant Colony Optimization (ACO) is a heuristic approach for solving hard combinatorial optimization problems. It was first applied to solve the Traveling Salesman Problem. Agent is mobile code which has a little intelligent, can move from node to node, cooperating with others to perform complex tasks in a distributed manner.
ACO routing ACO-AHR
It has two parts: reactive routing setup, proactive routing probe and maintain.
Inspired by the ant look up path method, we can keep
a routing table on each node of network, the entry of the
table is pheromone like ant release which is called probability that chooses its neighborâ„¢s node as next hop.
There are 2 kinds of ant agents: forward ant agents (Fant) which from source to destination(collect information to a node ) and the backward ant agents (Bant). There is the service agent (Sagent) which uses information that from Bant to update the routing .
Proactive maintenance and repair
there exist a
series of nodes in the networks which have number of good
paths from source to destination in the routing table. Also, these nodes can update the routing table.When the source send out data packets, many packets
are delivered using one good path but gradually this leads to congestion because the bandwith of MANET is limited.As a result while the source node
sends out n data packets, and then sends proactive Fant to
maintain and explore. These ant agents normally unicast,
choosing next hop according to the computed probability of
the routing table.
Two methods maybe possible :
1) If, on one hand, the Fant broadcast at any
probability, it could leave the currently known paths and
explore new best ones.
2) If Fant is always unicast, choosing next hop
according to probability, until arrive to destination, and it
would collect information about this path, according to this
to update and maintain the routing table.
Link failures and repair
If a node can't send out any data packets, it
would broadcast pathâ„¢s detect message containing its identity
and sequence number to his
neighbor.It is not rebroadcast outside the neighborhood of the node due to its TTL(time to live ) being 1. If this node doesnâ„¢t receive its neighborâ„¢s
reply message , indicates that neighbor's
node cause link failures of this
It is handled as follows:
(1) First, switch to other path and then delivery data
2. Save the data that will send out to buffer
area of this node, and then try to locally repair the path.
3) send error messages to source, setup path
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Active In SP
Joined: Feb 2011
02-03-2011, 04:38 PM
plz sent me a good ppt of ant colony routing seminar and presentation toipc...