The Research on an Algorithm of Three-Dimensional Topology Control of Wireless Sensor Network

Transcription

1 IJCSI Intenational Jounal of Compute Science Issues, Vol 9, Issue 6, No, Novembe 01 wwwijcsiog 4 The Reseach on an Algoithm of Thee-Dimensional Topology Contol of Wieless Senso Netwok Xiao-chun Hu 1, Chen Fei 1, Chen Yan 1 School of Infomation and Statistics, Guangxi Univesity of Finance and Economy, Nanning 5000, China School of Compute, Electonics and Infomation, Guangxi Univesity, Nanning 50004, China Abstact Nowadays, the eseach about thee-dimensional topology contol has focused on ensuing the connectivity of the netwoks, and has seldom consideed the balance between neighbo node degee and enegy consumption minimum path In ode to solve this poblem, this pape poposes an adjustable topology contol algoithm in thee-dimensional wieless senso netwoks, and this algoithm can dynamically adjust the netwok topology contol stuctue though changing the adjustment facto (0<<1, and make the netwok has good neighbo node degee while etaining some enegy consumption minimum paths The simulation expeiment data shows that the algoithm can make the netwok topology with good adjustability and spasity, and also poves that the algoithm has good effect on polonging the netwok s lifetime and saving the node powe Keywods: wieless senso netwok, thee-dimensional, topology contol algoithm 1 Intoduction With the wide application of wieless senso netwoks, moe and moe eseach in this aea [1][] Topology contol algoithm fo wieless senso netwoks, by means of patial adjustment the tansmission ange of a node, select the appopiate neighbo node communicating, maintaining a stuctue that can impove netwok pefomance ][4] fo CBTC is the -CBTC (Cone Based Topology Contol in thee-dimensional space expansion, the algoithm ensues that each node within any cone of angle α u have at least one neighbo node, when α π/ ensues connectivity, α π/(k, to ensue that the k-connected[5] the fist two-dimensional RNG (Relative Neighbohood Gaph and GG (Gblel Gaph expanded to thee-dimensional space, poposes a new thee dimensional topology based on Yao These studies focus pimaily on ensuing netwok connectivity, and no good taking into account the neighbo node and minimum enegy consumption path fo tadeoffs between the two In addition in the actual deployment of wieless senso netwoks in thee dimensional netwok of neighbo nodes is often bette than a two-dimensional netwok of lage, nodes of high degee would lead to edundancy of infomation and inteaction between nodes, influence of neighbo nodes that ae too low you will choose the path to lowe enegy consumption, incease the enegy consumption of the nodes [6] Theefoe, weigh between neighbo nodes and minimum enegy consumption path fo issues to be egulated accoding to the actual demand This aticle can be applied to thee dimensional topology contol algoithm fo wieless senso netwoks, by adjusting the facto (0<<1 dynamic netwok topology, while etaining some of the minimum enegy consumption path with good neighbo nodes Simulation and expeimental data show that this algoithm constuction of netwok topology has a good adjustability and spase, and algoithm fo optimized netwok lifecycle and node powe with a moe ponounced effect Netwok topology contol algoithms Adjacent diagam with good geometic chaacteistics, especially the extension facto 1 GG has the lowest enegy consumption, while RNG has a lowe-neighbo node [6] This aticle fist of all stuctual elements of the combination GG and RNG, -Neighbohood Gaph[8] extension applied to thee dimensional space, and define an adjustable adjacent gaph 1 Defined netwok model In thee dimensional space R, the collection of all senso nodes fo v, u the wheeabouts of v, v the wheeabouts fo any netwok node V, node, (u,v fo the u and v components; path (uv epesents the path fom node u to v; Repesents the Eule distances between nodes u and v, b (u, Said to u fo the sphee, sphee diamete Ball; spend (uv fom node u to v consumes enegy Copyight (c 01 Intenational Jounal of Compute Science Issues All Rights Reseved

2 IJCSI Intenational Jounal of Compute Science Issues, Vol 9, Issue 6, No, Novembe 01 wwwijcsiog 5 when communicating fom efeence [6] node fo diect communication with the UV enegy consumption when you spend(uv= Α, whee α Define 1:In thee dimensional space R given fo u the wheeabouts of any netwok node v, v the wheeabouts of v, coesponding to thee dimensional -Neighbohood (Thee-Dimensional -Neighbohood Gaph is defined as:, whee m is not a netwok node (u,v halfway between Sphee b (u, And b (v, Repesent the diamete of a sphee of u and v, the ball is Ball; b (m,l to m-sphee, sphee diamete-l the ball; the aea fo the thee sphees intesect, as shown in Figue 1 Points in the egion to: NR ( u, v x R ux, vx, mx l (1 Define :Node set v of a given thee dimensional space R, thee dimensional -Neighbohood zone is defined as: any netwok node u the wheeabouts of v, v the wheeabouts of v If and only if Povides maximum tansmission distance is less than the wieless senso netwok, posed to the egion and any node a netwok node that does not contain any othe w In othe wods, if, be sue thee is no w the wheeabouts of vw netwok node located within the egion, namely wnr ( u, v B( u, B( v, B( m, l Wh ee m is the midpoint of the, l ( / (1 1/ Natue of the netwok model,and 0 1 Accoding to the definition of the netwok model, the netwok model on the constuction hee has the following two popeties: Popety1:In thee dimensional space R, if thee ae any netwok node w located within the egion, by definition communication between nodes on a netwok of is fowaded though the nodes w without establishing diect communication Enegy spend consumed though the nodes w (u,w,v must be less than diect tansfe of enegy spend consumed between (u,v times, ie: spend ( uwv (1 spend ( (1, 其中 demonstate: NR ( u, v Any point total points u, v and w, w Plumb lines, intesection of o, then the path path (u,w,v, enegy consumption: spend ( uw v uw wv ( ( uw ow ( um om ow ( vm om Accoding to the theoem of cosine: om wm mv mv cos omw coswmv wm wm mv (4: om mv wm mv mv ow wv ov wv ( om mv ow mv wm mv wv (, (4, (5-substitute (: ( mv (5 (4 Joint p( uwv uw wv ( mv vw wm vw Accoding to (1 : wm l 1 mv 1 So the enegy consumed by nodes w spend(u,w,v is: s pend uwv mv vw wm vw ( ( 1 (4 4 (4 4 mv vw vw 4 ( (1 Though the above easoning, we can daw the popety 1 Popety:Any node set v in the thee dimensional space R, inheent affiliation: RNG ( V NR ( V GG ( V ; and 0 1 D specially, while =0, NR ( u, v GG ; when =1, (, NR u v RNG Poof : (1 It is fist of all to define ball B( m, is D B( m, GG ( V,we can know that is NR ( u, v s subfield fom the definition 1 So if Copyight (c 01 Intenational Jounal of Compute Science Issues All Rights Reseved

3 IJCSI Intenational Jounal of Compute Science Issues, Vol 9, Issue 6, No, Novembe 01 wwwijcsiog 6 NR ( V, NR ( u, v, While othe netwok node does not exist in the egion, (, B m Inevitably thee is no othe netwok nodes, accoding to GG ( V s define,we can get GG ( V ;on the contay, while GG ( V, NR ( V may not be gotten So we can get NG ( V GG ( V B( m, (We should define the intesection of B ( m, and is B( m, RNG ( V,then we get to be NR ( u, v s subfield fom definition 1 When RNG ( V, RNG ( u, v s aea was not exist othe netwok node, NR ( V Will not keep othe NR ( V netwok node,accoding to s define, we can get NG ( V ; on the contay, while NG ( V, RNG ( V may not establish So RNG ( V NG ( V lu v specially, if =0,, (, NR u v GG, if =1,, NR ( u, v RNG fom RNG ( V NG ( V and NG ( V GG ( V Though the above easoning, we can daw the popety The expansion facto is 1of GG The popety shows by adjusting the paametes, topology contol can guaantee ceiling expansion factos of enegy consumption and enegy expansion facto is constant within a cetain ange [6] ATC algoithms This topology contol algoithm poposed by ATC (Algoithm of Topology Contol into neighbo discovey and topology to establish the implementation of phase : (1Neighbo discovey phase Pojection into any neighboing nodes on a sphee of RADIUS, divided by spheical Delaunay SDT (Spheical Delaunay Tiangulation calculate the maximum blank aea if the aea is less than 7R, make sue that the minimum 1-connected netwok, the algoithm teminates; othewise continue to incease a node u-powe, up to the maximum powe This boowing [7] conclusions of the judge the condition of neighbo discovey algoithm l teminates at the stage, that is, each node in a gadual pocess of inceasing powe to the suounding nodes boadcast a unique numbe containing node, initialized, and esidual enegy message, each node accoding to the infomation eceived to establish a list of the infomation on thei neighbos NL Neighbo Discovey, the code looks like the following: min 1: N u, P P max : FOR ( P P : u boadcast hello message, and collect eply message fom neighbo v; 4: N u N u v ; 5: Poject the locations of N u on the suface of the ball B(u, R; 6: Constuct SDT with the pojected points; 7: Find the lagest spheical cap suface aea; max 8: if ( 7R u 9: beak; 10: End if 11: P incement( P; 1: End fo (Topology building phase: Accoding to the knowledge that u has neighbo table of soting good NLu, step though the pocessing of any of the neighbo node v u Thee is in the fist judgement to find whethe NLu and NLv have some public neighbo node w located inside the aea, if it means that thee is a bette path though w eached the v and u and v thee is no diect communication links; if such a w node does not exist, u and v the establishment of diect communication links Topology building code looks like this: Nu N, u v NL 1: FOR ( u W accoding to w NL FOR ( v W accoding to wv : If w N N w NR ( u, v N N { } : u u v 4: else N N v 5: u u 6:End fo u u Copyight (c 01 Intenational Jounal of Compute Science Issues All Rights Reseved

4 IJCSI Intenational Jounal of Compute Science Issues, Vol 9, Issue 6, No, Novembe 01 wwwijcsiog 7 ATC Algoithm simulation expeiment and pefomance analysis 1 Simulation Envionment Simulation expeiment was done in a Matlab70 envionment, paametes ae set as follows: the cube of side length is 100m egion, andom dispesal 100 node n=100, 60M maximum tansmission RADIUS Simulation of topology contol degee is the entie netwok topology fo maximum value fo all nodes, aveage degee of a node is the aveage value fo all nodes of the netwok as a whole Highe nodes in wieless senso netwoks easie to communications intefeence between signals and conflicting, esulting in significant additional ovehead of node enegy; communications between nodes though the low end to end you need longe tansmission paths, just as easily esult in enegy loss fo the entie netwok Kleinock, who noted that the aveage oveall netwok pefomance is the best in the static wieless senso netwok with the aveage node 6 [5] Simulation of topology contol as shown in Figue, Figue (a was sent to max powe Max Powe, visible connections to the netwok topology is vey cowded Figue (b and (f, espectively [4] GG and RNG in the topology map Figue (c~(e was though ATC algoithm adjustment facto of, espectively 01, 05 and 09 of the netwok topology simulations Simulation diagam, using the paamete to adjust the netwok topology diagam node numbe size of the destination When smalle value, close the topology map GG map that peseves moe low enegy path when the value, the moe the close RNG, numbe of neighbo nodes also have bette chaacteistics Figue Change diagam node with the adjustment facto Figue Simulation of topology contol ATC Pefomance analysis of algoithms The pefomance analysis of ATC algoithm mainly consides the thee aspects of netwok nodes, and nodes of the netwok life cycle Netwok node Node efes to the node in the netwok topology can communicate diectly with the numbe of neighbos Minimum node efes to the entie netwok fo all nodes in the topology of the minimum values and maximum Figue 4 Nodes of netwok scale s node n Figue adjustment facto is the ange of values that stats 0, each step is 01, espectively, 11 diffeent paamete values fo simulation and expeimental contast analysis of the esults As can be seen fom the diagam, with the adjustment facto take diffeent values, aveage between to 6 degees of the nodes, the maximum value at between 5 and 14 Figue 4 netwok size n get 50~400 each simulation netwok of size n inceases the numbe 50, in diffeent netwok scales used in the liteatue [6] SDT algoithm and algoithm of ATC this aticle when the adjustment facto of 0 and 07 aveage esults of node degee of stuctual topology diagam As can be seen fom the figue, as the netwok size gows, neighbo nodes on aveage gowth of SDT and ATC aveage degee of adjustment factos detemined cases emained Copyight (c 01 Intenational Jounal of Compute Science Issues All Rights Reseved

5 IJCSI Intenational Jounal of Compute Science Issues, Vol 9, Issue 6, No, Novembe 01 wwwijcsiog 8 unchanged Theefoe illustate ATC algoithm constuction of netwok topology has a good tone and spase ( Netwok Life Cycle Netwok life cycle is measued fom the netwok began its wok, has to appea in the netwok due to not enough enegy emaining the fist node communicates with neighbo nodes when the netwok topology divided by the elapsed time Figue 5 unning ATC=0, ATC=07, SDT and Max Powe afte fou diffeent algoithms of netwok life cycle compaison chat Hoizontal axis is the numbe of nodes in n scale, vetical axis is the netwok life cycle As can be seen fom the diagam nodes unning at maximum powe the netwok life cycle that has nothing to do with the scale of netwok nodes, nodes will not incease o decease aising fom change, ATC =0, ATC =07, and SDT algoithm as the node size inceases the life cycle of gowth, on the whole, ATC inceased faste than SDT ( Node Powe Aveage powe of wieless senso netwok node fom anothe pespective eflects the netwok enegy consumption at wok, geate the aveage powe of the node, indicate that the netwok is moe enegy consumption at wok and, convesely, less enegy consumption duing the wok Figue 6 is the ATC and SDT algoithm and maximum powe aveage powe in the same netwok envionment compaed to, ATC adjustment facto of 05 in the algoithm As can be seen fom the diagam, two aithmetic mean powe, maximum powe is educed as you incease the numbe of netwok nodes, but oveall ATC algoithm fo maximum powe aveage powe and ae smalle than the SDT algoithm Intefeence010 Digest of Technical Papes Intenational Confeence on Consume Electonics(ICCE, Las Vegas, NV, 010: [] Y Wang,L J Cao,Teesa ADahlbeg,F Li,X H Shi Self- Oganizing Fault-Toleant Topology Contol in Lage-Scale Thee-Dimensional Wieless Netwoks ACM Tansaction on Autonomous and Adaptive System009,4( [] Junseok Kim,Younggoo Kwon-Dimensional Topology Contol fo Wieless Senso Netwoks in Pesence of Intefeence010 Digest of Technical Papes Intenational Confeence on Consume Electonics(ICCE, Las Vegas, NV, 010: [4] MBahamgii,MHajjaghayi,VSMiokni Fault-toleant and -Dimensional Distibuted Topology Contol Algoithms in Wieless Multi-Hop NetwoksWieless Netwoks006,1(: [5] Y Wang,L J Cao,Teesa ADahlbeg,F Li,X H ShiSelf- Oganizing Fault-Toleant Topology Contol in Lage-Scale Thee-Dimensional Wieless NetwoksACM Tansaction on Autonomous and Adaptive System009,4( [6] Y Wang,L J Cao,Teesa ADahlbeg,F Li,X H Shi Self- Oganizing Fault-Toleant Topology Contol in Lage-Scale Thee-Dimensional Wieless Netwoks ACM Tansaction on Autonomous and Adaptive System009,4( [7] AGhosh,YWang,BKishnamachai Efficient Distibuted Topology Contol in -Dimensional Wieless NetwoksIn Poceedings of the 4th Annual IEEE Communications Society Confeence on Senso, Mesh and Ad Hoc Communications and Netwoks(SECON,San Diego,USA,007:18-1,xiao-chun hu Compute softwae pofessional,gaduate,univesity lectue,engaged in eseach in compute science and technology,published in EI and ISTP compute pape chenfei Compute softwae pofessional,gaduate,univesity chen yan Compute softwae pofessional,gaduate, univesity Associate Pofesso 4 Conclusions Fom above of contast analysis can concluded that conclusions, this made of ATC algoithm is a can egulation of wieless senso netwok topology contol algoithm, though adjustment facto (0<<1 dynamic adjustment netwok topology stuctue, makes netwok has good neighbos node degees of while etained has pat enegy minimum path, ATC algoithm constucted of netwok topology figue has good of can adjustable sexual and spase sexual, while in netwok life cycle and node powe aea ae than SDT algoithm o Max Powe algoithm to excellent Refeences [1] Junseok Kim,Younggoo Kwon-Dimensional Topology Contol fo Wieless Senso Netwoks in Pesence of Copyight (c 01 Intenational Jounal of Compute Science Issues All Rights Reseved