Professional Documents
Culture Documents
I.
INTRODUCTION
BFOA stands for Bacterial Foraging Optimization Algorithm (BFOA). It is proposed by Kevin Passino. It is
a new comer to the family of nature inspired optimization algorithms. The key idea of this algorithm is
based on the E.coil. E.coil (Escherichia coil) is a rod-shaped bacterium of the genus Escherichia that is
commonly found in the lower intestine of warm blooded organism. Mostly the e.coil are harmless but
some type can cause health problem. Bacteria search for nutrients is a manner to maximize energy
obtained per unit time. Individual bacterium also communicates with others by sending signals. A
bacterium takes foraging decisions after considering two previous factors. The process, in which a
bacterium moves by taking small steps while searching for nutrients, is called chemotaxis. The key idea of
BFOA is mimicking chemotactic movement of virtual bacteria in the problem search space. Foraging
theory is based on the assumption that animals search for and obtain nutrients in a way that maximizes
their energy per unit time. As the whole WSN is also dependent on the batteries. So for maximum
utilization of energy we use BFOA in WSN. Wireless sensor network is group of sensor nodes which are
small in size, movable and predictable that is associated by a wireless medium to form a sensor field. The
sensor are used to sense the environmental condition such as pressure temperature ,humidity, pulsation,
wind direction, sound intensity, speed, etc. Without any wires, WSN can be deployed in areas where
regular sensor networks cannot operate.Also the self-shaping feature of WSN, along with the freedom of
6 | 2015, IJAFRC All Rights Reserved
www.ijafrc.org
Micro-controler
External memory
Sensor 1
ADC
Sensor 2
A. Chemotaxis
This process simulates the movement of an E.coli cell .The ecoli cell mainly move in two different way
swimming and tumbling via flagella. Biologically an. It can swim for a period of time in the same direction
or it may tumble and alternate between these two modes of operation for the entire lifetime. Suppose i (
j, k, l) represents ith bacterium at jth chemotactic, kth reproductive and lth elimination-dispersal step.
www.ijafrc.org
B. Swarming
An interesting group behavior has been observed for several motile species of bacteria including E.coli
and S. Typhimurium, where intricate and stable spatio-temporal patterns (swarms) are formed in
semisolid nutrient medium. A group of E.coli cells arrange themselves in a traveling ring by moving up
the nutrient gradient when placed amidst a semisolid matrix with a single nutrient chemo-effecter. The
cells when stimulated by a high level of succinate, release an attractant aspertate, which helps them to
aggregate into groups and thus move as concentric patterns of swarms with high bacterial density.
C. Reproduction
In the reproduction step the least healthy bacteria eventually die and healthier bacteria (which yielding
lower value of the objective function) split into two bacteria, which are then placed in the same location.
This keeps the swarm size constant. For having the same number of bacteria the reproduction step is
important.
www.ijafrc.org
Start
Initialization
Evaluation
Initiate chemotaxis
No
End of
Chemotaxis
yes
Reproduction
End of Rep.
No
Yes
Elimination
No
End of Eli.
Yes
End
Figure2 : Flowchart of Bacterial Foraging
www.ijafrc.org
In 2002, Passino [1] proposed Bacterial Foraging Optimization Algorithm (BFOA) for distributed
optimization and control. BFA is based on the foraging behavior of Escherichia Coli (E. Coli) bacteria
present in the human intestine and already been in use to many engineering problems including multiple
robot co-ordination. According to paper, BFA is better than Particle Swarm Optimization in terms of
convergence, robustness and precision.May Cho Aye and Aye Moe Aung[2] has propose an energy
efficient multipath routing protocol for choosing energy efficient path. The proposed algorithm considers
transmission power of nodes and residual energy to extend the network lifetime and reduce the energy
consumption of mobile nodes. This system is provided to reduce energy consumption and end to end
delay to improve the network lifetime and throughput.K.N.Kavipriya1, P.Prabaharan2, B.Anitha [3] define
various object tracking algorithms. Based on there study and analysis lagarangaen relaxation object
tracking and continuous detection methods are suitable for the application which requires high speed
object tracking. Probability based prediction and sleep scheduling and optimized power aware target
tracking are suitable for the application which requires energy efficient target tracking. Tree based object
tracking and Dynamic clustering is used to minimize the missing rate level.Guang-yao Jin, Xiao-yi Lu, and
Myong-Soon Park define[4] object tracking is an important feature of the ubiquitous society and also a
killer application of wireless sensor networks. Nowadays, there are many researches on object tracking
in wireless sensor networks under practice, however most of them cannot effectively deal with the tradeoff between miss ingrate and energy efficiency. In this paper, we propose a dynamic clustering
mechanism for object tracking in wireless sensor networks. With forming the cluster dynamically
according to the route of moving, the proposed method can not only decrease the missing-rate but can
also decrease the energy consumption by reducing the number of nodes that participate in tracking and
minimizing the communication cost, thus can enhance the lifetime of the whole sensor networks. The
simulation result shows that our proposed method achieves lower energy consumption and lower
missing-rate
IV. CONCLUSION
In this paper we discuss the BFOA algorithm which we can use with WSN for selecting the cluster head in
between the various node. We can use the BFOA for energy optimization, for reducing computational
complexity, for enhancing the network life time etc.
V. REFERENCES
[1]
K. M. Passino, "Biomimicry of bacterial foraging for distributed optimization and control," Control
System Magazine,IEEE, vol. 22, pp. 52-67, June 2002.
www.ijafrc.org
May Cho Aye and Aye Moe Aung ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD
HOC NETWORKS International Journal of Information Technology, Modeling and Computing,
10.5121/ijitmc.2014.2302 2014
[3]
[4]
Jin Guang-yao, Lu Xiao-yi, and Park Myong-Soon, Dynamic Clustering for Object Tracking in
Wireless Sensor Networks, H.Y. Youn, M. Kim, and H. Morikawa (Eds.): UCS 2006, LNCS 4239, pp.
200209, 2006
[5]
J. Y. Yu and P. H. J. Chong, "A survey of clustering schemes for mobile ad hoc networks,"
Communication Surveys and Tutorials, IEEE, vol. 7, no. 1, pp. 32-48, 2005.
[6]
M. Chatterjee, S. K. Das and D. Turgut, "WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc
Networks," Cluster computing,Springer Netherlands, vol. 5, pp. 193-204, April 2002.
[7]
S.Mohanty and S.K.Patra, A novel Bio-inspired Clustering algorithm for Wireless Sensor
Networks, accepted in 3rd International Conference on Intelligent and Advanced Systems, Kuala
Lumpur, Malaysia(ICIAS2010).
[8]
[9]
Sinha, A. Dynamic power management in wireless sensor networks. IEEE Design and Test of
Computers 2001, 18, 62-74.
[10]
[11]
[12]
www.ijafrc.org
Kelvin. M. Passino Biomimicry of bacterial foraging for distributed and optimization control.
IEEE control system magazine, 2002.
[14]
www.ijafrc.org