Study of Wireless Sensor Network Location Algorithm and Data Collection Protocol

Transcription

1 Study of Wreless Sensor Network Locaton Algorthm and Data Collecton Protocol Wemn Han 1, Shjun L,4, Wedong L 3 1 Hunan Vocatonal Insttute of echnology, Xangtan, Chna; Hunan Insttute of ngneerng; Hunan Provncal Key Laboratory of Wnd Generator and Its Control Xangtan, Chna 3 Powerchna Zhongnan ngneerng Co.Ltd, Changsha, Chna 4 Hunan provnce Cooperatve Innovaton Center for Wnd Power qupment and nergy Converson, Xangtan, Chna Abstract It s deduced that the network lfe tme s nversely proportonal to the zone area of the collecton data that each snk s responsble for. hat s to say, when the zone area n the charge of a snk s smaller, the average load of nodes dstrbuted n ths area and the energy consumpton are smaller, whle the network lfe tme s longer. MSGP protocol s proposed, wth several round cluster head canddate zones, fxed member zones and publc zones beng delmted to make approxmately unform clusterng. he cluster head s responsble for collectng a meanngful event n the cluster, makng data fuson and then forwardng t to snk. Mult-snks move accordng to the zone dvson rules and the rule of free movement. Specfc analyss s made from three aspects of data drecton, sngle round data collecton of snk, and network lfe tme. Index erms wreless sensor network, data collecton protocol, locaton algorthm, mult-snks. I. INRODUCION he applcaton and study of statc wreless sensor network are based on the assumpton that the nodes do not move. Wth the expanson of the applcaton, many scholars propose the concept of moble nodes. In such applcatons, some nodes can be moved. For example, n the applcaton of ocean montorng, the sensor node s nstalled on a buoy and t s nevtable for the buoy to move. Addtonally, the sensor node nstalled on the automoble can also move. It s by relyng on the moble nodes that the traffc center obtans, analyzes and processes the traffc flow n ths regon so as to make new and favorable traffc schedulng [1]. he applcaton of moble nodes brngs new opportuntes to the wreless sensor network, whch can mprove the locatng accuracy of the nodes, and prolong the lfetme of the network. However, t also leads to some challenge. he frequent node movement results n falure of the establshed communcaton lnk and soluton of the tme slot dstrbuton. Some classcal routng methods can also fal completely, so ths rases hgher requrements for the desgn of communcaton protocol. II. ANALYSIS OF H PROBLM In the wreless sensor network, the load of nodes surroundng the snk s the largest n the whole network whose lfe cycle depends on the lfe of these nodes. he average node load formula s deduced targetng the round network. he lfetme of a mult-snks network s further analyzed wth ths formula. When there s only one snk n the network [], the average node load L s as follows, wth the snk beng at the center of the crcle:! ( R % d )" e & + " e d ' r L = ) # ( r (1) & * R" er d< r Among whch representng the radus of the round network, r s the communcaton radus of the node, s the probablty n whch the node transmts the data wthn the unt tme, e s the energy that the node consumes to receve and transmt the unt data, J s the dstance from the node to the crcle center of the network, and s constant, =arcsn(r/d). When the node s close to snk, the load s large, as well s the energy consumpton. As shown n formula (1), the maxmum load of the node can be represented as follows: ( L ) R! e r max 1" lnk = () By multplyng the numerator and the denomnator wth the formula above becomes:! R " e max 1# lnk ( L ) = (3)! r R and are the area of the whole network and the area of the node communcaton scope respectvely. When they are represented by S1-lnk and S r, we obtan: 1 ( L ) max 1 " lnk S! e " lnk = (4) Sr Assumng the ntal energy of all nodes n the network s the same, whch s represented by n, then the network lfetme can be represented as: n mult" sn k =! (5) ( Lmax ) mult" sn k 1 sn k! L n max " = (6) Among whch represents the coeffcent, multsnk and 1-snk are the lfetme of the network ownng multple snks and sngle snk respectvely. he rato of ths tow s: n S1 # sn k! e " ( Lmax ) S S = = = (7) S! e " S mult# sn k mult# sn k r 1# sn k 1# sn k n mult# sn k mult# sn k Lmax Sr 70

2 We take the lfetme of a sngle snk network as the reference, set 1-snk=1, then the formula above can be smplfed as follows: S1! lnk = (8) mult! sn k Smult! sn k As known from formula (9), when there are mult-snks, the network lfetme s nversely proportonate to the zone area that each snk s responsble for. hat s to say, when the zone area s smaller of the data collecton that snk s responsble for, the average load of the nodes dstrbuted n ths zone s smaller and the node energy consumpton s smaller but the network lfetme s longer. Amng at a mult-snks scenaro, we propose two approaches for comparson [3]. One s to dvde the data collecton zone that each snk s responsble for, another s that snk moves freely. It s consdered n ths secton that multple moble snks and n sensor nodes collect the data n the network (L L). he sensor nodes are suppled by the battery, ther communcaton radus s the same and ther own coordnates are known. Mult-snks do not have a lmtaton of energy. III. MULI-SINKS DAA COLLCION PROOCOL Clusterng treatment for MSGP agreement s completed due to the advantages of clusterng. Several rounds of cluster head canddate zones, fxed member zones and publc zones are delmted to make approxmately unform clusterng[4]. he cluster head s responsble for collectng the relevant event n the cluster, makng data fuson and then forwardng t to snk [5]. Mult-snks move accordng to the zone dvson rules and free movement rule. Addtonally, these two approaches are compared. A. Round clusterng law! " x # N x = l % & y " # N y = l % & ' 1( ' 1( +, Nx ) - l) r0 * x *, Nx ) -l+ ro. /. / ' 1 ( ' 1 (, Ny ) - l) r0 * y *, Ny ) -l+ r0. /. / ' ' 1 ( ( ' ' 1 ( ( x ) Nx ) l + y ) Ny ) l * r,, -, - -, / /.. / / (1) Round cluster head canddate zone Several round cluster head canddate zones are set and the nodes deployed n the zone can compete for cluster heads. he advantages of unform head dstrbuton have already been ntroduced above. As shown n Fgure 1, the nsde of the small cycle s the round cluster head canddate zone. he node decdes whether t belongs to ths zone dependng on formula (10). In the formula, x and y are the coordnates of node. [x/l] s rounded up to the nteger;.e., the mnmum nteger larger than x/l, r 0 s the radus of cluster head canddate zone (r 0 =l/), (( Nx! 1/ ) l, ( Ny! 1/) l) s the co- ordnate of central pont of the canddate zone [6]. () Fxed member zone One crcular fxed member area s set outsde each round cluster head canddate zone. he nodes deployed at ths zone can only enter the cluster formed by the cluster 0 (9) ll 1,, 1,1,1 ll Fgure 1. Partton model head canddate zone n the mddle. r s the crcular rng wdth (r =l/). he crcular rng area between the large and small crcles n Fgure1 s the fxed member zone [7]. (3) Publc zone Outsde the fxed member zone s the publc area. he nodes deployed n ths zone jon the cluster formed by the cluster heads closest to them, as shown n the shaded area f = r! r / r s the dstance from the n Fgure 1. ( ) d 0 0 node to the center of round cluster head canddate zone. Fgure shows the cluster heads produced wth the tradtonal clusterng approach. her poston dstrbuton s unform and cluster heads n ths part of the zone s too low. Fgure 3 shows the cluster heads produced wth the round clusterng approach whose poston dstrbuton s relatvely unform. Fgure. Uneven dstrbuton of head Fgure 3. Nearly unform dstrbuton of head (a) Non-unform dstrbuton of cluster heads (b) Approxmately unform dstrbuton of cluster heads [8-9]. B. MuIt-snks movement rules Wth the goal of mult-snks, two knds of movement rules are proposed: regonal dvsons rule and free movement rule. S s used to represent the mult-snks set S = { s1, s,!, s k }, among whch k s constant( k! ). Assumng a snk moves once each other rounds [10]. JO Volume 1, Issue 10,

3 Fgure 4 shows the data flow chart of snk stop ponts. he crcle represents the round cluster head canddate zone whch s abstracted to one cluster for convenence of analyss. he black trangular s snk and the dotted arrow s the data flow drecton. In Fgure 4, the snk stops at the non-boundary area and there are eght clusters n total n the surroundng whch are A, B, C, D,, F, G and H. In Fgure 5, there are fve clusters n total whch are A, B, C, D and. It s assumed that each cluster sends n data packets to snk each round. he total data transmtted by perpheral cluster heads whch wll be receved by the eght adjacent clusters of the snk n Fgure 4 s 16n whle that receved by the fve adjacent clusters of the snk n Fgure 5 s 19n. herefore, the average data receved by the adjacent clusters of snk n Fgure 4 s data a 16n = = n (10) 8 he average data receved by the adjacent clusters of snk n Fgure 5 s 19n data a = (11) 5 data Obvously, datab > ;.e., the load of adjacent clusters of snk s relatvely large, and so s the energy con- a sumpton n Fgure 4. In order to reduce the load of neghborng clusters and prolong the network lfetme so that the snk can stop n the mddle of responsble data collecton zone as much as possble, the target selecton functon to select the next stop pont of snk s proposed. Fgure 4. Data Drecton of MSGPZDK C. arget selecton functon center / center V =! V +! V (1) Among whch V = ( d! d ) d, V =1/ ( p 1 + ) represents the dstance from apex A to the center 0 of the data collecton responsble zone, d represents the dstance from the center of each round cluster head canddate area n the responsble zone to 0; p represents the number that snk stops n the round cluster head canddate area, 1 and are adjustment parameters. he target selecton functon consders the next stopng pont of snk from two aspects whch are the dstance from the central pont of responsble zone to the number of snk stops. he cluster closer to the central pont and wth a smaller number of stops wll be taken as the stop pont. IV. PRFORMANC ANALYSIS AND SIMULAION S Performance analyss s conducted for two MSGP protocols n ths secton. he total amount of data produced by the network s D total. In MSGP ZDR, the amount of data each snk collects s D total /k, whle n MSGP FMR, the maxmum amount of data that snk can collect s D total and the mnmum s 0. We choose the mean value of D total /. As can be seen n Fgure 5, the adjacent clusters of snk can be eght at most and three at least, and we choose the mean value of 5.5. he data that the adjacent cluster has to transfer n MSGP ZDR and MSGP FMR are D total /5.5k respectvely. Whle k!, so D total /11! D total /5.5k;.e., the more the data transferred by the neghborng clusters of snk n MSGP FMR, the more the energy consumpton (as other parameters shown n able 1). A. Data flow Fgures 6 and 7 show the data flow of MSGPZDR and MSGPFMR protocol at a certan tme. Snce the responsblty zone s dvded, the snk dstrbuton n MSGPZDR s relatvely unform and the load amount n each responsblty zone s approxmately the same. In ths way, the energy consumpton of the neghborng clusters surroundng snk tends to be the same. Addtonally, the poston nformaton of snk s only updated n the responsblty zone whch avods energy consumpton for forwardng due to the overlappng of multple snk poston nformaton. In MSGPFMR, all the snks move freely, whch wll lead to the non-unform dstrbuton of snks and a porton of snk neghborng load s too large, ncreasng the energy consumpton [11-13]. A B C D F G H Fgure 5. Data Drecton of MSGPFMR Fgure 6. Non-edge regon for stoppng poston 7

4 Fgure 7. dge regon for stoppng poston he applcaton and study of statc wreless sensor network are based on the assumpton that the nodes do not move. Wth the expanson of the applcaton, many scholars propose the concept of moble nodes. In such an applcaton, some nodes can be moved. For example, n the applcaton of ocean montorng, the sensor node s nstalled on the buoy and t s nevtable that the buoy wll move. Addtonally, the sensor node nstalled on the automoble can also move. It s by relyng on the moble nodes that the traffc center obtans, analyzes and processes the traffc flow n ths regon so as to make new and favorable traffc schedulng. In the process of buldng the routng, a chld rado base staton began to constantly transfer an nformaton package to the surroundng node, establshng a communcaton radus of the expanson of the tree structure[14]. he routng tree structure, base staton s consdered as the root, the data s convertng from the source node to the leaves of the tree, and the data flow from the leaves to the root node. After completng the establshment of the tree structure, n the process of the data transfer from the source node to others, the source node can adjust the routng lnk on a small scale, such when the orgnal lnk n source node becomes dormant[15-16]. Because the wreless sensor network (WSN) s n broadcast mode, all the work nodes can receve nformaton wthn the scope of the rado, so the new lnk can be establshed. Where the data flow s concentrated, n the orgnal tree structure, the node can rely on the tree structure to establsh multple pathways and fnally get to the base staton, wthout the need to refactor all routng processes [17]. he applcaton of moble nodes brngs new opportuntes to the wreless sensor network, whch can mprove the locatng accuracy of the nodes, and prolong the lfetme of the network [18-0]. However, t also leads to some challenges. he frequent node movement results n falure of the establshed communcaton lnk and tme slot dstrbuton soluton. Some classcal routng methods can also fal completely, so ths rases hgher requrements for the desgn of communcaton protocol. A C D B B. Data collecton by snk each round ables and 3 show the data collecton by snk each round of these two protocols. In able, the data collecton by snk each round s bascally the same, whch suggests that the load of snk neghborng clusters s bascally the same and the energy consumpton s unform, and ths s attrbuted to the dvson of snk data collecton responsblty zones n MSGP ZDR. In able 3, the data collecton amount s shown of snk 1 and snk as 43.61kb and 63.4kb. Obvously, the sngle round data collecton of each snk n MSGP FMR s largely dfferent. he load of neghborng clusters of the snk wth a large data collecton amount n sngle round s too large, so the energy consumpton s too hgh, whle the load of the adjacent clusters of the snk wth a small data collecton amount n a sngle round s small, so the energy consumpton s also small. he unbalance n energy consumpton wll lead to the energy hole and shortens the network lfetme. hs s because each snk of MSGP FMR can move freely, whch wll nevtably make the snk densty n a certan part hgher and lower n another part. he load s large where the snk densty s low and the load s small when the snk densty s hgh. he applcaton and study of statc wreless sensor networks are based on the assumpton that the nodes do not move. Wth the expanson of the applcaton, many scholars propose the concept of moble nodes. In such applcatons, some nodes can be moved. For example, n the applcaton of ocean montorng, the sensor node s nstalled on a buoy and t s nevtable for the buoy to move. Addtonally, the sensor node nstalled on the automoble can also move. It s by relyng on the moble nodes that the traffc center obtans, analyzes and processes the traffc flow n ths regon so as to make new and favorable traffc schedulng. C. Network lfe tme he network lfetme of these two protocols s shown n able 4. In MSGP ZDR, the best stuaton and the worst stuaton of the network lfetme s rounds and rounds respectvely whle the network lfetme correspondng to MSGP FMR s rounds and rounds. he snk load of MSGP ZDR s relatvely unform, so that the node energy consumpton s relatvely unform and the network lfetme s longer; whle the snk load n some portons of MSGP FMR s too large, so that the energy consumpton of ther adjacent clusters s too large and they fal n advance, whch shortens the network lfetme. ABL I. PARAMR S Parameter Value Sde length of the network 700mm l snk 900mm L 180mm R 0 90mm R 1 90mm Communcaton radus 30mm he node densty 0.003/m lect 50nj/bt! fs 10pj/bt/m! mp 0.001pj/bt/m da 5nj/bt/m! 1! 1:1 K 8 Data sze 000bt Intal energy J JO Volume 1, Issue 10,

5 ABL II. SINK DAA COLLCION FOR ON RM(MSGPZDR) Snk1 Snk Snk3 Snk4 Snk5 Snk6 Snk7 Snk8 Snk9 data sze ABL III. SINK DAA COLLCION FOR ON RM(MSGPFMR) Snk1 Snk Snk3 Snk4 Snk5 Snk6 Snk7 Snk8 Snk9 data sze ABL IV. H COMPARISON FOR NWORK SURVIVAL IM MSGPZDR MSGPFMR he best condton he worst condton he best condton he worst condton Network survval tme V. CONCLUSIONS he largest communcaton model of a wreless sensor network lfetme s based on multple source lnks and multple base statons. he data that was produced from source node can be transmtted to dfferent lnks of base staton nodes. Source node product data, and ntermedate node provdes data forwardng busness. Data translates from the edge of network nodes to base staton node collecton, and data source node percepton though a jump or jump forward to base staton node. Homologous node s possble to be routed to dfferent base staton nodes through dfferent data lnks. Homologous node data has a strong correlaton, and dfferent source nodes can cognate data n the process of data fuson. Consderng the source data fuson processng that the base staton node needs from multple base staton nodes to a tree structure, the root node s connected to the base staton through a vrtual lnk. One of the base staton nodes s as a root node, and the root node deletes redundant compressed data before sendng data to the termnal recever. One wreless sensor network data collecton protocol based on multple moble snks s presented n ths paper. Wth the expanson of the applcaton zone, the energy consumed by the node farther away from snk to transmt the relevant event wll ncrease and the real tme performance s reduced. hs study s focused on the data collecton protocol wth multple moble snks. In MSGP protocol, several round cluster head canddate zones, fxed member zones and publc zones are delmted to make approxmately unform clusterng. he snk moves accordng to the rule of zone dvson and the rule of free movement (MSGP ZDR and MSGP FMR ). It s analyzed theoretcally that multple sns can balance the network load and save the energy consumpton of node. he smulaton results show MSGP ZDR s better than MSGP FMR n terms of data collecton amount by snk n each round and network lfetme. RFRNCS [1] M.A. Adnan, M.A. Razzaque, A novel cuckoo search based clusterng algorthm for wreless sensor networks, Lecture Notes n lectrcal ngneerng, vol. 3, pp August [] R. Anane, R. Bouallegue, K. Raoof, Medum access control (MAC) protocols for wreless sensor network: An energy aware survey, Lecture Notes n lectrcal ngneerng, vol. 3, pp , June [3] C. mmanoulds, P. Pstofds, Desgn requrements for wreless sensor-based novelty detecton n machnery condton montorng. ngneerng Asset Lfecycle, Management-Proceedngs of the 4th World Congress on ngneerng Asset Management, WCAM 009, pp [4] S.D. Jang, B.W. Kang, Frequency selectve surface based passve wreless sensor for structural health montorng, Smart Materals and Structures, vol., pp. 1-31, June [5] S. Meena, N. K. Prakash, Runtme reconfguraton of wreless sensor node usng FPGA, 5th Internatonal Conference on Computng Communcaton and Networkng echnologes, ICCCN 014, pp cnt [6] N. Wu, J. Zhang, Moble nodes deployment scheme desgn based on perceved probablty model n heterogeneous wreless sensor network, Journal of Robotcs and Mechatroncs, vol. 6, pp , August [7] X.H. Yu, Content of smart wreless sensor network securty and ts network securty polcy, Computer Modellng and New echnologes, vol. 18, pp , June 014. [8] Y. Zhou, D. Xao, Polcy-based dstrbuted management for wreless sensor networks, I Conference Publcatons, vol. 5, pp , May 006. [9] J. Zhpeng, Z. Sanguo, Relablty evaluaton of wreless sensor networks usng logstc regresson, 010 WRI Internatonal Conference on Communcatons and Moble Computng, CMC 010, Vol. 3, pp , Aprl 010. [10] B. Steffen, L. Cyrl, Rollout Algorthms for Wreless Sensor Network-Asssted arget Search, I Sensors Journal, Vol. 15, pp , July [11] K. Sanjeev, V. Poor, Regresson n sensor networks: ranng dstrbutvely wth alternatng projectons, Proceedngs of SPI - he Internatonal Socety for Optcal ngneerng, Vol. 5910, pp. 1-15, Aprl 005. [1] C. Adt, V. Palanandavar, An effcent statstcal approach for tme synchronzaton n wreless sensor networks, Internatonal Journal of Communcaton Systems, Vol. 9, pp , March [13] J.B.Predd, S.R. Kulkarn, H.V. Poor, Dstrbuted kernel regresson: An algorthm for tranng collaboratvely, 006 I Informaton heory Workshop, IW 006, pp [14] C. Jongyoo, Development and evaluaton of an ambulatory stress montor based on wearable sensors, I ransactons on Informaton echnology n Bomedcne, Vol. 16, pp , March [15] O..K. Aktouf, I. Parsss, SMAR servce for fault dagnoss n wreless sensor networks, Proceedngs - 6th Internatonal Con- 74

6 ference on Next Generaton Moble Applcatons. NGMAS 01, pp [16] I. Aydn, M. Karaköse, Wreless sensor network based fault dagnoss approaches, 013 1st Sgnal Processng and Communcatons Applcatons Conference, SIU 013, pp [17] S.H. Chang, A causal model method for fault dagnoss n wreless sensor networks, Proceedngs-10th I Internatonal Conference on Computer and Informaton echnology, CI-010, pp [18] C.L. He, echnology research on the fault dagnoss of wreless sensor network system, Advanced Materals Research, vol. 84, pp , Aprl 014. [19] X.H. Jn,.W.S. Chow, Kuper test and autoregressve modelbased approach for wreless sensor network fault dagnoss, Wreless Networks, vol. 1, pp ,May [0] P.M. Khlar, Intermttent fault dagnoss n wreless sensor networks, Proceedngs-10th Internatonal Conference on Informaton echnology, ICI 007, pp [1] Q. L, Wreless sensor network fault dagnoss method of optmzaton research and smulaton, Appled Mechancs and Materals, vol. 347, pp , May 009. AUHORS Wemn Han s an assocate professor wth Department of Wnd engneerng, Hunan Vocatonal nsttute of echnology, Xangtan , Chna. Her research nterests nclude wnd power engneerng, nformaton engneerng and automaton. (e-mal: B @hnu.edu.cn). Shjun L s a doctoral student of College of lectrcal and Informaton ngneerng, Hunan Unversty, Xangtan , Chna. He s manly engaged n the study of computer control technology. He s also wth Hunan provnce Cooperatve Innovaton Center for Wnd Power qupment and nergy Converson, Xangtan , Chna (emal: lshjun80404@qq.com). Wedong L s a master of Powerchna Zhongnan ngneerng Co. Ltd., Changsha , Chna. He s manly engaged n communcaton technology research. (e-mal: Lsj18167@qq.com). Submtted 03 September 016. Publshed as resubmtted by the authors 3 October JO Volume 1, Issue 10,