Acoustic Links. Maximizing Channel Utilization for Underwater

Size: px
Start display at page:

Download "Acoustic Links. Maximizing Channel Utilization for Underwater"

Transcription

1 Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy {harris,davide.meneghetti,zorzi}@dei.unipd.it Abstrat-Underwater aousti hannels suffer from long delays and high bit error rates. In addition to these hallenges, the unique bandwidth-distane relationship of underwater links makes straightforward appliation of traditional networking tehniques suboptimal. This paper presents an analysis of the appliation of three tehniques: forward error orretion, paket size adaptation, and paket train size adaptation in terms of their effets on hannel utilization in underwater aousti environments. Our analysis provides insight that an guide the design of MAC and routing protools. Results from simulations of the tehniques in ombination demonstrate how inreases in hannel utilization an be ahieved in the fae of underwater aousti hannel onstraints. Tehnial Area: 1.1 Other [Underwater Aousti Networks] I. INTRODUCTION A large number of appliations for underwater sensor networks exist [1]; however, due to limitations of the aousti hannel, providing effiient ommuniation is a hallenging problem. Propagation delay, absorption loss, and low bandwidth are only some fators that must be taken into aount in underwater aousti links. Developing protools that provide effetive ommuniation in terms of timeliness of data, reliability, and energy onsumption must take into aount these fators. One metri for ommuniation effiieny is hannel utilization. In the fae of limited bandwidth resoures, protools that require the hannel to be either idle, or used sending data that is not useful to the reeiving appliations, have a large negative impat on the system. The long propagation delays in underwater networks ause aknowledgment-based reliability mehanisms to severely redue the hannel utilization, due to the need to wait for response from the reeiver; however, the potentially high error rates of underwater hannels [2] require some reliability mehanism to be built into the network stak to support appliations with low tolerane for error. Tehniques to improve the hannel utilization in the fae of large propagation delays inlude using paket trains and forward error orretion (FEC) shemes, but understanding the impat of the various parameters, suh as paket size and the FEC strength, is an open problem. Additionally, properties unique to the underwater environment alter the onventional wisdom on how suh tehniques should be applied. In terrestrial radio networks, as the distane between the sender and reeiver inreases, assuming the transmit power is held onstant, the signal-to-noise ratio (SNR) at the reeiver dereases. Lower SNRs an ause more bit errors at the reeiver, depending on the hannel enoding sheme used for transmission. Lower data rate shemes tend to tolerate lower SNRs while maintaining aeptably low bit error rates. For underwater aousti links, in addition to this effet, the bandwidth available for transmitting the data also dereases with inreasing distane [3]. The ombination of these two effets has a large impat on the available data rates at given distanes for underwater networks. While previous work has attempted to minimize energy without onsidering hannel utilization [4], [5], [6], to minimize delay [2], or to maximize hannel utilization without onsidering the effets of the bandwidth-distane relationship [7], [8], none of this work ahieves optimal hannel utilization sine eah ignores a ritial aspet of the underwater hannel. The main ontribution of this work is an analysis of the effets of the bandwidth-distane relationship, high error rates, and long propagation delays on hannel utilization. We demonstrate the effets of these properties on the use of forward error orretion (FEC) and paket and paket train size adaptation. FEC an be adapted aording to the number of bit errors per blok the ode an orret. This optimal blok ode depends both on the error rate of the hannel and the bit rate available. Optimal paket size depends on the bit error rate of the hannel and the FEC ode used. Paket training an be used to mitigate the effets of long delays on effiieny while extending the amount of time before an error is reported to the sender. By arefully analyzing the relationships between these three tehniques and the effets of the underwater hannel harateristis on their appliation, we demonstrate how to design protools to maximize hannel utilization. The rest of this paper is as follows. Setion II briefly desribes related work in the area of effiient underwater ommuniations. Setion III presents the three adaptation mehanisms onsidered in this paper: forward error orretion, paket size adaptation, and paket train length adaptation. Setion IV presents the model of the underwater hannel used in the paper and disusses how the bandwidth-distane relationship and long propagation delays affet hannel utilization. Setion V presents the results of our simulations. Finally, Setion VI gives some onlusions and future diretions /7/$2. 27 IEEE Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

2 II. RELATED WORK Work in the design of underwater network protools is relatively new. Park et al. develop a MAC layer protool to attempt to deal with the long propagation delays [4]. This protool sends synhronization messages ontaining a transmission time shedule for eah node to attempt to avoid ollisions and unneessary delays. Harris et al. present a protool to allow nodes to use a low-power wakeup mode to onserve energy when idle [5] and an analysis of the effet of the bandwidth-distane relationship on routing deisions based on hop length for energy-effiient routing [6]. However, none of these works onsider hannel utilization. Heidemann et al. [2] provide a protool to attempt to minimize delay in underwater aousti networks. Pompili et al. [7] present a routing protool that attempts to minimize energy and maximize hannel utilization; however, this work does not onsider the effet of the bandwidth-distane relationship and uses fixed paket train sizes. Stojanovi [8] presents a paket train protool to attempt to inrease hannel utilization without an analysis of the use of FEC or the speifi effets of the bandwidth-distane relationship on the paket train sizes. III. MECHANISMS FOR INCREASING CHANNEL UTILIZATION We onsider three interrelated mehanisms for inreasing hannel utilization in this work: FEC, paket size adaptation, and paket train size adaptation. In order to quantify the effets on network performane, a metri must be hosen. In this paper, we onsider hannel utilization, whih is defined as the ratio of the amount of time the hannel is transmitting useful data that is suessfully reeived to the total amount of time the hannel is used (whih inludes the time the sender is either idle waiting for aknowledgments or transmitting data that is not used by this reeiver beause it is either redundant or is reeived in error). We ignore protool overhead for simpliity of notation; however, suh overhead an be trivially inluded and has minimal impat on the results. A. Forward Error Corretion and Paket Size Adaptation FEC is used primarily to avoid the need for retransmission due to bit errors in a paket and to redue the amount of time it takes to reover losses due to suh errors. Without any FEC, if a paket is reeived with bit errors, it is not useful to the reeiver. Therefore, if the data is needed, a retransmission must be performed. The round-trip time (i.e., the time it takes from when a node starts sending data to when it ends reeiving the orresponding aknowledgment) depends on the data rate of the hannel, determined by the bandwidth and the modulation, on the paket length, and on the propagation and proessing delays. If we let d be sum of the two-way propagation delay on the link, the proessing time of the paket at the reeiver, and the transmission time of the aknowledgment, the round-trip time an be omputed as follows: D t'r =d +R(1 where D is the number of bits transmitted before the sender stops and waits for an aknowledgment, and R is the data rate of the link. For high propagation delay links, suh as those present in the underwater environment, the propagation delay is the dominant omponent. Therefore, some redundany in the form of an FEC ode an be added to eah paket at little additional ost. Eah FEC blok ode has the apability to orret a number of transmission errors. In this work, we onsider Reed-Solomon odes [9], whih map an information blok onsisting of k symbols of L bits eah to a odeword of n > k L-bit symbols (where typially n = 2L), and whih an orret up to n-k symbol errors.' If the FEC blok ode is designed to orret more errors than atually our, the extra redundany added to the stream onstitutes a waste and redues the hannel utilization. Therefore, the FEC should ideally be adapted based on the error rate of the hannel. The effet of FEC on hannel utilization is ditated by the amount of redundany added to eah paket. Essentially, for eah kl appliation data bits, there is an additional (n- k)l bits of redundany added. Therefore, the hannel utilization in the absene of errors beomes: kl/r ' nl/r+d (2) If the probability that the FEC annot orret the bit errors in the paket is ep, the hannel utilization is as follows: (1 -ep)kl/r 8' nl/r+d (3) Note that ep depends not only on the bit error rate, but also on n, k and L, whih define the paket size and number of errors that an be orreted. The expressions in Equations (2) and (3) inorporate two mehanisms, namely, FEC and paket size adaptation. While it is ertainly possible to use eah of these tehniques independently, their tight relationship makes it appropriate to treat them together. Paket size adaptation has two primary effets. First, larger paket sizes send more data between aknowledgments, therefore reduing the fration of time that the hannel is unused. For an aknowledgment based protool on a half duplex link, suh as links in the underwater environment, if eah paket is independently aknowledged, i.e., there is no use of paket trains as desribed in the next subsetion, the hannel utilization is affeted by inreasing or dereasing n in Equation (2) with n = k. The hannel utilization inreases as n inreases, assuming no errors on the hannel. In the fae of errors, simply inreasing the paket size may not in fat inrease the hannel utilization. Consider Equation (3) with n = k, i.e., no error orretion apability. Inreasing n will lead to a orresponding inrease in ep (reall that ep depends on the bit error rate and the paket size). Any paket ontaining an error will onstitute wasted transmission time. Therefore, the inrease in paket error rate will potentially offset the gains in hannel utilization by 'For shortened odes, n < 2L, but the orretion apability is still (nk) /2 symbols. Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

3 inreasing the paket size. Therefore, the optimal paket size depends both on the round trip time and on the bit error rate of the link. Combining FEC with a larger paket size an potentially be used to inrease the hannel utilization beyond that if no FEC is used. B. Paket Train Length Adaptation Paket trains an be used to inrease hannel effiieny without inreasing the probability of paket error. The tehnique involves sending a number of individual pakets bak to bak before waiting for an aknowledgment. Seletive or umulative aknowledgments an then be used for eah of the paket trains. We hoose to use seletive aknowledgments sine they allow gap orretion [1], leading to better hannel utilization. The hannel effiieny when using paket trains, with the probability of paket error ep and paket train length T, is as follows: (1 -ep)tkl/r I' TnL/R+d (4) Equation (4) shows that inreases in T provide inreased hannel utilization. The ost of using longer paket trains is that the time it takes for the sender to learn about losses inreases with the length of the paket train as follows: tr dn+ (5) R Therefore, the main drawbak of using large paket trains is to delay the possible retransmissions. How muh this ost matters depends greatly on the appliation. A soft real-time appliation may have timing dependenies that require the use of short paket trains, whereas bulk data appliations, suh as FTP, may be able to tolerate far longer delays. C. Combined Effets on Channel Utilization The ombination of all three tehniques allows a large adaptation spae that an be used to inrease the hannel utilization depending on the link harateristis. Assuming a fixed data rate R, fixed propagation delay, and a fixed bit error rate, the effets of eah of the three adaptation mehanisms an be expliated. From Equation (4) it an be seen that inreasing the amount of data sent per paket, k, an inrease the hannel utilization; however, with an inrease in paket size also omes an inrease in paket error rate, ep, whih also depends on the relationship between n and k for the FEC blok ode used. Inreasing the amount of redundany per paket for the FEC, n -k, redues the hannel utilization in the fae of no paket errors, but an lead to the ability to use larger paket sizes (allowing an inrease in k) that might outweigh the redution in utilization due to the redundany added. Finally, inreasing the paket train length, T, dereases the amount of time spent waiting for aknowledgments and so inreases the hannel utilization, with a ost of inreased time before notifiation of a loss reahes the sender. The next setion haraterizes the effets of the underwater hannel on the data rate and the propagation delay. IV. DATA RATE AND PROPAGATION DELAY IN UNDERWATER CHANNELS Underwater aousti hannels differ from their terrestrial radio ounterparts in a number of different ways. In this work we fous on the long propagation delays and the relationship between the distane between two nodes and the bandwidth available for use on the link to highlight how underwater hannel harateristis affet hannel utilization. A. Propagation Delay Underwater aousti signals propagate at speeds depending on their depth in the water. This may lead to large differenes in propagation speed even for equal distanes, depending on the angle with respet to the z-axis of the transmission. The underwater propagation speed in m/s has been modeled aurately by Urik [11] as follows: = t t2 +.23t3 +( t +.9t2)(S - 35) +16.3z +.18z2 where t is one tenth of the temperature of the water in degrees Celsius, z is the depth in meters, and S is the salinity of the water. The main fator that alters the speed of sound in water as depth hanges is the temperature of the water. For oeans, this interval is between 2 C and 22 C. However, hanges our at different rates in three different regions, the region above the thermoline, the thermoline itself, and the region below the thermoline [12]. The salinity for oeans is in the interval [32, 37] parts per thousand (ppt) with an average of 35 ppt [13]. Changes in the propagation delay affet d in Equation (3), with inreasing delays reduing hannel utilization. One important thing to note is that, unlike in terrestrial radio links, distane alone is not suffiient for determining delay times. It is possible in underwater links for a shorter link to have a longer delay. B. Bandwidth-Distane Relationship In underwater aousti environments, the bandwidth available to a link depends on the distane between the sender and the reeiver: as the distane dereases, the available bandwidth spetrum inreases, allowing for a greater link apaity. For typial terrestrial radio environments, shorter transmission distanes lead to either the ability to use lower power (due to less signal attenuation), or the ability to use higher bit rates (due to a higher signal-to-noise ratio), but the bandwidth available remains onstant. The frequeny omponent of the hannel is defined by the attenuation fator and the noise fator for the link. The SNR at a reeiver distane f from the transmitter an be modeled as follows [3]: (6) SNR(f, f) = N/A(f Af' (7) Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

4 where f is the frequeny, P is the transmitted power, and Af is the noise bandwidth at the reeiver. The AN produt, AN, determines the frequeny-dependent part of the SNR. For eah distane, there exists an optimal frequeny for whih the narrow-band SNR is maximum. Then, using this as the enter frequeny and following some definition of bandwidth (e.g., 3 db bandwidth), the maximum available bandwidth an be inferred. The attenuation fator A depends on the absorption loss on the underwater link. Thorp's formula is used to express the absorption oeffiient a(f) as follows [14]: 1 log a(f) =.11 f2 1+f ±f f2 +.3, where a(f) is given in db/km and f is in khz. The absorption oeffiient is the major fator that limits the maximum usable bandwidth at a given distane as it inreases very rapidly with frequeny. Using this absorption oeffiient, Urik models A in terms of the spreading loss and the spreading oeffiient k for a distane f and a frequeny f as follows [11]: 1log A = k 1log f + f 1loga(f), (9) where the first term is the spreading loss and the seond term is the absorption loss. The spreading oeffiient defines the geometry of the propagation (i.e., k = 1 is ylindrial, k = 2 is spherial, and k = 1.5 is pratial spreading [11]). The ambient noise in underwater environments is affeted by four omponents: turbulene (Nt), shipping (N5), waves (Nm), and thermal noise (Nth). The following formulae give the power spetral density of the four noise omponents in db re pupa per Hz as a funtion of frequeny in khz [15]: 1logNt(f) lologns(f) 1logNw(f) 17-3logf 4 + 2(s -.5) + 26 log f -6 log(f +.3) w1/2 + 2 log f -4 log(f +.4) 1 log Nth(f) = Ologf, and the overall noise power spetral density for a given frequeny f is as follows: P (8) N = Nt(f) +Ns(f) +Nw(f) +Nth(f) (11) The bandwidth, whih depends strongly on distane in underwater aousti links, affets the available data rate for the link, R in Equation (3). This has a major impat: inreased R dereases the transmission times for both the useful data reeived suessfully and for all data reeived in error and any redundany sent. Consider an example. As has been disussed, paket train length inreases an mitigate the effets of propagation delay on hannel utilization by inreasing the number of pakets transmitted bak to bak before waiting for an aknowledgment. Assume that there is some goal hannel utilization to be ahieved, and further assume that the bandwidth does not hange with distane between nodes on the link. Then, as.n S-r Distane (m) Fig. 1. Channel utilization: error rate, FEC level, paket size 48 bytes the distane between the sender and reeiver is dereased, the propagation delay dereases aording to Equation (6). This orresponds to a derease in d in Equation (3) and an inrease in hannel utilization. Now, if the hannel utilization was already at the target value, the paket train size, T, ould be dereased. This may be desirable to derease the amount of time before the sender is made aware of a loss. However, for the underwater aousti links, dereasing the distane also inreases the bandwidth. This inrease orresponds to an inrease in R in Equation (3), whih dereases the hannel utilization. When the distane between the sender and reeiver shrinks, T an be dereased while still maintaining the same hannel utilization. However, beause the bandwidth inreases, the amount that T an be dereased is less than if the bandwidth were to remain onstant. V. NUMERICAL RESULTS To demonstrate the effets of the bandwidth-distane relationship, the high bit error rates, and the long propagation delays on the use of FEC, paket size adaptation, and paket train length, we produed the models desribed in the previous setions in C++. We ran a large number of experiments varying the distane between sender and reeiver from 1 m to 2 km and the bit error rate between 1-3 to 1-9. Variations in the parameters of the various adaptations were made as follows. The paket size was varied from 48 bytes to 128 bytes. The FEC error orreting level ((n -k)/2) was varied from to 2. Finally, the paket train length was varied from 1 to 1. In this paper, due to spae onstraints, we present a selet number of results the demonstrate the trends, baking up the design intuitions in the rest of the paper. To study the effets of paket train adaptation in isolation we present results from runs where the probability of bit error was zero and the paket size was 48 bytes. Additionally, no FEC was used (setting k _ n). The delay before the sender was notified of a loss grew from.3 s at 1 m to 2.73 s at 2 km for a train size of one. For a train size of 1, these delays grew to.17 s and 3.6 s respetively. Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

5 1 1 FEC level.8 F.8 FEC level.6 F.6.4 F.4.2 F.2 In In In IMA No M Fig. 2. Channel utilization: error rate 1-4, distane 1 m Fig. 4. Channel utilization: error rate 1-4, distane 5 m.9.8 FEC level, 1.8 FEC level Fig. 3. Channel utilization: error rate 5 x 1-4, distane 1 m Fig. 5. Channel utilization: error rate 5 x 1-4, distane 5 m Figure 1 depits the hannel utilization as the distane between sender and reeiver is inreased along the z-axis (the reeiver goes deeper into the water). The lines loser to the top of the graph (representing higher hannel utilization) orrespond to inreasingly longer paket trains. Longer paket trains have signifiant effets for distanes between 1 m and 6 m. At the edges of these bounds they tend to onverge, beause the delay is either short enough to not require the use of paket trains, or long enough to negate the effet of a train size hange of only 1. Experiments run with longer paket trains at the larger distanes ahieved better hannel utilization, but at a muh higher ost in terms of the time before the sender was notified of a loss. As expeted, as distanes get shorter, the size of paket train needed to maintain a fixed hannel utilization did not shrink rapidly due to the inrease in bandwidth. We ran experiments where the bandwidth was held onstant and found the optimal train length. We then used this train length in experiments where the bandwidth did inrease with dereasing distane, as is the ase in underwater hannels. The resulting hannel utilizations were as muh as 16% lower than the optimal hoie when the hanging bandwidth was not taken into aount. Figures 2 and 3 depit the hannel utilization for various paket sizes and FEC levels with error probabilities of 1-4 and 5 x 1-4 respetively and paket train lengths of 1. The distane between the sender and the reeiver is 1 m along the z-axis. Two things to notie are that first, the longest paket size is not the optimal hoie in either ase. This is beause the inrease in the amount of data sent per paket does not outweigh the orresponding inrease in paket error, ep, even when FEC is used. Seond, while in these results, adding the overhead for FEC apable of orreting 2 errors outweighs the ost of transmitting the extra redundany, in other experiments, that extra redundany did not always equal higher hannel utilization. Figures 4 and 5 depit the hannel utilization for the same parameters as in Figures 2 and 3, but with the distane between sender and reeiver inreased to 5 m. The hannel utilization is severely dereased due to the long propagation delays. Additionally, the bandwidth has dereased. These two effets hange the optimal paket length from the shorter distane ases. Again, we performed experiments without hanging the bandwidth as distane dereased, found the optimal parameters for all three mehanisms, and the used those parameters while taking into aount the bandwidth-distane relationship and found the performane to be suboptimal. Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

6 .8 F.6 F.4 F.2 F FEC level Fig. 6. Channel utilization: error rate 1-4, distane 5 m, paket train 1._N S-r F.6 r.4 F.2 F FEC level No Fig. 7. Channel utilization: error rate 5 x 1-4, distane 5 m, paket train 1 Finally, Figures 6 and 7 depit the hannel utilization for the same parameters as in Figures 4 and 5, this time with a paket train length of 1. This inrease in train length has a onsiderable effet on hannel utilization but auses no hange in the optimal paket length or FEC strength beause hanges in paket train length do not affet either the loss probability, bandwidth, or delay of the hannel. VI. CONCLUSION This paper has presented an analysis of the effets of three tehniques, namely, forward error orretion, paket size adaptation, and paket train length adaptation, in underwater aousti networks. This analysis and the simulation results that followed demonstrated how the ombination of all three tehniques an be used to mitigate the high error rate, long delay, and bandwidth-distane relationship of underwater hannels to inrease hannel utilization. Paket train length adaptation an be used to mitigate the effets of long delays without inreasing the paket error probability. However, this mitigation omes at the ost of an inrease in the amount of time that passes before the sender an be notified of a loss. Forward error orretion and paket size adaptation an be used to mitigate both the propagation delay and high bit error rates. Our study demonstrated that the optimal hoie of parameters for all three tehniques depends on the distane between the sender and the reeiver, whih affets both the bandwidth available and the propagation delay for the underwater links. Future diretions for this work are to use these insights to design MAC and routing protools to maximize hannel utilization. Suh protools should also onsider energy onsumption and end-to-end delay to provide omprehensive support for a large number of appliations. REFERENCES [1] I. Akyildiz, D. Pompili, and T. Melodia, "Underwater aousti sensor networks: Researh hallenges," Elsevier's Ad Ho Networks, vol. 3, no. 3, 25. [2] J. Heidemann, W. Ye, J. Willis, A. Syed, and Y Li, "Researh hallenges and appliations for underwater sensor networking," in Proeedings of the IEEE Wireless Communiations and Networkin Congerene, 26. [3] M. Stojanovi, "On the relationship between apaity and distane in an underwater aousti ommuniation hannel," in ACM International Workshop on UnderWater Networks (WUWNet), 26. [4] V. Rodoplu and M. Park, "An energy-effiient MAC protool for underwater wireless aousti networks," in MTS/IEEE OCEANS, 25. [5] A. F. Harris, M. Stojanovi, and M. Zorzi, "Why underwater aousti nodes should sleep with one eye open: Idle-time power management in underwater sensor networks," in ACM International Workshop on UnderWater Networks (WUWNet), 26. [6] A. F. Harris and M. Zorzi, "Energy-effiient routing protol design onsiderations for underwater networks," in IEEE Conferene on Sensor; Mesh and Ad Ho Communiations and Networks (SECON), 27. [7] D. Pompili, T. Melodia, and I. Akyildiz, "Routing algorithms for delay-insensitive and delay-sensitive appliations in underwater sensor networks," in Pro. ofacm Mobiom, 26. [8] M. Stojanovi, "Optimization of a data link protool for underater aousti networks," in MTS/IEEE OCEANS, 25. [9] B. Sklar, Digital Communiations: Fundamentals and Appliations, 2nd ed. Prentie Hall PTR, 21. [1] IEEE Computer Soiety, "RFC 3517: A Conservative Seletive Aknowledgment (SACK)-based Loss Reovery Algorithm for TCP," June [11] R. Urik, Priniples of Underwater Sound. MGraw-Hill, [12] The National Center for Atmospheri Researh, "Temperature of Oean Water," [13] Offie of Navel Researh, "Oean Water: Salinity," [14] L. Berkhovskikh and Y. Lysanov, Fundamentals of Oean Aoustis. Springer, [15] R. Coates, Underwater Aousti Systems. Wiley, Authorized liensed use limited to: ELETTRONICA E INFORMATICA PADOVA. Downloaded on Otober 17, 28 at 7:59 from IEEE Xplore. Restritions apply.

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Cluster-based Cooperative Communication with Network Coding in Wireless Networks

Cluster-based Cooperative Communication with Network Coding in Wireless Networks Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

We don t need no generation - a practical approach to sliding window RLNC

We don t need no generation - a practical approach to sliding window RLNC We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

Improved flooding of broadcast messages using extended multipoint relaying

Improved flooding of broadcast messages using extended multipoint relaying Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal

More information

Robust Dynamic Provable Data Possession

Robust Dynamic Provable Data Possession Robust Dynami Provable Data Possession Bo Chen Reza Curtmola Department of Computer Siene New Jersey Institute of Tehnology Newark, USA Email: b47@njit.edu, rix@njit.edu Abstrat Remote Data Cheking (RDC)

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,

More information

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb

More information

New Channel Allocation Techniques for Power Efficient WiFi Networks

New Channel Allocation Techniques for Power Efficient WiFi Networks ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre

More information

with respect to the normal in each medium, respectively. The question is: How are θ

with respect to the normal in each medium, respectively. The question is: How are θ Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

Dynamic Backlight Adaptation for Low Power Handheld Devices 1

Dynamic Backlight Adaptation for Low Power Handheld Devices 1 Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Design of High Speed Mac Unit

Design of High Speed Mac Unit Design of High Speed Ma Unit 1 Harish Babu N, 2 Rajeev Pankaj N 1 PG Student, 2 Assistant professor Shools of Eletronis Engineering, VIT University, Vellore -632014, TamilNadu, India. 1 harishharsha72@gmail.om,

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

A Comparison of Hard-state and Soft-state Signaling Protocols

A Comparison of Hard-state and Soft-state Signaling Protocols University of Massahusetts Amherst SholarWorks@UMass Amherst Computer Siene Department Faulty Publiation Series Computer Siene 2003 A Comparison of Hard-state and Soft-state Signaling Protools Ping Ji

More information

Path Diversity for Overlay Multicast Streaming

Path Diversity for Overlay Multicast Streaming Path Diversity for Overlay Multiast Streaming Matulya Bansal and Avideh Zakhor Department of Eletrial Engineering and Computer Siene University of California, Berkeley Berkeley, CA 9472 {matulya, avz}@ees.berkeley.edu

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Divide-and-conquer algorithms 1

Divide-and-conquer algorithms 1 * 1 Multipliation Divide-and-onquer algorithms 1 The mathematiian Gauss one notied that although the produt of two omplex numbers seems to! involve four real-number multipliations it an in fat be done

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

An Experimental Study of Fractional Cooperation in Wireless Mesh Networks

An Experimental Study of Fractional Cooperation in Wireless Mesh Networks An Experimental tudy of Frational Cooperation in Wireless Mesh Networks Anthony Cale, Nariman Farsad, and Andrew W. Ekford Dept. of Computer iene and Engineering, York University 47 Keele treet, Toronto,

More information

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur

More information

Detection of RF interference to GPS using day-to-day C/No differences

Detection of RF interference to GPS using day-to-day C/No differences 1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster

More information

Facility Location: Distributed Approximation

Facility Location: Distributed Approximation Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

Tackling IPv6 Address Scalability from the Root

Tackling IPv6 Address Scalability from the Root Takling IPv6 Address Salability from the Root Mei Wang Ashish Goel Balaji Prabhakar Stanford University {wmei, ashishg, balaji}@stanford.edu ABSTRACT Internet address alloation shemes have a huge impat

More information

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs)

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs) 48 J. ICT Res. Appl., Vol. 9, No., 5, 48-6 SINR-based Network Seletion for Optimization in Heterogeneous Wireless Networks (HWNs) Abubakar M. Miyim, Mahamod Ismail & Rosdiadee Nordin Department of Eletrial,

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,

More information

Introduction to Seismology Spring 2008

Introduction to Seismology Spring 2008 MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

The AMDREL Project in Retrospective

The AMDREL Project in Retrospective The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints 5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Latency Choose Two

Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Latency Choose Two Anonymity Trilemma: Strong Anonymity, Low Bandwidth, Low Lateny Choose Two Debajyoti Das Purdue University, USA das48@purdue.edu Sebastian Meiser University College London, U s.meiser@ul.a.uk Esfandiar

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

IN structured P2P overlay networks, each node and file key

IN structured P2P overlay networks, each node and file key 242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 Elasti Routing Table with Provable Performane for Congestion Control in DHT Networks Haiying Shen, Member, IEEE,

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming User-level Fairness Delivered: Network Resoure Alloation for Adaptive Video Streaming Mu Mu, Steven Simpson, Arsham Farshad, Qiang Ni, Niholas Rae Shool of Computing and Communiations, Lanaster University

More information

Interconnect Delay Minimization through Interlayer Via Placement in 3-D ICs

Interconnect Delay Minimization through Interlayer Via Placement in 3-D ICs Interonnet Delay Minimization through Interlayer Via Plaement in -D ICs Vasilis F. Pavlidis, Eby G. Friedman Department of Eletrial and Computer Engineering University of Rohester Rohester, New York 467,

More information

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

A Dictionary based Efficient Text Compression Technique using Replacement Strategy A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India

More information

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European

More information

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams IEEE International Conferene on Multimedia Computing & Systems, June 17-23, 1996, in Hiroshima, Japan, p 372-381 Intra- and Inter-Stream Synhronisation for Stored Multimedia Streams Ernst Biersak, Werner

More information

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,

More information

DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary *

DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary * DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Eunheol Kim, Gwan Choi, Mark Yeary * Dept. of Eletrial Engineering, Texas A&M University, College Station, TX-77840

More information

Adapting K-Medians to Generate Normalized Cluster Centers

Adapting K-Medians to Generate Normalized Cluster Centers Adapting -Medians to Generate Normalized Cluster Centers Benamin J. Anderson, Deborah S. Gross, David R. Musiant Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg Carleton College andersbe@gmail.om, {dgross,

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Alleviating DFT cost using testability driven HLS

Alleviating DFT cost using testability driven HLS Alleviating DFT ost using testability driven HLS M.L.Flottes, R.Pires, B.Rouzeyre Laboratoire d Informatique, de Robotique et de Miroéletronique de Montpellier, U.M. CNRS 5506 6 rue Ada, 34392 Montpellier

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Episode 12: TCP/IP & UbiComp

Episode 12: TCP/IP & UbiComp Episode 12: TCP/IP & UbiComp Hannes Frey and Peter Sturm University of Trier Outline Introdution Mobile IP TCP and Mobility Conlusion Referenes [1] James D. Solomon, Mobile IP: The Unplugged, Prentie Hall,

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

Parallelization and Performance of 3D Ultrasound Imaging Beamforming Algorithms on Modern Clusters

Parallelization and Performance of 3D Ultrasound Imaging Beamforming Algorithms on Modern Clusters Parallelization and Performane of 3D Ultrasound Imaging Beamforming Algorithms on Modern Clusters F. Zhang, A. Bilas, A. Dhanantwari, K.N. Plataniotis, R. Abiprojo, and S. Stergiopoulos Dept. of Eletrial

More information

Performance Benchmarks for an Interactive Video-on-Demand System

Performance Benchmarks for an Interactive Video-on-Demand System Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department

More information

A Unified Subdivision Scheme for Polygonal Modeling

A Unified Subdivision Scheme for Polygonal Modeling EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

A radiometric analysis of projected sinusoidal illumination for opaque surfaces

A radiometric analysis of projected sinusoidal illumination for opaque surfaces University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination

More information

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC Priya N. Werahera and Anura P. Jayasumana Department of Eletrial Engineering Colorado State University

More information

Backpressure with Adaptive Redundancy (BWAR)

Backpressure with Adaptive Redundancy (BWAR) Bakpressure with Adaptive Redundany (BWAR) Majed Alresaini alresain AT us. edu Maheswaran Sathiamoorthy msathiam AT us. edu Bhaskar Krishnamahari bkrishna AT us. edu Mihael J. Neely mjneely AT us. edu

More information