04-08-2012, 01:12 PM
Beehive Algorithm
BeeHive Algorithm.ppt (Size: 1.36 MB / Downloads: 67)
Introduction
Beehive is a routing algorithm with emphasis
On wireless ad-hoc mobile networks and Energy
awareness. It is Completely Distributed and does
not need global information about the network
condition. The algorithm is based on source
routing and on-demand routing.
This algorithm is inspired from honey bee behavior specially their foraging techniques.
Hive sends agents to look for food and if one of them finds a good food site it returns back to hive to perform the Waggle Dance on the Dance Floor.
This dance gives three important information :
The Direction of flower patches(angle between the sun and the patch)
The distance from the hive(duration of the dance)
The quality rating (fitness)(frequency of the dance).
So the hive can easily enhance the discovered site with a sufficient number of foragers even without a guide.
Basic idea outlines
Most design decisions were done with the picture of
honeybees in mind. Every node
is a beehive, with packets (bees) collecting data (food).
This means that every packet
is a very simple mobile agent, transporting user data
and route information from its
starting node to its destination. Once it returns with
fresh information about the route
conditions, it will "inform" other bees through waggle
dances, depending on the rating.
Beehive’s steps:
1- each node consider itself as a representative node (node with the lowest ip address take this position)
2- after launching 1st ,2nd and 3rd short distance bee agent network is organized into fixed partition called foraging region.
3- each node has a specific foraging zone.
4- each non representative node launch periodically short distance bee agent by broadcasting replicas to the neighbors .
5- representative node launch long distance bee agent .