MAC Throughput Improvement Using Adaptive Contention Window
|
|
- Camilla Baldwin
- 6 years ago
- Views:
Transcription
1 Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. MAC Throughput Improvemet Usig Adaptive Cotetio Widow Chu Liag Li, Wei Tig Chag, Mi Huei Lu Departmet of Electrical Egieerig, Natioal Chug Hsig Uiversity, Taichug, Taiwa chuli@drago.chu.edu.tw Received 2 Jauary 2015; accepted 19 Jauary 2015; published 23 Jauary 2015 Copyright 2015 by authors ad Scietific Research Publishig Ic. This work is licesed uder the Creative Commos Attributio Iteratioal Licese (CC BY). Abstract HomePlug AV (HPAV) is a stadard developed by HomePlug Powerlie Alliace (HPA) for power lie commuicatio. I HomePlug AV, it uses a techology amed Carrier Sese Multiple Access with Collisio Avoidace (CSMA/CA) to reduce collisio happeed i etwork. However, whe etwork odes icrease, the cotetio widow umber may ot be wide eough. It will cause collisio probability to icrease. I this paper, we itroduce a ew idea of adaptive cotetio widow which will produce suitable cotetio widow uder actual etwork eviromet. Our method oly requires the iformatio of CSMA/CA parameters. It meas that oe does t eed to correct the origial CSMA/CA procedure but substitutes old parameters by the ew oes. Simulatio experimets coducted i the etwork simulator NS3 show that compared with HomePlug AV, our method promotes throughput sigificatly whe the ode umber icreases. Keywords CSMA/CA, Cotetio Widow, Power Lie Commuicatio 1. Itroductio Power-Lie Commuicatio (PLC) is developed rapidly i recet years. Because it does t eed to build additioal trasmit chael ad exists almost everywhere eve i the backward areas, it is mostly recogized as the solutio of last mile to the curret etwork commuicatio. Sice power lie was ot origially built for iformatio trasmissio, there are several problems. Oe of these is the data collisio. Whe chael trasmits multiple packets at the same time, packets will collide aturally causig packets to be destroyed. The statio has to retrasmit packets which will cause throughput decrease i the ed. Thus, HomePlug AV [1] uses CSMA/CA [2] to avoid collisio happeig. The priciple is as follows: each time the statio tries to sed package, it will detect chael s status. If the chael is idle, the statio seds the packets. Otherwise, it goes ito the cotetio How to cite this paper: Li, C. L., Chag, W. T. ad Lu, M. H. (2015) MAC Throughput Improvemet Usig Adaptive Cotetio Widow. Joural of Computer ad Commuicatios, 3,
2 mode. This method ca avoid too may statios trasmittig at a time hece to effectively reduce the chace of data collisio. A PLC architecture cosists of head ed (HE) ad user modem. HE erects at the trasformer side ad oe side is coected to the trasmissio backboe, like Etheret. Aother side is coected to the power lie to receive request from PLC users. The user modem coects to the commuicatio equipmet to commuicate through the power lie. If a PLC modem accesses the Iteret, it will receive packets from the head ed through the power lie. Although HomePlug AV stadard ca guaratee high throughput whe the umber of odes is very limited, whe the ode umber icreases, the value of cotetio widow settig i HomePlug AV will be big which leads throughput to decrease accordigly. I [3], iformatio theory ad data miig techique were applied for etwork traffic profilig. Some research tasks focused o ehacig throughput via the revised MAC layers [3] [4]-[8]. Amog which, the authors of [3] proposed a adaptive cotetio widow mechaism for HomePlug AV ad verified their desigs through experimets. They have coducted a experimet to reach the best successful trasmissio umber i a beaco period. That is, if the umber of successful trasmits is less tha the imal oe, it meas that the curret cotetio widow size is iappropriate. It will the chage it i the ext beaco period. I 2011, the authors of [4] foud the imal cotetio widow value for the situatio of differet odes. Both of them show that throughput ca be improved i a efficiet maer if the size of cotetio widow is imized. Eve though previous research ca achieve the desired effect, most of them require iformatio of all statios. That meas that they eed aother bit to trasmit that iformatio to each ode. Or, they have to modify the protocol. I this research, we propose a ew strategy of a adaptive cotetio widow mechaism that does t chage the origial CSMA/CA procedure or require statio s iformatio as a basis of modifyig the cotetio widow size. Our correctio factor icludes the CSMA/CA parameters. Soft experimets at the etwork simulator, NS3, show the improved effect i throughput. 2. Priciples of CSMA/CA For PLC, whe a statio tries to sed a packet, it first checks the chael coditio. If the chael is i idle, it trasmits data accordigly. Otherwise, it eters the cotetio mode. The cotetio period is a regio to coted the authority of usig chael by other statios. Before goig ito the cotetio period, the statio will allocate each packet priority. Packets with higher priority use the chael first. If there are several packets possessig the same priority, it will become the cotetio period. I priority resolutio, HPAV defie four parameters, CA0, CA1, CA2 ad CA3. CA3 preset the highest priority, ad CA0 is the lowest, etc. Each statio will be defied the packet s priority i two priority regios deoted PRS0 ad PRS1 respectively. At each PRSi, the statio chooses to sed or ot to sed sigals. Accordig to the PRS, we ca determie the packet s priority level. Differet priority level correspods to differet parameter settigs. Table 1 shows the role of it. After implemetig the settig of priority, each statio equips with a specific packet priority level. Higher priority level wis the cotetio ad possesses more chaces to sed the packet. If there are several statios with the same priority, it will proceed to the ext stage-radom backoff procedure. For the radom backoff procedure, we first itroduce cotetio widow ad three couters, backoff couter, deferral couter ad backoff procedure couter. 1) Cotetio widow (CW): Cotetio widow is a fixed umber defied i Table 2. It is used to determie the value of backoff couters. 2) Backoff couter (BC): Backoff couter s value chooses from a radom value of cotetio widow. It meas that CW is the maximal value of BC could be. BC will be decreased by oe, each time whe it seses a busy status i the chael util BC equals to zero. The statio will trasmit the packet. 3) Deferral couter (DC): Whe the umber of users i the local area etwork is large, usig oly BC to delay the trasmissio time is ot eough. Deferral couter is used to avoid collisio further. At the begiig, DC is fixed. Differet CAs have differet iitial values of DC correspodig to. If the chael status sesed is idle, DC remais uchaged. O the cotrary, if it is busy, DC will be decreased by oe. Whe DC reaches to zero, the time cotetio is declared fail. It will restart cotetio agai. 4) Backoff procedure couter (BPC): Backoff procedure couter is set to be zero iitially. Whe the statio 2
3 Table 1. Relatioship betwee PRS ad CA. Low priority High priority CA0 CA1 CA2 CA3 PRS PRS Table 2. Parameter settig. BPC BPC = 0 BPC = 1 BPC = 2 BPC 3 CA3, CA2 High priority DC = 0 CW = 7 DC = 1 CW = 15 DC = 3 CW = 15 DC = 15 CW = 31 CA CA1, CA0 Low priority DC = 0 CW = 7 DC = 1 CW = 15 DC = 3 CW = 31 DC = 15 CW = 63 fails to trasmit packets (happeed collisio). Statio will attempt to coted agai ad BPC will be icreased by oe. Accordig to differet BPC, there are differet DC ad CW settigs to respod. We express the behavior through Markov chai [4] i Figure 1. Each time we begi the backoff procedure by settig the same probability to obtai the value of BC from zero to CW (=W). Therefore, each probability at the top statemet is 1/W. At each time slot (defied i HPAV is ms), the statio will detect the commuicatio chael. The probability is P to sese a busy, ad it is 1 P to sese a idle. Whe DC or BC is equal to zero but the chael status sesed is still i busy. BPC will be icreased by oe ad BC will be rechose. That meas that there are too may users occupyig the chael. The, DC ad BC eed to be icreased for loger waitig time for collisio avoidace. Whe BC reaches to zero ad the chael status sesed is idle, the statio ca the trasmit packets. The complete flow chart is illustrated i Figure 2. The time of successful trasmissio ca be expressed as i Figure 3. PRS0 ad PRS1 are regios to decide packets priority, a cotetio regio refer to the waitig time of the coteded chael before trasmittig packets, data trasmissio is the time of packets set i the PHY layer; RIFS refers to the time before sedig ackowledgemet, ACK is the time of trasmittig ackowledgemet, ad CIFS is time before startig the ext packet. Amog which, PRS0, PRS1, RIFS, ACKS, ad CIFS are fixed umbers i HomePlug AV, see Table Slot Utilizatio ad Relatio with Throughput Referrig to Figure 3, we defie rs t ad rc t respectively, the time required for a successful data trasmissio ad the time for a collisio happeed durig data trasmissio. The two terms ca be expressed by r t T, r t T where s s all c c all is the total slot time i the cotetio regio ad If we defie Ts frame all PRS0 PRS1 T RIFS ACK CIFS (1) Tc PRS0 PRS1 T CIFS (2) frame P b as the probability of slot sesed i busy. From [2], Pb P b ca be expressed by 1 1 (3) where is the probability of the statio trasmitted i a slot ad is the umber of statios. Sice P b reflects 3
4 Figure 1. Markov chai of CSMA/CA. Figure 2. Operatioal flow chart of the CSMA/CA procedure. 4
5 Figure 3. The process for a successful trasmissio. Table 3. HPAV system parameters. Parameters Beaco period CIFS RIFS PRS0 PRS1 Slot time MAX_FL Respose tieout Time ms 100 μs μs μs μs μs μs μs the probability of chael i busy status, it ca also be defied as busy slot umber P b busy slot umber idle slot umber (4) This is also referred as slot utilizatio [9]. We coduct several extesive simulatio experimets o the Network Simulator 3 (NS3) [10]. NS3 is a evet driver developed to mimic etwork eviromet. Compared with its predecessor NS2, NS3 is completely developed by C++ ad the system architecture is simpler tha that of NS2. We record slot utilizatio every 30 secods at various ode arragemet. There are four CW cases i the simulatio. The results are show i Figure 4(a) where T s defied i Equatio (1) is set to be 3500 μs ad the slot time is similar to that defied i Table 3. I Figure 4(a), red lie refers to HomePlug AV stadard which let CW = [ ]. Other lies are the situatio with differet CW values. Whe CW is set to be larger, the probability for obtaiig a larger BC is higher. Correspodigly, its slot utilizatio is comparatively smaller. However, eve the CW settig is as such, the slot utilizatio icreases cotiuously. This fact ispires us to cosider whether oe ca use slot utilizatio to relate the cogestio level. Aother simulatio bee coducted is to observe the variatio of throughput at the same settig, illustrated as i Figure 4(b). I Figure 4(b), HomePlug AV stadard has the highest throughput whe the umber of cotetio odes is small. However, whe the ode umber icreases, the throughput will decrease because of the higher collisio probability. O the cotrary, CW = [ ] settig possesses the worst throughput at the begiig. That s because it wastes too much time i the idle slot. However, it will cause low collisio probability whe the ode umber becomes larger. This why it possesses highest throughput whe the ode umber is more tha 35. Therefore, if oe ca assig the system a low CW settig whe the ode umber is few ad a high CW whe the ode umber is large the better throughput could be expected. This is the basic idea behid the adaptive cotetio widow mechaism proposed i this research. To compare Figure 4(a) ad Figure 4(b), from the ode umber 5 to 12, CW = [ ] has the highest throughput. From 13 to 35 odes, CW = [ ] possesses the highest throughput. After 35, CW = [ ] has the highest throughput. Most of their slot utilizatio are i 0.1 ~ 0.2 whe they possess the highest throughput. Oe ca thus ifer that the value of slot utilizatio i 0.1 ~ 0.2 would be the best settig i this case. 5
6 (a) Figure 4. Simulatio o differet CW settig: (a) Slot utilizatio; (b) Throughput. (b) I summary, if oe ca cotrol slot utilizatio i a appropriate regio the better throughput could be expected. 4. Adaptive Cotetio Widow Mechaism From [11], it was kow that whe defied i Equatio (3) as the followig way, throughput of the etwork will exhibit the best performace: cavg. cavg 2 1 T T 1 T 2. cavg. where T cavg. is the average time of collisio trasmissio T c i the slot time as T cavg, Substitutig Equatio (6) ito Equatio (5) yields the ew as T c (6) 1 (7) T c 2 Substitutig Equatio (7) ito Equatio (3) gives the imal slot utilizatio which will lead to the imal throughput. We set this imal slot utilizatio as the stadard which is expressed as P b. : where 2. T c P b After recogized data received, every statio records the slot utilizatio by usig Equatio (4) for the last successful trasmissio packet. If slot utilizatio of the last packet is greater tha P b., it meas that the curret cotetio widow is ot big eough which may cause the cogestio. It will assig the system a larger cotetio widow. Otherwise, it will adjust the cotetio widow for reductio. Our adaptive cotetio widow architecture ca be illustrated as i Figure 5. I this figure, is expressed as slot utilizatio of the last packet. By the revised fuctio- f, it coverts the slot utilizatio to a revisig factor to multiply the origial cotetio widow (CW = [ ]). That is, f CW. the cotetio widow of the ext packet will be chaged to (5) (8) 6
7 Figure 5. System architecture of the proposed adaptive cotetio widow mechaism. We suppose that the revised fuctio f P, f is give i the form show i Figure 6. While the slot utilizatio is i betwee P b. ad 2 b. appears as a liear positive gai. Sice CW = [ ] is origially suitable for the case with oly a few odes, it does t eed to be small whe the slot utilizatio is apparetly too small. Therefore, we set fmi to be 1. O the other had, we defie M as the expressio of fmax to be a variable. Assume f is expressed by the followig form whe is i betwee P b. ad 2P b. : f m k (9) Substitutig P b.,1 ad 2 Pb., M ito Equatio (9) yields m ad k as M 1 m P b. k 2 M Fially, we obtai the complete form of the revised fuctio f : 1, Pb. M 1 f 2 M, P 2P Pb. M, 2Pb. b. b. The mai idea here is to icorporate slot utilizatio to determie cogestio level of the etwork. However, slot utilizatio determied by Equatio (4) leads to a large alteratio if the last packet is successfully trasmitted at BPC = 0 (Table 2). Uder this situatio, it will brig the ext packet with icorrect iformatio i the cogestio level. To tackle, we propose a virtual slot utilizatio istead of the previous slot utilizatio. A virtual slot utilizatio will lie i betwee P b. ad 2P b.. The eighborig two packets will ot exhibit large differece virtual slot utilizatio. The virtual slot utilizatio comes from the followig process. We defie vm ad vm 1 as the virtual slot utilizatio of the packets m ad m 1, respectively ad m is the slot utilizatio of the packet m, show as i Figure 7. The packet m + 1 uses vm as the previous slot utilizatio which ads Equatio (10) to obtai the revisig factor as its cotetio widow. vm is obtaied by the previous packet s virtual slot utilizatio vm 1 1 ad the slot utilizatio of the packet m. If m Pb., vm will be vm 1 2 Pb. vm 1 to icrease the 5 1 revisig factor. If m Pb., vm will be vm 1 vm 1 P b.. If m Pb., set vm vm 1 5. We replace the slot utilizatio by the virtual slot utilizatio accordig to Equatio (10): (10) 7
8 Figure 6. Correctio factor of the cotetio widow f. Figure 7. Sketch of slot utilizatio virtual slot utilizatio vm. m ad P 1 b. 1, m P vm vm b b., vm P vm vm m< Pb. (11) 1, vm m= P b. By this process, every statio CW will reach to a regio which the probability of every statio trasmittig packets will be close. The revisig factor f will be icreasig cotiuously whe P b. as well. While the previous method works i a efficiet way, there is a weakess, i.e. the cotetio widow mechaism shows lower throughput whe the ode umber is few. That s because if we modify the cotetio widow at BPC = 0 by the previous method, it teds to prompt a larger revisig factor whe the ode umber is few. Thus, it still exhibits a large cotetio widow causig lower throughput. It is expected that, at each time istat, ρ could really reflect the previous cogestio level. Thus, whe is large, we do t wat the statio trasmits at the first cotetio period time. It meas that oe still eeds a larger CW at BPC = 0 whe the ode umber is large. Therefore, oe has to defie a updated revisig factor for the state BPC = 0. Ulike the revisig factor characterized i Figure 5 usig a simple multiplicatio to modify the cotetio widow, the revisig factor at BPC = 0 should be updated i the way of additio. Comparig to the multiplicatio operatio, the amout of additio should be smaller. It will be more suitable for the case of BPC = 0 sice its deferral couter is 0. The modificatio is to itroduce a correctio factor, say 4 f vm M (12) where the operator miz x. By this way, we obtai a iteger, with its values i betwee 1 to 4, to idicate the cogestio level. Next, we record the couter of the backoff procedure of the last packet, deoted BPC m. To proceed, set the maximum value of BPC m to be 3 ad defie 8
9 BPC 1 Therefore, the value of will be from 1 to 4. Combiig ad forms a cogestio level idicator as where Table 4 lists all possible values of. We choose as our revisig factor whe BPC = 0. By this process, the statio will has less probability to trasmit at the first roud i the backoff regio whe the ode umber is large. It does t ifluece throughput whe the ode umber is fewer. The complete desig process of our adaptive cotetio widow process ca be summarized as follows: Step 1: Based o the give slot time, collisio trasmissio time T c ad ode umber obtai P b. as Step 2: Defie the revisig factor P b. f by P b. : m T c 1, Pb. M 1 f 2 M, P 2P Pb. M, Pb. b. b. Step 3: Cout the idle ad busy slot umbers of the last trasmissio packet to obtai the virtual slot utilizatio: busy_slot_umbers all_slot_umbers P, P P, P vm vm vm 1, P vm vm 1 b. vm 1 b. Step 4: Specify the revisig factor whe BPC = 0 i Table 2: Step 5: Update the cotetio widow via: 1) Backoff procedure is at BPC = 0: 2) Backoff procedure is at BPC > 0: 4 f M vm BPC 1 m * CW CW b. b. * CW CWf vm So far, our focus is oly i ow statio. However, the statio umber i Equatio (8) is ot fixed which is ukow i geeral. To resolve this problem, we calculate P b. Tc 3500 s with differet, see Figure 8. Whe the ode umber is i 1 ~ 200, its value will ot sigificatly affect P b.. To prove the ode umbers will ot ifluece P b. further, we calculate the sesitivity whe is larger tha Defie. It follows that the sesitivity fuctio of P b. with respect to the ode umber is give by T c b. 9
10 Table 4. List of the values of ω Figure 8. Variatio of P b. o differet ode umbers. S P 1 l1 Pb Pb. b. Whe > 200, the terms 1 ad will be smaller tha 1. However, 11 l 1 1. Thus, S 0. 1 I the followig study, the etwork ode umber is set to be 10. Furthermore, if we cosider CW = [ ] as the largest cotetio widow, which will be approximately 15 times to the case of CW = [ ], the we set the maximum revisig fuctio M to be 15. The operatioal flow chart of the updated adaptive cotetio widow mechaism is illustrated i Figure Experimetal Results The goal of this research is to acquire higher throughput while maitaiig slot utilizatio. The simulatio experimets have bee coducted at the etwork simulator NS3. We set to be μs which remais the same as i HomePlug AV. Simulatio study is maily coducted for differet T s ad CW. Figure 10(a) shows slot utilizatio for various CW settigs. No matter HomePlug AV stadard or other CW settigs, their slot utilizatios exhibit large variatios whe the umber of odes icreases. However, there is 10
11 Figure 9. Operatioal flow chart of the proposed adaptive CW mechaism. oly slight differece amog differet cases i our proposed approach. This result shows that our method is effectively to cotrol slot utilizatio. Eve for a large scale etwork, it shows o sigificat differece. After verifyig slot utilizatio, the mai poit of this research is to get better throughput o the large scale etwork. We prove i the follows that the proposed approach exhibits the best throughput performace while comparig to other fixed CW settigs. Icludig the origial HomePlug AV (CW = [ ]). All packets are supposed to possess the same priority ad all statios are o the saturated situatio which meas that all statios have packets to trasmit at all time. We record the average throughput every 30 secods for each coditio. Figure 10(b) shows throughput of various CW settigs with T s equal to 3500 μs. HomePlug AV stadard exhibits the highest throughput at the begiig. Whe the ode umber becomes large, HomePlug AV stadard s CW settig is ot big eough because its throughput decreases seriously. O the other had, CW = [ ] has the lowest throughput at the begiig because the system wastes too much time o the idle slots. However, it rises subsequetly whe the ode umber become large. Our method shows the highest at all time sice its CW settig is ot fixed. Whe the ode umber is relatively few, it uses a small CW. Whe the ode umber icreases, it automatically icreases the CW value accordigly. Thus, whe the ode umber becomes large, it still exhibits low probability i etwork collisio. That s why it ca keep high throughput of the etwork over the whole commuicatio time. This is as expected before. Figure 10(c) shows that whe the ode 11
12 (a) (b) (c) Figure 10. Various CW settigs i differet simulatio cases: (a) Slot utilizatio; (b) Throughput (T s = 3500 μs); (c) Throughput (large ode umber ad large CW); (d) Throughput (T s = 5500 μs). umber is icreased to 95, it performs as the cases of CW = [ ] i the simulatio study. The simulatio result shows that whe the ode umber approaches to a large value, throughput will coverge to a small regio. Thus, settig a extremely large CW does t brig positive effect. That s also the reaso that we set a limit to f. To prove performace robustess of the preset mechaism, we coduct experimets for differet trasmissio time. Figure 10(d) illustrates that throughput of the successful trasmissio time equals 5500 μs. This shows the similar result, our method performs the best at all time. From Figure 10(b) ad Figure 10(d), it ca be see that if trasmissio time is less, the degree of CW affectig throughput is larger ad our adaptive CW mechaism performs better tha other cases as well. We also verify the case whe there is a abrupt chage i the ode umber ad examie if it still works. Cosider the etwork has 40 odes at the begiig. At 60 secods, it reduces to 10 odes. We compare the situatio with 10 odes at the begiig ad record throughput at each secod. The simulatio result is show i Figure 11(a). It displays that after 60 secods, throughput of the situatio 1 has bee improved ad quickly approaches to the lie of situatio 2. This edorses performace robustess of our proposed mechaism Fially, the umber i Equatio (8) was chaged to 10 at the previous simulatio test. To prove that it wo t sigificatly alter the result, we coduct extra tests with the umber of odes = 30 ad compare it to the case of = 10. See Figure 11(b) for the result. It clearly shows that the value of does t sigificatly affect throughput. That demostrates robustess of our proposed approach to the etwork complexity. (d) 12
13 (a) Figure 11. Throughput at differet special case: (a) Situatio 1: 40 odes at etwork begiig. It remais 10 odes after 10 s. Situatio 2: 10 odes at all time; (b) Various settig of P b.. 6. Coclusio PLC is becomig mature i recet years. However, as the usual etwork commuicatio, the etwork cogestio problem is crucial whe cosiderig maitaiig commuicatio quality. While HomePlug AV is already a mature protocol i PLC, we propose here a adaptive cotetio mechaism istead of formulatig a ew protocol. The adaptive cotetio widow scheme oly eeds the iformatio from CSMA/CA i HomePlug AV. I additio, because the iformatio eeded is self-cotaied, oe does ot eed ot to correct the PHY layer settig to acquire extra iformatio from other statios. All eeded are to substitute the ew CW ad BC ito the origial HomePlug AV mechaism. This makes the approach more practical ad presets better feasibility. From the simulatio experimets coducted at NS3, it is foud that the proposed scheme ca effectively improve throughput. We have tested it with a variety of several scearios; satisfactory results have bee observed which show idetifiable improvemet of our proposed desig. Ackowledgemets This research was sposored by Natioal Sciece Coucil, Taiwa, uder the Grat NSC E MY3. Refereces [1] HomePlugPowerlie Alliace (2007) HomePlug AV Specificatio, Ver [2] Chug, M.Y., Jug, M.H., Lee, T.J. ad Lee, Y. (2006) Performace Aalysis of HomePlug 1.0 MAC with CSMA/CA. IEEE Joural o Selected Areas i Commuicatios, 24, [3] Velarde-Alvarado, P., Martiez-Pelaez, R., Ruiz-Ibarra, J. ad Morales-Rocha, V. (2014) Iformatio Theory ad Data-Miig Techiques for Network Traffic Profilig for Itrusio Detectio. Joural of Computer ad Commuicatios, 2, [4] Yoo, S.G. ad Bahk, S. (2011) Adaptive Rate Cotrol ad Cotetio Widow-Size Adjustmet for Power-Lie Commuicatio. IEEE Trasactios o Power Delivery, 26, [5] Krimiger, E. ad Latchma, H. (2011) Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size. Proceedigs of IEEE Iteratioal Symposium o Power Lie Commuicatios ad Its Applicatios, Udie, 3-6 April 2011, [6] Liu, K.H., Hsieh, D.R., Hsu, J.Y. ad Chag, S.Y. (2012) Throughput Improvemet for Power Lie Commuicatio by Adaptive MAC Protocol. Proceedigs of IEEE Iteratioal Power Egieerig ad Optimizatio Coferece, Melaka, 6-7 Jue 2012, [7] Luca, D.B., Alessadro, S.D. ad Toello, A.M. (2013) MAC Ehacemets for G3-PLC Home Networks. Proceed- (b) 13
14 igs of IEEE Iteratioal Symposium o Power Lie Commuicatios ad Its Applicatios, Johaesburg, March 2013, [8] Tsokalo, I., Radeke, R. ad Lehert, R. (2013) Ehacemet of Backoff Algorithm i CSMA/CA Protocols for Broadbad PLC. Proceedigs of IEEE Iteratioal Symposium o Power Lie Commuicatios ad Its Applicatios, Johaesburg, March 2013, [9] Wu, H., Log, K. ad Heg, S. (2002) IEEE Distributed Coordiatio Fuctio (DCF): Aalysis ad Ehacemet. Proceedigs of IEEE Iteratioal Coferece o Commuicatios, 28 April-2 May 2002, [10] NS3. [11] Biachi, G. (2000) Performace Aalysis of the IEEE Distributed Coordiatio Fuctio. IEEE Joural o Selected Areas i Commuicatios, 18,
15
Introduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.
Itroductio to Wireless & Mobile Systems Chapter 6 Multiple Radio Access 1 Outlie Itroductio Multiple Radio Access Protocols Cotetio-based Protocols Pure ALOHA Slotted ALOHA CSMA (Carrier Sese Multiple
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationHistory Based Probabilistic Backoff Algorithm
America Joural of Egieerig ad Applied Scieces, 2012, 5 (3), 230-236 ISSN: 1941-7020 2014 Rajagopala ad Mala, This ope access article is distributed uder a Creative Commos Attributio (CC-BY) 3.0 licese
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationInterference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks
Iterferece Aware Chael Assigmet Scheme i Multichael Wireless Mesh Networks Sumyeg Kim Departmet of Computer Software Egieerig Kumoh Natioal Istitute of Techology Gum South Korea Abstract Wireless mesh
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationA QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services
A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute
More informationA New per-class Flow Fixed Proportional Differentiated Service for Multi-service Wireless LAN*
A New per-class Flow Fixed Proportioal Differetiated Service for Multi-service Wireless LAN* Meg Chag Che, Li-Pig Tug 2, Yeali S. Su 3, ad Wei-Kua Shih 2 Istitute of Iformatio Sciece, Academia Siica, Taipei,
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationCopyright 2010, Elsevier Inc. All rights Reserved
Computer Networks: A Systems Approach, 5e Larry L. Peterso ad Bruce S. Davie (Subset of topics) Gettig Coected Framig Error Detectio. Reliable Trasmissio Sharig: Etheret ad Multiple Access Networks, Wireless
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationGTS Scheduling Scheme for Real-Time Communication in IEEE Industrial Wireless Sensor Networks
Idia Joural of Sciece ad Techology, Vol 9(7), DOI:.7485/ijst/6/v9i7/87734, February 6 ISSN (Prit) : 974-6846 ISSN (Olie) : 974-5645 GTS Schedulig Scheme for Real-Time Commuicatio i IEEE8.5.4 Idustrial
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationOntology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection
2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationMedia Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1
Media Access Protocols Sprig 2018 CS 438 Staff, Uiversity of Illiois 1 Where are We? you are here 00010001 11001001 00011101 A midterm is here Sprig 2018 CS 438 Staff, Uiversity of Illiois 2 Multiple Access
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationTable 2 GSM, UMTS and LTE Coverage Levels
6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationA PREDICTION MODEL FOR USER S SHARE ANALYSIS IN DUAL- SIM ENVIRONMENT
GSJ: Computer Sciece ad Telecommuicatios 03 No.3(39) ISSN 5-3 A PRDICTION MODL FOR USR S SHAR ANALYSIS IN DUAL- SIM NVIRONMNT Thakur Sajay, Jai Parag Orietal Uiversity, Idore, Idia sajaymca00@yahoo.com
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationAdaptive and Lazy Segmentation Based Proxy Caching for Streaming Media Delivery
Adaptive ad Based Proxy Cachig for Streamig Media Delivery Sogqig Che Dept. of Computer Sciece College of William ad Mary Williamsburg, VA 23187 sqche@cs.wm.edu Susie Wee Mobile ad Media System Lab Hewlett-Packard
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationSoftware development of components for complex signal analysis on the example of adaptive recursive estimation methods.
Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationAdaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1
Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationBGP with an Adaptive Minimal Route Advertisement Interval
with a Adaptive Miimal Route Advertisemet Iterval Nead Lasković ad Ljiljaa Trajković Simo Fraser Uiversity Vacouver, British Columbia, Caada {laskovi, ljilja}@cs.sfu.ca Abstract The duratio of the Miimal
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationIntroduction to Network Technologies & Layered Architecture BUPT/QMUL
Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationAchieving Fairness in Wireless LANs by Enhanced IEEE DCF *
Achievig Fairess i Wireless LANs by Ehaced IEEE 802.11 DCF * Nagesh S. P. Nadiraju, Hrishikesh Gossai, Dave Cavalcati, Kaushik R. Chowdhury, Dharma P. Agrawal Ceter for Distributed ad Mobile Computig,
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationPrice-based Congestion-Control in Wi-Fi Hot Spots
Price-based Cogestio-Cotrol i Wi-Fi Hot Spots Roberto Battiti, Marco Coti, Erico Gregori, Mikalai Sabel To cite this versio: Roberto Battiti, Marco Coti, Erico Gregori, Mikalai Sabel. Price-based Cogestio-Cotrol
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationAn Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network
A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationGuaranteeing Hard Real Time End-to-End Communications Deadlines
Guarateeig Hard Real Time Ed-to-Ed Commuicatios Deadlies K. W. Tidell A. Burs A. J. Welligs Real Time Systems Research Group Departmet of Computer Sciece Uiversity of York e-mail: ke@mister.york.ac.uk
More informationPrevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting
Vol.2, Issue.3, May-Jue 2012 pp-1017-1021 ISSN: 2249-6645 Prevetio of Black Hole Attack i Mobile Ad-hoc Networks usig MN-ID Broadcastig Atoy Devassy 1, K. Jayathi 2 *(PG scholar, ME commuicatio Systems,
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationperformance to the performance they can experience when they use the services from a xed location.
I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationAdmission control issues in sensor clusters
Admissio cotrol issues i 802.15.4 sesor clusters Jelea Mišić, Shairmia Shafi, ad Vojislav B. Mišić Departmet of Computer Sciece, Uiversity of Maitoba Wiipeg, Maitoba, Caada PACS umbers: Valid PACS appear
More informationIMPROVEMENT OF A TAIL-PLANE STRUCTURAL MODEL USING VIBRATION TEST DATA. S. J. Guo
IMPROVEMENT OF A TAIL-PLANE STRUCTURAL MODEL USING VIBRATION TEST DATA S. J. Guo Departmet of Aerospace, Civil ad Mechaical Egieerig, Uiversity of Hertfordshire, Hatfield, Hertfordshire, AL 9AB, U.K. ABSTRACT
More information