Proposal of a new Maximum Lifetime Communication Model of Wireless Sensor Network

Transcription

1 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK Proposal o a new Maxmum Letme Communcaton Moel o Wreless ensor Network Jnhu Le an yan Tan Henan Insttute o cence an Technology, Henan nxang, Chna Abstract One new maxmum letme communcaton moel o wreless sensor network s propose n ths thess an the moel s base on contons o base staton wth multple sources an multple lnks an the ata generate rom the source noe can be transmtte to several base statons through multple lnks. In ths chapter, energy lmtaton an ata stream conservaton prncples o a wreless sensor network are use to establsh a lnear plannng moel, an attanng the maxmum letme o the network s the optmal objectve to establsh a moel wth multple restrctons restrcte by energy an banwth. The basc element nluencng the letme o a wreless sensor network s the ata orwarng rate. The letme o noes wll become longer wth the ecrease o noe ata. In ths thess, the ata sze o network noes s taken as suboptmzaton objectve an the strbute heurstc algorthm wll be use to solve the lnear plannng moel. In the en, a smulaton experment s conucte to very yhe perormance o the communcaton moel an ncate that the propose moel can eectvely ncrease network letme. Inex Terms maxmum letme, communcaton moel, wreless sensor network. I. INTRODUCTION As shown n Fg. 1, the wreless sensor network conssts o a sensor noe, snk an manager noe. A large number o sensor noes are ranomly strbute nse or near the montorng area ater beng rppe an all noes consttute the network through sel-organzaton. The sensor noe wll montor objects an ata montore n the ntal processng wll be transmtte by a mult-strp relay-operate metho accorng to specc routng protocol. In the transmttng process, montore ata wll be processe by several noes an then they are route to the aggregaton noes[1]. Then the ata wll be transmtte to manager noes through a satellte, nternet an moble communcaton network. The en user wll carry out conguraton an management on the sensor network, ssue a montorng task an collect montorng ata. In the multple base staton network o a wreless sensor, the network letme s ncrease to some egree when compare wth the base staton network. The network orms multple groups n multple base statons among whch there are several smlar route moels to establsh LEACH algorthm so as to orm several clusters. The base staton wll be use to substtute cluster hea n LEACH algorthm an every base staton mantans surrounng noe communcaton lnks. Furthermore, a herarchal treeorm communcaton structure CWTP [2-3] s establshe or every base staton an surrounng noes n the network an each noe only nees to communcate wth the nearest base staton, whch can releve ata transmsson pressure o the surrounng noes n the base staton, thus ncreasng network letme. As or noes[4-5], one communcaton algorthm wll be selecte rom multple base statons, whch s relatvely smlar to any cast communcaton technology n the TCP/IP protocol. Tony proposes one algorthm (MD-MLR) to realze maxmum letme an mnmum elay o wreless sensor network by any cast technology, an t manly realzes the maxmum letme o the network n ata elay restrctons [6]. However, the communcaton moel wth multple base statons s stll nsucent n relevng communcaton pressure o surrounng noes o the base staton. In act, the network s ve nto several task areas accorng to strbuton contons o the base staton an every base staton s responsble or normaton collecton contons n one task area. To a certan egree, t s the collecton o several moels o a base staton, whch only shortens the noe scale o base staton mantenance n a sngle base staton moel. One new maxmum letme communcaton moel o wreless sensor network s propose n ths thess, an the moel s base on contons o a base staton wth multple sources an multple lnks. The ata generate rom the source noe can be transmtte to several base statons through multple lnks[7]. In ths chapter, energy lmtaton an ata stream conservaton prncples o a wreless sensor network are use to establsh a lnear plannng moel an maxmum letme o network s the optmum objectve to establsh a moel wth multple restrctons restrcte by energy an banwth. The basc element nluencng the letme o a wreless sensor network s the ata orwarng rate[8]. The letme o noes wll become longer wth the ecrease o noe ata. In ths thess, the ata sze o network noes s taken as sub-optmzaton objectve an the strbute heurstc algorthm wll be use to resolve the lnear plannng moel. In the en, a smulaton experment s conucte to very the perormance o the communcaton moel an ncate that the propose moel can eectvely ncrease network letme, as shown n Fgure 1. JOE Volume 12, Issue 10,

2 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK The Internet, satellte an moble network Gatherng noe The management noe A sensor noe Perceve the scene Fgure 1. The archtecture o wreless sensor network II. MLCM YTEM MODEL A. Network moel The wreless sensor network conssts o a large number o sensor noes whch are ensely strbute n a montorng area or operaton wthout engneerng treatment or propostonng. Thereore, necessary sensor noes wll have sel-organzaton characterstcs. At the same tme, multple routes are necessary or transmsson o ata or the sensor noes are embee systems an the processng capacty, storage capacty an communcaton capacty are relatvely weak. Atonally, apart rom local normaton collecton an ata processng, noes must store, manage an ntegrate ata transmtte by other noes. Furthermore, they must coornate wth other noes an transmt orgnal ata to an aggregaton noe ater processng[9-10]. As the nterace o the sensor network an external network, the aggregaton noe can realze the communcaton between manager noes an the wreless sensor network through network protocol. It wll orwar ata collecte rom the sensor noes to the external network an ssue commans rom the manager noe to the sensor network at the same tme, as shown n Fgure 2. The wreless sensor network can be abstracte as one unrecte graph among G(V,A) where V represents the set o sensor noes an base statons n the network an A represents the set lnks. In the case that the set o sensor noes n network s, the noe number s n, the set o base staton s s an the number o base statons s m, thenv=. In the case that the set o ajacent noe o V "V s, then V can have rect communcaton n any noes nse. The communcaton set o noe V s,, an conssts o noes between noe V an base statons an the communcaton lnk o noe V s (V,). The lnk set can be expresse as: A={(V,) V "V, }. The source noe V k wll perceve an generate ata whch wll nally arrve at the base staton noe through one or several ronter sets (V,V j ) prove that the ata sze surpasses the ronter set (V,V j ) n unt tme n that process s s V,V j. In the case that the prmary energy o all sensor noes s E, then the energy o noe V s E. B. Funamental assumpton The assumpton s that the sensor network s o the ollowng characterstcs: ource (a) The nterest sprea Graent "#Graent base Graent (c) Path to enhance Fgure 2. Network type nk nk nk (1) The noes n the network are unormly strbute an the sensor noes an the base staton are statonary. (2) All sensor noes have the same ntal energy an once the energy o a certan noe s use up, the noe wll stop workng. (3) All noes can transmt an receve ata an partal noes selecte to perocally nuce the ata are calle source noes[11]. (4) All noes have the same maxmum transmsson range max an the noes wth a stance rom the base staton s more than max the ata s transmtte to the base staton through the mult-hop routng moe. (5) Networks are nterconnecte ntally. 32

3 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK C. Energy consumpton moel The energy consumpton n the noe o the wreless sensor network nclues three parts, whch are respectvely the processor moule, sensor moule an wreless communcaton moule, o whch the wreless communcaton consumes the most energy o the sensor noe. The energy consume by the wreless communcaton moule n the sensor noe s researche n ths thess, an the algorthm aopts the energy moel use n Lterature [12-13]. Each sensor noe V " contnuously or perocally reports the ata collecte to the base staton an the energy consumpton o V transmttng unt ata to the neghbor noe s: m e = + "# Range (1) j Assumng the coornates o the noe an communcaton object K respectvely are (,Y ) an ( j,y j ), then the communcaton raus s: g = # VV j (2) V, V VV, " j j In the case that the noe oes not have the postonng uncton an the noe transmttng power s nonajustable, the noe generally broacasts to the surrounng noes wth a xe transmttng raus. Assumng the ata generaton rate o noe V s g, then: e (, j) = e # (3) V t j VV j V, V VV, " j j Assumng the lnk banwth s R an t s allowe that the maxmum ata transmsson amount o noe V an the ajacent noe V j n unt tme s R j, an then t s obvous that V,s V,Vk,"R. The energy consumpton o communcaton between noe V an the ajacent noe V j s e(,j). er = % VV j (4) V, V" VV, # j j The energy consumpton o noe V recevng the ata o ajacent noe V j s e r () an e r () s unrelate to the stance between them, where, # s the xe constant. Other possble energy consumpton o the noe nclue e g representng the energy consumpton o the noe generatng unt ata, e le the energy consumpton o noe n an le state an e lsten the energy consumpton o noe contnuously lstenng to the network state so as to promptly awaken the noe. These three sources o energy consumptons are the same or all noes an the energy consumpton value s bascally xe, an gven e other =e g +e le +e lsten, the energy consumpton o the noe V j wthn unt tme s % % e j = e + + e (5) j VV j VV j other V, V" VV, # V, V" VV, # j j j j D. Communcaton moel The maxmum letme communcaton moel o the wreless sensor network propose n ths thess s base on a mult-source, mult-lnk an mult-base staton conton. The ata generate by the source noe can be transmtte to erent base staton noes through erent lnks[14]. The source noe generates ata, the ntermeate noe proves ata orwarng servce, the ata contnuously converges to the base staton noe rom the ege noe n the network an the source noe nuces the ata generate an nally arrves at the base staton noe through sngle-hop or mult-hop orwarng. Data generate by noes o the same source may be route to erent base staton noes through erent lnks an t s o very strong epenency[15]. Derent source noes may conuct ata uson processng n the process o ata orwarng. On account o the base staton noe requrng ata rom the same source or the uson processng, multple base staton noes orm a tree structure an the root noe s connecte wth the vrtual lnk through each base staton, o whch one base staton noe s taken as the root noe an t conucts reunancy removal to compress all ata an then sens t to the termnal recever. III. MLCM COMMUNICATION MODEL A. Maxmum letme moel The wreless sensor network s the energy restrcton network an the energy consumpton o the noe wll not excee the resual energy. Base on Equaton (7), when the ata orwarng rate o the noe s, the letme o a noe V s E T ( ) = pr + pt (, j) + eother E (6) = e + + e % % j VV j VV j other V, Vj" VV, j# V, Vj" VV, j# The noes o the wreless sensor network uner workng contons base on the eect o noe on the ata stream can be ve nto source noe an ntermeate noe. The source noe nuces, generates an receves ata an then orwars the ata to the next ajacent noe. The ntermeate noe oes not generate ata, but only receves ata an then orwars to the next ajacent noe. The ata stream contons o the two noes are: VV + = j g VV j (7) V, Vj" VV, j# V, Vj" VV, j# Where, " 1, V # = % (8) ' & 1, V = Base on Equaton (8), the letme moel o network noe s: E T ( ) = e + g ) + "% + e (9) & & j VV j VV j other The letme T sys () o the network at a certan ata orwarng rate s the mnmum letme o all noes. T = mnt (10) sys The objectve o the energy-ecent network communcaton moel s to maxmze the mnmum letme o the noe an prolong the network letme as much as possble to make the energy consumpton o a sngle noe balance wth the whole network[16]. The purpose o research on the maxmum letme communcaton moel o wreless sensor network s to JOE Volume 12, Issue 10,

4 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK maxmze the network letme. The maxmum letme communcaton moel establshe n ths chapter s: max mze mnt (11) subject to % V, Vj" VV, j# % V, Vj" VV, j# ' + g = V VV j, VV, " V, " VV j j T e % + g + j VV j ' " % + e ) & E VV j other % VV ",#,, j j j (12) (13) R VV (14) " 0, = 0or1, g " 0, # V, V, % (15) VV j j The Conton 1 n Equaton (12) shows that the quantty o ata transmtte by noe V to the ajacent noe s equal to the sum o ata generate by the ata nucton an the quantty o ata receve rom the ajacent noe, an the ata loss n transmsson s not consere n ths chapter. Conton 2 shows that the total energy consumpton o noe I wthn tme o T sys () wll not excee the set value E o the noe energy. Conton 3 shows that the communcaton rate between the noe an the ajacent noe s less than the network banwth. The conton o the noe not partcpatng n the network communcaton s not consere n ths thess, such as the contons o the ormant noe, a noe wthout a montorng area an the noe that has accentally gone ormant n eployment[17]. B. Data stream moel The base staton set ={1,2,,m} can orm 2m-1 nonvo subsets. In the case o assumng m=2 an ={1,2}, the subsets possbly orme are {1}, {2} an {1,2}. In each process o the source noe transmttng ata, the ata wll be transmtte to a certan subset o the base staton. In the ajacent communcaton lnk {V,} o the source noe, the set s not vo wth " an ={ 1, 2,, k }; the ata o moe V s route to one base staton as the least through k lnks an assumng the noe V passes through the ajacent noe 1 an transmts to the subset P1 o the base staton, an transmts the subset P1 o the base staton through noe 2; that s, the set transmtte to the base staton subset through the ajacent communcaton lnk set s P={P 1,P 2,,P k } an P" (16) The subset o noe V transmtte to the base staton through the ajacent noe V j s P k wth P k # an P k ={P 1,P 2,,P k }; assumng that the ata orware by noe V through the ajacent noe V j s receve by Pk base staton subset at the average ata rate o F V an V,V total amount o ata receve by P k base staton s F V V,Vj {P 1,P 2,,P k }. In the communcaton moel, F Vg, V,Vj represents the quantty o ata passng through the ege set (V,,V j ) wthn a unt o tme an base on the ata stream moel, the relaton between F Vg, V,Vj an the average ata rate F V V,V arrvng at the base staton set s: # ({ }) { } ({ }) V 1 V = + 2 V VV F + 1, 2 j VV F j VV F j VV j (17) Vj, " Assumng the subset collectons orme by F Vg, V,Vj reaches ={1,2} are {1} an {2}. ({ 1} ) + { 2} V V = F F (18) VV VV VV j j j In that case that noe V arrves at the collecton o all base statons through the ajacent noe collecton V j ; that s, all subset collectons are orme by ={1,2} # Vj, " ({ }) { } ({ }) = F + F + F, (19) V 1 V 2 V VV 1 2 j VV j VV j VV j It s assume n ths thess that the subset collecton o ata transmtte by noe V arrves at the base staton s % wth %&p an %={P 1,P 2,,P k }. V (%) Represents the total rate o ata transmtte by noe V to % wthn a unt o tme. V V V ( ) = % FVV ( P ) = % % ( ) j k FVV P P P j k (20) Pk# P, " Pk Vj", # Pk# P The ata transmtte by noe V comes rom the sum o ata receve an the ata generate by ts nucton, an the ata receve by the noe V rom the ajacent noe s Vg, # V, Vj an V (%) represents the total rate o ata VV, j VY, " receve by a noe wthn a unt o tme. V V ( ) = %% FVV ( Pk) = % % F ( ) j VV P P P j k V" Pk# P Vj", # Pk# P (21) In ths chapter, the value o V (%) generally s more than that o V (%); gven ' (%)=(%)-%(%) an n the case o ' (%)>0. In aton to orwarng ata wthn a unt o tme, the noe V also nuces an generates ata, an ' (%)=0 shows that the noe V only orwars ata an ' (%)<0 shows that there s ata loss n noe V or t conucts reunancy processng an ata compresson or the ata[18]. It can be etermne rom Equaton (7) that when the ata rate n the noe ecreases, the energy consumpton o the noe wll also ecrease, an when there s no ata passng the noe, t s consere that the noe only nees to mantan relatvely low energy consumpton, as shown n Fgure 3. A(PA=2) a2=1 B(PA=2) a8=2 C(PA=2) a1=1 a7=2 a9=2 Fgure 3. nk a4=2 a5=2 ource a3=1 Energy routng protocol E(PA=1) a6=2 F(PA=4) 34

5 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK C. ystematc mathematc moel In ths chapter, a mult-constrant lnear programmng moel s propose n orer to resolve the maxmum letme communcaton moel o the wreless sensor network, wth network letme beng ts optmal objectve. A strbute algorthm s a typcal algorthm aopte to solve lnear programmng moel. In orer to resolve the maxmum letme moel o a network wth aopton o strbutve algorthm, substtuton varable q s ntrouce, an set q=1/t sys (). The soluton to the maxmum letme o a wreless sensor network becomes the soluton to mnmzaton o q, an such a moel can be transorme nto an equvalent moel. max mze q (22) subject ( to j VV j V, Vj" VV, j# = e % + g + ( V, Vj" VV, j# + g VV j VV j " % + e & qe,' V, V # V,' # % j VV j other j (23) (24) V VV " R j, # VV, j, (25) " 0, = 0or1, g " 0, # V, V, % (26) VV j j The objectve uncton q s techncally not a convex uncton an the ual uncton s non-erentable. To solve ths problem, the substtuton scheme propose n lterature [19] s aopte, where q s substtute wth q 2, an such substtuton has no nluence on the soluton o maxmum value o letme T. Meanwhle, n ths chapter, a erental convex seconary coornaton tem (x) s ntrouce base on the characterstcs o a wreless sensor network. By settng as (x)='(%) the KKT conton s satse. In orer to make (x) become erental or techncally a convex uncton, substtute ' (%) wth ( 2 ' 2 t (%), where ( s a small postve real number; the lnear programmng moel wll be: 2 ( ) max mze q + " (27) subject to V, V" VV, # = j j V, Vj" VV, j# j % ( VV + + j e g ( j + g V VV V VV j " % + e & qe,' V, V # V,' # VV j other j V % VV ",#,, j j j V = % % VV j k Vj", # Pk# P (28) (29) R VV (30) " # = % F P P P (31) (32) " 0, = 0or1, g " 0, # V, V, % (33) VV j j Equaton (19) s the lnear programmng moel escrbe n the optmzaton theory, whch can be resolve wth the aopton o the strbute projecte graent algorthm. The approxmate upper lmt value o the maxmum network letme can be solve through teratve computaton. IV. IMULATION AND PERFORMANCE ANALYI ON THE ALGORITHM In orer to very perormances o the entre moel, smulaton has been conucte n N-2 envronment, an the smulaton result was apple base on WTP an MD-MLR to realze ranom generaton n N-2 envronment o 2-6 snk noes an common sensor noes whch are ranomly strbute wthn a planar area measurng 8080M2. All these noes are equppe wth postonng uncton an ther transmsson power s ajustable. R, raus o maxmum transmsson range, s 15; ata generaton rate g j =lkbt/s; ata package sze s 512Bytes; metaata sze s 25Bytes; prmary energy transmsson unt an ata energy consumpton actor o sensor noe are subject to comparson. =50nJ/b, "=0.0013pJ/b/m4, an ata energy consumpton actor o the recevng part #=50nJ/b; path power consumpton moel parameter m=4; correcton actor o seconary optmzaton moel =0.01. Fgure 4 shows the relatonshp between total energy consumpton o the network an the number o noes. The number o base staton s respectvely set as 2, 3, 4, 5 an 6. As the number o network noes ncreases, noe ntensty ncreases. Meanwhle, the number o source noes ncreases proportonally. In act, when the number o noes oubles, the ata sze generate n the network oubles corresponngly. It s obvous that as noe ntensty ncreases, the ncrease energy consumpton wll be less than ouble. However, the total energy consumpton o the network wll rse. As the number o base staton ncreases, the total energy consumpton rate o the network reuces graually. Wth number o noes beng the same, the more the base staton there s, the closer s the lnk orme by source noe ata to the base staton, resultng n less energy consumpton. When the number o base staton ncreases, the reucton o average energy consumpton o the network cause by the newly accesse base staton becomes less. In such a case, as n=30, when the number o base staton expresse as m, ncreases rom 2 to 4, energy consumpton wll be reuce about 32%. In other wors, when the number o base staton oubles, reucton n energy consumpton wll not excee 50%. When m s ncrease to 6, the reucton n energy consumpton s such that t s about 48% o that when m=2, an 16% urther less than when m=4. The nluence o the number o base statons on the total network energy consumpton reuces graually, whle the total network energy consumpton shows a eclnng tren. Fgure 5 shows the comparson between the propose algorthm MLCM an WTP an MD-MLR algorthm n terms o maxmum network letme when there are three base statons n the network. It can be observe rom Fgure 5 that the algorthm propose n ths chapter s superor to the other two moels n terms o network letme. Accorng to the MLCM algorthm, ata JOE Volume 12, Issue 10,

6 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK generate at the source noe can be transmtte, n the process o ata routng, va the optmal lnk among many lnks, or otherwse transmtte va all these lnks, an the number o such lnks may ncrease when ata s transmtte rom the source noe. The MLCM moel tres to cause all noes n the network to partcpate n the ata transmsson n orer to make the network energy evenly consume by more noes, although noes partcpatng n the transmsson may not be locate wthn the task secton o the WTP algorthm. For the WTP algorthm, the network s ve nto sectons base on the number o base statons, an each secton s uner the charge o a certan base staton. It s n act a convergence o a snglebase-staton network, whch s very close to the shortest path moel o common wth a sngle base staton n regars to energy consumpton. In ths case, energy consumpton s lkely to take place at a certan lnk, makng noes on such lnk e excessvely quckly, whch results n a short lnk letme. The MD-MLR algorthm s an event-rven routng moel an s the routng algorthm base on mnmum network elay an maxmum network letme. Accorng to ths algorthm, route scovery wll be re-conucte pror to each routng. The algorthm seeks to mprove the ecency o transmsson to the base staton an reuce elay. However, the path o ata transmsson als to realze the optmal mnmum energy consumpton path on general network energy consumpton, makng the optmzaton unsatsactory. +,-./012,3,04526/3789:34 Network letme &"" %"" "" #"" "" 2< := 27 -> -:/3 2? :@, 27 -> -:/3 2? /8027 -> -:/3 2A B0,, 27 -> -:/3 2A./27 -> -:/3 *"" " #" " %" &" '" (" )"" ))" +, -./0127 :;, *" *+ *# *% *' Fgure 4. Network energy consumton,-. / -, ,2345 #*" " #" " %" &" '" (" )"" ))" Number o noes Fgure 5. Comparson o network letme V. CONCLUION In ths thess, research has been conucte on the maxmum letme communcaton moel o a multsource mult-lnk mult-base staton o a wreless sensor network. Multple base statons are oten eploye n wreless sensor networks n orer to prolong letme, reuce ata elay an renorce network robustness. In terms o wreless sensor network equppe wth multple base statons, ata generate at the source noe can be transmtte to a number o base statons va multple lnks. In the process o ata transmsson, the prmary objectve s to realze maxmum network letme, an the seconary objectve s to reuce ata sze at the noe; namely, to make ata arrve at the base staton va the mnmum number o noes n the network. A lnear programmng moel whch takes a maxmum network letme as the optmal objectve s establshe n orer to cope wth many constrants such as lmte energy an banwth o a wreless sensor network. uch a lnear programmng moel s resolve wth the aopton o a strbute heurstc algorthm. Fnally, perormances o the communcaton moel have been vere through a smulaton experment, whch shows that the propose moel s eectve n mprovng network letme. REFERENCE [1] L.Y. Mn, J.. Hua, A protocol moel or wreless sensor network, Proceengs - Internatonal Conerence on Networks ecurty, Wreless Communcatons an Truste Computng, vol. 2, pp , Aprl [2] R.A. Rahka, Routng n wreless sensor network usng uzzy base trust moel, Proceengs th Internatonal Conerence on Communcaton ystems an Network Technologes, vol.4, pp , May [3] N. Jan, K. Ryszar, N. Macej, Drecte communcaton n Wreless ensor Network base on Dgtal Terran Moel n Internatonal ymposum on Logstcs an Inustral Inormatcs, LINDI 2009, pp [4] H.Q. Long, G.Z. Guo, Research on clou trust moel or malcous noe etecton n wreless sensor network, Ten Tzu Hsueh Pao/Acta Electronca nca, vol. 40, pp , November [5] K. Celalettn, Energy an letme analyss o compresse Wreless ensor Network communcaton, 2013 IEEE ensors Applcatons ymposum, A 2013-Proceengs, pp [6] K. Neha, Mathematcal moel on the transmsson o worms n wreless sensor network, Apple Mathematcal Moellng, vol. 37, pp , March [7] C. aojuan, D.K. Meso, Moellng the energy cost o a ully operatonal wreless sensor network, Telecommuncaton ystems, vol. 44, pp. 3-15, June [8] W. Ruchuan,. Ljuan, tuy on communcaton moel between heterogeneous operatng systems or a wreless sensor network mleware, Chnese Journal o Electroncs, vol. 16, pp , July [9].. Zh, W.Q. Chen, Attenuaton moel o antenna sgnal wth barrers n wreless sensor network, Apple Mechancs an Materals, vol , pp , May [10] L.H. Guang, Full ntererence moel n wreless sensor network smulaton, Proceengs o the th Internatonal ymposum on Wreless Communcaton ystems, IWC2009, pp [11] M. Mchael, H. aj, Investgatng wreless sensor network letme usng a realstc rao communcaton moel, Proceengs-2008 Internatonal Conerence on Multmea an Ubqutous Engneerng, MUE 2008, pp

7 PROPOAL OF A NEW MAIMUM LIFETIME COMMUNICATION MODEL OF WIRELE ENOR NETWORK [12]. Aghaene, Moelng o earthquake precton system on wreless sensor network va satellte communcaton, Proceengs o the Internatonal Astronautcal Congress, vol. 5, pp , Aprl [13] W. Yan, tuy on moel an archtecture o sel-organzaton wreless sensor network, 2008 Internatonal Conerence on Wreless Communcatons, Networkng an Moble Computng, WCOM 2008, pp [14] H.J. Qang, Z. We, Z. Mao, An analytcal moel on unbalance energy consumpton n large scale wreless sensor network, Proceengs - 3r Internatonal Conerence on Measurng Technology an Mechatroncs Automaton, ICMTMA 2011, pp [15] B. uman, G. Chanan, Fuzzy communcaton moel or sensors n Wreless ensor Network, Proceengs o the 2012 Internatonal Conerence on Communcatons, Devces an Intellgent ystems, CODI 2012, pp [16]. Amrta,. Pnak, Hghly reslent communcaton usng ane planes or key prestrbuton an Ree Muller coes or connectvty n wreless sensor network, Communcatons n Computer an Inormaton cence, vol. 162, pp , August [17] C.. Jun, W.M. Rong, Research on sel-aaptve wreless sensor network communcaton archtecture base on ptolemy, Communcatons n Computer an Inormaton cence, vol. 159 pp , Aprl [18] L. Marom, Moellng an smulaton approach or the perormance evaluaton o a wreless sensor network, Proceengs o the IATED Internatonal Conerence on Automaton, ACIT-ICT 2010, pp [19] C. Frank,. hyamala, A clustere wreless sensor network moel base on log - stance path loss, Proceengs o the 6th Annual Communcaton Networks an ervces Research Conerence, CNR 2008, pp AUTHOR Jnhu Le receve hs bachelor's egree n Electronc Inormaton Engneerng rom Zhengzhou Unversty, Zhengzhou, Henan, Chna, n 2003, an the master's egree n Electroncs an Communcaton Engneerng rom Zhengzhou Unversty, Zhengzhou, Henan, Chna, n Now he s now a lecturer at chool o Inormaton Engneerng, Henan Insttute o cence an Technology, nxang , Chna. Hs current research nterests nclue embee systems, gtal sgnal processng, mage processng, pattern recognton. (ljh@hst.eu.cn). yan Tan receve the B.E. n applcaton o electronc technology eucaton rom Henan Normal Unversty, nxang, Henan, Chna, n 2002, an the M. n communcaton an normaton system rom Zhengzhou Unversty, Zhengzhou, Henan, Chna, n Now, she s a lecturer at chool o Mechancal an Electrcal, Henan Insttute o cence an Technology, nxang , Chna. Her research nterests manly ocuse on wreless communcaton, wreless sensor networks an speech sgnal processng. (tanxy2001@126.com). ubmtte 03 eptember Publshe as resubmtte by the authors 16 October JOE Volume 12, Issue 10,