OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
|
|
- Aldous Whitehead
- 6 years ago
- Views:
Transcription
1 OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor ABTRACT As part of Morgans NET development, the Mxed Cellular and Moble Ad hoc Networ (MCMN) archtecture has been proposed to provde coverage to over-the horzon test artcles. Nodes n MCMN are assgned to one of three possble modes- Ad hoc, Cellular or Gateway. We present archtecture for the proposed MCMN and some performance analyss to characterze the networ. The problem of organzng nodes n ths mxed networ wth optmal confguraton s sgnfcant. Ths confguraton gves nodes ablty to now the best mode to operate and communcate wth other nodes. Node organzaton s crtcal to the performance of the mxed networ and to mprove communcaton. The confguraton of nodes requred to optmally organze nodes n MCMN s demonstrated. The problem of evaluatng confguraton parameters for nodes n a mxed networ s a nonlnear and complex one. Ths s due to the varous components le the number of nodes, geographcal locaton, sgnal strength, moblty, connectvty and others that are nvolved. Clusterng technques and algorthms have been used n lterature to partton networs nto clusters to support routng and networ management. A clusterng technque s employed to dynamcally partton the aggregate networ nto Cluster Cells (CCs). A gateway node s selected for each CC whch relays traffc from the cellular to the Ad hoc and vce versa. A trade-off analyss of the cellular boundary s presented usng the maxmum of the mnmum data rate n the networ. Numercal analyss and experments are provded to show that the coverage can be extended to test artcles n over-the-horzon regon. It s also shown that, when the networ s well organzed, performance s mproved. KEYWORD MANET, cellular, coverage, throughput capacty, Ad Hoc, NET The choce of a cellular/ad hoc structure precedes INETs choce of an IEEE8. model. Ths wor stll apples wth the assumpton that the WLAN Access Pont substtutes for the cellular base staton.
2 INTRODUCTION MCMN was proposed after a comparson study of ad hoc and cellular networs []. In mxed or hybrd networs concept, the cellular networs and moble ad-hoc networs nteroperate to form an aggregate networ. Advancements n technology have revealed the feasblty of the proposed soluton by usng the emergng dual-mode nterface to equp nodes. Ths allows nodes to communcate n one of the three possble modes. These modes are ad hoc mode (AHM), cellular mode (CM) and gateway mode (GM). Ths concept provdes moble nodes more flexblty and system performance enhancement by provdng seamless roamng between cellular networs and ad hoc networs. Ths research focuses on an effcent way of computng the confguraton for each node n a mxed networ. Ths ncludes ther CC dentty, gateway node to relay ther traffc, and nformaton about other nodes n the networ. As routng schemes are mportant to effectvely route traffc n the networ, ths wor wll nclude technques for routng wthn each cluster and routng between the cellular and MANETs. The CC to whch a node belongs s evaluated based on the nformaton sent to the Base taton (B) by the node. The focus n ths wor s the aeronautcal envronment where nodes have hgh moblty, reduced path loss due to free space or lne of sght communcaton, and hgh coverage areas. The frst secton presents the MCMN archtecture; the next secton presents performance analyss n terms of throughput and coverage. The last secton presents node organzaton scheme usng a -stage clusterng technque. Numercal analyss s presented to valdate the performance of the networ and a concluson s gven. MCMN ARCHITECTURE The MCMN s a pure hybrd networ when compared wth most of the other proposed hybrd networs [, 3]. In MCMN, both cellular and ad hoc communcatons are possble. Ths means that both cellular and ad hoc nodes can orgnate and receve data. MCMN also ncludes the ad hoc mode (AHM) nodes, these nodes communcate n mult-hop mode and they dynamcally route ther own traffc usng standard routng protocols le AODV, DR, and DDV. For Nodes operatng n CM to contnue communcaton n the networ they swtch to AHM (mult-hop) when ther sgnal strength drops to a certan threshold. Ths s smlar to the hand-over process n a conventonal cellular system. The dfference s that, whle a node searches for another B to connect to n cellular networs, nodes n MCMN search for an alternate mode or route usng ther other nterface (ad hoc nterface). A thrd category of nodes n MCMN s the gateway node (GN). These nodes are capable of communcatng n both cellular and ad hoc mode smultaneously and they relay cellular traffc to ad hoc and vce versa. The NET scenaro s llustrated n fgure where Test Artcles (TA) collect data and send them to ground systems for further processng. The words nodes and TAs are used nterchangeably for the rest of ths paper to refer to wreless termnals. The fgure shows TAs communcatng n AHM as well as CM usng both the ad hoc and cellular technologes for communcaton. TAs are grouped nto K MANETs CCs. Each CC has ts own GN to relay traffc between the cellular and MANET nodes n the CC. The B s located at the center of the cellular networ (sngle cell cellular system), and K CCs are located around t as shown n fgure. The GNs can be a
3 bottlenec n the networ so the choce of GNs s crtcal to the performance of MCMN. Every node can become a GN dependng on ts confguraton. It s also assumed that each node s aware of ts geographcal locaton through GP or other postonng mechansm. Ad-hoc Node Cluster cells Gateway node Gateway node Base taton Cellular Nodes Fgure MCMN Archtecture Ad hoc Networ Cluster Cells Gateway Nodes Base taton Cellular Nodes Fgure MCMN Layout The archtecture and protocol stac for a node n MCMN s presented n fgure 3 below. The two nterfaces use the same upper layers applcaton, transport, and networ. The networ layer plays the role of nterfacng between the lower layers and upper layers. The networ layer s also responsble for the complex tas of routng between the two dfferent nterfaces wth consderaton of moblty and connecton management. Every node n the networ s equpped wth dual nterface as shown n fgure 3. Any node n the networ can become a gateway at any tme dependng on ts geographcal locaton, sgnal strength and proxmty to both the B and ad hoc nodes. GNs communcate usng the two nterfaces smultaneously as shown n fgure 4. Ths s a more complex tas because t ntegrates the two technologes and also deals wth the routng problems. Every CC can have one or more GNs, but for ths analyss and smplcty, t s assumed that every CC has one GN for relayng traffc. 3
4 Applcaton Transport Networ CM Ln CM MAC CM-PHY AHM Ln AHM-MAC AHM-PHY Cellular Interface Ad hoc Interface Fgure 3 Archtecture of MCMN Node Cellular Node Gateway Node Ad hoc Node Applcaton Applcaton Transport Networ Transport Networ Ln Control MAC PHY CM-LLC CM-MAC CM-PHY AHM-LLC AHM-MAC AHM-PHY Networ Ln Control MAC PHY Cellular Interface Ad hoc Interface Fgure 4 Archtecture of MCMN Gateway Node Based on the node organzaton and groupng (next secton), the B develops a confguraton table for all nodes n the networ. The B bulds up a routng table and sends the routng nformaton of every node n each CC to the GNs respectvely; every node n the networ s attached to GN for ts CC. GNs eep and mantan the routng nformaton, and share t among other GNs. In addton, each GN forwards the routng nformaton of all nodes n ts CC to every member of the cell. Usng ths nformaton every node n the same CC can communcate wth one another wthout necessarly passng through GN. To communcate wth the nodes outsde the CC or CM node, a node wll have to transmt through the GN. Even though a node cannot communcate wth nodes outsde ts CC, every node can receve where do I belong (WDIB) message from other nodes. Ths message s meant for the B and contans node parameters that wll be used to compute ts confguraton; every node can receve and forward the WDIB message untl t arrves at the destnaton whch s the B. PERFORMANCE ANALYI Two common networ performance metrcs are coverage and throughput. These have been extensvely covered n lterature for the cellular and ad hoc networs separately. Coverage s defned as the geographcal area n whch successful communcaton can be provded. For 4
5 MCMN, the coverage provded by the of MCMN. Estmaton for the overall coverage s gven as: K Cov Cov Cov Where s a constant reflectng the border effect whch s due to the fact that CCs are nonoverlappng [4]. The CCs wth MCMN th CC results n a cumulatve effect on the total coverage cellular NCC Cov cellular s the cellular coverage, Cov N CC s the coverage provded by nodes n each CC. Throughput s defned as the aggregate amount of data that can be successfully transported n a networ over tme. The GN s assumed to be a super user and can have more tme slots from the B to accommodate demand. The B montors the demand on the GN and ncreases ts tme slots dynamcally. The overall throughput for MCMN s gven as: MCMN CM CM K CC K Where GN s the throughput of a GN, ( N GN CC CC ) f f Cellmax Cellmax N CC GN CC CC GN () () s the expected throughput n a CC wth NCC K CM s the throughput of the cellular networ. Detals of these analyses are provded n [5]. nodes, NODE ORGANIZATION IN MCMN The technque for groupng nodes n MCMN nto CCs (CCs) for optmum performance s developed n ths secton. Ths groupng of nodes s the ey to the overall performance of a MCMN networ. A method s presented to ntellgently form CCs, select nodes to be gateway nodes (GNs) for each of the CCs, and develop a scheme to evaluate the optmal number of CCs that wll be requred for the networ parttonng. Nodes are presented as ponts n a - dmensonal Eucldean space ( ) and nformaton about nodes n ths space s contaned n ther statstcs. Clusterng procedures use a crteron functon, such as the Eucldean dstance and sum of squared dstances from the cluster centers, and see the groupng that optmze the crteron functon [6]. A -stage clusterng scheme s used n MCMN to organze nodes n the networ; ths s shown n fgure 5a and 5b. The clusterng s done by the B after collectng the requred nformaton from nodes n the networ. In ths analyss, only dstnct clusters are consdered wth each node n a CC havng a GN to connect to the cellular nodes as well as nodes n other CCs. The use of clusterng for organzng nodes n MCMN offers several advantages. It mproves manageablty, ncreases throughput, reduces overhead and mnmzes networ congeston among other advantages. Every node s assumed to have the nowledge of ts geographcal locaton. Every node transmts ts Y geographcal locaton to the B where centralzed coordnaton and management of the networ taes place. 5
6 Ad hoc Nodes tart tart cale Parameters Geographcal Locaton Parameters Radus, Angle Compute NR Intal Centrod Number of Clusters Compute Dstance from Centrod Thresh old > Cellular Nodes Group nodes usng mnmum dstance No < Compute new centrod Ad hoc Nodes End Compute Error Conv erge? Yes End Fgure 5a tage One Fgure 5b tage Two To organze nodes n MCMN, two heterogeneous parameters are defned for every node the radus and angle. Radus measures the dstance of each node from the B (Centre of networ) whle the angle measures the spatal locaton of each node. It has been assumed that the radus and angle are unformly dstrbuted. The radus R and angle of node are gven as: R Y Y (3) Y Y tan (4) Where Y represent the geographcal locaton of B whch s assumed to be the center of the networ. Usng the heterogeneous parameters defned above, clusterng parameter CPar s computed for each node n the networ. CPar R, N AHM (5) Where N AHM s the total number of ad hoc nodes n the networ. The clusterng parameter, CPar, can nclude as many parameters as possble and has been lmted to R and for smplcty. The frst stage nvolves usng the locaton nformaton and the path loss model of equaton (6) and (7) to compute the NR of every node from the B. Ths s a functon of the dstance from the B whch s the radus gven n equaton (3) above. The NR decreases as a functon of R where s the path loss exponent. A threshold s set for the NR and any node wth NR greater than the threshold s consdered a CM node and those wth NR less than the 6
7 threshold are consdered as AHM node. Ths procedure parttons the aggregate networ nto the two man components of MCMN- Cellular networ and ad hoc networ. Where P ( d ) r PG G t t r 4 d L P r d P r d and the NR, d d d d (6) n wreless communcatons s gven as P r or Pr L (7) L P are the receve and transmt powers respectvely. The Where Pr and t and transmt antenna gans, and L s the path loss Gven a parttonng of CCs, nto, the centrod, CC K, for each CC s defned as: The clusterng problem s defned as Where CPar s the clusterng parameter, cluster cell. G r and G t are receve, K beng the total number of CCs to partton the networ. R,,, (8) CC arg mn D CPar, (9) CPar CC CC s the th cluster cell, and s the centrod for NUMERICAL ANALYI AND REULT Ths secton presents some numercal analyses and experments usng MATLAB program. A MATLAB vsualzaton program s developed to vew the node organzaton. In addton, analyss s presented for gateway locaton and trade-off n the cellular boundary when the ad hoc component s dependent on the cellular component. A total of 4 nodes are randomly placed n a crcular regon wth the B located at the center of ths networ. The frst tas s to classfy the aggregate networ nto ether CM nodes or AHM nodes. Fgure 6 shows the randomly placed nodes n a gven area. Fgure 7 shows the parttoned networ after applyng the threshold for NR. It s seen that the whole networ s separated nto CM nodes and AHM nodes. A valdty measure s developed to obtan an estmaton for the optmal number of CCs, K, that the ad hoc nodes are dvded nto. Ths s gven as: wcler Valdty measure arg mn () excler Where wcler s the wthn cluster error, t measures the average of all dstances between a node and the centrod of ts CC, and t can be used to determne whether the CC s compact or not. The external error, excler, measures the relatonshp between the CCs that mae up a gven parttonng and s computed as the mnmum dstance between the centrods n parttonng. The 7
8 goal s to mnmze the valdty measure, the values of valdty measure for each K s plotted and the parttonng wth the mnmum value of valdty measure gves the optmum parttonng. The value of K for ths parttonng s the optmum number of CCs to partton the AHM nodes. The result s shown n fgure 8 and for the networ scenaro consdered n ths analyss, the value of valdty measure s mnmum at K = Fgure 6 Randomly Placed Nodes n MCMN -3 CM nodes AHM nodes Fgure 7 Parttoned Cellular and MANET To effectvely choose GNs n MCMN, smlar parameters used n parttonng the networ must be consdered n selectng approprate GNs. The B, n addton to performng the clusterng, computes the GNs selecton metrc, ngmetrc, for all actve nodes n a CC. Ths s gven as: w* NR j ngmetrc j N N CC CC () D node, node j D node, B N CC where D node, node j s the dstance between node and node j n the same CC, and D node, B s the dstance between node and the B. In addton to the dstances, the sgnalto-nose rato, NR, of nodes n the CC wth reference to one another s computed. Fgure 9 represents the complete MCMN system wth every node nowng the CCs they belong to n the networ and ther GN ID. Usng ths organzed networ, the B has detaled nformaton about all the nodes n the networ. The mnmum networ rate, R mn, s computed as the mnmum rate of cellular nodes, gateway node, and ad hoc node. Ths s represented as R mn arg mn RCM, RGM, RAHM () Where R CM, R GM, R AHM are the rates for cellular mode, gateway mode, and ad hoc mode. And fnally, the maxmum of the mnmum rate s used to defne the boundary for cellular and ad hoc 8
9 networ n MCMN. Ths represents the optmal locaton for the GNs and also the optmal boundary for cellular and ad hoc networs. Ths analyss has taen nto consderaton the dependency of the ad hoc networ on the capacty of cellular networ Number of clusters Fgure 8 Optmal Number of Cluster to Partton MCMN Fgure 9 Gateway Nodes for CCs Fgure shows the trade-off between rates and dstance from base staton for the dfferent components of MCMN. The fgure also shows the cellular and gateway throughput decreasng as the dstance from the B ncreases untl the optmum pont s reached and contnues to decrease at the mnmum rate. But because the networ s well organzed, the cellular node changes nto ad hoc mode and ts throughput begns to rse. x 4 ad hoc rate gateway rate cellular rate mnmum rate Gateway dstance from Base taton (dg) x 4 Fgure Trade-off for Boundary and Gateway Locaton 9
10 CONCLUION AND FUTURE WORK A soluton to the problem of coverage of nodes usng a mxed cellular and ad hoc networ has been presented. It has been shown that when combnng the features of tradtonal nfrastructurebased cellular networs wth that of ad hoc networs an mproved mxed networ can be formed. We have desgned a novel archtecture for our proposed MCMN. We presented both theoretcal and numercal analyss to evaluate the performance mprovement that MCMN can provde to a networ. It has been shown that coverage can be extended beyond the lmtaton of a cellular base staton. It has also been shown that throughput can be enhanced whle extendng the networ coverage. A soluton to the problem of organzng nodes n MCMN has been presented through a -stage clusterng scheme. The modfed K-means scheme ncorporates the nonhomogenety of networ nodes nto the networ parttonng. A soluton for choosng the optmum number of CCs to partton the ad hoc nodes nto was developed. A scheme for selectng gateway nodes to relay traffc from one cluster to another was developed. And fnally, the trade-off analyss n selectng the GN locaton and cellular boundary has been presented. The soluton easly adapts to NET system by ncorporatng NET chosen technologes to operate n multhop and sngle hop to form the MCMN. Ths wll enhance throughput and extend coverage to OTH TAs n NET. Fnally, t s mportant to acnowledge the support provded by NAVAIR wthout whch ths wor could not have happened. REFERENCE. Babalola, O. A., Performance Issues n Mxng Cellular and Ad hoc Networs for NET, ITC 5 Conference, Las Vegas, October 5.. H. Luo, R. Ramjee, P. nha, L. L, and. Lu, UCAN: A unfed cellular and ad-hoc networ archtecture, n Proc. MobCom, ept. 3, pp Hongy Wu; Chunmng Qao; De,.; Tonguz, O.; Integrated cellular and ad hoc relayng systems: CAR, IEEE Journal on elected Areas n Communcatons, Vol. 9, Oct., pp E. Wessten, Crcle-Crcle Intersecton From MathWorld A Wolfram Web Resource, June 4, /Crcle-CrcleIntersecton.html. 5. Babalola, O. A. Optmal Confguraton for Nodes n a Mxed Cellular and Moble Ad hoc Networs, Dssertaton, Dept. of Electrcal Engneerng, Morgan tate Unversty, Baltmore, Maryland, May R. Duda, P. Hart, D. tor, Pattern Classfcaton, nd Edton, New Yor, John Wley and ons,.
Parallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationOn the Network Partitioning of Large Urban Transportation Networks
On the etwor Parttonng of Large Urban Transportaton etwors Hamdeh Etemadna and Khaled Abdelghany Abstract Ths paper ams at developng a traffc networ parttonng mechansm for dstrbuted traffc management applcatons.
More informationOnline Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks
12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele
More informationExtending Network Life by Using Mobile Actors in Cluster-based Wireless Sensor and Actor Networks
Extendng Networ Lfe by Usng Moble Actors n Cluster-based Wreless Sensor and Actor Networs Nauman Aslam, Wllam Phllps, Wllam Robertson and S. Svaumar Department of Engneerng Mathematcs & Internetworng Dalhouse
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More information1. Introduction. Abstract
Image Retreval Usng a Herarchy of Clusters Danela Stan & Ishwar K. Seth Intellgent Informaton Engneerng Laboratory, Department of Computer Scence & Engneerng, Oaland Unversty, Rochester, Mchgan 48309-4478
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationUsing Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol
2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationXV International PhD Workshop OWD 2013, October Machine Learning for the Efficient Control of a Multi-Wheeled Mobile Robot
XV Internatonal PhD Workshop OWD 203, 9 22 October 203 Machne Learnng for the Effcent Control of a Mult-Wheeled Moble Robot Uladzmr Dzomn, Brest State Techncal Unversty (prof. Vladmr Golovko, Brest State
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationConnection-information-based connection rerouting for connection-oriented mobile communication networks
Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang
More informationHYMN: AN INTEREST-BASED MULTIMEDIA PROVIDING SYSTEM FOR HYBRID WIRELESS NETWORKS
HYMN: AN INTEREST-BASED MULTIMEDIA PROVIDING SYSTEM FOR HYBRID WIRELESS NETWORKS Adran Andronache 1 ), Matthas R. Brust 2 ), Steffen Rothkugel 3 ) Abstract The concept of self-organzaton already exsts
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationDistributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks
Dstrbuted Topology Control for Power Effcent Operaton n Multhop Wreless Ad Hoc Networks Roger Wattenhofer L L Paramvr Bahl Y-Mn Wang Mcrosoft Research CS Dept. Cornell Unversty Mcrosoft Research Mcrosoft
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationIJCTA Nov-Dec 2016 Available
Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationCACHE MEMORY DESIGN FOR INTERNET PROCESSORS
CACHE MEMORY DESIGN FOR INTERNET PROCESSORS WE EVALUATE A SERIES OF THREE PROGRESSIVELY MORE AGGRESSIVE ROUTING-TABLE CACHE DESIGNS AND DEMONSTRATE THAT THE INCORPORATION OF HARDWARE CACHES INTO INTERNET
More informationPerformance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks
RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationResearch Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com
More informationsensors ISSN
Sensors 2011, 11, 5383-5401; do:10.3390/s110505383 OPEN ACCESS sensors ISSN 1424-8220 www.mdp.com/journal/sensors Artcle FRCA: A Fuzzy Relevance-Based Cluster Head Selecton Algorthm for Wreless Moble Ad-Hoc
More informationA STUDY OF THE SCALABILITY AND PERFORMANCE OF MULTI-LEVEL HIERARCHY FOR SCALABLE MOBILITY MANAGEMENT IN WIRELESS IPv6 NETWORKS
A STUDY OF THE SCALABILITY AND PERFORMANCE OF MULTI-LEVEL HIERARCHY FOR SCALABLE MOBILITY MANAGEMENT IN WIRELESS IPv6 NETWORKS E.N. Onwua and Z. Nu State Key Lab on Mcrowave and Dgtal Communcaton Department
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationCombined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks
Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,
More informationSession 5.3. Switching/Routing and Transmission planning
ITU Regonal Semnar Belgrade Serba and Montenegro 20-24 24 June 2005 Sesson 5.3 Swtchng/Routng and Transmsson plannng volvng nfrastructures to NGN and related Plannng Strateges and Tools I.S. Sesson 5.3-1
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationSecurity Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments
Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationA Variable Threats Based Self-Organization Scheme for Wireless Sensor Networks
009 Thrd Internatonal Conference on Sensor Technologes and Applcatons A Varable Threats Based Self-Organzaton Scheme for Wreless Sensor Networks Jan Zhong School of Computer Scence and Informaton Technology
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationVoice capacity of IEEE b WLANs
Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local
More informationMobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks
Moblty Based Routng Protocol wth MAC Collson Improvement n Vehcular Ad Hoc Networks Zhhao Dng, Pny Ren, Qnghe Du Shaanx Smart Networks and Ubqutous Access Rearch Center School of Electronc and Informaton
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationIMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION Gholamreza Farahan Department of Electrcal Engneerng and Informaton Technology, Iranan Research
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationDecision Strategies for Rating Objects in Knowledge-Shared Research Networks
Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,
More informationAnnales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization
Annales Informatca AI 1 (2003) 277-284 Annales Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ Desgnng of multchannel optcal communcaton systems topologes crtera optmzaton Mrosław Hajder,
More information