Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection
|
|
- Evangeline Bell
- 5 years ago
- Views:
Transcription
1 Wreless Sensor Network, 010,, do:10.436/wsn Publshed Onlne November 010 ( Range-Based Localzaton n Wreless Networks Usng Densty-Based Outler Detecton Abstract Khald K. Almuzan, Aaron Gullver Department of Electrcal and Computer Engneerng, Unversty of Vctora, Vctora, BC, Canada E-mal: kmuzan@ece.uvc.ca, agullve@ece.uvc.ca Receved August 13, 010; revsed September 15, 010; accepted October 18, 010 Node localzaton s commonly employed n wreless networks. For example, t s used to mprove routng and enhance securty. Localzaton algorthms can be classfed as range-free or range-based. Range-based algorthms use locaton metrcs such as ToA, TDoA, RSS, and AoA to estmate the dstance between two nodes. Proxmty sensng between nodes s typcally the bass for range-free algorthms. A tradeoff exsts snce range-based algorthms are more accurate but also more complex. However, n applcatons such as target trackng, localzaton accuracy s very mportant. In ths paper, we propose a new range-based algorthm whch s based on the densty-based outler detecton algorthm (DBOD) from data mnng. It requres selecton of the K-nearest neghbours (KNN). DBOD assgns densty values to each pont used n the locaton estmaton. The mean of these denstes s calculated and those ponts havng a densty larger than the mean are kept as canddate ponts. Dfferent performance measures are used to compare our approach wth the lnear least squares (LLS) and weghted lnear least squares based on sngular value decomposton (WLS-SVD) algorthms. It s shown that the proposed algorthm performs better than these algorthms even when the anchor geometry about an unlocalzed node s poor. Keywords: Localzaton, Postonng, Ad Hoc Networks, Range-Based, Wreless Sensor Network, Outler Detecton, Clusterng 1. Introducton The process of fndng the spatal locaton of nodes n a wreless network has been called localzaton, postonng, geolocaton, and self-organzng n the lterature. The term localzaton s the most popular and so s used here. In a wreless network, we can classfy the nodes nto three categores, anchor, unlocalzed, and localzed. The frst group of nodes know ther poston or coordnates and are called anchors. Nodes n the second group do not know ther poston and are called unlocalzed. The thrd group contans those nodes whch were n the second group but subsequently had ther postons estmated, and thus are called localzed. The locaton nformaton of nodes n a wreless network can be used for many useful purposes such as trackng moble nodes, determnng the coverage area, load and traffc management, node lfetme control, cluster formaton, and routng enhancement. There are many dfferent aspects to the localzaton problem, such as when localzaton should be performed and how frequently. Upon network start up, all nodes should be ntally localzed. However, ths may have to be repeated perodcally, for example f there are moble nodes n the network. The qualty or resoluton of the localzaton s an mportant consderaton. Sometmes, node locatons are requred wthn meters of ther actual postons, and other tmes wthn a few centmetres. Some applcatons only requre relatve localzaton, such as node A s n regon 1 and node B s n regon, or node A s close to node B. For example, montorng people n a buldng when we need to know how many have entered a gven room durng the day. The computatons assocated wth localzaton can bedstrbuted (done at each node), centralzed (done at a central unt), or both (done at cluster heads n the network). When the number of anchor nodes s low, they typcally cannot cover the entre wreless network. Ths means that some unlocalzed nodes may not be wthn range of a suffcent number of anchor nodes. In ths case, Copyrght 010 ScRes.
2 808 K. K. ALMUZAINI ET AL. localzed nodes can partcpate n the localzaton process by actng as anchors. Ths s called cooperatve localzaton. Localzaton algorthms can be dvded nto two categores: range-based and range-free. Range-free algorthms depend on proxmty sensng or connectvty nformaton to estmate the node locatons. These nclude CPE [1], centrod [], APIT [3], and the dstrbuted algorthm n [4]. Range-based algorthms estmate the dstance between nodes usng measurements such as tme of arrval (ToA) [5], tme dfference of arrval (TDoA) [6], receved sgnal strength (RSS) [7], or angle of arrval (AoA) [8]. Poston accuracy s not constant across the area of coverage, and poor geometry of the unlocalzed nodes relatve to the anchor nodes can lead to hgh geometrc dluton of precson (GDOP). GDOP s commonly used to descrbe localzaton accuracy. Generalzed GDOP (GGDOP) s a smlar measure used to compare the performance of localzaton algorthms. The proposed approach dffers from conventonal solutons to the localzaton problem n wreless networks. Typcally the locatons of the anchors wthn range and the estmated dstances between the unlocalzed node and these anchors are used to drectly estmate ts locaton. Instead, we use a mult-step process. An approach from data mnng called densty-based outler detecton (DB OD) [9] s employed whch uses the dstance to the K- nearest neghbours (KNN) to select the best (canddate) ponts, and these are averaged to get the estmated locaton of the unlocalzed node. The lnear least squares (LLS) [10] and the weghted lnear least squares sngular value decomposton (WLS-SVD) [11] algorthms as a benchmark. In [11], the WLS-SVD algorthm s compared wth a maxmum lkelhood (ML) algorthm [1], multdmensonal scalng (MDS) [13], and the best lnear unbased estmator approach based on least square calbraton (BLUE-LSC) [14]. Accordng to [11], WLS-SVD performs better than any of these three algorthms. The remander of the paper s organzed as follows. Dluton of precson s explaned n Secton, and the densty-based outler detecton technque s explaned n Secton 3. The proposed algorthm s presented n Secton 4. Some performance results are gven n Secton 5, and fnally some conclusons are gven n Secton 6. errors result n errors n the computed node coordnates. The magntude of the fnal error depends on both the measurement errors and the geometry of the structure nduced by the nodes. The contrbuton due to geometry s called the geometrc dluton of precson (GDOP). GDOP s used extensvely n the GPS communty as a measure of localzaton performance [15]. The dstrbuton of the anchors around an unlocalzed node can have a good or poor GDOP, as shown n Fgure 1. Another verson of GDOP s the generalzed geometry of dluton precson GGDOP. GGDOP depends on the geometry of the anchors around an unlocalzed node and the accuracy of the range measurements. GGDOP s defned as [16] m m (1) m where m 1 m 1 () and m m sn ( j) m (3) 1 j1, j> j The dstance error for node has a Gaussan dstrbuton wth varance. The angle s the orentaton of the th anchor or localzed node relatve to the node (a). Dluton of Precson Dluton of precson s a metrc whch descrbes how good an anchor node geometry s for localzaton. The dstance measurements used to compute the node coordnates always contan some error. These measurement (b) Fgure 1. Node locatons wth poor and good GDOP. (a) Nodes wth poor GDOP; (b) Nodes wth good GDOP. Copyrght 010 ScRes.
3 K. K. ALMUZAINI ET AL. 809 whose locaton s beng estmated, as shown n Fgure, and m s the number of anchors and localzed nodes nvolved n the estmaton. As the GGDOP ncreases, the localzaton error decreases. In [16], t was shown that for all { },{ },0 1/4 m 3. Densty-Based Outler Detecton The densty-based outler detecton algorthm s commonly used n anomaly detecton. The outler score s just the nverse of the densty score of a pont. The densty s the nverse of the mean dstance to the K-nearest neghbours of pont p [9] and s gven by (, ) (, ) (, ) d p y yn p K densty p K (4) N( p, K) where N( p, K ) s the set contanng the K-nearest neghbours of pont p, N( p, K) s the sze of ths set, and y s a nearest neghbour. The densty-based outler detecton algorthm s gven n Algorthm 1 [9]. Algorthm 1 Densty-based Outler Detecton 1: K s the number of nearest neghbours : for all ponts p do 3: determne N (p, K) for p 4: determne the densty of p 5: the outler score s the nverse of the densty 6: end for 4. The Proposed Algorthm The frst step n localzaton s to obtan dstance estmates for the unlocalzed nodes from the anchor and localzed nodes that are wthn range. These estmates provde the rad for crcles around the nodes. The ntersecton of these crcles for an unlocalzed node forms a set 1 j of ponts to be used n the remander of the algorthm. The key s to choose canddate ntersecton ponts whch are closest to each other. In the deal case the crcles n tersect on the unlocalzed node. For example, when we have three anchors, three ntersecton ponts le on the node, whle the other three do not. However, n practcal stuatons where nose and other sources of error exst, ths event s unlkely and the crcles ntersect as n Fg- -ure 1. In Fgure 3, the ntersecton ponts of the crcles around anchor nodes p 1 = (x 1,y 1 ) and p = (x,y ) are denoted as p 1 and p 1, and ther coordnates are gven by [17] and x x1 ( x x1)( r1 r ) x d y y1 (( r 1r) d )( d ( r r1) ) d y y1 ( y y1)( r1 r ) y d x x1 (( r 1r) d )( d ( r r1) ) d where the p 1 x-coordnate corresponds to the plus sgn n (5), and the correspondng y-coordnate corresponds to the mnus sgn n (6). The dstance between the anchor nodes s (5) (6) d( p, p ) ( x x ) ( y y ) (7) Each unlocalzed node estmates ts dstance from each anchor or localzed node that t can receve a sgnal from. Ths node can estmate ts poston only f t s n range of three or more of these nodes. The ntersecton of the crcles formed from all estmates of the unlocalzed node provde a set of ponts. If we have m anchor and/or localzed nodes, then they form g groups where m m! g!( m )! (8) j j Fgure. An unlocalzed node wth multple anchors wthn ts range. Fgure 3. Intersecton of the dstance estmates for two anchors. Copyrght 010 ScRes.
4 810 K. K. ALMUZAINI ET AL. Each group conssts of two ponts as a result of the ntersecton between two anchor and/or localzed node estmates, as shown n Fgure 3. The total number of ponts f all estmates ntersect s g. The goal s to average a subset of these ponts to obtan the locaton estmate. The thrd step s to calculate the densty of each ntersecton pont. To do ths, the K-nearest neghbours, K g 1, of each ntersecton pont are used to calculate the densty accordng to (4). The ponts wth a densty hgher than the mean densty are selected as canddates. In some cases, the estmates are too small, resultng n crcles that do not ntersect. However, these ntersecton ponts can stll be calcuated, but they wll be complex numbers. If ths occurs, we consder the real part as the ntersecton pont n subsequent calculatons. Fgure 4 llustrates the steps of the proposed algo- (a) (b) (c) Fgure 4. The proposed algorthm wth four anchor nodes. (a) Step 1: Dstance estmates for an unlocalzed node from four anchors; (b) Step : The ntersecton ponts; (c) Step 3: The canddate ntersecton ponts. rthm for four anchor nodes. After the four dstance estmates are determned, the g = 1 ntersecton ponts are found. Note that because two pars of crcles do not ntersect, there are only w = 10 ponts n Fgure 4(a) (snce the real parts of the complex numbers are the same). Then the average densty for all ntersecton ponts s calculated as D w 1 densty( v, K) where v s an ntersecton pont and w s the number of ntersecton ponts. Fnally, the ponts wth densty gven by (4) greater than the average D are selected as canddate ponts. If the canddate ponts are v = { v1, v,... v q }, then the estmated locaton of the unlocalzed node s the average of these ponts w q v 1 û= (10) q We next consder the effect of employng localzed nodes to help n the localzaton of nodes whch do not have a suffcent number of anchors around them. If nodes wth transmsson range r are randomly deployed n an area A, then the probablty of an unlocalzed node beng wthn transmsson range of a gven node s r pr A The probablty of a node havng degree,.., e anchor or localzed nodes wthn ts range, s gven by (9) Copyrght 010 ScRes.
5 K. K. ALMUZAINI ET AL. 811 P( ) e! where N p r and N s the number of anchor and localzed nodes. Then the probablty of a node havng n or more anchor and localzed nodes wthn ts range s n1 p( n) 1 p( ) 5. Performance Results o In ths secton, the proposed algorthm LDBOT s compared wth the WLS-SVD [11] and LLS [10] algorthms va smulaton. We frst consder dstance to measure the accuracy of both technques. 100 nodes are deployed, 50% of whch are anchors whch are chosen randomly. The deployment area s A = m, and the range s r = 10 m. The dstance error has a Gaussan dstrbuton wth varance d whch s a percentage of the actual dstance. As a performance measure, we use the mean error, whch s defned as u ( xˆ ) ( ˆ x y y) t 1 mean error (11) tu where u s the number of unlocalzed nodes, t s the number of trals, ( xˆ, y ˆ) s the estmated unlocalzed node poston, and (x, y) s the actual poston. The results were averaged over 10 4 trals. Localzed nodes were used wth the anchors to localze those unlocalzed nodes whch were not wthn range of a suffcent number of anchor and localzed nodes n the prevous teratons. The localzaton process ends when all nodes are localzed or all remanng unlocalzed nodes are solated,.e., not wthn range of three or more anchor or localzed nodes. Fgure 5 shows that the mean error wth the proposed algorthm outperforms that wth the LLS and WLS-SVD algorthms. Note that the rate of change of the error s also lower wth LDBOD. Next all algorthms are compared consderng the transmsson range of the wreless nodes. The deployment area, the number of nodes, and the number of anchors are the same as before but the transmsson range vares from 10 m to 50 m. The dstance error varance s fxed at 10% of the actual dstance between nodes. The results were agan averaged over 10 4 trals. Fgure 6 shows that the proposed algorthm performs better than the LLS and WLS-SVD algorthms at low transmsson ranges, n whch case the unlocalzed nodes are typcally wthn range of a small number of nodes. However, at hgh transmsson ranges all algorthms have smlar performance. The probablty that an unlocalzed node has 3 or more anchor or localzed nodes around t based on a gven transmsson range s llustrated n Fgure 7. Ths clearly Fgure 6. Mean error versus transmsson range. Fgure 5. Mean error versus dstance varance. Fgure 7. Probablty of node localzaton based on transmsson range. Copyrght 010 ScRes.
6 81 K. K. ALMUZAINI ET AL. shows that usng localzed nodes n the localzaton process mproves the probablty of localzng nodes. When the range exceeds 5 m, all unlocalzed nodes can be localzed. The anchor rato s one of the most mportant factors affectng localzaton accuracy. Thus we next comparethe algorthms wth a varyng percentage of anchor nodes. In ths case we are more nterested n the performance when the anchor rato s small because n a practcal system the number of anchor nodes wll be much lower than the number of unlocalzed nodes. The deployment area and the number of nodes are the same as before but the anchor rato vares from 0% to 80%. The transmsson range s fxed at 10 m and the dstance error varance s fxed at 10% of the actual dstance. The results are agan averaged over 10 4 trals. Fgure 8 shows that the proposed algorthm agan outperforms both the LLS and WLS-SVD algorthms, partcularly at low anchor ratos. The probablty that an unlocalzed node has 3 or more anchor or localzed nodes around t based on a gven anchor rato s shown n Fgure 9. Clearly the use of localzed nodes n the localzaton process mprove the probablty of node localzaton. Ths probablty reaches a maxmum of only 0.6 due to the small range of 10 m. Next we consder the effect of the node geometry on performance, wth GGDOP used as the geometry meas- -ure. Three anchor nodes are deployed on a crcle wth a fourth unlocalzed node n the center. The transmsson range s set to 30 m to ensure that the unlocalzed node s wthn range of the three anchors, and the dstance error varance s set to 10%. The anchors a 1, a, and a 3 are dstrbuted around the unlocalzed node u at angles aua 1 and aua 3 rangng from 1 to 101 (wth both angles the same). The results are averaged over 10 4 trals, and are shown n Fgure 10 for GGDOP and n Fgure 11 for angle between anchors. Both fgures show that the proposed algorthm performs better, partcularly when the geometry s poor,.e., low GGDOP or small angles. The LLS and WLS-SVD algorthms perform smlarly at all angles and GGDOP values because only Fgure 8. Mean error versus anchor rato. Fgure 10. Mean error versus GGDOP. Fgure 9. Probablty of node localzaton based on the anchor rato. Fgure 11. Mean error versus angle between anchors. Copyrght 010 ScRes.
7 K. K. ALMUZAINI ET AL. 813 (a) four nodes are deployed. At small angles, the geometry s poor, and as the angles ncrease the geometry approaches the deal case where the anchors are dstrbuted unformly on the crcle. Thus at angles of 101 the performance s very good, and all three algorthms perform smlarly. Fnally, we evaluated the algorthms wth dfferent anchor ratos and dstance error varances. Fgure 1 shows the resultng mean error surfaces. Clearly LDBOD outperforms the other algorthms at hgh dstance error varances (90%) and low anchor ratos (10%), whch s the most typcal, but also the most challengng envronment. The performance s smlar at hgh anchor ratos (90%) and low dstance error varances (10%), whch s close to the deal case, and therefore not lkely to occur n practce. 6. Conclusons A new range-based localzaton algorthm (LDBOD) has been presented whch s based on the densty-based outler detecton (DBOD) algorthm, a concept from data mnng. The proposed algorthm s used to select the best ponts (canddates) from a set of dstance estmate ntersecton ponts. The proposed algorthm was shown to outperform the LLS and recently proposed WLS-SVD algorthms. 7. References (b) (c) Fgure 1.Mean error surfaces. (a) Mean error surface for the LLS algorthm; (b) Mean error surface for the WLS-SVD algorthm; (c) Mean error surface for the LDBOD algorthm. [1] L. Doherty, K. S. J. Pster and L. El Ghaou, Convex Poston Estmaton n Wreless Sensor Networks, Proceedngs of IEEE INFOCOM, Anchorage, AK, Aprl 001, pp [] N. Bulusu, J. Hedemann and D. Estrn, GPS-Less Low-Cost Outdoor Localzaton for Very Small Devces, IEEE Personal Communcatons, Vol. 7, No. 5, October 000, pp [3] T. He, C. Huang, B. M. Blum, J. A. Stankovc and T. Abdelzaher, Range-Free Localzaton Schemes For Large Scale Sensor Networks, Proceedngs of ACM MobCom, San Dego, CA, September 003, pp [4] K. Almuzan and T. A. Gullver, A New Dstrbuted Range-Free Localzaton Algorthm for Wreless Networks, Proceedngs of IEEE Vehcular Technology Conference, Anchorage, AK, September 009, pp [5] I. Guvenc and Z. Sahnoglu, Threshold-Based TOA Estmaton for Impulse Rado UWB Systems, Proceedngs of IEEE Internatonal Conference on Ultra-Wdeband, Zurch, Swtzerland, September 005, pp [6] X. We, L. Wang and J. Wan, A New Localzaton Technque Based on Network TDOA Informaton, Proceedngs of IEEE Internatonal Conference on ITS Telecommuncatons, Chengdu, Chna, June 006, pp [7] A. Hatam, K. Pahlavan, M. Hedar and F. Akgul, On RSS and TOA Based Indoor Geolocaton A Compara- Copyrght 010 ScRes.
8 814 K. K. ALMUZAINI ET AL. tve Performance Evaluaton, Proceedngs of IEEE Wreless Communcatons and Networkng Conference, Las Vegas, NV, Aprl 006, pp [8] D. Nculescu and B. Nath, Ad Hoc Postonng System (APS) Usng AOA, Proceedngs of IEEE INFOCOM, San Francsco, CA, March-Aprl 003, pp [9] P. N. Tan, M. Stenbach and V. Kumar, Introducton to Data Mnng, Pearson Addson Wesley, Boston, 006. [10] I. Guvenc, C.-C. Chong and F. Watanabe, Analyss of a Lnear Least-Squares Localzaton Technque n LOS and NLOS Envronments, Proceedngs of IEEE Vehcular Technology Conference, Dubln, Ireland, Aprl 007, pp [11] C.-H. Park and K.-S. Hong, Source Localzaton Based on SVD wthout a Pror Knowledge, Proceedngs of IEEE Internatonal Conference on Advanced Communcatons Technology, Phoenx Park, Korea, February 010, pp [1] D. J. Torrer, Statstcal Theory of Passve Locaton Systems, IEEE Transactons on Aerospace and Electronc Systems, Vol. 0, No., March 1984, pp [13] H. C. So and F. K. W. Chan, A Generalzed Subspace Approach for Moble Postonng wth Tme-of-Arrval Measurements, IEEE Transactons on Sgnal Processng, Vol. 55, No. 10, October 007, pp [14] F. K. W. Chan, H. C. So, J. Zheng and K. W. K. Lu, Best Lnear Unbased Estmator Approach for Tmeof-Arrval Based Localsaton, IET Sgnal Processng, Vol., No., June 008, pp [15] D. B. Jourdan, D. Dardar and M. Z. Wn, Poston Error Bound for UWB Localzaton n Dense Cluttered Envronments, Proceedngs of IEEE Internatonal Conference on Communcatons, Istanbul, Turkey, June 006, pp [16] S. Venkatesh and R. M. Buehrer, Multple-Access Desgn for Ad Hoc UWB Poston-Locaton Networks, Proceedngs of IEEE Wreless Communcatons and Networkng Conference, Las Vegas, NV, Aprl 006, pp [17] J. Vnce, Geometry for Computer Graphcs: Formulae, Examples and Proofs, Sprnger, Berln, 005. Copyrght 010 ScRes.
An Analytical Method for Centroid Computing and Its Application in Wireless Localization
An Analytcal Method for Centrod Computng and Its Applcaton n Wreless Localzaton Xue Jun L School of Engneerng Auckland Unversty of Technology, New Zealand Emal: xuejun.l@aut.ac.nz Abstract Ths paper presents
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationAn Improved Localization Scheme Based on DV-Hop for Large-Scale Wireless Sensor Networks
Journal of Communcatons Vol., o., December 06 n Improved Localzaton Scheme Based on DV-Hop for Large-Scale Wreless Sensor etworks Janpng Zhu, Chunfeng Lv, and Zhengsu Tao SOU College of Engneerng Scence
More informationAn Improved Weighted Centroid Localization Algorithm
Internatonal Journal of Future Generaton Communcaton an Networng Vol.6, No.5 (203), pp.45-52 http://x.o.org/0.4257/fgcn.203.6.5.05 An Improve Weghte Centro Localzaton Algorthm L Bn, Dou Zheng*, Nng Yu
More informationMulti-hop-based Monte Carlo Localization for Mobile Sensor Networks
Mult-hop-based Monte Carlo Localzaton for Moble Sensor Networks Jyoung Y, Sungwon Yang and Hojung Cha Department of Computer Scence, Yonse Unversty Seodaemun-gu, Shnchon-dong 34, Seoul 20-749, Korea {jyy,
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationAn Improved Method for GPS-based Network Position Location in Forests 1
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 008 proceedngs. An Improved Method for GPS-based Network Poston Locaton n
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationlocation-awareness of mobile wireless systems in indoor areas, which require accurate
To my wfe Abstract Recently, there are great nterests n the locaton-based applcatons and the locaton-awareness of moble wreless systems n ndoor areas, whch requre accurate locaton estmaton n ndoor envronments.
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationCentralized approach for multi-node localization and identification
Centralzed approach for mult-node localzaton and dentfcaton Ola A. Hasan Electrcal Engneerng Department Unversty of Basrah Basrah, Iraq Lolastar91@gmal.com Ramzy S. Al Electrcal Engneerng Department Unversty
More informationStudy of the Improved Location Algorithm Based on Chan and Taylor
Send Orders for eprnts to reprnts@benthamscence.ae 58 The Open Cybernetcs & Systemcs Journal, 05, 9, 58-6 Open Access Study of the Improved Locaton Algorthm Based on Chan and Taylor Lu En-Hua *, Xu Ke-Mng
More informationAn efficient cluster-based power saving scheme for wireless sensor networks
RESEARCH Open Access An effcent cluster-based power savng scheme for wreless sensor networks Jau-Yang Chang * and Pe-Hao Ju Abstract In ths artcle, effcent power savng scheme and correspondng algorthm
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationTopology Control for C-RAN Architecture Based on Complex Network
Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton
More informationAOA Cooperative Position Localization
AOA Cooperatve Poston Localzaton Jun Xu, Maode Ma and Cho Loo Law Postonng and Wreless echnology Centre Nanyang echnologcal Unversty, Sngapore xujun@pmal.ntu.edu.sg Abstract- In wreless sensor networs,
More informationMDS-based Algorithm for Nodes Localization in 3D Surface Sensor Networks
MDS-based Algorthm for odes Localzaton n 3D Surface Sensor etworks Bljana Rsteska Stojkoska, Danco Davcev Faculty of Computer Scence and Engneerng Unversty Ss. Cyrl and Methodus Skopje, Macedona bljana.stojkoska@fnk.ukm.mk,
More informationAn Alternation Diffusion LMS Estimation Strategy over Wireless Sensor Network
Progress In Electromagnetcs Research M, Vol. 70, 135 143, 2018 An Alternaton Dffuson LMS Estmaton Strategy over Wreless Sensor Network Ln L * and Donghu L Abstract Ths paper presents a dstrbuted estmaton
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationASFALT: Ā S imple F āult-tolerant Signature-based L ocalization T echnique for Emergency Sensor Networks
ASFALT: Ā S mple F āult-tolerant Sgnature-based L ocalzaton T echnque for Emergency Sensor Networks Murtuza Jadlwala, Shambhu Upadhyaya and Mank Taneja State Unversty of New York at Buffalo Department
More informationFast Code Detection Using High Speed Time Delay Neural Networks
Fast Code Detecton Usng Hgh Speed Tme Delay Neural Networks Hazem M. El-Bakry 1 and Nkos Mastoraks 1 Faculty of Computer Scence & Informaton Systems, Mansoura Unversty, Egypt helbakry0@yahoo.com Department
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationA Relative Positioning Technique with Spatial Constraints for Multiple Targets Based on Sparse Wireless Sensor Network
Sensors & ransducers, Vol. 158, Issue 11, November 213, pp. 183-189 Sensors & ransducers 213 by IFSA http://www.sensorsportal.com A Relatve Postonng echnque wth Spatal Constrants for Multple argets Based
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationMovement - Assisted Sensor Deployment
Intro Self Deploy Vrtual Movement Performance Concluson Movement - Asssted Sensor Deployment G. Wang, G. Cao, T. La Porta Dego Cammarano Laurea Magstrale n Informatca Facoltà d Ingegnera dell Informazone,
More informationChalmers Publication Library. Copyright Notice
Chalmers Publcaton Lbrary Copyrght Notce 202 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve
More informationPerformance Analysis of the Weighted Window CFAR Algorithms
Performance Analyss of the Weghted Wndow CFAR Algorthms eng Xangwe Guan Jan He You Department of Electronc Engneerng, Naval Aeronautcal Engneerng Academy, Er a road 88, Yanta Cty 6400, Shandong Provnce,
More informationIntelligent Wakening Scheme for Wireless Sensor Networks Surveillance
The Frst Internatonal Workshop on Cyber-Physcal Networkng Systems Intellgent Wakenng Scheme for Wreless Sensor Networks Survellance Ru Wang, Le Zhang, L Cu Insttute of Computng Technology of the Chnese
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationA Pervasive Indoor-Outdoor Positioning System
70 JOURNAL OF NETWORKS, VOL. 3, NO. 8, NOVEMBER 008 A Pervasve Indoor-Outdoor Postonng System Lonel Reyero 1, Glles Delsle 1 INRS-EMT, Unversté du Québec, Montréal, Canada, H5A 1K6, lonel.reyero@telecom.com
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationApplying Rprop Neural Network for the Prediction of the Mobile Station Location
Sensors 0,, 407-430; do:0.3390/s040407 OPE ACCESS sensors ISS 44-80 www.mdp.com/journal/sensors Communcaton Applyng Rprop eural etwork for the Predcton of the Moble Staton Locaton Chen-Sheng Chen, * and
More informationResearch Article Semidefinite Relaxation Algorithm for Multisource Localization Using TDOA Measurements with Range Constraints
Wreless Communcatons and Moble Computng Volume 2018, Artcle ID 9430180, 9 pages https://doorg/101155/2018/9430180 Research Artcle Semdefnte Relaxaton Algorthm for Multsource Localzaton Usng TDOA Measurements
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More information1.0 INTRODUCTION 2.0 CELLULAR POSITIONING WITH DATABASE CORRELATION
An Improved Cellular postonng technque based on Database Correlaton B D S Lakmal 1, S A D Das 2 Department of Electronc & Telecommuncaton Engneerng, Unversty of Moratuwa. { 1 shashka, 2 dleeka}@ent.mrt.ac.lk
More informationReview Article A Survey of Sound Source Localization Methods in Wireless Acoustic Sensor Networks
Hndaw Wreless Communcatons and Moble Computng Volume 7, Artcle ID 39568, 4 pages https://do.org/.55/7/39568 Revew Artcle A Survey of Sound Source Localzaton Methods n Wreless Acoustc Sensor Networks Maxmo
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationWireless Signal Map Matching for NLOS error mitigation in mobile phone positioning
Internatonal Global Navgaton Satellte Systems Socety IGNSS Symposum 006 Holday Inn Surfers Paradse, Australa 17 1 July 006 Wreless Sgnal Map Matchng for NLOS error mtgaton n moble phone postonng Bnghao
More informationOn Channel Estimation of OFDM-BPSK and -QPSK over Generalized Alpha-Mu Fading Distribution
Int. J. Communcatons, Network and System Scences, 010, 3, 380-384 do:10.436/jcns.010.34048 Publshed Onlne Aprl 010 (http://www.scrp.org/journal/jcns/) On Channel Estmaton of OFDM-BPSK and -QPSK over Generalzed
More informationGuidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014
Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,
More informationEvaluate the Effective of Annular Aperture on the OTF for Fractal Optical Modulator
Global Advanced Research Journal of Management and Busness Studes (ISSN: 2315-5086) Vol. 4(3) pp. 082-086, March, 2015 Avalable onlne http://garj.org/garjmbs/ndex.htm Copyrght 2015 Global Advanced Research
More informationA RF Source Localization and Tracking System
The 010 Mltary Communcatons Conference - Unclassfed Program - Waveforms and Sgnal Processng Track A RF Source Localzaton and Trackng System Wll Tdd, Raymond J. Weber, Ykun Huang Department of Electrcal
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationClustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 21 proceedngs Clusterng Based Fractonal Frequency Reuse and Far Resource
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationInverse Halftoning Method Using Pattern Substitution Based Data Hiding Scheme
Proceedngs of the World Congress on Engneerng 2011 Vol II, July 6-8, 2011, London, U.K. Inverse Halftonng Method Usng Pattern Substtuton Based Data Hdng Scheme Me-Y Wu, Ja-Hong Lee and Hong-Je Wu Abstract
More informationAnalysis of Lifetime of Large Wireless Sensor Networks Based on Multiple Battery Levels
I. J. Communcatons, Network and System Scences, 008,, 05-06 Publshed Onlne May 008 n ScRes (http://www.srpublshng.org/journal/jcns/). Analyss of Lfetme of Large Wreless Sensor Networks Based on Multple
More informationAdaptive Distributed Topology Control for Wireless Ad-Hoc Sensor Networks
Adaptve Dstrbuted Topology Control for Wreless Ad-Hoc Sensor Networks Ka-Tng Chu, Chh-Yu Wen, Yen-Cheh Ouyang, and Wllam A. Sethares Abstract Ths paper presents a decentralzed clusterng and gateway selecton
More informationMulti-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments
Mult-Robot Map-Mergng-Free Connectvty-Based Postonng and Tetherng n Unknown Envronments Somchaya Lemhetcharat and Manuela Veloso February 16, 2012 Abstract We consder a set of statc towers out of communcaton
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationTracking Algorithms Based on Dynamics of Individuals and MultiDimensional Scaling
Trackng Algorthms Based on Dynamcs of Indvduals and MultDmensonal Scalng Jose Mara Cabero, Fernando De la Torre, Galder Unbaso and Artz Sanchez ROBOTIKER-TECNALIA Technology Centre, Telecom Unt, Zamudo,
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationCooperative Localization Based on Visually Shared Objects
Cooperatve Localzaton Based on Vsually Shared Objects Pedro U. Lma 1,2, Pedro Santos 1, Rcardo Olvera 1,AamrAhmad 1,andJoão Santos 1 1 Insttute for Systems and Robotcs, Insttuto Superor Técnco, 1049-001
More informationOptimal Sleep Scheduling Scheme for Wireless Sensor Networks Based on Balanced Energy Consumption
6 JOURAL OF COMPUTER, VOL. 8, O. 6, JUE 3 Optmal leep chedulng cheme for Wreless ensor etworks Based on Balanced Energy Consumpton han-shan Ma College of Computer cence and Technology, Chna Unversty of
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationCooperative localization method for multi-robot based on PF-EKF
Scence n Chna Seres F: Informaton Scences 008 SCIENCE IN CHINA PRESS Sprnger www.scchna.com nfo.scchna.com www.sprngerln.com Cooperatve localzaton method for mult-robot based on PF-EKF WANG Lng, WAN JanWe,
More informationMalicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques
Malcous User Detecton n Spectrum Sensng for WRAN Usng Dfferent Outlers Detecton Technques Mansh B Dave #, Mtesh B Nakran #2 Assstant Professor, C. U. Shah College of Engg. & Tech., Wadhwan cty-363030,
More informationOn Sensor Fusion in the Presence of Packet-dropping Communication Channels
On Sensor Fuson n the Presence of Packet-droppng Communcaton Channels Vjay Gupta, Babak Hassb, Rchard M Murray Abstract In ths paper we look at the problem of multsensor data fuson when data s beng communcated
More informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
More informationThe Application of Interpolation Algorithms in OFDM Channel Estimation
The Applcaton of Interpolaton Algorthms n OFDM Estmaton Xjun ZHANG 1,, Zhantng YUAN 1, 1 School of Electrcal and Informaton Engneerng, Lanzhou Unversty of Technology, Lanzhou, Gansu 730050, Chna School
More informationJOURNAL OF SELECTED AREAS IN COMMUNICATIONS 1
JOURNAL OF SELECTED AREAS IN COMMUNICATIONS On the Interdependence of Dstrbuted Topology Control and Geographcal Routng n Ad Hoc and Sensor Networks Tommaso Meloda, Student Member, IEEE, Daro Pompl, Student
More informationROBUST IDENTIFICATION AND PREDICTION USING WILCOXON NORM AND PARTICLE SWARM OPTIMIZATION
7th European Sgnal Processng Conference (EUSIPCO 9 Glasgow, Scotland, August 4-8, 9 ROBUST IDENTIFICATION AND PREDICTION USING WILCOXON NORM AND PARTICLE SWARM OPTIMIZATION Babta Majh, G. Panda and B.
More informationWi-Fi Indoor Location Based on RSS Hyper-Planes Method
Chung Hua Journal of Scence and Engneerng, Vol. 5, No. 4, pp. 7-4 (007 W-F Indoor Locaton Based on RSS Hyper-Planes Method Ch-Kuang Hwang and Kun-Feng Cheng Department of Electrcal Engneerng, Chung Hua
More informationProcedia Computer Science
Proceda Computer Scence 3 (211) 714 72 Proceda Computer Scence (21) Proceda Computer Scence www.elsever.com/locate/proceda www.elsever.com/locate/proceda WCIT-21 Performance evaluaton of data delvery approaches
More informationWeighted Penalty Model for Content Balancing in CATS
Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract
More informationSide-Match Vector Quantizers Using Neural Network Based Variance Predictor for Image Coding
Sde-Match Vector Quantzers Usng Neural Network Based Varance Predctor for Image Codng Shuangteng Zhang Department of Computer Scence Eastern Kentucky Unversty Rchmond, KY 40475, U.S.A. shuangteng.zhang@eku.edu
More informationOptimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks
Optmal Local Topology Knowledge for Energy Effcent Geographcal Routng n Sensor Networks Tommaso Meloda, Daro Pompl, Ian F. Akyldz Broadband and Wreless Networkng Laboratory School of Electrcal and Computer
More informationSource Localization by TDOA with Random Sensor Position Errors - Part II: Mobile sensors
Source Localzaton by TDOA wth Random Sensor Poston Errors - Part II: Moble sensors Xaome Qu,, Lhua Xe EXOUISITUS, Center for E-Cty, School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty,
More informationChannel Alternation and Rotation in Narrow Beam Trisector Cellular Systems
Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,
More informationEnsemble Evolution of Checkers Players with Knowledge of Opening, Middle and Endgame
Ensemble Evoluton of Checkers Players wth Knowledge of Openng, Mddle and Endgame Kyung-Joong Km and Sung-Bae Cho Department of Computer Scence, Yonse Unversty 134 Shnchon-dong, Sudaemoon-ku, Seoul 120-749
More informationLocalization of a Wireless Sensor Network with Unattended Ground Sensors and Some Mobile Robots
Localzaton of a Wreless Sensor Networ wth Unattended Ground Sensors and Some Moble Robots Koushl Sreenath, Fran L. Lews, Dan O. Popa Automaton & Robotcs Research Insttute (ARRI) Unversty of Texas at Arlngton
More informationLocalization in mobile networks via virtual convex hulls
Localzaton n moble networs va vrtual convex hulls Sam Safav, Student Member, IEEE, and Usman A. Khan, Senor Member, IEEE arxv:.7v [cs.sy] Jan 7 Abstract In ths paper, we develop a dstrbuted algorthm to
More informationGenetic Algorithm for Sensor Scheduling with Adjustable Sensing Range
Genetc Algorthm for Sensor Schedulng wth Adjustable Sensng Range D.Arvudanamb #, G.Sreekanth *, S.Balaj # # Department of Mathematcs, Anna Unversty Chenna, Inda arvu@annaunv.edu skbalaj8@gmal.com * Department
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
More informationMulti-sensor optimal information fusion Kalman filter with mobile agents in ring sensor networks
Mult-sensor optmal nformaton fuson Kalman flter wth moble agents n rng sensor networs Behrouz Safarneadan *, Kazem asanpoor ** *Shraz Unversty of echnology, safarnead@sutech.ac.r ** Shraz Unversty of echnology,.hasanpor@gmal.com
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationChaotic Filter Bank for Computer Cryptography
Chaotc Flter Bank for Computer Cryptography Bngo Wng-uen Lng Telephone: 44 () 784894 Fax: 44 () 784893 Emal: HTwng-kuen.lng@kcl.ac.ukTH Department of Electronc Engneerng, Dvson of Engneerng, ng s College
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationMulti-Relay Selection Strategy for Device to Device Communication
Internatonal Conference on Computer, Networks and Communcaton Engneerng (ICCNCE 3) Mult-elay Selecton Strategy for Devce to Devce Communcaton Wecheng Xa, Shxang Shao, Jun Sun Jangsu Provncal Key Laboratory
More informationA Novel GNSS Weak Signal Acquisition Using Wavelet Denoising Method
A Novel GNSS Weak Sgnal Acquston Usng Wavelet Denosng Method Jn Tan, Lu Yang, BeHang Unversty, P.R.Chna BIOGRAPHY Jn Tan s a post-doctor n School of Electronc and Informaton Engneerng, BeHang Unversty,
More informationResearch Article Indoor Localisation Based on GSM Signals: Multistorey Building Study
Moble Informaton Systems Volume 26, Artcle ID 279576, 7 pages http://dx.do.org/.55/26/279576 Research Artcle Indoor Localsaton Based on GSM Sgnals: Multstorey Buldng Study RafaB Górak, Marcn Luckner, MchaB
More informationWideband Spectrum Sensing by Compressed Measurements
Wdeband Spectrum Sensng by Compressed Measurements Davood Mardan Najafabad Department of Electrcal Engneerng Yazd Unversty Emal: d.mardan@stu.yazdun.ac.r Al A. Tadaon Department of Electrcal Engneerng
More information