Look-ahead Geographic Routing for Sensor Networks
|
|
- Octavia Thomas
- 6 years ago
- Views:
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, dirk.timmerma}@ui-rostock.de Colorado School of Mies, US qha@mies.edu 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),
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 informationImprovement 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 informationAlgorithms 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 informationPrevention 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 informationAn 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 informationRandom 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 informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationAn 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 informationLecture 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 informationEvaluation 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 informationElementary 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 informationAn 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 informationAdaptive 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 informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationThe 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 informationRelay 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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationCS 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 informationAccuracy 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 informationStone 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 informationCost 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 informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationEnergy 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 informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationData 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 informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationOptimization 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 informationOnes 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 informationCS200: 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 informationAn 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 informationData-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps
Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More information. 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 informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationDynamic 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 informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationΣ 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 informationThe 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 informationcondition 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 informationIMP: 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 informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationChapter 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 informationCubic 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 informationS. 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 informationLecture 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 informationSpherical Mapping Based Load Aware Routing for Wireless Sensor Networks
Spherical Mappig Based Load Aware Routig for Wireless Sesor Networks FATIMA MUHAMMAD ANWAR, Ajou Uiversity MUHAMMAD TAQI RAZA, LG Electroics SEUNG-WHA YOO, Ajou Uiversity KI-HYUNG KIM, Ajou Uiversity Eergy
More informationThe 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 informationCS Polygon Scan Conversion. Slide 1
CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear
More informationThroughput-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 informationHarris 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 informationPerformance 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 informationMobile 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 informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationManaging Random Sensor Networks by means of Grid Emulation
Maagig Radom Sesor Networks by meas of Grid Emulatio Zvi Lotker 1 ad Alfredo Navarra 2 1 Cetrum voor Wiskude e Iformatica Kruislaa 413, NL-1098 SJ Amsterdam, Netherlads lotker@cwi.l 2 Computer Sciece Departmet,
More informationGlobal Optimization of File Availability Through Replication for Efficient File Sharing in MANETs
Global Optimizatio of File Availability Through Replicatio for Efficiet File Sharig i MANETs Kag Che ad Haiyig She Departmet of Electrical ad Computer Egieerig Clemso Uiversity Clemso, South Carolia 29631
More information1 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 information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationA 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 informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationInterference 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 informationAppendix 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 informationQoS 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 informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationFCM-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 informationMał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 informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationSD 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 informationBGP 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 informationSECURED 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 informationAnalysis 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 informationSocial-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 informationOn the Throughput-Delay Trade-off in Georouting Networks
22 Proceedigs IEEE INFOCOM O the Throughput-Delay Trade-off i Georoutig Networks Philippe Jacquet Alcatel Lucet Bell Labs Villarceaux, Frace philippe.jacquet@alcatel-lucet.com Salma Malik INRIA Rocquecourt,
More informationRelationship 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 informationOptimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
Optimal Movemet of Mobile Sesors for Barrier Coverage of a Plaar Regio Biay Bhattacharya Mike Burmester Yuzhuag Hu Evagelos Kraakis Qiaosheg Shi Adreas Wiese Abstract Itrusio detectio, area coverage ad
More informationHash 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 informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More informationMultiprocessors. HPC Prof. Robert van Engelen
Multiprocessors Prof. Robert va Egele Overview The PMS model Shared memory multiprocessors Basic shared memory systems SMP, Multicore, ad COMA Distributed memory multicomputers MPP systems Network topologies
More informationA 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 informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationTransitioning 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 informationCMSC 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 informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationOptimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region (Extended Abstract)
Optimal Movemet of Mobile Sesors for Barrier Coverage of a Plaar Regio (Exteded Abstract) B. Bhattacharya M. Burmester Y. Hu E. Kraakis Q. Shi A. Wiese March 16, 2008 Abstract Itrusio detectio, area coverage
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationperformance 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 informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationA 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