Look-ahead Geographic Routing for Sensor Networks

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Look-ahead Geographic Routing for Sensor Networks"

Transcription

1 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, Colorado School of Mies, US bstract s sesor etworks are deployed over various terrais, the complexity of their topology cotiues to grow. Voids i etworks ofte cause existig geographic routig algorithms to fail. I this paper, we propose a ovel geographic routig algorithm called Forwardig with VIrtual Positio (ViP). We itroduce virtual positio as the middle positio of all direct eighbors of a ode. Istead of comparig odes real geographic positios, ViP employs virtual positios whe selectig the ext hop. Such virtual positio reflects the eighborhood of a sesor ode, as well as the tedecy of further forwardig. For sparsely-deployed etworks, ViP icreases success rate of packet routig without itroducig sigificat overhead. Furthermore, multiple levels of virtual positio ca be obtaied with localized iteratio. We propose the Forwardig with Multi-level Virtual Positio (MVP) algorithm ad the Forwardig with Hierarchical Virtual Positio (HVP) algorithm. Differet levels of virtual positios ad their combiatios are used alteratively to icrease success rate of packet routig i sesor etworks. Key words geographic routig, greedy forwardig, routig hole, wireless sesor etworks. I. INTRODUCTION Wireless Sesor Networks (WSNs) are composed of may sesor odes, which are capable of sesig physical parameters, processig data ad commuicatig wirelessly [1]. Sesor odes are usually battery powered ad left uatteded after deploymet. Sice radio commuicatio amog sesor odes is the mai drai of eergy i WSNs, eergy efficiecy remais a critical desig issue for WSNs. mog various routig algorithms, o-demad routig algorithms such as ODV [] are popular, while their floodig-based route discovery ofte lead to high cotrol overhead [3]. I cotrast, sigle-path geographic routig with Forwardig (GF) is attractive for WSNs [1]. I a basic GF algorithm, a ode commuicates oly with its direct eighbors (1-hop). The eighborig ode that further miimizes the remaiig distace of a packet to its destiatio will be selected as the ext hop. Such localized approach is This work is partially fiaced by the Germa Research Foudatio (DFG) (post graduate program MuSM, GRK 144). Fig. 1. example of ad MFR geographical routig. packet is set from ode S to ode D. The algorithm selects ode as the ext-hop, sice is the eighbor that is the closest to the destiatio. The MFR algorithm selects ode B as the ext hop, sice B makes the greatest progress alog the directio of packet forwardig (S-D). Both ad MFR requires the ext hop to be closer to the destiatio tha the curret ode. effective ad ca be dyamically adapted to chages, which oly require positio iformatio of sesor odes [1]. The algorithm [4] ad the Most Forwardig progress withi Radius (MFR) algorithm [5] are two fudametal approaches of GF based o distace. Fig. 1 illustrates the priciple of the algorithm ad the MFR algorithm. s moder WSNs are becomig popular i various applicatios, their topology is becomig complicated. Due to limited precisio of deploymet, voids ca cause routig holes i the etwork, where ofte lead traditioal GF algorithms to fail [6]. The reaso is the local miimum pheomeo illustrated i Fig.. I sigle-path GF routig algorithm (e.g. or MFR), forwardig of packets towards the sik ca fail at ode, sice there is o direct eighbor closer to the destiatio tha ode itself. Besides, ueve power cosumptio o sesor odes ca also lead to ew routig holes i the later lifetime of WSNs. The objective of our work is to improve the success rate of GF for sparse WSNs or WSNs with small routig holes. To this ed, we preset a ovel geographic routig algorithm sik hole Fig.. example of local miimum.

2 amed Forwardig with VIrtual Positio (ViP)", as well as its improved versios called the Forwardig with Multi-level Virtual Positio (MVP)" algorithm ad the " Forwardig with Hierarchical Virtual Positio (HVP)" algorithm. Each proposed algorithm has two variats usig the ad MFR priciple respectively. The mai advatage of our approaches is that the algorithms simply employ GF throughout the routig process, ad iheretly results i high routig efficiecy as the basic GF algorithms. I the mea time, the amout of cotrol overhead of the proposed algorithms is strictly limited. The basic assumptio of our approaches is that each ode i the etwork is aware of its ow geographic positio as well as the positios of its direct eighbors. II. RELTED WORK Various geographic routig algorithms [6] have bee proposed i recet years to address the local miimum problem of GF. Most of the routig algorithms are composed of two phases. Such algorithms start with a basic GF algorithm, ad recover from local miimum with their complemetary hole-bypassig phases. The Perimeter Stateless Routig (GPSR) is oe of the fudametal algorithms based o plaar graphs [7]. plaar graph is a sub-graph with o-crossig edges, which represets the same coectivity as the origial etwork. GPSR uses GF ad switches to its perimeter mode whe a local miimum is met. The right-had rule is employed i the perimeter mode, where packets are routed couterclockwise alog the edge o the face of a plaar graph. Bose et al. proposed the FCE-1 ad FCE- [8] algorithms that use the perimeter of the plaar graph formed at each ode. Such approaches have high success rate of packet routig, but also high cotrol overhead due to the plaarizatio processes ad the maiteace of the plaar graph iformatio o every sesor ode. I the abovemetioed -phase algorithms, the performace durig the GF phase is much better tha durig their complemetary phases [9]. To icrease the ratio of GF durig routig, Liu et al. preseted the idea of liged Virtual Coordiate System (VCS) [9]. Virtual coordiates are based o iteger umber of hops to the referece odes (achor odes) ad represet a coarse approximatio of ode locatio. The success rate of greedy routig is improved with VCS, while floodig of cotrol message from achor odes to the whole etwork causes large cotrol overhead durig the settig up of VCS. I [10], Stojmeovic et al. proposed to use GF with iformatio of -hop eighbors (-hop GF). The success rate of the GF algorithms is improved with each ode aware of its direct eighbors as well as its -hop eighbors (eighbors of its eighbors). mog all direct ad -hop eighbors, packets are set to the ode which is the closest to the destiatio via 1-hop or -hop forwardig. Sice farther eighbors are available for the selectio of ext-hop, small routig holes ca be avoided efficietly. The authors also proved that such GFbased methods are iheretly loop-free. The method i [10] solely employs the basic idea of GF durig routig. Such a method limits cotrol overhead sice it oly requires local kowledge of sesor odes (iformatio of 1-hop ad -hop eighbors) ad avoids sophisticated complemetary phases to recover from local miimums. III. LGORITHM DESIGN s metioed earlier, -hop GF uses extra kowledge of - hop eighbors i GF. Such iformatio o farther eighbors improves the success rate of GF i a straight-forward maer. However, -hop GF is ot strictly localized to the direct eighbors, therefore, it is ot scalable for further extesio. For example, whe further improvemet of success rate is demaded, odes eed to have iformatio of eighbors withi N hops (N>=3). For a D wireless etwork, the umber of eighbors stored o each sesor odes icreases proportioally to N. Similarly is the cotrol overhead for the maiteace of eighbor iformatio withi N hops.. Forwardig with Virtual Positio (ViP) We itroduce the virtual positio of a ode as the middle poit of all its direct eighbors. If a ode (x,y ) has direct eighbors V,1 (x,1,y,1 ), V, (x,,y, ),, V, (x,,y, ), the virtual positio of ode is: Fig. 3. example of usig virtual positios i GF. The packet is routed from ode 10 to ode 13. Whe usig the geographic positios of odes, ode 1 becomes a local miimum for both ad MFR, as show i (a). With virtual positios, a path ca be foud by MFR-ViP, as show i (b). With d -level virtual positio, both -MVP (-level) ad MFR- MVP (-level) fid paths aroud the hole, as show i (c).

3 3 ( x ', y ') = (( x, 1 + x, + K+ x, ) /,( y,1 + y, + K+ y, ) / ) Each ode calculates its virtual positio accordig to (1), ad broadcasts its virtual positio to its direct eighbors. The iformatio of virtual positio is stored o odes themselves ad their direct eighbors. I other words, each ode has the kowledge of its ow virtual positio, ad the virtual positios of its direct eighbors. Fig. 3(a) shows the geographic positios of odes. Fig. 3(b) shows the calculated virtual positios of odes. The virtual positio of ode 11 is the same as its real geographic positio, sice its direct eighbors (ode 6, 7, 8, 10, 1, 14, 15, 16) are located uiformly i the trasmissio circle cetered at the geographic positio of ode 11. I cotrast, the virtual positio of ode 1 (Fig. 3(b)) locates to the left of the geographic positio of ode 1 (Fig. 3(a)), because the positios of its direct eighbors (ode 7, 8, 11, 15, 16) are left-biased i the trasmissio circle of ode 1. The virtual positio of a ode provides a idicatio of how the direct eighbors are located aroud the ode o average, hece it is a suitable metric to demostrate the tedecy of further forwardig durig geographic routig. Cosider the example i Fig. 3, for a packet that eeds to be set from ode 10 to ode 13, both ad MFR get stuck at ode 1, sice there is o eighbor that ca make further progress towards the destiatio. I cotrast, the virtual positio of ode 1 is strogly left-biased due to the void o the right side of ode 1. s a result, MFR-ViP fids a path ( ) aroud the hole usig virtual positios of odes. We propose Forwardig with Virtual Positio (ViP), a look-ahead geographic routig algorithm based o the coordiate system of virtual positios. Istead of usig farther eighbors as i -hop GF, ViP uses the virtual positios of odes to ivolve farther eighbors i the lookahead routig process. Our algorithm is strictly localized, where a ode oly iteracts with its direct eighbors. ViP has two variats called ad MFR-ViP, which are based o the priciple of the ad MFR algorithm, respectively. s a example for a D WSN, whe a packet with destiatio D(x D,y D ) arrives at ode (x,y ), - ViP evaluates its ow virtual positio (x,y ) ad the virtual positios of its direct eighbors. The eighbor has the virtual positio that is the closest to ode D is selected as the ext hop. ccordig to the algorithm, the virtual positio of the selected eighbor must be also closer to the destiatio tha the virtual positio of curret ode. Namely, the exthop ode V,i of meets the followig two coditios: arg mi( ( x ' x ) + ( y ' y ) ) () ad: V, i, i D, i D (1) (x,i ' x D ) + (y,i ' y D ) < ( (x ' x D ) + (y ' y D ) (3) Similarly, MFR-ViP selects the eighbor that makes the greatest progress towards the destiatio of a packet. Give the vectors D ad DV,i, the ext-hop ode V,i of MFR-ViP is the oe that has the miimal dot product of the two vectors: arg mi( D DV ) (4) V, i ad also satisfies equatio (3). ad MFR-ViP termiate whe there is o eighbor that has the virtual positio to make further progress towards the destiatio of a packet. With this idea, odes oly eed to iteract with their direct eighbors to obtai iformatio of virtual positio. Therefore, settig up virtual positios is strictly localized. The message overhead i the worst case is O(M), where M is the total umber of odes i a etwork. B. Forwardig with Multi-level Virtual Positio (MVP) To further improve the success rate of GF, we itroduce the cocept of multi-level virtual positio that cosiders farther odes (eighbors of K-Hop, K>=1). If we refer to the virtual positio derived usig Equatio (1) as the 1 st -level virtual positio, the the K th -level virtual positio (K>=1) of ode ca be doe with K iteratios of local broadcast betwee odes ad their direct eighbors V,1 (x,1,y,1 ), V, (x,,y, ),, V, (x,,y, ), as follows. ( x K, y K ) = (( x,1 ( y,1 + x, + y,, i + K + x + K + y,, ) /, ) / ) Such K th -level virtual positios of odes idicate how the K- hop eighbors are located o average, also the tedecy of further forwardig durig geographic routig. Usig this cocept, we itroduce the Forwardig with Multilevel Virtual Positio (MVP)" algorithm based o K th -level virtual positio (K>=1), where each ode kows its ow K th - level virtual positio, ad the K th -level virtual positios of its direct eighbors. MVP equals ViP whe K is 1. The variats -MVP ad MFR-MVP evaluate the K th -level virtual positios accordig to the priciple of the ad MFR algorithm, respectively. Comparig to ViP, MVP employs a higher level of virtual positios to further improve the success rate of GF. Fig. 3(c) is a example of MVP usig d -level virtual positio, which demostrates that usig virtual positio of higher level idicates better forwardig tedecy i geographic routig, sice it takes farther eighbors ito cosideratio. -MVP ad MFR-MVP stop whe there is o eighbor that has the K th -level virtual positio that makes further progress towards the destiatio of a packet. C. Forwardig with Hierarchical Virtual Positio (HVP) Usig K th -level virtual positio (K>=1) ca itroduce ew local miimums durig routig. For istace, i Fig. 4, a packet eeds to be set from ode 5 to ode 4. Whe usig the geographic positios of odes, the packet ca be successfully delivered (path i Fig. 4(a)). While usig 1 st -level virtual positio, ode 5 has o eighbor to make further progress towards ode 4, thus becomes a local miimum of - (5)

4 4 D. lgorithm Properties I a GF algorithm, a ode eeds to evaluate all the etries of eighbors stored o the odes, ad select the ext hop based o a certai criterio. Therefore, the average storage ad computatioal overhead is proportioal to the umber of eighbor etries o odes. This metric also reflects the cotrol Fig. 4. example of routig holes itroduced by usig virtual positios. ViP ad MFR-ViP. To address this problem, we itroduce the Forwardig with Hierarchical Virtual Positio (HVP) algorithm (Table. 1 shows the pseudo code of HVP). HVP uses the combiatio of all K-level virtual positios (K>=1) ad the geographic positios of odes i a dow-hill fashio. Namely, whe a local miimum is met usig K th -level virtual positio, HVP will lower the level of virtual positio from K th - level to (K-1) th -level (K>=), or from 1 st -level virtual positio to real geographic positio. HVP requires odes to store the geographic positios, as well as all the K-level virtual positios of itself ad its direct eighbors. flag flag_level is added to the packets to idicate the curret level of virtual positio (usig geographic positio whe K=0). I our example (Fig. 4(b)), the packet stuck (usig 1 st -level virtual positio) at ode 5 ca set its flag_level to be 0, ad reach its destiatio via the path by usig the geographic positios of odes. The two variats -HVP ad MFR- HVP start with K th -level virtual positio (K>=1) accordig to the priciple of the ad MFR algorithm, respectively. To esure that HVP is loop-free, such dow-hill process is uidirectioal. Namely, for a packet iitialized with K th -level virtual positio ad adjusted to (K-1) th -level virtual positio after meetig a local miimum, the packet stays o (K-1) th - level ad ca oly be further adjusted to the lower levels (or from 1 st -level virtual positio to geographic positio). PROCEDURE hadle_packet TBLE 1 PSEUDO CODE OF GF-HVP ON NODE N WHILE there is local miimum ND packet.flag_level>=0 { packet.flag_level--; } IF packet.flag_level>=0 { forward packet usig virtual positio of level packet.flag_level idicated by the packet (usig geographic positio whe packet.flag_level is 0); } ELSE { routig failed; } lgorithm GF, GF-ViP, GF-MVP TBLE LGORITHM OVERHED Overhead GF-HVP starts with K th -level virtual positio N-hop GF R: trasmissio rage of odes. D: average umber of odes i a uit area O(π R D) O(π R D (K+1)) O(π (N R) D) message overhead to maitai the iformatio of virtual positios. Table shows cotrol overhead of related algorithms. Here we assume that odes are deployed with the same desity i a D etwork. The proposed ViP, MVP ad HVP algorithms are strictly localized, ad ca termiate based o local kowledge, i.e., they are loop-free. Lemma 3.1. For ay static etwork, ViP is loop-free. Proof: s proved i [10], sigle-path routig algorithms based o the algorithm or the MFR algorithm is iheretly loop-free. ViP employs the virtual positio coordiatio system which is the 1-to-1 mappig of the origial geographic coordiate system of a etwork. Istead of the geographic positios, ViP evaluates the correspodig virtual positios of odes based o the coordiate system of virtual positio. Thus, ad MFR-ViP are also iheretly loop-free. Namly, ViP is loop-free. Lemma 3.. For ay static etwork, MVP is loop-free. Proof: ssume that MVP of K th -level virtual positio (K>=1) is loop free. Sice MVP of (K+1) th -level virtual positio employs the 1-to-1 mappig of the K th -level virtual positio coordiate system. Therefore, MVP of (K+1) th -level virtual positio is loop-free. s proved i Lemma3.1, MVP of 1 st -level virtual positio is loop free. Thus, MVP of K th -level virtual positio is loop free for ay K>=1. Lemma 3.3. For ay static etwork, HVP is loop-free. Proof: HVP starts with K th -level virtual positio (K>=1) ad adjust the flag_level of packets uidirectioally util 0, which refers to the coordiate system of geographic positio. s proved i Lemma3., MVP of K th -level virtual positio is loop free. Therefore, each step i the dow-hill scalig of HVP is loop-free. Thus, HVP starts with K th -level virtual positio is loop free for ay K>=1.

5 5 IV. PERFORMNCE EVLUTION We implemeted the proposed algorithms usig Matlab. The simulated etwork was a 1000 m 1000 m square plae, where 500 sesor odes were radomly deployed. Packets were geerated with radom pairs of source-destiatio addresses. Differet commuicatio rages of sesors are used. We used a simple disc-commuicatio model: sesor odes i the trasmissio rage ca receive sigals from a trasmitter without loss. For the same deploymet desity, smaller commuicatio rage implies sparser layout of a etwork ad bigger chace to ecouter routig holes durig packet forwardig. The objective of our experimets is to demostrate the performace of our algorithm i sparsely-deployed WSNs, or WSNs with small voids due to o-uiform deploymets. We show oly the results of the variat, -MVP ad -HVP. The performace of MFR-ViP, MFR-MVP ad MFR-HVP are similar from our simulatio. The results were compared with the -Hop algorithm [10] ad its extesio, the 3-Hop algorithm. We use the followig metrics to compare the performace of the simulated routig algorithms: Success rate of GF: This is defied as the percetage of packet delivery with radom packet forwardig. 500 packets with radom source-destiatio pairs were geerated ad forwarded i the simulated etwork. Whe the trasmissio rage of odes is small, voids appear frequetly i the etwork. This metric illustrates the ability of avoidig routig hole of the simulated algorithms. Delay of GF: This is defied as the average hop couts of packets from their source to the destiatio. Give the same success rate, small packet delay (i hops) represets better performace i terms of routig efficiecy ad eergy cosumptio. lgorithm Overhead: The umber of eighbor etries stored o sesor odes implies the storage overhead, as well as the computatioal overhead by choosig of exthop. Furthermore, the cotrol message overhead of maitaiig eighbor iformatio is also proportioal to the umber of etries. Experimetal Results: Fig. 5 shows the average percetage of successful packet forwardig from our simulatio. Fig. 5(a) compares the performace of the algorithm, Hop-, - ViP ad -MVP (usig d -level virtual positios). Whe the commuicatio rage of sesor odes is short, odes have relatively few eighbors, which leads to low success rates of the simulated algorithms. The Hop- ad cosider the -hop eighbors of odes. s the commuicatio rage icreases, Hop- ad demostrate similar success rates, which are higher comparig to. -MVP usig d -level virtual positio results i eve better success rate sice it cosiders 3-hop eighbors. ll the simulated algorithms reach full delivery of packets i deselydeployed etworks (whe trasmissio rage reaches 10m i verage Success Rate verage Success Rate 100% 90% 80% 70% 60% 50% 40% 30% 0% 10% Hop % 90% 80% 70% 60% 50% 40% (a) 30% 0% -HVP (1 level) 10% -HVP ( level) 0 (b) Fig. 5. verage success rate of the algorithms with differet commuicatio rages Fig. 5(a)). Fig. 5(b) illustrates the performace of the dowhill scalig i the -HVP algorithms start with 1 st -level ad d -level virtual positios. Comparig to the correspodig -MVP algorithms usig the same level of virtual positios, -HVP has higher success rate due to its additioal search o virtual positios of lower levels ad the geographic positios of odes. Fig. 6 shows the average delay of the successfully delivered packets from our simulatio. Whe the etwork is sparselydeployed (trasmissio rage < 70m i Fig. 6(a)), the legth of routig paths icreases with the icreasig of the commuicatio rage. The reaso is that more packets with distat source ad destiatio ca be delivered whe the coectivity of a etwork icreases. Hop-, - ViP ad -MVP (usig d -level virtual positio) have bigger average delay, sice additioal packet with sourcedestiatio pair of loger distace ca also be delivered with the look-ahead algorithms. s the trasmissio rage reaches 70m (Fig. 6(a)), the hop cout starts to fall due to the high success rates ad the icreasig step-size of forwardig. We observe that the results of the simulated algorithms are similar whe the success rates reach 100%. Therefore, the look-ahead routig algorithms (Hop-, ad - MVP) have similar routig efficiecy as the algorithm. Fig. 7 illustrates the cotrol overhead of the simulated

6 6 verage Delay [hop cout] verage Delay [hop cout] (a) Hop HVP (1 level) -HVP ( level) 1 (b) Fig. 6. verage delay of the algorithms with differet commuicatio rages algorithms idicated by the umber of eighbor etries o odes. With similar performace i terms of success rate, results i lower storage ad computatioal overhead compared to the -Hop algorithm. s a extesio of the -Hop algorithm, the rapidly icreasig overhead of the 3-Hop algorithm shows that the N-Hop idea is ot scalable. I cotrast, the umber of eighbor etries of our ad - MVP algorithms stays low as the algorithm. The storage ad computatioal overhead of -HVP icreases liearly alog with the level of virtual positio it starts with. V. CONCLUSION ND FUTURE WORK I this paper, we preset a ovel geographic routig algorithm amed Forwardig with Virtual Positio (ViP)", as well as its two extesios called the Forwardig with Multi-level Virtual Positio (MVP)" algorithm ad the Forwardig with Hierarchical Virtual Positio (HVP) algorithm. Each of the three algorithms has two variats based o the priciple of the algorithm ad the Most Forwardig progress withi Radius (MFR) algorithm, respectively. Simulatio results demostrate that our proposed algorithms improve the success rate of geographic routig for sparsely-deployed WSNs ad Etries of Neighbors ,, -MVP Hop- 3Hop- -HVP (1 level) -HVP ( level) 0 Fig. 7. Number of eighbor etries with differet commuicatio rages WSNs with small routig holes. The proposed algorithms solely employ Forwardig (GF) throughout the routig processes, ad iheretly results i high routig efficiecy as the basic GF algorithms. Furthermore, the cotrol overhead of our proposed algorithms is strictly limited. For future work, the trade-off betwee the overhead caused by usig higher levels of virtual positios ad the resulted performace will be formally aalyzed. Cotext iformatio such as remaiig eergy will be cosidered as the routig parameter for our algorithms. REFERENCES [1] K. kkaya ad M. Youis, " survey of routig protocols for wireless sesor etworks", Elsevier d Hoc Network Joural, 005, Vol. 3/3, pp [] C.E. Perkis ad E.M. Beldig-Royer, "d hoc o-demad distace vector (ODV) routig", i IEEE Workshop o Mobile Computig Systems ad pplicatios, Feb [3] Pham, N. N., You, J., ad Wo, C. " Compariso of Wireless Sesor Network Routig Protocols o a Experimetal Testbed", I Proceedigs of the IEEE iteratioal Coferece o Sesor Networks, Ubiquitous, ad Trustworthy Computig - Vol - Workshops - Volume 0 (Jue 05-07, 006). SUTC. IEEE Computer Society, Washigto, DC, [4] G. G. Fi. "Routig ad addressig problems i large metropolitascale iteretworks", Techical Report ISI/RR , Iformatio Scieces Istitute, Mars [5] H. Takagi ad L. Kleirock, "Optimal Trasmissio Rages for Radomly Distributed Packet Radio Termials", IEEE Tras. Comm., vol. 3, o. 3, pp , [6] Nadeem hmed, Salil S. Kahere, Sajay Jha, "The holes problem i wireless sesor etworks: a survey", CM SIGMOBILE Mobile Computig ad Commui-catios Review, v.9., pril 005. [7] Brad Karp ad H. T. Kug, "GPSR: perimeter stateless routig for wireless etworks", i Proceedigs of the CM/IEEE MobiCom '000, pages 43-54, 000. [8] P. Bose, P. Mori, I. Stojmeovic, ad J. Urrutia, "Routig with guarateed delivery i ad hoc wireless etworks", Wireless Networks, 7: , 001. [9] Ke Liu, Nael bu-ghazaleh, "liged Virtual Coordiates for Routig i WSNs", Mobile dhoc ad Sesor Systems (MSS), 006 IEEE Iteratioal Coferece o, vol., o., pp , Oct [10] Stojmeovic, I. ad Li, X, "Loop-Free Hybrid Sigle-Path/Floodig Routig lgorithms with Guarateed Delivery for Wireless Networks", IEEE Tras. Parallel Distrib. Syst. 1, 10 (Oct. 001),

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

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

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

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

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

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

. 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

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1 CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()

More information

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,

More information

Σ P(i) ( depth T (K i ) + 1),

Σ P(i) ( depth T (K i ) + 1), EECS 3101 York Uiversity Istructor: Ady Mirzaia DYNAMIC PROGRAMMING: OPIMAL SAIC BINARY SEARCH REES his lecture ote describes a applicatio of the dyamic programmig paradigm o computig the optimal static

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks

QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks QoS Aware Geographic Opportuistic Routig i Wireless Sesor Networks Log Cheg, Member, IEEE, Jiawei Niu, Member, IEEE, Jiaog Cao, Seior Member, IEEE, Sajal K. Das, Seior Member, IEEE, ad Yu Gu, Member, IEEE

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

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio

More information

Social-P2P: An Online Social Network Based P2P File Sharing System

Social-P2P: An Online Social Network Based P2P File Sharing System 1.119/TPDS.214.23592, IEEE Trasactios o Parallel ad Distributed Systems 1 : A Olie Social Network Based P2P File Sharig System Haiyig She*, Seior Member, IEEE, Ze Li, Studet Member, IEEE, Kag Che Abstract

More information

BGP Attributes and Path Selection. ISP Training Workshops

BGP Attributes and Path Selection. ISP Training Workshops BGP Attributes ad Path Selectio ISP Traiig Workshops 1 BGP Attributes The tools available for the job 2 What Is a Attribute?... Next Hop AS Path MED...... p Part of a BGP Update p Describes the characteristics

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Routing with Guaranteed Delivery in ad hoc Wireless Networks*

Routing with Guaranteed Delivery in ad hoc Wireless Networks* Routig with Guarateed Delivery i ad hoc Wireless Networks* Prosejit Bose School of Computer Sciece Carleto Uiversity jit@scs.carleto.ca Pat Mori School of Computer Sciece Carleto Uiversity mori@scs.carleto.ca

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

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

Towards Compressing Web Graphs

Towards Compressing Web Graphs Towards Compressig Web Graphs Micah Adler Λ Uiversity of Massachusetts, Amherst Michael Mitzemacher y Harvard Uiversity Abstract We cosider the problem of compressig graphs of the lik structure of the

More information

Contour Map Matching for Event Detection in Sensor Networks

Contour Map Matching for Event Detection in Sensor Networks Cotour Map Matchig for Evet Detectio i Sesor Networks Wewei Xue, Qiog Luo, Lei Che, Yuhao Liu Departmet of Computer Sciece Hog Kog Uiversity of Sciece ad Techology Clear Water Bay, Kowloo, Hog Kog {wwxue,

More information

1&1 Next Level Hosting

1&1 Next Level Hosting 1&1 Next Level Hostig Performace Level: Performace that grows with your requiremets Copyright 1&1 Iteret SE 2017 1ad1.com 2 1&1 NEXT LEVEL HOSTING 3 Fast page loadig ad short respose times play importat

More information

Introduction to OSPF. ISP Training Workshops

Introduction to OSPF. ISP Training Workshops Itroductio to OSPF ISP Traiig Workshops 1 OSPF p Ope Shortest Path First p Lik state or SPF techology p Developed by OSPF workig group of IETF (RFC 1247) p OSPFv2 stadard described i RFC2328 p Desiged

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets

More information

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70 NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

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 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

GPUMP: a Multiple-Precision Integer Library for GPUs

GPUMP: a Multiple-Precision Integer Library for GPUs GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract

More information

Service discovery in ad hoc networks

Service discovery in ad hoc networks Service discovery i ad hoc etworks Mohammed Haddad ad Hamamache Kheddouci Laboratoire PRISMa - Uiversité Claude Berard Lyo, Bât. 7, 843, Bd. du ov. 98, 69622 Villeurbae Cedex Abstract. Various researches

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor

Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor Iteratioal Joural of Computer Applicatios (97 8887) Volume 132 No.11, December21 Optimizatio of based CPU Schedulig Algorithms to Miimize Starvatio of Processes usig a Efficiecy Factor Muhammad A. Mustapha

More information

T-ANT: A Nature-Inspired Data Gathering Protocol for Wireless Sensor Networks 1

T-ANT: A Nature-Inspired Data Gathering Protocol for Wireless Sensor Networks 1 22 JOURNAL OF COMMUNICATIONS, VOL. 1, NO. 2, MAY 26 T-ANT: A Nature-Ispired Data Gatherig Protocol for Wireless Sesor Networks 1 S. Selvakeedy School of Iformatio Techologies, Uiversity of Sydey, NSW 26,

More information

Hashing Functions Performance in Packet Classification

Hashing Functions Performance in Packet Classification Hashig Fuctios Performace i Packet Classificatio Mahmood Ahmadi ad Stepha Wog Computer Egieerig Laboratory Faculty of Electrical Egieerig, Mathematics ad Computer Sciece Delft Uiversity of Techology {mahmadi,

More information

Investigating methods for improving Bagged k-nn classifiers

Investigating methods for improving Bagged k-nn classifiers Ivestigatig methods for improvig Bagged k-nn classifiers Fuad M. Alkoot Telecommuicatio & Navigatio Istitute, P.A.A.E.T. P.O.Box 4575, Alsalmia, 22046 Kuwait Abstract- We experimet with baggig knn classifiers

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

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Novel Encryption Schemes Based on Catalan Numbers

Novel Encryption Schemes Based on Catalan Numbers D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha

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

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

Threads and Concurrency in Java: Part 1

Threads and Concurrency in Java: Part 1 Cocurrecy Threads ad Cocurrecy i Java: Part 1 What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Optimization on Retrieving Containers Based on Multi-phase Hybrid Dynamic Programming

Optimization on Retrieving Containers Based on Multi-phase Hybrid Dynamic Programming Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scie ce s 96 ( 2013 ) 844 855 Abstract 13th COTA Iteratioal Coferece of Trasportatio Professioals (CICTP 2013) Optimizatio

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Examples and Applications of Binary Search

Examples and Applications of Binary Search Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We

More information

R 5 N: Randomized Recursive Routing for Restricted-Route Networks

R 5 N: Randomized Recursive Routing for Restricted-Route Networks R 5 N: Radomized Recursive Routig for Restricted-Route Networks Natha S. Evas Techische Uiversität Müche Muich, Germay Email: evas@et.i.tum.de Christia Grothoff Techische Uiversität Müche Muich, Germay

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Speeding-up dynamic programming in sequence alignment

Speeding-up dynamic programming in sequence alignment Departmet of Computer Sciece Aarhus Uiversity Demark Speedig-up dyamic programmig i sequece aligmet Master s Thesis Dug My Hoa - 443 December, Supervisor: Christia Nørgaard Storm Pederse Implemetatio code

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

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

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

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)

Linearising Calibration Methods for a Generic Embedded Sensor Interface (GESI) 1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

A Group-Based Architecture for Wireless Sensor Networks

A Group-Based Architecture for Wireless Sensor Networks A Group-Based Architecture for Wireless Sesor Networs Jaime Lloret, Miguel Garcia ad Jesus Tomas Departmet of Commuicatios Polytechic Uiversity of Valecia Valecia, Spai jlloret@dcom.upv.es, migarpi@teleco.upv.es,

More information

Properties and Embeddings of Interconnection Networks Based on the Hexcube

Properties and Embeddings of Interconnection Networks Based on the Hexcube JOURNAL OF INFORMATION PROPERTIES SCIENCE AND AND ENGINEERING EMBEDDINGS OF 16, THE 81-95 HEXCUBE (2000) 81 Short Paper Properties ad Embeddigs of Itercoectio Networks Based o the Hexcube JUNG-SING JWO,

More information

k (check node degree) and j (variable node degree)

k (check node degree) and j (variable node degree) A Parallel Turbo Decodig Message Passig Architecture for Array LDPC Codes Kira Guam, Pakaj Bhagawat, Weihuag Wag, Gwa Choi, Mark Yeary * Dept. of Electrical Egieerig, Texas A&M Uiversity, College Statio,

More information

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG

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

A Comparative Study on the Algorithms for a Generalized Josephus Problem

A Comparative Study on the Algorithms for a Generalized Josephus Problem Appl. Math. If. Sci. 7, No. 4, 1451-1457 (2013) 1451 Applied Mathematics & Iformatio Scieces A Iteratioal Joural http://dx.i.org/10.12785/amis/070425 A Comparative Study o the Algorithms for a Geeralized

More information

A Dynamic Separator Algorithm

A Dynamic Separator Algorithm A Dyamic Separator Algorithm Degait Armo Joh Reif Departmet of Computer Sciece, Duke Uiversity Durham, NC 27708-0129 Abstract Our work is based o the pioeerig work i sphere separators doe by Miller, Teg,

More information

Intermediate Statistics

Intermediate Statistics Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS 28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets

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 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

History Based Probabilistic Backoff Algorithm

History Based Probabilistic Backoff Algorithm America Joural of Egieerig ad Applied Scieces, 2012, 5 (3), 230-236 ISSN: 1941-7020 2014 Rajagopala ad Mala, This ope access article is distributed uder a Creative Commos Attributio (CC-BY) 3.0 licese

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,

More information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

Constant-Time Distributed Dominating Set Approximation*

Constant-Time Distributed Dominating Set Approximation* Costat-Time Distributed Domiatig Set Approximatio* Fabia Kuh Departmet of Computer Sciece ETH Zurich 8092 Zurich, Switzerlad kuh @ if.ethz.ch Roger Wattehofer Departmet of Computer Sciece ETH Zurich 8092

More information

THE PROBLEM THE PROBLEM (1) THE PROBLEM (2) THE MINIMUM ENERGY BROADCAST PROBLEM THE MINIMUM SPANNING TREE

THE PROBLEM THE PROBLEM (1) THE PROBLEM (2) THE MINIMUM ENERGY BROADCAST PROBLEM THE MINIMUM SPANNING TREE THE MINIMUM ENERGY BROADCAST PROBLEM I.E. THE MINIMUM SPANNING TREE PROBLEM Prof. Tiziaa Calamoeri Network Algorithms A.y. 05/ THE PROBLEM THE PROBLEM () THE PROBLEM () What does it meas sufficietly close?!

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

Strong Complementary Acyclic Domination of a Graph

Strong Complementary Acyclic Domination of a Graph Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig

More information

CMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago

CMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access

More information

Minimum Spanning Trees

Minimum Spanning Trees Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 0 Miimum Spaig Trees 0 Goodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig a Network Suppose

More information

Algorithm Selection using Reinforcement Learning

Algorithm Selection using Reinforcement Learning Algorithm Selectio usig Reiforcemet Learig Michail G. Lagoudakis Departmet of Computer Sciece, Duke Uiversity, Durham, NC 2778, USA Michael L. Littma Shao Laboratory, AT&T Labs Research, Florham Park,

More information

CS644 Advanced Networks

CS644 Advanced Networks Limitatios of IP CS644 Advaced Networks Lecture 7 QoS Adreas Terzis IP provides oly best effort service IP does ot participate i resource maagemet Caot provide service guaratees o a per flow basis Caot

More information

BGP with an Adaptive Minimal Route Advertisement Interval

BGP with an Adaptive Minimal Route Advertisement Interval with a Adaptive Miimal Route Advertisemet Iterval Nead Lasković ad Ljiljaa Trajković Simo Fraser Uiversity Vacouver, British Columbia, Caada {laskovi, ljilja}@cs.sfu.ca Abstract The duratio of the Miimal

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c

Global Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c Verizo WIreless Global Support Guide For the BlackBerry 8830 World Editio Smartphoe ad the Motorola Z6c For complete iformatio o global services, please refer to verizowireless.com/vzglobal. Whether i

More information

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig

More information

Message Integrity and Hash Functions. TELE3119: Week4

Message Integrity and Hash Functions. TELE3119: Week4 Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig

More information

Evaluating Top-k Selection Queries

Evaluating Top-k Selection Queries Evaluatig Top-k Selectio Queries Surajit Chaudhuri Microsoft Research surajitc@microsoft.com Luis Gravao Columbia Uiversity gravao@cs.columbia.edu Abstract I may applicatios, users specify target values

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

A network throughput comparison of optical metro ring architectures

A network throughput comparison of optical metro ring architectures A etwork throughput compariso of optical metro rig architectures M. Veeraraghava, H. Lee, J. Aderso, K. Y. Eg This paper compares three differet metropolita-area etwork (MAN) architectures from a etwork

More information