Bio-Inspired Node Localization in Wireless Sensor Networks

WSN l tp hp cc Node (N Nodes) Mi Node c mt bin cm ng r WSN c biu din nh thi G=(V,E) Tp cc Nodes S dng nh v cc node khc Tp cc Nodes U dng nh v cho cc thit b

Cc thut ton nh v trong WSN

Particle Swarm Optimization (PSO) Bacterial Foraging Algorithm (BFA)

Particle Swarm Optimization

Da trn m hnh hot ng ca by chim Bao gm tp s cc c th trong khng gian n chiu

Xik : V tr c th th i ti th h th k Vik : Vn tc c th i ti th h th k

Pbesti : V tr tt nht ca c th th i Gbesti : V tr tt nht ca c th trong qun th vik+1 = w.vik + c1.rand1().(Pbesti xik) + c2.rand2().(Gbest xik) xik+1 = xit + vik+1

Bacterial Foraging Algorithm

Da trn hnh thc kim n ca E.coli Bao gm mt tp S cc vi khun Vi khun n ni J(Pi)<0

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.
10

End

TEST PSO
Population = 30 Iterations = 150 Acceleration constants c1 = c2 = 2.0 W is decreased from 0.9 to 0.4 Xmin=0 and Xmax=100

TEST BFA
Dimension 30 Life Time 5 Swim Length Limitation 20 Reproduction Steps 5 Elimination-Dispersal Steps 5 Population Size 0.5 Elimination Rate 0.1

Nhn xt
Hiu sut ca BFA tt hn PSO Thi gian tnh ton BFA ln hn PSO B nh cn thit cho BFA ln hn nhiu PSO