All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA
|
|
- Edith Horton
- 5 years ago
- Views:
Transcription
1 Preprint, August 5, All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA Mikhail Ivanov, Frerik Brännström, Alexanre Graell i Amat, an Petar Popovski Department of Signals an Systems, Chalmers University of Technology, Gothenburg, Sween Department of Electronic Systems, Aalborg University, Aalborg, Denmark {mikhail.ivanov, frerik.brannstrom, alexanre.graell}@chalmers.se, petarp@es.aau.k arxiv: v2 [cs.it] 26 Jan 2015 Abstract We propose an uncoorinate all-to-all broacast protocol for perioic messages in vehicular networks base on coe slotte ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter an receiver in a half-uplex moe. As in CSA, each user transmits its packet several times. The halfuplex moe gives rise to an interesting esign trae-off: the more the user repeats its packet, the higher the probability that this packet is ecoe by other users, but the lower the probability for this user to ecoe packets from others. We compare the propose protocol with carrier sense multiple access with collision avoiance, currently aopte as a multiple access protocol for vehicular networks. The results show that the propose protocol greatly increases the number of users in the network that reliably communicate with each other. We also provie analytical tools to preict the performance of the propose protocol. I. INTRODUCTION Reliable vehicular communications (VCs) is presently one of the most challenging problems of communication engineering. Its eployment will enable numerous applications, such as intelligent transportation systems an autonomous riving, as well as improve traffic safety. VCs entails a number of challenges, such as high mobility networks with rapily changing topologies an a large number of users, poor channel quality, an strict reliability an elay requirements. These challenges require new ieas an esign at the physical layer (PHY) an the meium access control (MAC) layer. The current status of VCs is summarize in the stanar [1] an is usually referre to as p. The PHY an the MAC layer in p are base on the Wi-Fi protocol that works well for low mobility networks. In the context of VCs, the PHY is mainly criticize for not being able to cope with time-varying channels [2] p uses carrier sense multiple access with collision avoiance (CSMA-CA) as the MAC protocol. It oes not require any coorination an is shown to work well for networks with a small number of users, large amounts of information to be transmitte at each user, an no elay constraints. Uner these conitions, CSMA- CA can provie large throughputs [3]. In vehicular a hoc networks (VANETs), however, the number of users is large, the amount of information to be transmitte is rather small, This research was supporte by the Sweish Research Council, Sween, uner Grant No , in part by the Ericsson s Research Founation, Sween, uner Grant No , in part by Chalmers Antenna Systems Excellence Center in the project Antenna Systems for V2X Communication, an in part by the Danish Council for Inepenent Research within the Sapere Aue Research Leaer program, Grant No an there are har ealines for accessing the channel. In such scenarios, CSMA-CA fails to provie a reliable channel access. Furthermore, the high user mobility prohibits the use of acknowlegements in VANETs, an thereby methos for mitigating the hien terminal problem. The other uncoorinate MAC protocols use for VCs can be roughly ivie into two classes: i) the ones base on CSMA-CA, that try to improve its performance by ajusting the loa by means of power control [4] or transmission rate control [5]. However, they retain the rawbacks of the original CSMA-CA. ii) The secon class inclues selforganizing protocols preominantly base on time ivision multiple access (TDMA), which are avantageous for overloae networks [6], but cannot guarantee high reliability. These self-organizing algorithms require a learning phase, which increases the channel access elay; moreover, transmission errors uring this phase rener such protocols unusable. Recently, a novel uncoorinate MAC protocol, calle coe slotte ALOHA (CSA), has been propose for a unicast scenario [7], [8]. It uses the iea of the original slotte ALOHA [9] together with successive interference cancellation (SIC). The contening users introuce reunancy by encoing their messages into multiple packets, which are transmitte to a base station (BS) in ranomly chosen slots. The BS buffers the receive signal, ecoes the packets from the slots with no collision an attempts to reconstruct the packets in collision exploiting the introuce reunancy. The main ifference between CSMA-CA an CSA it that the former tries to avoi collisions, whereas the latter tries to exploit them. In this paper, we propose a novel MAC protocol for allto-all broacast in VANETs base on CSA, calle all-toall broacast CSA (B-CSA). We consier a scenario where users in the network perioically broacast messages to the neighboring users. Each user is equippe with a half-uplex transceiver, so that a user cannot receive packets in the slots it uses for transmission 1, which is the main ifference of the propose protocol with respect to the classical unicast CSA. This is moele as a packet erasure channel an it affects the esign an the performance analysis of CSA. Using the analytical tools from [10], we analyze the packet loss rate (PLR) performance of the propose B-CSA. Analytical results show goo agreement with simulation results for low to 1 If full-uplex communication is possible, the analysis of the all-to-all broacast scenario is ientical to that of the unicast scenario.
2 Preprint, August 5, TABLE I: The PHY parameters. The values in the upper part are taken from [1]; the values in the lower part are erive. Parameter Variable Value Units Data rate r ata 6 Mbps PHY preamble t pream 40 µs CSMA slot uration t csma 13 µs AIFS time t aifs 58 µs Frame uration t frame 100 ms Guar interval t guar 5 µs Packet size pack byte Packet uration t pack µs Slot uration t slot µs Number of slots n meium channel loas. The results are further use to optimize the parameters of B-CSA. Finally, we show that B-CSA greatly outperforms CSMA-CA for meium to high channel loas. II. SYSTEM MODEL There are two types of packets in VCs, namely ecentralize environmental notification messages (DENMs) an cooperative awareness messages (CAMs). DENM packets are sent if requeste by a higher-layer application, e.g., in case of an emergency. On the other han, CAM packets are sent perioically every t frame secons. In this paper, we consier transmission of CAM packets. We assume that all packets have uration t pack, which epens on the packet size pack (in bytes), transmission rate r ata, an uration of the preamble ae to every packet t pream, i.e., t pack = t pream + pack /r ata. The parameters in this paper are taken from the PHY in [1] an are given in Table I. We consier a VANET where users are arbitrarily istribute on a 2-imensional plane as shown in Fig. 1. Every user has a circular transmission range, e.g., the circle in Fig. 1 shows the transmission range of user A. All users within this transmission range receive packets sent by user A. The transmission range may vary across users, hence, the set of users from which user A receives packets, enote by U, may be ifferent from the set of users within user A s transmission range. Without loss of generality, we assume that U consists of m 1 users. The users in U are calle the neighbors of user A. As an example, the neighbors of user A are marke with gray in Fig. 1. We assume that U remains unchange uring t frame. In this paper, we focus on the performance of a single user (user A in Fig. 1), also referre to as the receiver. From the network perspective, the performance of B-CSA epens only on the users in U. The rest of the users are ignore as user A cannot receive packets from them. A. All-to-all Broacast Coe Slotte ALOHA We assume that time is ivie into frames of uration t frame. Every user transmits one packet uring each frame. Frames are ivie into n = t frame /t slot slots each, where t slot = t pack +t guar an t guar is a guar interval that accounts for the propagation elay an timing inaccuracy. We assume that users are both frame an slot synchronize. This can be A Fig. 1: Network moel. Rectangles represent users. The circle shows the transmission range of user A. The users marke with gray are neighbors of user A. users A m n slots Fig. 2: Users transmissions in B-CSA system within one frame. Rectangles represent transmitte packets. Gray lines inicate the time slots in which user A cannot receive. achieve by means of, e.g., Global Positioning System (GPS), which provies an absolute time reference for all users. The transmission phase of the propose protocol is ientical to that of classical CSA [7], an is briefly escribe in the following. Every user maps its message to a PHY packet an then repeats it l times (l is a ranom number chosen base on a preefine istribution) in ranomly an uniformly chosen slots within one frame, as shown in Fig. 2. Such a user is calle a egree-l user. Every packet contains pointers to its copies, so that, once a packet is successfully ecoe, full information about the location of the copies is available. It is possible to analyze B-CSA uner iealize assumptions on the PHY presente in the following without specifying it explicitly 2. Unlike classical CSA, where a BS is the intene recipient of the messages, every user in B-CSA acts as a BS, i.e., a user buffers the receive signal whenever it is not transmitting. The receive signal buffere by user A in slot i is y i = j U i h i,j a j, (1) where a j is a packet of the jth user in U, h i,j is the channel coefficient, an U i U is the set of user A s neighbors that transmit in the ith slot. The ith slot is calle a singleton slot if it contains only one packet. If it contains more packets, we say that a collision occurs in the ith slot. First, user A ecoes the packets in singleton slots an obtains the location of their copies. Using ata-aie methos, the channel coefficients corresponing to the copies are then estimate. After subtracting the interference cause by the ientifie copies, ecoing procees until no further singleton slots are foun. 2 We use the PHY from [1] mainly to capture timing parameters of the system.
3 Preprint, August 5, The performance of the system greatly epens on the istribution that users use to choose the egree l. The istribution is expresse in the form of a polynomial, q λ(x) = λ l x l, (2) l=0 where λ l is the probability of choosing egree l an q is the maximum egree. The performance parameters are efine as follows. The channel loa g = m/n shows how busy the meium aroun user A is. The average number of users that are not successfully ecoe by user A, terme unresolve users, is enote by w. As reliability is one of the most important requirements in VCs, we focus on the average PLR, p = w/(m 1), which is the probability of a user to be unresolve, i.e., the probability that its message is not successfully ecoe by user A. III. PERFORMANCE ANALYSIS The typical performance of CSA exhibits a threshol behavior, i.e., all users are successfully resolve if the channel loa is below a certain threshol value whenn. The threshol epens only on the egree istribution an is usually obtaine via ensity evolution [7]. In VANETs, however, n is rather small (see Table I), which causes an error floor in the PLR performance. For transmission over a packet erasure channel, it was shown in [10] that the error floor can be accurately preicte base on an inuce istribution observe by the receiver. As mentione earlier, in B-CSA, a user cannot receive in the slots it uses for transmission. This can be moele by means of a packet erasure channel. Therefore, the performance of B-CSA can be analyze using the framework in [10]. In this section, we briefly outline the analysis presente in [10] an aapt it to account for the broacast scenario. A. Inuce Distribution Assuming that user A chooses egree k, a egree-l user is perceive by user A as a egree- user if the egree-l user transmits in l slots that user A uses for its transmission. From user A s point of view, these l slots can be consiere erase, which occurs with probability ( )( n k k ( l ) / n l). Given the constraint 0 l k, the istribution perceive by user A, which we call the k-inuce istribution, λ (k) (x), can be written similarly to (2), where min{q,k+} λ (k) = l= ( n k )( k ) l ( n l) λ l (3) is the fraction of users of egree as observe by user A if it chooses egree k. It is easy to show that for any finite k, λ (k) l = λ l k,l when n, i.e., λ (k) (x) = λ(x) if the number of slots is large enough an q is finite. In this case, ensity evolution can be use to preict the performance of B-CSA in the waterfall region base on the original egree istributionλ(x). However, when the number of slots is small, the ifference between the original an the inuce istributions is significant, especially if k is large. This also suggests that epening on the chosen egree, user A has ifferent ecoing capabilities. On the other han, as shown in [10], users of ifferent egrees have ifferent protection, namely the higher the egree, the better the protection. We call this property ouble unequal error protection (DUEP). The rationale behin this property is that the chance of a user to be resolve by other users increases if the user transmits more, but at the same time the chance to resolve other users ecreases. B. Stopping Sets In this paper, we focus on the receiving aspect of DUEP, i.e., we characterize ifferent ecoing capabilities. The average PLR for a egree-k receiver can be efine as p (k) = 1 m 1 q =0 w (k), (4) where w (k) is the average number of unresolve inuce egree- users as observe by a egree-k receiver. For = 0, w (k) 0 = (m 1)λ (k) 0. For other egrees, we show how w(k) can be approximate in the following. Since user A chooses its egree at ranom accoring to λ(x), the average PLR p can then be foun by averaging (4) over the original egree istribution, i.e., q p = λ k p (k). (5) k=0 The only error source in the consiere moel is the socalle stopping sets. A stopping set is a set of users that cannot be resolve ue to an unfortunate choice of slots for transmission. For instance, if two egree-2 users transmit in the same two slots they cannot be resolve by any other user. We enote a stopping set by S an escribe it by a vector v(s) = [v 0 (S),v 1 (S),...,v q (S)], where v (S) is the number of egree- users in the stopping set S an v 0 (S) = 0. For the example above, v(s) = [0,0,2,0,...,0]. The probabilities of stopping sets can be accurately preicte using the inuce istribution in (3) an the inuce frame length n (k) = n k as follows. We enote the probability of a stopping set S to occur by ρ (k) (S). It can be approximate as [10] ρ (k) (S) α (k) (S)β (k) (S), (6) where β (k) (S) is the probability of the stopping set S to occur calculate uner the assumption that U consists of v (S) users of egree, = 1,...,q. There are, however, more users in U an this is accounte for by the coefficient α (k) (S), efine as the number of combinations to choose v (S) users out of all egree- users in U for = 1,...,q. α (k) (S) is [10] ( ( ) q m 1 α (k) (S) = v(s) 1! v(s) 1 =0 λ (k) ) v (S) v (S)!. (7) β (k) (S) is not known in general an nees to be foun for each stopping set iniviually base on λ (k) (x) an n (k).
4 Preprint, August 5, PLR k = 8 average k = g [user/slot] Fig. 3: PLR performance of B-CSA for λ(x) = 0.86x x 8 an n = 172. The soli lines show simulation results an the ashe lines show analytical approximations (4) an (5). Let A be the set of all possible stopping sets. Using a union boun argument, w (k) can be upperboune as w (k) v (S)ρ (k) (S) (S)α S A S Av (k) (S)β (k) (S). (8) Ientifying all stopping sets an calculating the corresponing β (k) (S) in a systematic way is not straightforwar in general. In practice, istributions with large fractions of egree-2 an egree-3 users are most commonly use since they provie a large threshol [7]. By running extensive simulations for such istributions, we etermine in [10] the set A 8 of eight stopping sets with their β (k) (S) given in [10, eq. (14) with n replace by n (k) ] that contribute the most to the error floor. Substituting (8) with the stopping sets in A 8 into (4) gives an approximation of the average PLR for a egree-k receiver. C. Numerical Results We use the analytical error floor approximation (5) to optimize the egree istribution for B-CSA with finite frame length. We constrain the istribution to only have egrees two, three, an eight to reuce the search space. Such istributions have been shown to have goo performance both in terms of error floor an threshol [7]. The istribution is optimize for the channel loa g = 0.5 by performing a gri search. The obtaine istributions are λ(x) = 0.86x x 8 for n = 172 an λ(x) = 0.87x x 8 for n = 315. The analytical error floor preictions in (4) an (5) are shown with ashe lines in Fig. 3 for λ(x) = 0.86x x 8 an n = 172. Simulation results are shown with soli lines. It can be seen from the figure that the higher the egree of the receiver, the worse the performance. The analytical results show goo agreement with the simulation results for low to meium channel loas. In Section IV-A we also show that the accuracy improves when n increases. IV. CARRIER SENSE MULTIPLE ACCESS Comparing B-CSA with CSMA-CA for the network escribe in Section I is not straightforwar for several reasons. First, time is not structure in slots in CSMA-CA an new efinitions of channel loa an PLR are therefore neee. This also hiners moeling users mobility. Secon, the behavior of each user in a CSMA-CA system epens on the behavior of its neighbors, whereas users in B-CSA act inepenently. Thus, to estimate the performance of an iniviual user in a CSMA-CA system, the entire network nees to be moele. Thir, the performance of CSMA-CA for the network in Fig. 1 is affecte by the hien terminal problem since acknowlegements are not use in VANETs. Hence, a proper moeling requires specification of: sensing threshol, path loss, transmitte power, ecoing moel with signal-tointerference-plus-noise, an actual network geometry. Instea, we introuce a simplifie system moel which represents the best-case scenario in terms of the performance of CSMA-CA. It is easy to implement an compare with B-CSA. We consier a network with m users inexe by j = 1,...,m, where every user is within all other users transmission range, i.e., no collision occurs ue to the hien terminal problem. This makes the consiere system moel favorable for CSMA-CA compare to the system moel in Section II. The set of users is enote by V. Time is enote by t. At the beginning of contention (t = 0), every user chooses a real ranom number τ j [0, t frame ), which represents the time when the jth user attempts to transmit its first packet invoking the CSMA-CA proceure from [6, Fig. 2(a)]. The contention winow size c is chosen from the set {2 u 1 : u is an interger}, t aifs is the sensing perio, an t csma is the uration of a backoff slot [6]. The values of these parameters are specifie in [1] (see Table I for the values use in simulations). At time instant τ j +(i 1)t frame, the jth user attempts to transmit its ith packet. If by this time the (i 1)th packet has not been transmitte, the packet is roppe. Each packet is transmitte at most once. The channel loa is efine as the ratio of the number of users m an t frame (expresse in slots) to match the efinition of the channel loa for B-CSA, i.e., g = m/(t frame /t slot ) = m/n. The PLR for user j is efine as { } E τ1,...,τ m i V e i i j p j =, (9) m 1 where e i {0,1,2} is the number of roppe an collie packets of the ith user over the time interval [t 0, t 0 +t frame ) an E x { } stans for the expectation over a ranom variable x. For estimating the performance, we introuce a time offset t 0 in orer to remove the transient in the beginning of contention. As the performance oes not epen on the particular user, without loss of generality, we choose user j at ranom. In Fig. 4, we show the performance of CSMA-CA for ifferent values of the contention winow size. We set t 0 = 2t frame for simulations. Larger values of c reuce the probability of a collision but increase the time require to access the channel: for values of c 2047 (u 11), lost packets are only cause by collisions, whereas for c = 8191 (u = 13), the PLR is
5 Preprint, August 5, u = n = 172 n = 315 PLR 10 2 u = 4 PLR 10 2 CSMA-CA B-CSA 10 3 u = 9 u = g [user/slot] Fig. 4: PLR performance of CSMA-CA for 400 byte packets (n = 172) an ifferent values of c = 2 u 1. preominantly efine by roppe packets. It can be seen from Fig. 4 that the value c = 2047 (u = 11) provies goo performance for the entire range of channel loas. For u = 10 an u = 12 (not shown in the figure), the PLR performance is slightly worse than that of u = 11. We remark that the orer of the curves remains the same for shorter packets. c = 2047 (u = 11) is thus use later on for both packet sizes in Table I when comparing CSMA-CA with B-CSA. A. B-CSA vs CSMA Comparison The PLR performance of the two protocols is shown in Fig. 5 for n = 172 an n = 315. The soli an the ashotte lines show simulation results for B-CSA an CSMA- CA, respectively. The ashe lines show the PLR approximation (5). The first observation is that the performance of CSMA-CA egraes when n increases. This can be explaine by the fact that the sensing overhea grows with respect to the packet length when the packet length ecreases. On the other han, the performance of B-CSA improves when n grows large, asymptotically approaching the threshol (equal to 0.87 for the consiere istributions) performance preicte by ensity evolution. This gives an extra egree of freeom when esigning a B-CSA system, as increasing the banwith will ecrease the packet uration an, hence, increase the number of slots. We also remark that the accuracy of the analytical PLR approximation in (5) improves when n increases. It can be seen from Fig. 5 that B-CSA significantly outperforms CSMA-CA for meium to high channel loas. For example, B-CSA achieves a PLR of 10 3 at channel loas g = 0.68 an g = 0.73 forn = 172 an n = 315, respectively. CSMA-CA achieves the same reliability at g = 0.4 an g = 0.35 for n = 172 an n = 315, respectively, i.e., B-CSA can support approximately twice as many users as CSMA-CA for this reliability. For heavily loae networks (g > 0.74), CSMA-CA shows better performance. However, in this case both protocols provie a poor reliability (PLR of aroun 0.1), which is unacceptable in VANETs g [user/slot] Fig. 5: PLR comparison of optimize CSMA-CA an B-CSA for ifferent frame lengths. The soli an the ash-otte lines show the performance of B-CSA an CSMA-CA, respectively. The ashe lines show the analytical PLR approximation (5). Re an blue lines correspon to n = 172 an n = 315 slots, respectively. V. CONCLUSIONS AND FUTURE WORK The propose protocol can provie an uncoorinate MAC all-to-all broacast with preictable elay an high reliability at large channel loas, which makes it highly appealing for VCs. The propose B-CSA is a cross-layer protocol since the actual PHY greatly affects SIC performance. Therefore, a more realistic PHY nees to be consiere. One of the main challenges we foresee here is the channel estimation neee for SIC. Among other interesting research irections, we point out the unequal error protection property of B-CSA which can be potentially utilize to provie ifferent priorities to packets. REFERENCES [1] IEEE St , Part 11: Wireless LAN meium access control (MAC) an physical layer (PHY) specifications, Tech. Rep., Mar [2] T. Zemen, L. Bernaó, N. Czink, an A. F. Molisch, Iterative timevariant channel estimation for p using generalize iscrete prolate spheroial sequences, IEEE Trans. Veh. Tech., vol. 61, no. 3, pp , Mar [3] G. Bianchi, Performance analysis of the IEEE istribute coorination function, IEEE J. Sel. Areas Commun., vol. 18, no. 3, pp , Mar [4] M. Torrent-Moreno, J. Mittag, P. Santi, an H. Hartenstaein, Vehicleto-vehicle communication: Fair transmit power control for safety-critical information, IEEE Trans. Veh. Tech., vol. 58, no. 7, pp , Sep [5] C.-L. Huang, Y. Pourmohammai, R. Sengupta, an H. Krishnan, Intervehicle transmission rate control for cooperative active safety system, IEEE Trans. Intell. Transp. Syst., vol. 12, no. 3, pp , Sep [6] K. Bilstrup, E. Uhlemann, E. Ström, an U. Bilstrup, On the ability of the p MAC metho an STDMA to support real-time vehicle-tovehicle communication, EURASIP Journal on Wireless Commun. an Networking, vol. 2009, pp. 1 13, Apr [7] G. Liva, Graph-base analysis an optimization of contention resolution iversity slotte ALOHA, IEEE Trans. Commun., vol. 59, no. 2, pp , Feb [8] C. Stefanovic an P. Popovski, ALOHA ranom access that operates as a rateless coe, IEEE Trans. Commun., vol. 61, no. 11, pp , Nov
6 Preprint, August 5, [9] L. G. Roberts, ALOHA packet system with an without slot an capture, SIGCOMM Comput. Commun. Rev., vol. 5, no. 2, pp , Apr [10] M. Ivanov, F. Brännström, A. Graell i Amat, an P. Popovski, Error floor analysis of coe slotte ALOHA over packet erasure channels, to appear in IEEE Commun. Lett. [Online]. Available:
Chalmers Publication Library
Chalmers Publication Library All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA This ocument has been ownloae from Chalmers Publication Library (CPL). It is the author s version of a work
More informationUncoordinated Multiple Access for Vehicular Networks
Uncoordinated Multiple Access for Vehicular Networks Mikhail Ivanov, Fredrik Brännström, Alexandre Graell i Amat, Petar Popovski Chalmers University of Technology, Gothenburg, Sweden Aalborg University,
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationProbabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients
Probabilistic Meium Access Control for 1 Full-Duplex Networks with Half-Duplex Clients arxiv:1608.08729v1 [cs.ni] 31 Aug 2016 Shih-Ying Chen, Ting-Feng Huang, Kate Ching-Ju Lin, Member, IEEE, Y.-W. Peter
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationOverview : Computer Networking. IEEE MAC Protocol: CSMA/CA Internet mobility TCP over noisy links
Overview 15-441 15-441: Computer Networking 15-641 Lecture 24: Wireless Eric Anerson Fall 2014 www.cs.cmu.eu/~prs/15-441-f14 Internet mobility TCP over noisy links Link layer challenges an WiFi Cellular
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationCoordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks
Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationEDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks
sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationResearch Article REALFLOW: Reliable Real-Time Flooding-Based Routing Protocol for Industrial Wireless Sensor Networks
Hinawi Publishing Corporation International Journal of Distribute Sensor Networks Volume 2014, Article ID 936379, 17 pages http://x.oi.org/10.1155/2014/936379 Research Article REALFLOW: Reliable Real-Time
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationInuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem
Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationNew Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction
New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationScalable Deterministic Scheduling for WDM Slot Switching Xhaul with Zero-Jitter
FDL sel. VOA SOA 100 Regular papers ONDM 2018 Scalable Deterministic Scheuling for WDM Slot Switching Xhaul with Zero-Jitter Bogan Uscumlic 1, Dominique Chiaroni 1, Brice Leclerc 1, Thierry Zami 2, Annie
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationParallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm
NASA/CR-1998-208733 ICASE Report No. 98-45 Parallel Directionally Split Solver Base on Reformulation of Pipeline Thomas Algorithm A. Povitsky ICASE, Hampton, Virginia Institute for Computer Applications
More informationOptimal Distributed P2P Streaming under Node Degree Bounds
Optimal Distribute P2P Streaming uner Noe Degree Bouns Shaoquan Zhang, Ziyu Shao, Minghua Chen, an Libin Jiang Department of Information Engineering, The Chinese University of Hong Kong Department of EECS,
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationImpact of FTP Application file size and TCP Variants on MANET Protocols Performance
International Journal of Moern Communication Technologies & Research (IJMCTR) Impact of FTP Application file size an TCP Variants on MANET Protocols Performance Abelmuti Ahme Abbasher Ali, Dr.Amin Babkir
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationClassical Mechanics Examples (Lagrange Multipliers)
Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the
More informationPerformance evaluation of the Zipper duplex method
Performance evaluation of the Zipper lex metho Frank Sjöberg, Mikael Isaksson, Petra Deutgen, Rickar Nilsson, Per Öling, an Per Ola Börjesson Luleå University of Technology, Division of Signal Processing,
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationRefinement of scene depth from stereo camera ego-motion parameters
Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
0 0 0 0 0 0 0 0 on-uniform Sensor Deployment in Mobile Wireless Sensor etworks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University Boca Raton,
More informationFigure 1: Schematic of an SEM [source: ]
EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationOverlap Interval Partition Join
Overlap Interval Partition Join Anton Dignös Department of Computer Science University of Zürich, Switzerlan aignoes@ifi.uzh.ch Michael H. Böhlen Department of Computer Science University of Zürich, Switzerlan
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationOn-path Cloudlet Pricing for Low Latency Application Provisioning
On-path Cloulet Pricing for Low Latency Application Provisioning Argyrios G. Tasiopoulos, Onur Ascigil, Ioannis Psaras, Stavros Toumpis, George Pavlou Dept. of Electronic an Electrical Engineering, University
More informationSpare Capacity Planning Using Survivable Alternate Routing for Long-Haul WDM Networks
Spare Capacity Planning Using Survivable lternate Routing for Long-Haul WDM Networks in Zhou an Hussein T. Mouftah Department of lectrical an Computer ngineering Queen s University, Kingston, Ontario,
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More informationFINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD
Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.
More informationLab work #8. Congestion control
TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationAN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY
AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon
More informationInterior Permanent Magnet Synchronous Motor (IPMSM) Adaptive Genetic Parameter Estimation
Interior Permanent Magnet Synchronous Motor (IPMSM) Aaptive Genetic Parameter Estimation Java Rezaie, Mehi Gholami, Reza Firouzi, Tohi Alizaeh, Karim Salashoor Abstract - Interior permanent magnet synchronous
More informationAn Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach
An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach Nishi Sharma, Vanna Verma Abstract Wireless sensor networks (WSNs) is one of the emerging fiel of research in recent era
More informationTCP Symbiosis: Congestion Control Mechanisms of TCP based on Lotka-Volterra Competition Model
TCP Symbiosis: Congestion Control Mechanisms of TCP base on Lotka-Volterra Competition Moel Go Hasegawa Cybermeia Center Osaka University 1-3, Machikaneyama-cho, Toyonaka, Osaka 56-43, JAPAN Email: hasegawa@cmc.osaka-u.ac.jp
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationEXACT SIMULATION OF A BOOLEAN MODEL
Original Research Paper oi:10.5566/ias.v32.p101-105 EXACT SIMULATION OF A BOOLEAN MODEL CHRISTIAN LANTUÉJOULB MinesParisTech 35 rue Saint-Honoré 77305 Fontainebleau France e-mail: christian.lantuejoul@mines-paristech.fr
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationUsing Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1
Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationCascading Multi-Hop Reservation and Transmission in Underwater Acoustic Sensor Networks
Sensors 2014, 14, 18390-18409; oi:10.3390/s141018390 Article OPEN ACCESS sensors ISSN 1424-8220 www.mpi.com/journal/sensors Cascaing Multi-Hop Reservation an Transmission in Unerwater Acoustic Sensor Networks
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationCoded Splitting Tree Protocols
Coded Splitting Tree Protocols Jesper H. Sørensen, Čedomir Stefanović, and Petar Popovski Aalborg University, Department of Electronic Systems, Fredrik Bajers Vej, 0 Aalborg, Denmark E-mail: {jhs,petarp,cs}@es.aau.dk
More informationA PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset
Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationContents on the Move: Content Caching and Delivery at the Wireless Network Edge
Contents on the Move: Content Caching an Delivery at the Wireless Network Ege Deniz Günüz Imperial College Lonon 20 June 2017 icore/ Commnet2 Joint Workshop: Content Caching an Distribute Storage for Future
More informationShort-term prediction of photovoltaic power based on GWPA - BP neural network model
Short-term preiction of photovoltaic power base on GWPA - BP neural networ moel Jian Di an Shanshan Meng School of orth China Electric Power University, Baoing. China Abstract In recent years, ue to China's
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationDistributed Decomposition Over Hyperspherical Domains
Distribute Decomposition Over Hyperspherical Domains Aron Ahmaia 1, Davi Keyes 1, Davi Melville 2, Alan Rosenbluth 2, Kehan Tian 2 1 Department of Applie Physics an Applie Mathematics, Columbia University,
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More information