Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Ant Colony optimization for routing in Mobile and Adhoc Networks
Post: #1

plz provide me complt info abt this topic as early as possible..... n even suggest me any better seminars topic with complte info plzzzz make it fast
Post: #2
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.

Routing setup
Algorithmic principle:

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
Algorithmic principle
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
Post: #3
plz sent me a good ppt of ant colony routing seminars toipc...
Post: #4
to get information about the topic "application of ant colony optimization " related topic refer the link bellow

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: file type ppt ant colony optimization in manets, load balancing in cloud computing ant colony optimization, integration of adhoc with mobile ip networks in mobile adhoc networks ppt, ant colony optimization java source, ant colony optimization in manets ppt, ppt for dynamic address routing for scalable adhoc and mesh networks, gabor filter and ant colony optimization,

Quick Reply
Type your reply to this message here.

Image Verification
Image Verification
(case insensitive)
Please enter the text within the image on the left in to the text box below. This process is used to prevent automated posts.

Possibly Related Threads...
Thread: Author Replies: Views: Last Post
Wink solution manual for principles of wireless networks by kaveh pahlavan free download Guest 2 187 09-09-2016 05:31 AM
Last Post: ignitedmind
  hack import ethio telecom hidden mobile card 805 Guest 2 436 08-09-2016 07:21 PM
Last Post: Guest
  matlab xy routing algorithm Guest 2 190 12-08-2016 09:16 PM
Last Post: khant
Rainbow how to ethio telecom mobile card hack Guest 2 311 05-08-2016 09:24 AM
Last Post: seminar report asees
  srs for online mobile recharge system pdf Guest 2 150 01-08-2016 12:03 PM
Last Post: seminar report asees
Video disha vakani mobile number contact number Guest 1 132 22-07-2016 03:37 PM
Last Post: visalakshik
Heart piezoelectric mobile charger circuit mini project pdf Guest 2 295 21-07-2016 03:19 PM
Last Post: dhanyavp
  disha vakani mobile number contact number Guest 2 191 13-07-2016 10:51 AM
Last Post: visalakshik
  optical networks by rajiv ramaswami free download Guest 2 177 12-07-2016 04:39 PM
Last Post: dhanyavp
  ant colony optimization source code in ns2 Guest 2 166 12-07-2016 11:26 AM
Last Post: jaseela123