Calculation and Simulation of Transmission Reliability in Wireless Sensor Network Based on Network Coding

Size: px
Start display at page:

Download "Calculation and Simulation of Transmission Reliability in Wireless Sensor Network Based on Network Coding"

Transcription

1 Calculatio ad Simulatio of Trasmissio Reliability i Wireless Sesor Network Based o Network Codig Zhifu Lua Weifag Uiversity of Sciece ad Techology, Weifag, Chia @qq.com Abstract The wireless sesor etwork (WSN) has peetrated ito every corer i our lives, ragig from atioal defese, biological medicie, evirometal moitorig, to traffic maagemet. It is of great sigificace to study the reliability of data trasmissio, a key determiat of the results of moitorig evets. The etwork reliability lies i fault tolerace: whe some odes or liks i the etwork fail, the data ca be recovered at the sik ode by selectig the appropriate fiite domai space. I this paper, etwork codig is used to improve the reliability of WSN. Firstly, the author calculated the data trasmissio reliability ad eergy cosumptio of etwork codig i siglepath ad multi-path scearios. The, the eergy cosumptio of etwork codig was compared with that of the traditioal method. Fially, the reliabilities of the two differet methods were simulated o MATLAB at differet chael loss rates. The experimetal results show that the reliability of the etwork codig techique is better tha the traditioal oe at the expese of a small amout of eergy. Keywords Wireless Sesor Network (WSN), Network Codig, Reliability Itroductio The wireless sesor etwork (WSN) has peetrated ito every corer i our lives, ragig from atioal defece, biological medicie, evirometal moitorig, to traffic maagemet. The etwork is formed through self-orgaizatio of sesors deployed i multiple sesig areas. I the WSN, the sesors ca work cooperatively to sese, collect ad process specific iformatio i the moitorig area, layig the basis for real-time acquisitio, processig ad trasmissio of iformatio []. It is of great sigificace to study the reliability of data trasmissio, a key determiat of the results of moitorig evets. The reliability of data trasmissio is a itegral part of etwork reliability. The research o etwork reliability ca be traced back to the 960s. However, the early research maily focused o commuicatio etworks, power etworks ad computer etworks. Origiated from etwork reliability, the WSN reliability has ot bee uiformly defied yet. I Referece [2], the cocept is defied as the probability of ormal commuicatio betwee odes i the etwork uder the give costraits. Refer- 50

2 ece [3] gives the defiitio of the ability to deliver material, iformatio ad eergy uder the specified coditios ad withi a desired time frame. Referece [4] defies WSN reliability as the success rate of source-to-destiatio data trasmissio i the etwork. Over the years, various models have bee costructed to study the WSN reliability. For example, Referece [5] costructs a Markov chai-based reliability model i light of the state trasitio i both software ad hardware. The model is further improved i Referece [6] with a quatitative aalysis method. Refereces [7, 8] itroduce a reliability modellig method based o Architecture Aalysis & Desig Laguage (AADL), which quatifies the reliability followig the idea of the Geeralized Stochastic Petri Nets (GSPN) model. The WSN reliability is maily reflected by such three parameters as data acquisitio, data trasmissio ad etwork coverage [9]. Amog them, the data trasmissio plays the most fudametal role [0, ]. Traditioally, the reliability of data trasmissio i the WSN are improved by Automatic Repeat Request (ARQ), Forward rror Correctio (FC) ad multi-path trasmissio. The reliability of data acquisitio is ofte modelled as a overlay problem [2], while the etwork coverage is a reflector of the moitorig quality ad the reliability of the acquired data. By defiitio, etwork coverage refers to the ability to moitor each locatio i a area of iterest. The greater the etwork coverage, the greater the moitorig ability. The parameter is ofte measured by the K-coverage [3, 4], that is, the locatio or area of iterest is covered by at least K odes. To meet differet data reliability requiremets i the area of iterest, the K value ca be set accordig to the uused Quality of Service (QoS). Data acquisitio is oe of the may fuctios of the WSN. The successful operatio of the WSN also relies o the reliable trasmissio of the acquired data to the observer. However, the reliability of data trasmissio is traditioally explored based o the reliable routig mechaism, ad rarely from the perspective of etwork topology. The oe-sided focus o reliable routig mechaism is attributable to the fixed topology of traditioal etworks. As sesor odes grow deser i distributio ad greater i quatity, the etwork topology has become icreasigly flexible, makig it possible to study data trasmissio reliability based o etwork topology [5-7]. I light of the above, this paper first itroduces the compositio ad characteristics of the WSN, ad the calculates the reliability ad eergy cosumptio of the etwork uder sigle-path ad multi-path coditios. Next, the etwork codig techique was compared with a traditioal method i terms of the eergy cosumptio. Fially, the reliabilities of the two differet trasmissio plas at differet chael loss rates were obtaied by MATLAB simulatio. The experimetal results show that the etwork codig techique achieves better stability tha the traditioal mode at the expese of a small amout of eergy, ad that etwork codig is superior to the traditioal mode i multi-path routig. ijo Vol. 3, No. 2, 207 5

3 2 Compositio ad Characteristics of the WSN 2. Compositio of the WSN The WSN is a task-orieted wireless ad hoc etwork [8], that itegrates sesor techology, embedded techology, wireless commuicatio techology with distributed iformatio processig techology. The etwork moitors the target i real time with various micro sesors, processes the moitorig data i a embedded module, ad trasmits the data to the remote moitorig cetre via wireless or physical etwork. The WSN cosists of four parts: wireless sesor odes, sik ode, trasmissio etwork, ad remote moitorig cetre. Its structure is show i Figure.,$#.(#"/*!"#$%"&$#'()*#%*& %&+#,!$,,$"#( #*%-"&.!"#$%"&$#'(#"/*!"#$%"&$#'(+&*+ Fig.. The structure of WSN 2.2 Characteristics of the WSN The WSN, as the combiatio of various emergig techologies, carries may characteristics that are ot available i geeral etworks [9].. Self-orgaizatio: the WSN is a ad hoc etwork formed with sesor odes based o the distributed etwork protocol. Without relyig o ay fixed ifrastructure, the etwork automatically adjusts the etry, exit ad migratio of odes. I this way, a plurality of active odes ca quickly form a idepedet etwork. 2. Decetralizatio: all odes i the WSN have equal status ad form a peer-to-peer etwork. The odes ca joi or leave the etwork mometarily at ay time if ecessary. The status of some odes does ot affect the operatio of the etire etwork. 52

4 3. Dyamic topology: I the case of battery exhaustio or failure, the WSN odes may exit the etwork followig the pre-set procedures. Owig to the mobility of sesor odes, exteral wireless sesor odes ca be admitted to the etwork at ay time. 4. Multi-hop routig: The iterodal commuicatio distace is relatively short i the WSN. The odes ca oly commuicate directly with eighbourig odes. Distat commuicatio requires a itermediate ode for data trasmissio. The multi-hop routig i the WSN is accomplished by commo odes, each of which both receives ad forwards iformatio. The data is trasmitted from each sesor ode to the sik ode via multi-hop relay. 5. Redudat height: For the sake of system reliability ad fault tolerace, the same moitorig poit is covered by the moitorig rages of multiple sesor odes. 6. Limited hardware resources: Uder the costraits of price, volume ad power cosumptio, the odes have much smaller computig power, program space ad memory space tha ordiary computers. This excludes complex protocol hierarchy from the desig of ode operatig system. 7. Limited power supply: The sesor odes are powered by battery, which caot be charged or replaced i may applicatios. Whe the battery rus out, the odes will lose their fuctios. Thus, eergy-savig must be cosidered i the desig of the WSN. 8. Fault tolerace: The WSN boasts strog fault tolerace ad robustess i that the odes ca joi or exit the etwork at ay time, ad that the etwork operatio is immue from the fault of ay ode. 9. Broadcast commuicatio: the broadcast commuicatio mode is adopted istead of the poit-to-poit mode i traditioal etwork. 0. Data processig: The traditioal emphasis o coectivity is replaced by the focus o data. The WSN odes are required to possess such fuctios as data aggregatio, fusio, capturig ad compressio. 2.3 ergy cosumptio of sesor odes The highlightig of eergy-savig differetiates the WSN from traditioal wireless etworks. The eergy savig is o big deal i traditioal wireless etworks due to cotiuous eergy supplemetatio. By cotrast, the WSN faces serious eergy costrait because of the large umber of widely distributed sesor odes. Therefore, it is the primary goal of WSN desig to make efficiet use of ode eergy ad prolog the life of the etwork. There are three parts i the eergy cosumptio module of sesor odes, amely sesor module, processor module ad wireless commuicatio module. All these modules should be desiged for the purpose of eergy-savig. Hereito, the power cosumptio of the processor module depeds o four factors: operatig voltage, operatig clock, iteral logic complexity, ad maufacturig process, ad calls for the developmet of eergy-efficiet microprocessors ad microcotrollers. Thaks to the recet improvemets i low-power circuits ad system desig techiques, it is ow possible to develop ultra-low-eergy microprocessors ad micro-cotrollers. The ijo Vol. 3, No. 2,

5 progress of itegrated circuit has further lowered the eergy cosumptio of processors ad sesor odes, makig the wireless commuicatio module the largest cosumer (Figure 2). The wireless commuicatio module has four states, icludig sedig, receivig, idle ad sleepig. I the idle state, the module always moitors the use of wireless chael ad checks if data have bee set to itself. I the sleepig state, the commuicatio module is shut dow. The sedig state marks the greatest eergy cosumptio of the module, followed closely by the idle ad receivig states. By cotrast, the module has the miimal eergy cosumptio i the sleepig state. Hece, the etwork commuicatio ca be made more eergy-efficiet by reducig uecessary forwardig ad receivig, ad speedig up the activatio of the sleepig state. The efficiet use of eergy may help to maximize the lifetime of the WSN. Fig. 2. The eergy cosumptio module of sesor odes 3 Trasmissio Reliability of Network Codig I the WSN, reliable data trasmissio ca be achieved at elevated redudacy. For example, the ARQ trasfers data packets by retrasmissio, the FC adds redudat packets to the source ode, ad the multi-path method trasmits redudat packets via multiple paths. Moreover, the reliability of WSN data trasmissio is easily affected by the quality of iterodal commuicatio. Oe of the most commo ways to ehace data trasmissio reliability lies i the reductio of chael loss rate with redudat packets. The simplest topology of the WSN is the star etwork, ad the reliability model of the same etwork is differet uder differet requiremets (Figure 3). 54

6 !"#$%#&'() Fig. 3. Star etwork If etwork codig techique is used aloe, it is impossible to avoid the chael loss effect. After all, the effect is the same whether the sik ode loses oe packet oly or all packets at oce. Thus, the etwork codig techique should be combied with the redudat techology to improve data trasmissio reliability. The popular ways to icrease redudacy iclude multi-path trasmissio, retrasmissio codig of data packets, ad icreasig redudat packets. The FC is ecoded oly at the source ode ad decoded at the destiatio ode. I etwork codig, however, the itermediate odes ca be recoded. Compared with FC, the etwork codig features better flexibility ad fault tolerace. For example, assume that 3 raw data packets are trasmitted such that the last-hop ode of the sik ode receives the ecoded data packets x, x2, x3 ad x4, where x is liearly correlated with the ecodig vector of x2, ad other data packets are liearly idepedet. If the FC is adopted, the ode will forward the packets directly. Suppose the packet x3 is lost after trasmissio, the sik ode will ot be able to decode the data packets x, x2 ad x4 because the ecodig coefficiet matrix is ot full rak. If the etwork ecodig is employed, the ode will receive the 4 ew ecodigs by ecodig the data packets, ad the coefficiet matrix of ay three of these packets is full rak. ve if a packet is lost, the sik ode ca decode it smoothly. To disclose the advatage of etwork codig, the reliability of data trasmissio ad eergy cosumptio of etwork codig were simulated with differet paths. The ijo Vol. 3, No. 2,

7 reliability of data trasmissio is deoted as R ad defied as the probability that the sik ode will receive the origial data packet successfully after oe trasmissio. Defiitio : The eergy cosumptio refers to the eergy cosumed by a successfully trasmitted packet. It ca be expressed as: Total eergy cosumed = Number of packets received () Defiitio 2: The ratio of the eergy cosumptio i etwork codig to that i the traditioal mode ca be expressed as:! = t c (2) 3. Sigle-path trasmissio I a multi-hop WSN, the packets are trasmitted by sesor odes via multi-hop routig, the iterodal commuicatio quality is susceptible to chael effects, ad lik failures are idepedet of each other. I the case of lik failure, the sesor odes will ot fail. Let us deote the chael loss rate as e, ad the eergy cosumed by a ode to sed a packet as!. Through a time hoppig, the probability for a packet to reach p odes is: p = (! e) (3) Assumig that the source ode seds to successfully receive K packets is: K packets, the probability for the sik ode P = (! e) K (4) where the probability P is equivalet to the reliability R defied i the precedig sectio. The eergy cosumed to sed a packet to the sik ode via a time hoppig is calculated as follows. Sice the packet is lost after a certai hop, the total eergy cosumed to sed K packets ca be obtaied by iductio. " =!(" ) + # i t K e! ik( " e) e i= (5) The umber of packets received by the sik ode is expected to be Kp, whereby the eergy cosumptio is: "!( " ) + # i K e! ik( " e) e t t i= = = Kp K( " e) # ( i"" ) i= =! +! i " e e (6) 56

8 The eergy cosumptio ratio is: c ( + ) µ! = = + t i## [ " + " i( # e) e]( K + m)(- e) $ i= (7) By Formula (7), it is leared that ">. I this research, radom liear codig is used for the simple computatio of odes. 3.2 Multi-path trasmissio Suppose there exist L o-itersectig paths which are of equal legth, ad the source ode seds K packets simultaeously through multiple paths to the sik ode. The, the probability for ay packet to successfully reach the sik ode after oe trasmissio is: p =![!(! e) ] L (8) Thus, the probability for the sik ode to successfully receive K packets is Kp, that is, the reliability R is, P = p = {![!(! e) ] } k K L K (9) If K packets are set alog the L paths, the total eergy cosumptio is: ' = t L t (0) The eergy cosumed to sed the K packets alog the L paths is: t ' ' = t ( ) = t! (! ) = LK e LK e t () Whe the etwork codig is employed i multi-path trasmissio, the itermediate odes oly ecode without icreasig redudat packets. I this case, the total eergy cosumed to sed K packets is: ' = [!(" ) + # c! (" i" ) ] + [( " ) + 2] i= L K e ik e e L (2) The umber of packets received by the sik ode is expected to be: LK( e)! (3) Therefore, the eergy cosumptio is: c ' = c LK(! e) ' (4) ijo Vol. 3, No. 2,

9 The eergy cosumptio ratio! is: '! ' = = c c ' t = + ' t ' + [(! ) L+ 2] e 3000 [ + (! ) + (!! )(! ) LK e e e ] (5) 4 Simulatio xperimet ad Result Aalysis The model give i the previous sectio was simulated i the eviromet of MATLAB Sigle-path trasmissio Suppose that the path legth is 5, ad the source ode seds 3 packets to the sik ode such that the sik ode receives 5 ecoded data packets. The, the reliabilities of the etwork codig ad the traditioal method were simulated at differet chael loss rates. As show i Figure 4, the etwork codig has achieved better reliability tha the traditioal method. This paper oly cosiders the redudat coded packets at the source ode. The reliabilities of the two methods still decreased with the loss of chael. I a sigle-path, the etwork codig improved the reliability to a greater extet tha the traditioal method at high chael loss rate of redudat data ad with few etwork ecodig packets; however, the results were still ot desirable. To fruther improve the data trasmissio reliability of etwork codig, appropriate redudat data packets should be added to the odes. Figure 5 presets the eergy cosumptio ratio of the two differet trasmissio methods. It ca be see that " icreased with e. However, regardless of the size of the e, the eergy cosumed by the sigle-path trasmissio combied with etwork codig always exceeded the eergy cosumed by that combied with the traditioal method. This meas etwork codig ca improve the reliability of data trasmissio i the etwork at the expese of a small amout of eergy. 4.2 Multi-path trasmissio Similarly, assume that 5 packets are set from the source ode alog 3 paths, each of which is 5 i legth. The, the reliabilities of the etwork codig ad the traditioal method were simulated at differet chael loss rates. As ca be see from Figure 6, the etwork codig method outperformed the traditioal method at the same redudacy. With the icrease of the chael loss rate, both method trasmitted fewer redudat data, idicatig that the trasmissio improvemet failed to offset lik failure ad results i loger paths. Figure 7 illustrates the eergy cosumptio ratio betwee the two differet methods. It shows that etwork codig ca improve the reliability of data trasmissio i the WSN at the expese of a small amout of eergy. 58

10 5 Coclusios This paper calculates ad aalyses the trasmissio reliability ad eergy cosumptio of etwork codig i sigle-path ad multi-path scearios. The simulatio o MATLAB 7.0 idicates that the techique is more reliable tha the traditioal method at the expese of a small amout of eergy. I additio, the author also simulated the reliabilities ad the eergy cosumptio ratio of the etwork codig ad the traditioal method. The experimetal results verify that the etwork codig techique is superior to traditioal trasmissio. Fig. 4. The reliabilities of the two methods Fig. 5. The eergy cosumptio ratio of the two methods ijo Vol. 3, No. 2,

11 Fig. 6. The reliabilities of the two methods Fig. 7. The eergy cosumptio ratio of the two methods 6 Refereces [] Su L.M., Li J.Z. (2005). Wireless Sesor Networks, Beijig: Tsighua Press. [2] Meg H.J. (200). Research o Optimizatio of etwork reliability ad its applicatio, Shaghai: ast Chia Uiversity of Sciece ad Techology. [3] Li R.Y., Huag N., Che W.W. (2009). A Practical Approach for Network Applicatio Reliability Assessmet, k-sploatacja Iiezawodosc-Maiteace ad Reliability, 4, pp

12 [4] Yousefi H., Mizaia K., Jahagir A.H. (200). Modelig ad valuatig the Reliability of Cluster-Based Wireless Sesor Networks, Proceedigs of 24th I Iteratioal Coferece o Advaced Iformatio Networkig ad Applicatios. AINA [5] Tag F., Luo H.W., Xu Y.W. (2005). The applicatio of Mobile Ad Hoc etwork i the US, gieer equipmet research, 24(5), pp [6] Rolader G., Rogers J.C., Batteh J. (2004). Self-healig miefield, Pro-ceedigs of the Society of Photo-Optical Istrumetatio gieers. Belligham, USA, pp [7] Huag C.F., Tseg Y.C. (2005). A survey of solutios to the coverage problems i wireless sesor etworks, Joural of Iteret Techology, 6(), pp. -8. [8] Liu J.J. (20). Research o etwork coverage based o Vorooi graph i wireless sesor etworks, Wuha: Wuha Uiversity of Techology. [9] Li S.S. (2007). Research o key techologies for reliable data trasmissio i wireless sesor etworks, Hua: Natioal Uiversity of defese techology. [0] Kosaovic M., Stojcev M. (2008). Reliable trasport of data i wireless sesor etwork, Proceedigs of 26th Iteratioal Coferece o Microelectroics, pp [] Willig A., Karl H. (2005). Data trasport reliability i wireless sesor etworks - asurvey of issues ad solutios, Praxis Der Iformatiosverarbeitug Ud Kommuikatio, 28, pp [2] Liudog X., Akhilesh S. (2006). Qos Reliability of Hierarchical Clustered Wireless Sesor Networks, Performace, Computig ad Commuicatios Coferece 25th I Iteratioal, pp [3] Zhou Z.H., Das S., Gupta H. (2004). Coected K-Coverage Problem i Sesor Networks Computer Commuicatios ad Networks, ICCCN, pp [4] Re Y., Zhag S.D., Zhag H.K. (2006). Coverage cotrol theory ad algorithm i wireless sesor etworks, Joural of software egieerig, pp [5] Wag X., Xig G., Zhag Y. (2003). Itegrated coverage adcoectivity cofiguratio i wireless sesor etworks, I: Akyildiz IF, Proc. of the ACM It'l Cof. o mbedded Networked Sesor Systems (Se Sys), pp [6] Se A., She B.H., Zhou L., Hao B. (2006). Fault-Tolerace i Sesor Networks: A New valuatio Metric, Ifocom I Iteratioal Coferece o Computer Commuicatios, 47, pp [7] Kashyap A., Khuller S., Shayma M. (2006). Relay Placemet for Higher Order Coectivity i Wireless Sesor Networks, Ifocom I Iteratioal Coferece o Computer Commuicatios, 5(), pp. -2. [8] Zhag S.J. (200). Wireless sesor etwork techology ad its applicatio, Beijig: Chia lectric Power Press, pp [9] Bruda S., Chaitra H.K. (2004). Survey of wireless sesor etworks, Joural of commuicatios, 25(4), pp Author Zhifu Lua is the lecturer of Weifag Uiversity of Sciece ad Techology, Shadog, Chia. His research iterest field is computer applicatio techology. He has computer teachig experiece of 20 years. He has presided over a scietific research project ad participated i a few scietific research projects. Article submitted 25 October 207. Published as resubmitted by the author 28 November 207. ijo Vol. 3, No. 2, 207 6

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

S. Mehta and K.S. Kwak. UWB Wireless Communications Research Center, Inha University Incheon, , Korea

S. Mehta and K.S. Kwak. UWB Wireless Communications Research Center, Inha University Incheon, , Korea S. Mehta ad K.S. Kwak UWB Wireless Commuicatios Research Ceter, Iha Uiversity Icheo, 402-75, Korea suryaad.m@gmail.com ABSTRACT I this paper, we propose a hybrid medium access cotrol protocol (H-MAC) for

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Relay Placement Based on Divide-and-Conquer

Relay Placement Based on Divide-and-Conquer Relay Placemet Based o Divide-ad-Coquer Ravabakhsh Akhlaghiia, Azadeh Kaviafar, ad Mohamad Javad Rostami, Member, IACSIT Abstract I this paper, we defie a relay placemet problem to cover a large umber

More information

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless

More information

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System

Low Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:

More information

Random Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach

Random Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach Radom Network Codig i Wireless Sesor Networks: Eergy Efficiecy via Cross-Layer Approach Daiel Platz, Dereje H. Woldegebreal, ad Holger Karl Uiversity of Paderbor, Paderbor, Germay {platz, dereje.hmr, holger.karl}@upb.de

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Security and Communication. Ultimate. Because Intercom doesn t stop at the hardware level. Software Intercom Server for virtualised IT platforms

Security and Communication. Ultimate. Because Intercom doesn t stop at the hardware level. Software Intercom Server for virtualised IT platforms Because Itercom does t stop at the hardware level by Commed Software Itercom Server for virtualised IT platforms Ready for VMware Ready for Hyper-V VoIP Ultimate availability Itercom Server as a app The

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Course Site: Copyright 2012, Elsevier Inc. All rights reserved.

Course Site:   Copyright 2012, Elsevier Inc. All rights reserved. Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Prevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting

Prevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting Vol.2, Issue.3, May-Jue 2012 pp-1017-1021 ISSN: 2249-6645 Prevetio of Black Hole Attack i Mobile Ad-hoc Networks usig MN-ID Broadcastig Atoy Devassy 1, K. Jayathi 2 *(PG scholar, ME commuicatio Systems,

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

More information

Energy Efficinet Cluster Head Selection and Data Convening in Wireless Sensor Networks

Energy Efficinet Cluster Head Selection and Data Convening in Wireless Sensor Networks Idia Joural of Sciece ad Techology, Vol 9(15), DOI: 1.17485/ijst/216/v9i15/77749, April 216 ISSN (Prit) : 974-6846 ISSN (Olie) : 974-5645 Eergy Efficiet Cluster Head Selectio ad Data Coveig i Wireless

More information

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute

More information

Master Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1

Master Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1 Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts

More information

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects Politecico di Milao Advaced Network Techologies Laboratory Iteret of Thigs Projects 2016-2017 Politecico di Milao Advaced Network Techologies Laboratory Geeral Rules Geeral Rules o Gradig 26/30 are assiged

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1 Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Malicious Node Detection in Wireless Sensor Networks using Weighted Trust Evaluation

Malicious Node Detection in Wireless Sensor Networks using Weighted Trust Evaluation Malicious Node Detectio i Wireless Sesor Networks usig Weighted Trust Evaluatio Idris M. Atakli, Hogbig Hu, Yu Che* SUNY Bighamto, Bighamto, NY 1392, USA {iatakli1, hhu1, yche}@bighamto.edu Wei-Shi Ku

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN

A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN Iteratioal Joural of Digital Cotet Techology ad its Applicatios Vol. 2 No 1, March 2008 A Key Distributio method for Reducig Storage ad Supportig High Level Security i the Large-scale WSN Yoo-Su Jeog *1,

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

The measurement of overhead conductor s sag with DLT method

The measurement of overhead conductor s sag with DLT method Advaces i Egieerig Research (AER), volume 7 2d Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 206) he measuremet of overhead coductor s sag with DL method Fag Ye,

More information

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,

More information

FCM-SEP (Fuzzy C-Means Based Stable Election Protocol) for Energy Efficiency in Wireless Sensor Networks

FCM-SEP (Fuzzy C-Means Based Stable Election Protocol) for Energy Efficiency in Wireless Sensor Networks FCM-SEP (Fuzzy C-Meas Based Stable Electio Protocol) for Eergy Efficiecy i Wireless Sesor Networks Sadeep Kaur Computer Sciece ad Egieerig, Giai Zail Sigh Campus College of Egieerig ad Techology, Bathida,

More information

SECURED OPTIMAL ROUTING BASED ON TRUST AND ENERGY MODEL IN WIRELESS SENSOR NETWORKS. Tamil Nadu, INDIA

SECURED OPTIMAL ROUTING BASED ON TRUST AND ENERGY MODEL IN WIRELESS SENSOR NETWORKS. Tamil Nadu, INDIA ARTICLE SECURED OPTIMAL ROUTING BASED ON TRUST AND ENERGY MODEL IN WIRELESS SENSOR NETWORKS A Sethil Kumar 1, E Logashamugam 2 * 1 Research Scholar, Dept. of Electroics ad Commuicatio Egieerig, St. Peter

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Design of efficient, virtual non-blocking optical switches

Design of efficient, virtual non-blocking optical switches Desig of efficiet, virtual o-blockig otical switches Larry F. Lid, Michael Sratt Mobile Systems ad Services Laboratory HP Laboratories Bristol HPL-200-239 March 3 th, 2002* otical switchig, switch desig

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Enhancing Cloud Computing Scheduling based on Queuing Models

Enhancing Cloud Computing Scheduling based on Queuing Models Ehacig Cloud Computig Schedulig based o Queuig Models Mohamed Eisa Computer Sciece Departmet, Port Said Uiversity, 42526 Port Said, Egypt E. I. Esedimy Computer Sciece Departmet, Masoura Uiversity, Masoura,

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More information

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible World Scietific Research Joural (WSRJ) ISSN: 2472-3703 www.wsr-j.org Research o Fresel Les Optical Receivig Atea i Idoor Visible Light Commuicatio Zhihua Du College of Electroics Egieerig, Chogqig Uiversity

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

Design Optimization of the Parameters of Cycling Equipment Based on Ergonomics

Design Optimization of the Parameters of Cycling Equipment Based on Ergonomics Desig Optimizatio of the Parameters of Cyclig Equipmet Based o Ergoomics Shu Qiao 1*, Jiagfeg Lua, Da Dig 1 Liaoig Shihua Uiversity, Liaoig, Fushu,113001,Chia Physical fitess testig ceterliaoig shihua

More information

Table 2 GSM, UMTS and LTE Coverage Levels

Table 2 GSM, UMTS and LTE Coverage Levels 6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1

More information

IS-IS in Detail. ISP Workshops

IS-IS in Detail. ISP Workshops IS-IS i Detail ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 27 th November

More information

Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration

Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Partitio i mobile adhoc etwork with mobility-a ew approach for effective use of fast IP address autocofiguratio Mukesh Chad *, HL

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

On Nonblocking Folded-Clos Networks in Computer Communication Environments

On Nonblocking Folded-Clos Networks in Computer Communication Environments O Noblockig Folded-Clos Networks i Computer Commuicatio Eviromets Xi Yua Departmet of Computer Sciece, Florida State Uiversity, Tallahassee, FL 3306 xyua@cs.fsu.edu Abstract Folded-Clos etworks, also referred

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks Iterferece Aware Chael Assigmet Scheme i Multichael Wireless Mesh Networks Sumyeg Kim Departmet of Computer Software Egieerig Kumoh Natioal Istitute of Techology Gum South Korea Abstract Wireless mesh

More information

Transitioning to BGP

Transitioning to BGP Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

Analysis of End-to-End Packet Delay for Internet of Things in Wireless Communications

Analysis of End-to-End Packet Delay for Internet of Things in Wireless Communications (IJACSA) Iteratioal Joural of Advaced Computer Sciece ad Applicatios, Aalysis of Ed-to-Ed Packet Delay for Iteret of Thigs i Wireless Commuicatios Imae Maslouhi 1 Dept: Electroics, Iformatics ad Telecommuicatios

More information

Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding

Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding Throughput-Delay Tradeoffs i Large-Scale MANETs with Network Codig Chi Zhag ad Yuguag Fag Departmet of Electrical ad Computer Egieerig Uiversity of Florida, Gaiesville, FL 326 Email: {zhagchi@, fag@ece.}ufl.edu

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS

AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS Iteratioal Joural of Computer Networks & Commuicatios (IJCNC) Vol.4, No.4, July 01 AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS Melisa Hajyvahabzadeh

More information

Look-ahead Geographic Routing for Sensor Networks

Look-ahead Geographic Routing for Sensor Networks 1 Look-ahead Geographic Routig for Sesor Networks Jiaxi You 1, Domiik Lieckfeldt 1, Qi Ha, Jakob Salzma 1, ad Dirk Timmerma 1 1 Uiversity of Rostock, Germay 1 {jiaxi.you, domiik.lieckfeldt, jakob.salzma,

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

More information

The University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition.

The University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition. Computer Architecture A Quatitative Approach, Sixth Editio Chapter 2 Memory Hierarchy Desig 1 Itroductio Programmers wat ulimited amouts of memory with low latecy Fast memory techology is more expesive

More information

Research Article Optimal Configuration of Virtual Links for Avionics Network Systems

Research Article Optimal Configuration of Virtual Links for Avionics Network Systems Iteratioal Joural of Aerospace Egieerig Volume 205, Article ID 329820, 9 pages http://dx.doi.org/0.55/205/329820 Research Article Optimal Cofiguratio of Virtual Liks for Avioics Network Systems Dogha A,

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Adaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1

Adaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1 Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

The Value of Peering

The Value of Peering The Value of Peerig ISP/IXP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 25 th

More information

Trade-off between Reliability and Energy Consumption in Transport Protocols for Wireless Sensor Networks

Trade-off between Reliability and Energy Consumption in Transport Protocols for Wireless Sensor Networks IJCSNS Iteratioal Joural of Computer Sciece ad Network Security, VOL.6 No.8B, August 006 47 Trade-off betwee eliability ad Eergy Cosumptio i Trasport rotocols for Wireless Sesor Networks Bui Dag Quag ad

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

CORD Test Project in Okinawa Open Laboratory

CORD Test Project in Okinawa Open Laboratory CORD Test Project i Okiawa Ope Laboratory Fukumasa Morifuji NTT Commuicatios Trasform your busiess, trasced expectatios with our techologically advaced solutios. Ageda VxF platform i NTT Commuicatios Expectatio

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

IMPROVED WEIGHTED CENTROID LOCALIZATION ALGORITHM BASED ON RSSI DIFFERENTIAL CORRECTION

IMPROVED WEIGHTED CENTROID LOCALIZATION ALGORITHM BASED ON RSSI DIFFERENTIAL CORRECTION INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS VOL. 7, NO. 3, SEPTEMBER 2014 IMPROVED WEIGHTED CENTROID LOCALIZATION ALGORITHM BASED ON RSSI DIFFERENTIAL CORRECTION E-jie Dig, Xi Qiao,

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE 14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal

More information

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Probability of collisions in Soft Input Decryption

Probability of collisions in Soft Input Decryption Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Cost Aware Secure Routing (CASER) Protocol Design for Wireless Sensor Networks G. SNEHA PRANEETHA 1, DEEPTHI JANAGAMA 2, N.

Cost Aware Secure Routing (CASER) Protocol Design for Wireless Sensor Networks G. SNEHA PRANEETHA 1, DEEPTHI JANAGAMA 2, N. ISSN 2348 2370 Vol.08,Issue.12, September-2016, Pages:2397-2401 www.ijatir.org Cost Aware Secure Routig (CASER) Protocol Desig for Wireless Sesor Networks G. SNEHA PRANEETHA 1, DEEPTHI JANAGAMA 2, N. ANJANEYULU

More information

n Explore virtualization concepts n Become familiar with cloud concepts

n Explore virtualization concepts n Become familiar with cloud concepts Chapter Objectives Explore virtualizatio cocepts Become familiar with cloud cocepts Chapter #15: Architecture ad Desig 2 Hypervisor Virtualizatio ad cloud services are becomig commo eterprise tools to

More information

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems

More information

Anti-addiction System Development Based on Android Smartphone. Xiafu Pan

Anti-addiction System Development Based on Android Smartphone. Xiafu Pan 3rd Iteratioal Coferece o Materials Egieerig, Maufacturig Techology ad Cotrol (ICMEMTC 2016) Ati-addictio System Developmet Based o Adroid Smartphoe Xiafu Pa Haia Vocatioal College of Political Sciece

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c

Analysis of Class Design Coupling Based on Information Entropy Di Jiang 1,2, a, Hua Zhou 1,2,b and Xingping Sun 1,2,c Advaced Materials Research Olie: 2013-01-25 IN: 1662-8985, Vol. 659, pp 196-201 doi:10.4028/www.scietific.et/amr.659.196 2013 Tras Tech Publicatios, witzerlad Aalysis of Class Desig Couplig Based o Iformatio

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Service Oriented Enterprise Architecture and Service Oriented Enterprise

Service Oriented Enterprise Architecture and Service Oriented Enterprise Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE

More information

MAC Throughput Improvement Using Adaptive Contention Window

MAC Throughput Improvement Using Adaptive Contention Window Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. http://www.scirp.org/joural/jcc http://dx.doi.org/10.4236/jcc.2015.31001 MAC Throughput Improvemet Usig Adaptive Cotetio

More information