OUTLINE

Introduction Problem statement Existing work Block diagram Modules Literature survey Tools used Evaluation parameters Module methodology Plan for review 2 References

INTRODUCTION
Wireless Sensor Networks (WSNs):
Highly distributed networks of small, lightweight wireless nodes, Deployed in large numbers, Monitors the environment or system by measuring physical parameters such as temperature, pressure, humidity.

Node:
sensing + processing + communication
2

Applications of WSNs
Constant monitoring & detection of specific events Military, battlefield surveillance Forest fire & flood detection Habitat exploration of animals Patient monitoring Home appliances
3

Composition of a sensor(-actuator) node

Transceiver
128Kb-1Mb Limited Storage 1Kbps- 1Mbps 3m-300m Lossy Transmission

Memory Embedded Processor

8 bit, 10 MHz Slow Computation

Requires Supervision Multiple sensors

Sensor Battery
Limited Lifetime

Portable and self-sustained (power, communication, intelligence) Capable of embedded complex data processing Note: Power consumed in transmitting 1Kb data over 100m is equivalent to 30M Instructions on 10MIPS processor Technology trends predict small memory footprint may not be a limitation in future sensor nodes Equipped with multiple sensing, programmable computing and communication capability

Sensing + CPU + Radio = Thousands of potential applications

4

Localization
Localization in wireless sensor networks is the process of determining the geographical positions of sensors. Only some of the sensors (anchors) in the networks have prior knowledge about their geographical positions. Localization algorithms use the location information of anchors and estimates of distances between neighboring nodes to determine the positions of the rest of the sensors.

Localization in WSNs
Inventory monitoring
Environment/forest monitoring

Smart battlefield

To achieve Better interpretation of sensed data Quality of network coverage Geographic Routing Target movement Monitoring

Machine survillance

Smart hospital

Courtesy: www.timedomain.com
17-10-07 Sadaf Tanvir-INPG 2007 6

PROBLEM STATEMENT
Optimal deployment and accurate localization of sensor nodes. a few special beacon nodes having location awareness is deployed, which help the ordinary nodes to localize. the ranging-based localization task is formulated as a multidimensional optimization problem, and addressed using bio-inspired algorithms, exploiting their quick convergence to quality solutions. distributed iterative localization is used. Here, the nodes that get localized in an iteration act as references for remaining nodes to localize.

PROBLEM STATEMENT(contd)

EXISTING WORK
simulated annealing algorithm is proposed in an earlier study. But it requires a large number of beacons in order to localize all dumb nodes. A genetic algorithm (GA) based node localization is existing. This centralized algorithm determines locations of all non-anchor nodes by using an estimate of their distances form all one-hop neighbors. Complexity and scalability issues in a WSN call for distributed localization algorithms which are executed on individual sensor node, rather than on a central base station.

MODULES
Chemo taxis -Nutrient climbing Tumble and swim Cell to cell signaling Reproduction and elimination

LITERATURE SURVEY

Other classe of Heuristics Inspired By Nature

Evolutionary Algorithms (EA)
All methods inspired by the evolution

Swarm Intelligence
All methods inspired by collective intelligence

12

Examples of Heuristics
The Harmony Method, Shuffled Leaping-Frog Algorithm, Squeaky Wheel Optimization, Ruin and Recreate Intelligent Water Drops Honey-Bee Mating Dance Gravitational Search River Formation Dynamics Charged System Search Stochastic Diffusion Search Particle Swarm Optimization Artificial Immune Systems Bee Colony Optimization Bacterial Foraging Optimization The Great Deluge Algorithm

13

Swarm Intelligence (SI)

The collective behaviour of decentralized, self-organized systems, natural or artificial. The expression was introduced by Gerardo Beni and Jing Wang in 1989 SI systems are typically made up of a population of simple agents interacting locally with one another and with their environment. The agents follow very simple rules, and although there is no centralized control structure dictating how individual agents should behave, local, and to a certain degree random, interactions between such agents lead to the emergence of "intelligent" global behavior, unknown to the individual agents. Natural examples of SI include
ant colonies bird flocking animal herding, bacterial growth fish schooling.

14

Bacterial Foraging Optimization

Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for distributed optimization and control. BFOA is inspired by the social foraging behavior of Escherichia coli. Used for continuous optimization

15

Operation of Bacterial Foraging

Start
Initialization Evaluation Moving Tumble / Swim
No

End of Life?
Yes

Reproduction
End of Rep.?
Yes No

Elimination End of Eli.?

Yes No

p: Dimension S: Population Size Nc: Life Time NS: Swim Length Limitation Nre: Reproduction Steps Ned: Elimination-Dispersal Steps Ped: Elimination Rate dlt(i): random number on [-1,1]. where i from 1 to p. c(i): Step Size for the dimension.
16

End

Bacterial Foraging

2012/8/8

17

Bacterial Foraging
Moving track of E. Coli:

2012/8/8

18

Bacterial Foraging Algorithm

Bacterium:
Position Step Sizes for Each Dimension Health Status

2012/8/8

19

Bacterial Foraging Algorithm(2)

Parameters:
Elimination Reproduction Lifetime Maximum Swim Length Selection Rate (for Elimination) Step Size (for Moving) Attraction and Repellent between cells to cells. (x4)

2012/8/8

20

Bacterial Foraging Algorithm(3)

Step1: Initialization. Step2: Evaluation. (fitness function, and then add cell-to-cell affects) Step3: Movement. -Tumbling - Swimming(if Tumbling on a gradient) Step4: Reproduction, go back to Step2 until reaches the reproduction time. Step5: Elimination, go back to Step 2 unless reaches the elimination time.
2012/8/8 21

Our Purpose Combining GA with BF

We tried to combine GA and BF to produce a new approach of evolutionary algorithm for optimization problems.

2012/8/8

22

The Existing Method

Pseudo-Bacterial GA
T. Furuhashi, Y. Miyata, Y. Uchikawa, Pseudo-Bacterial Genetic Algorithm and Finding of Fuzzy Rules, the Second Online Workshop on Evolutionary Computation(1996)(WEC2)

Mutated Mutated Mutated

2012/8/8 23