ࡱ > _ a Z [ \ ] ^ k g R bI bjbjVV r< r< %I V V t ! | v" z4 ( 4 4 4 w y Hz T $ @ @ @} v w @ @} @} V V 4 4 B @} r V 4 4 @} V @ v m 4 5qD > U 0 a p m m e p# z J{ | { d *| z z z ` z z z @} @} @} @} z z z z z z z z z , : 9eۏvWN{lv^GW SR|1uOS ^yO1 _eh2 * 1 ^NQ]FULNb/gf[b {:g|^N ^] 5 1 0 5 0 7 2 ^NQ]FULNb/gf[b :g5u|^N ^] 5 1 0 5 0 7 * O\OE - m a i l z w m 2 0 0 7 1 8 @ 1 2 6 . c o m Xd 0[e~ OahVQ~-N OahVp:gR^ b NGWT p:S I{cQN Ny9eۏvWN{lv^GW SR|1uOS0OS_NǑ(u n e_ЏLkn| >N _Y6k9hncpiRYOϑ0p[^~Tp0RS i n k pvݍyegg NGW Svz JS_k*Np9hncz JS_VQE\p{iRYOϑkSݍyOP]s^GW
NQ|s^a|QvOpenc O6kQiRYOϑ0O0(ϑ0 Oe^I{V }Ǒ(u9eۏv{lg gO O_penc OvTefeOo` }N0R^0R`OS0W^zT~b O_0Nw~ghf1uOS gHe~ϑTGWa^Q~u}ThTg9eU(ϑQ\ Oe^0 sQ.͋e~ OahVQ~^GW SR|{l1uOS -NVR{|ST P 3 9 3 0e.shƋxA 0 0 U n e v e n C l u s t e r i n g R o u t i n g P r o t o c o l f o r W i r e l e s s S e n s o r N e t w o r k s B a s e d o n I m p r o v e d A n t C o l o n y A l g o r i t h m L I A O F u - b a o 1 Z H A N G W e n - m e i 2 * 1 D e p a r t m e n t o f C o m p u t e r , G u a n g D o n g A I B P o l y t e c h n i c C o l l e g e , G u a n g z h o u 5 1 0 5 0 7 , C h i n a 2 D e p a r t m e n t o f M e c h a n i c s a n d E l e c t r o n i c s , G u a n g D o n g A I B P o l y t e c h n i c C o l l e g e , G u a n g z h o u 5 1 0 5 0 7 , C h i n a A b s t r a c t : A i m i n g a t t h e e n e r g y c o n s u m p t i o n u n b a l a n c e a n d h o t s p o t e n e r g y h o l e f o r s e n s o r n o d e s r a n d o m d i s t r i b u t i o n i n W i r e l e s s S e n s o r N e t w o r k s ( W S N s ) , a n u n e v e n clustering routing protocol for WSNs based on improved ant colony algorithm is proposed. The protocol adopts round opetation mode, in the beginningphase of each round cluster-headselection, it forms the uneven competition radius of nodes by the density of the nodes, residualenergyand the distance to sink. The rate of residualenergy and the average of distance deviation of nodes are calculated by the competition radius, and then the nodes waittimes of cluster-headselection are calculated. In the cluster-headselection phase, the protocol adopts waittime of cluster-headselection to select the cluster head and balances the energy consumption in the cluster. In the data transmission phase, concerning the residualenergy, energy consumption, linkquality and transmissiondelay, the protocol adopts improved ant colony algorithm to constructoptimal transmissionpath. The pheromones are updated at the time of data transmission, and the transmissionpath are established and maintained more self-adaptive and dynamic. The simulation shows that the routing protocol can efficiently reduce and balance the energy consumption, prolong the wireless sensor network survival period, improvethelinkquality and reducetransmissiondelay. Key words: wireless sensor networks; unequal clustering; ant colony algorithm; routing protocol0 0_ e~ OahVQ~/f1ur(WvKm:SWQv'Yϑ_W OahVpN~~e_~b8^S+T'Yϑv OahVpT N*NS i n k pُN OahVp(uNǑƖvc:SWQvpencv^Ne~Ove_\penc N O~S i n k pe~ OahVQ~]^l(uNQN0sX0;SueP^I{W[ 1 - 3 ] 0 OahVp8^Ǒ(uN]^n0ޘ:g^dI{e_'YϑrNvc:SWNُN OahVp'YYǑ(u5u`lO5u01uNvc:SWv YBgTNapv5u`lNeEQTfbcVdkwϑm0^u}ThTgv1u{l/fvMRe~ OahVQ~vxvzppKN N[ 4 ] 0 vMRf[NcQNYy1u{lTOSSbs^b1uOSTR|1uOS[ 5 ] vQ-NR|1uOSks^b1uwQ gf}YvSibU\'`TϑGWa'`VdkfTe~ OahVQ~[ 6 ] 0 (WR|1uOS-Ne~ OahVQ~RR:NY*N NTv|k*N|1u N*N|TOYv|Qp~b|Qp#ǑƖvc:SW-Nvpenc|p#{t|Qp0c6e|QpǑƖvpencv^\vQTTlSS i n k p[ 7 ] 0R|1uOS\te*NQ~vϑ}s^GWRM0Rk*NpNMNOQ~ϑvmFO(WGW SR|ve~ OahVQ~-N|4YNS i n k pvOeǑ(uUSbYe_OX[(W p:S 0 [R|1uOS-NSQsv p:S ,ge(WL E A C H OS[ 8 ] 0E E U C OS[ 9 ] I{1uOSvW@x NcQN9eۏvWN{lv^GW SR|1uOS0 1 0vsQ]\O 1 . 1 0vsQ{l L E A C H OS/f g gxQWvR|1uOSǑ(u n vi_hTg'` b|0k N n k*Npub N*N0 - 1 KNv:gpeS_勏:gpe'YN