II. RELATED WORK AND BACKGROUND

Size: px
Start display at page:

Download "II. RELATED WORK AND BACKGROUND"

Transcription

1 Comarson of Bluetooth Interconnecton Methods usng BlueProbe Sewook Jung, Alexander Chang, and Maro Gerla Deartment of Comuter Scence Unversty of Calforna, Los Angeles {sewookj, acmchang, Abstract Many Bluetooth researches are targeted to form effcent scatternets. However, scatternets do not have much oularty n general because many Bluetooth devces do not suort scatternet caabltes and hgh moblty makes t dffcult to kee the connectvty. Instead we choose temorary nterconnecton of conets to reduce scatternet formaton overhead. To comare several nterconnecton methods, we roose BlueProbe. BlueProbe fnds out the allocated tme slots sze, whch makes t at for Bluetooth style TDMA caacty measurement. BlueProbe s alcable to both conet and scatternet whether a cross traffc exsts or not. Results based on our real testbed measurements show that the nterconnecton method s more mortant than the ho length and the number of smultaneous flows, whereas revous researches based on smulatons concentrate on these two factors. Based on these results, we show effcent nterconnecton methods among Bluetooth Pconets. I. INTRODUCTION Bluetooth s a short-range wreless ersonal area network technology that suorts ad-hoc network. U to eght nodes are formed n a star-tye cluster, called conet. The node n the center of the star s called master and surroundng nodes are called slaves. Two slaves cannot communcate drectly. So, master should forward ackets between two slaves when one slave transmts ackets to the other. Pconets can be nterconnected va brdge nodes and these nterconnected conets form a scatternet. Brdges are the nodes that take art n more than one conet wth a tme-sharng method. However, scatternet s not suorted n all Bluetooth devces. Asynchronous Connectonless Lnk (ACL) s used to transmt data and t has 625μs sze tme slots. Data acket tyes vary based on how many tme slots (1, 3, or 5) are used and whether Forward Error Correcton (FEC) s used or not. FEC ackets are DM1, DM3, and DM5 (dgts ndcatng the number of slots used). Non-error correcton ones are DH1, DH3, and DH5. The latest Bluetooth Secfcaton 2.0 ntroduces the Enhanced Data Rate (EDR) ackets and they are 2-DH1, 2-DH3, 2-DH5, 3-DH1, 3-DH3, and 3-DH5 [1]. Ths aer has two man contrbutons. Frst, we roose a new caacty measurement tool that can be used for TDMA style rotocols. Prevously made tools do not work well for TDMA style rotocols. We roose BlueProbe that combnes acket length adataton, acket bundlng, and ng methods to measure ath caacty. Second, we comare several conet nterconnecton methods and show the roer ways to nterconnect Bluetooth devces II. RELATED WORK AND BACKGROUND A. Caacty Measurement AdHoc Probe [2] s a ath caacty robng method that s at for ad hoc network. It s based on CaProbe, whch s a well known bottleneck lnk caacty estmaton tool for wred and last-ho wreless networks [3]. AdHoc Probe uses one-way estmaton whereas CaProbe uses round-tr estmaton. It measures the maxmum rate achevable on an unloaded ath when ntermttent envronmental roblems are factored out. Fxed sze robng acket ars are sent back-to-back from the sender to the recever. The sender adds sendng tmestam n every acket. The recever calculates the one-way delay (OWD) and cks u roer acket ar by choosng two ackets that have the mnmum OWD sum, and calculates the caacty. Dovrors et al used dserson of acket ar and acket tran (more than 2 acket) to calculate caacty [4]. However, they used total dserson of acket tran to calculate caacty. B. Throughut Estmaton Kss Kallo et al analytcally estmated and showed the effect of ath length on throughut and ower consumton [5]. The throughut decreases wth the ncreasng number of hos and the ower consumton ntally decreases as the throughut decrease, and t later ncreases because of acket losses that ncur retransmssons. C. Scatternet Formaton Several algorthms [6, 7] are roosed to form and mantan a scatternet. In [6], BlueStar collects nformaton of other conets and t nterconnects conets based on ths nformaton. In [7], toology calculaton s used to fnd out number of slaves n a conet, number of conets servced by each brdge node, and number of loos n the network, n order to form a scatternet. These scatternet algorthms concentrate more on toologes of scatternet than nterconnecton methods. III. BLUEPROBE BlueProbe s based on AdHoc Probe, the one-way estmaton technque. AdHoc Probe measures the maxmum rate achevable on an unloaded ath. However, BlueProbe s dfferent from AdHoc Probe n several ways. Frst, BlueProbe calculates bottleneck node s allocated tme slot caacty for a certan ath nstead of the maxmum osle

2 Fgure 1. BlueProbe Tme Slot Fllng u caacty. AdHoc Probe calculates the best rate as the caacty and therefore t cannot roerly calculate a node s allocated tme slot caacty. When one Bluetooth node s shared wth several lnks, that node wll dvde ts tme slot for each lnk wth tme-sharng method. Second, BlueProbe uses tme slot fllng method to fully utlze ts tme slots whereas AdHoc Probe does not coner tme slot at all. When the frst and second robe ackets are located n the same tme slot as n Fgure 1. (a), the caacty wll be much hgher than the theoretcal one. When they are located n dfferent tme slots but each robe acket does not fully utlze ts tme slot as n Fgure 1. (b), the caacty wll be much lower than the theoretcal one. When each robe acket s located n each successve tme slots and each tme slot s fully flled u (each acket s fragmented nto two DH5 ackets) as n Fgure 1. (c), the caacty s very close to the theoretcal one. Thus, BlueProbe tres to fnd the roer acket length to fll each tme slot. Thrd, BlueProbe uses several methods each alcable to dfferent uroses. To calculate the exact caacty, t uses acket length adataton method whch tres to fnd the correct acket length to fll a tme slot. Ths method takes tme to fnd the correct acket length. In order to estmate the caacty n short amount of tme, BlueProbe uses acket bundle method n whch t sends multle ackets back to back to reduce the effect of cross traffc and thus smulates the real data transfer. In moble stuatons, connectons and dsconnectons are very frequent whch requre dfferent aroach to measure and udate caactes. For such cases, BlueProbe uses acket bundle and ng method to detect connectons and dsconnectons usng ng. When a connecton s detected t uses acket bundle and quckly calculates the caacty. If the connecton lasts long enough, the caacty s udated usng acket bundle. Detals are dscussed n the followng subsectons. A. Packet length adataton (PLA) Bluetooth devces usually select acket tye deendng on the ayload length and lnk qualty. In a good lnk qualty stuaton, DH acket s used nstead of DM acket to ncrease Fgure 2. BlueProbe Packet Length Adataton Method throughut. If IP ackets are longer than DH5 acket ayload sze (339 bytes), t wll be fragmented nto several DH5 ackets. So, we choose IP acket sze as the multle of DH5 ackets to fully fll u each tme slot. The IP acket sze starts from one DH5 acket ayload length, and ncreases u to ten DH5 acket sze, n the ncrement of one DH5 acket sze (1 DH5, 2 DH5 s,, 10 DH5 s), to fnd out the roer IP acket sze whch fully flls u a tme slot. In every fxed nterval, a acket ar (two IP ackets) s transmtted. AdHoc Probe comutes one-way delay sum (OWD_Sum) for each acket ar. It then cks the acket ar wth the mnmum OWD_Sum (Mn_OWD_Sum) to be used n calculatng the caacty. However, n TDMA style rotocol, MIN_OWD_Sum may not be the roer caacty measurement as shown n Fgure 2. (a). We ck the mnmum OWD among frst ackets (denoted as Mn_OWD_1) to fnd out the smallest queueng delay case. We also ck the acket ars n whch the frst acket s OWD s n the lowest 10% (denoted as Low_OWD_1), and the caacty s calculated by the average of each acket ar s caacty. In Fgure 2 (a), Mn_OWD_Sum used n AdHoc Probe calculates caacty whch s the total caacty of a certan node. Even f frst acket has small OWD, second acket s OWD (denoted as OWD_2) may be small or large as n Fgure 2 (b) and (c). Based on ths assumton, Mn_OWD_1 chooses the smallest OWD of frst ackets, and ths wll overestmate or underestmate the caacty when OWD_2 value s small or large, resectvely. Low_OWD_1 method calculates the average of these two cases, and therefore t wll be more accurate than Mn_OWD_1 method, when tme slots are not fully flled u. When tme slots are fully flled u, the standard devaton of caactes, calculated from each acket ar, s the lowest. Therefore we can detect the roer IP acket sze. When roer IP acket sze s used, the above Mn_OWD_1 and Low_OWD_1 methods show almost same caacty. B. Packet bundle (PB) Packet bundle method reduces caacty measurement tme. To fll u a certan lnk s tme slot, sender transmts 100 DH5

3 Fgure 3. BlueProbe Packet Bundle Method ackets at the same tme wthout delay and recever calculates dsersons of adjacent ackets. We check dsersons of every two adjacent ackets and regard the longer one as the start of tme slot. If dsersons are relatvely small (dfference to average s smaller than standard devaton), that means those ackets are transmtted n the same tme slot. If dsersons are relatvely long (dfference to average s bgger than standard devaton), that means those ackets are transmtted n dfferent tme slots. We choose these ackets as the start onts of tme slots. Caacty can be calculated as the total acket sze transmtted between the two consecutve start onts dvded by the sum of dsersons of the same erod. Fgure 3 shows detals of ths method. Dsersons D2 and D4 are longer than D1 and D2. So, we assume tme slots are started at the begnnng of acket 3 and 5 that have dsersons of D2 and D4. Caacty s calculated as (2*DH5)/(D3+D4). C. Packet bundle and ng (PB+PING) Ths method s at for the temorary scatternet connecton. Because Bluetooth scatternets are not always mantaned, they are connected at certan tmes but are dsconnected at other tmes. So, we use ng to check the exstence of a ath between source and destnaton. If there s a ath, acket bundle method s used to calculate the current caacty n a few seconds, and then ng s used agan to detect future dsconnecton. If the connecton stays longer than certan erod (usually several mnutes), the caacty s re-calculated usng the acket bundle method agan. Wth ths aroach, we can calculate the eak caacty when connecton s made and the average caacty as ( C D ) / D. The erod caacty s C and the duraton of erod s D. In dsconnected erod, C s 0. Thus PB+PING can be aled to a moble stuaton n whch nodes are frequently connected and dsconnected. IV. CAPACITY ANALYSIS Caacty of a sngle lnk n Bluetooth Scatternet s estmated lke the followngs. A. Bluetooth Scatternet Lnk Caacty In [4], throughut s calculated lke the followngs. θ = C mn ( f q ) (1) (, j) ( s, d ) mn ( f (, j) ( s, d ) j q ) j j j denotes the smallest usable bandwdth orton on the lnks of a connecton (s,d) (.e the bottleneck), whle qj s the acket success rate (PSR) of the lnk (, j). C s the maxmum caacty of a Bluetooth rado lnk. If a node has several lnks and lnk (, j) s used as a tmesharng method, node s total caacty s dstrbuted to each lnk. fj s calculated as the caacty of lnk (,j) dvded by the number of flows that ass ths lnk. Lnk caacty deends on the number of lnks connected to a certan node and swtchng tme (only on brdge node). Lnk caacty l s calculated lke the followngs. l = 1 / + α (2) l l N slave N master = 1 / σ + α (3) /( N master + 1) l Fgure 4. BlueZ Protocol Stack = 1 σ + α (4) mb mb _ m 1/( N master + 1) mb ) / = ( σ N + α (5) slave mb _ m l s the lnk caacty of a ure conet lnk. Lnks connected to slaves are sharng the caacty of master. α s are extra caactes f other lnks connected to a same node do not use ther maxmum caactes. For examle, three slaves are connected to one master. One lnk uses DH5 acket n one drecton and DH1 acket n the other drecton. Other lnks use DH1 ackets for both drectons. In ths case, addtonal 5 DH1 ackets (5 slots total) are transmtted for one DH5 acket transmsson (5 slots). So, l = 5 /(5 + 5) = In (1), l = 1/ 3 +α. So, α = l s the lnk caacty of a slave brdge. Slave brdge s actng as several masters slaves. So, a slave brdge node s caacty s dvded by the number of ts masters. Certan length tme slots are allocated from each master and the swtchng tme σ s allocated between tme slots. l s the lnk caacty of a master brdge when t s actng as a slave for that lnk. In ths case, the node s caacty s dvded by the number of ts masters lus one because the master brdge node has ts own conet. σ s the swtchng tme between tme slots. mb l s the lnk mb _ m caacty of a master brdge when t s actng as a master for that lnk. In ths case, the node s caacty s dvded by the number

4 of ts masters lus one as n l case. After that, the dvded caacty s allocated agan by the number of slaves n ts own conet. V. BLUETOOTH TESTBED In ths secton, we resent the Bluetooth Testbed envronment that we used for evaluatng our aroach. We used BlueZ Bluetooth rotocol stack for Lnux [8] and Belkn Bluetooth USB Adators (F8T003v). BlueZ conssts of HCI Core, HCI USB devce drver, L2CAP rotocol module, BNEP confguraton, and testng utltes. BlueZ rotocol stack s descrbed n Fgure 4. Belkn Bluetooth USB Adators use CSR Bluecore2 ch and suort lmted scatternet that can have u to two masters and seven slaves. We used and rogram n bluez-utls-2.13 [8] to make PAN (Personal Area Network) connecton (make lnks between nodes) and used brdge-utls [9] to brdge several connectons at a certan node. VI. RESULTS A. BlueProbe We evaluate BlueProbe methods wth AdHoc Probe and theoretcal results to verfy ts correctness. 1) Pconet 1-to-1 connecton To verfy BlueProbe, we frst used t for 1-to-1 connecton. There s only one connecton between Master and Slave to smlfy the test. BlueProbe PLA (Mn_OWD_1, Low_OWD_1), BlueProbe PB, and AdHoc Probe are used as caacty calculaton methods. L2test and Ierf (UDP, TCP) are used to calculate the real data throughut. Theoretcal calculaton s also used to comare aganst the results. Results are shown n Fgure 5. AdHoc Probe shows overestmaton for Slave-to-Master transfer. However, BlueProbe PLA shows almost same result as the real measurements (L2test and Ierf_UDP) n both Master-to-Slave and Slave-to-Master cases. BlueProbe PB shows slghtly lower caacty than the real measurements. Packet bundle method makes traffc fully use u caacty n a short erod. Usually, α n secton IV s 0, but t ncreases when there s no other traffc. Because of ths short erod, α s not fully ncreased. Theoretcal caacty s based on asymmetrc lnk usage of DH5 n one drecton and DH1 n the other. It assumes α s fully ncreased. However, t does not coner the rocessng and the queung delays n each node and thus t s always hgher than real measurements. 2) Pconet and Scatternet 2 Hos Connecton Smlar tests are erformed for 2 hos connectons. 3 knds of connecton tyes (S-M-S, M-MB-S, and M-SB-M) are used as n Fgure 7 (a), and both transfer drectons are used for M-MB-S case. L2test only suorts one-ho connecton, and theoretcal calculaton requres α and σ values n secton IV whch are deendent on Bluetooth chs and nterconnecton methods. Thus they are not used for ths test. In all cases, AdHoc Probe shows overestmatons because t calculates the maxmum osle caacty. BlueProbe PLA and PB show the caactes very close to the real measurement (Ierf). Results are shown n Fgure 6. B. Mult-ho Connecton Several connectons are selected for mult-ho tests as n Fgure 7 and results are shown n Fgure 8. 1) 2 Hos Connecton In 2 hos connectons, S-M-S (2H1) case (one conet) has hgher ath caacty than others. M-MB-S (2H2) and M-SB-M (2H3) cases are nterconnectons of conets va Master Brdge and Slave Brdge, resectvely. Caacty of a sngle conet (2H1) s much hgher than that of nterconnecton cases (2H2 and 2H3) because there s no conet swtchng tme σ n 2H1. Interconnecton va Master Brdge case (2H2) shows more than twce the caacty of nterconnecton va Slave Brdge (2H3). Slave brdge should wat for each master s oll ackets n snff slot before transmttng ackets, whereas Master brdge should wat only one master s oll acket [10]. Thus ther caactes are dfferent. 2) 3 Hos Connecton S-M-MB-S (3H1) case uses one Master brdge, M-MB-MB-S (3H2) case uses two Master brdges, and S-M-SB-M (3H3) uses one Slave Brdge. The 3H1 shows hgher caacty than 3H2 because t uses one less brdge. Even f 3H3 uses one brdge, t shows lower caacty than 3H2 case that uses two brdges.ths result shows that the caacty deends more on the tye of brdge than the number of brdges. Fgure 5. 1-to-1 Connecton Fgure 6. 2 hos Connecton

5 Fgure 7. Mult-hos Connecton Selectons 3) 4 Hos Connecton M-MB-MB-MB-S (4H1) case uses three Master Brdges, S-M-MB-MB-S (4H2) case uses two Master Brdges, and S-M-SB-M-S uses one Slave Brdge. Even f 4H1 uses one more Master Brdge than 4H2, the caactes are almost same. Ths shows that the n long-ho connectons, master brdges are as effcent as a sngle conet. Moreover, 4H1 and 4H2 cases show hgher caactes than 4H3 case. Ths result also shows that the caacty deends more on the tye of brdge. 4) 5 Hos Connecton M-MB-MB-MB-MB-S (5H1) case uses 4 Master Brdges but shows hgher caacty than that of S-M-MB-SB-M-S (5H2) case that uses one Master Brdge and one Slave Brdge. 5H1 uses 5 hos connectons but shows hgher caacty than that of 4H3 case. Ths result shows that the nterconnecton method s more mortant than the ho length. C. Effcent Bluetooth Pconet Interconnecton Method Three nterconnecton methods are used as n Fgure 9. In the fgure, left es are orgnal conets and rght es are nterconnected conets (Scatternet or multle new conets). There are two stages, such as Pconet Stage and Interconnecton Stage. Same duratons are used for both stages. After the duraton exres, one stage wll change to the other one. Addtonal connecton and setu tme s requred to change stages. We assume two alcaton flows (1 to 4, 3 to 2) exst. The flows cannot transfer acket durng Pconet Stage. BlueProbe PB+PING method s used to measure caacty. Due to frequent connectons and dsconnectons, other caacty measurement methods are not alcable. PB+PING can measure caacty n a few seconds n Interconnecton Stage and t also fnds out the duraton of Interconnecton Stage to calculate the eak and average caactes. Results are shown n Fgure 10. Multle 1-to-1 connecton Fgure 8. Mult-hos Connecton cases show hgher caactes than those of scatternet cases (va Master Brdge or Slave Brdge) n both Peak and Average. Even f 1-to-1 case has longer connecton setu tme, t suorts multle transfers durng Interconnecton Stage and therefore t has hgher eak and average caactes. D. Cross Traffc Cross Traffc can share a certan node or a certan lnk. UDP Cross traffc s generated by Ierf rogram for ths test. 1) Node Sharng Cross Traffc 5 knds of (Traffc, Cross traffc) cases n Fgure 11 (a) are used for ths test. Results are shown n Fgure 12. When cross traffc throughut s 0, all cases show ther eak values because maxmum α values are used. When cross traffc ncreases, caacty decreases but t s not changed a lot after cross traffc reaches a certan rate. We choose maxmum cross traffc throughut as 355kbs based on the theoretcal maxmum caacty of a sngle lnk of 1-to-4 (1 master, 4 slaves) conet connecton that has one 2-ho flow. Even f cross traffc reaches 355kbs, cross traffc UDP ackets are droed and thus the throughut calculated by the recever s same as the caacty calculated by BlueProbe. Ths result shows that the caacty can be changed by nterconnecton tye and BlueProbe can be aled to node sharng cross traffc cases. 2) Lnk Sharng Cross Traffc Traffc can share a lnk as n Fgure 11 (b). BlueProbe PLA and PB methods are used to comare results. Also the receved cross traffc throughut usng Ierf s used to comare BlueProbe methods. Results are shown n Fgure 13. Fgure 9. Pconet Interconnecton Selectons Fgure 10. Pconet Interconnecton

6 Fgure 11. Cross Traffc Selectons When cross traffc throughut s 0, caactes are at the hghest because α s used at ts maxmum. When cross traffc s at 10kbs, caactes decrease as α s reduced. After that, caactes become stable untl cross traffc reaches 355 kbs. Ths result shows that BlueProbe can also be aled to lnk sharng cross traffc cases. VII. CONCLUSION In ths aer, we resent a caacty measurement tool, BlueProbe, tuned for TDMA style rotocol wth or wthout cross traffc. It combnes three methods such as PLA, PB, and PB+PING. When nterconnectng conets usng brdges, caactes calculated usng PLA and PB methods are almost same as the real measurements. In one-ho connecton case, PLA shows better result than PB whch shows underestmaton. However, PLA method takes long tme (several mnutes) whereas PB takes very short tme (several seconds). PB+PING s the best and only choce when connecton s not ermanently mantaned. Caacty measurements on mult-ho connectons show that nterconnecton va Master brdge s better than va Slave brdge. Because of that, longer ho length connecton shows hgher caacty than shorter one. Thus roer choce of brdge tye s more mortant than ho length and Slave Brdge should be avoded f osle. Fgure 12. Cross Traffc (Node) Interconnectons of conets show that multle 1-to-1 connectons have hgher caacty than connectons va Master Brdge or Slave Brdge. Therefore, temorary 1-to-1 connectons are also effcent ways for nter-conet transfers. In the future, we lan to measure caacty on moble envronments. PB+PING method shows ts caablty to measure caacty for temorary connectons, and thus t can be aled to moble stuatons. We wll also try to use BlueProbe to other TMDA rotocols, such as IEEE and IEEE REFERENCES [1] Bluetooth SIG,. Bluetooth Secfcaton v2.0, 2004 [2] Lng-Jyh Chen, Tony Sun, Guang Yang, Medy Young Sanadd, and Maro Gerla, Ad Hoc Probe:Path Caatcy Probng n Wreless Ad Hoc Networks, IEEE Internatonal Conference on Wreless Internet (WICON), 2005 [3] Roht. Kaoor, Lng-Jyh Chen, L Lao, Maro Gerla, and Medy Young Sanadd, CaProbe: A smle and accurate caacty estmaton technque, Proceedngs of ACM SIGCOMM, [4] Constantnos Dovrols, Parameswaran Ramanathan, and Davd Moore What do acket dserson technques measure?, IEEE Conference of Comuter Communcaton (Infocom), [5] Casaba Kss Kallo, Sewook Jung, Lng-Jyh Chen, Mauro Brunato, and Maro Gerla, Throughut, energy and ath length tradeoffs n Bluetooth scatternets, IEEE Internatonal Conference on Communcatons (ICC), [6] Stefano Basagn and Chara Petrol, A scatternet Formaton rotocol for ad hoc networks of Bluetooth devces, IEEE Vehcular Technology Conference (VTC), 2002 [7] Leng Huang, Hongyuan Chen, T.V.L.N. Svakumar, Tsuyosh Kashma, and Kaoru Sezak, Imact of Toology on Bluetooth Scatternet, Internatonal Journal of Pervasve Comutng and Communcatons, 2005 [8] BlueZ Bluetooth rotocol stack for Lnux, htt:// [9] Lnux Ethernet Brdgng software, htt://brdge.sourceforge.net/ [10] Smon Baatz, Matthas Frank, Carmen Kuhl, Peter Martn, Chrstoh Scholz, Adatve Scatternet Suort for Bluetooth usng Snff Mode, IEEE Conference on Local Comuter Networks (LCN), 2001 Fgure 13. Cross Traffc (Lnk)

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

A Scheduling Algorithm of Periodic Messages for Hard Real-time Communications on a Switched Ethernet

A Scheduling Algorithm of Periodic Messages for Hard Real-time Communications on a Switched Ethernet IJCSNS Internatonal Journal of Comuter Scence and Networ Securty VOL.6 No.5B May 26 A Schedulng Algorthm of Perodc Messages for Hard eal-tme Communcatons on a Swtched Ethernet Hee Chan Lee and Myung Kyun

More information

Broadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2)

Broadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2) Broadcast Tme Synchronzaton Algorthm for Wreless Sensor Networs Chaonong Xu )2)3), Le Zhao )2), Yongun Xu )2) and Xaowe L )2) ) Key Laboratory of Comuter Archtecture, Insttute of Comutng Technology Chnese

More information

E-DEEC- Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN

E-DEEC- Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN 21 1st Internatonal Conference on Parallel, Dstrbuted and Grd Comutng (PDGC - 21) E-DEEC- Enhanced Dstrbuted Energy Effcent Clusterng Scheme for heterogeneous WSN Parul San Deartment of Comuter Scence

More information

Advanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs

Advanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs Advanced LEACH: A Statc Clusterng-based Heteroneous Routng Protocol for WSNs A. Iqbal 1, M. Akbar 1, N. Javad 1, S. H. Bouk 1, M. Ilah 1, R. D. Khan 2 1 COMSATS Insttute of Informaton Technology, Islamabad,

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

Real-time interactive applications

Real-time interactive applications Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet

More information

An Inter-Piconet Scheduling Algorithm for Bluetooth Scatternets

An Inter-Piconet Scheduling Algorithm for Bluetooth Scatternets An Inter-Pconet Schedulng Algorthm for Bluetooth Scatternets Suman Saha, Mtsuj Matsumoto GITS, Waseda Unversty, Tokyo, Japan suman@asag.waseda.jp, mmatsumoto@waseda.jp Abstract Bluetooth s a wreless specfcaton

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Modeling TCP Throughput: A Simple Model and its Empirical Validation

Modeling TCP Throughput: A Simple Model and its Empirical Validation Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Jtendra Padhye, Vctor Frou, Don Towsley, Jm Kuros 0-09-9 Presenter: Ognjen Vukovc Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Motvaton

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

An Approach for Congestion Control in Sensor Network Using Priority Based Application*

An Approach for Congestion Control in Sensor Network Using Priority Based Application* An Aroach for Congeston Control n Sensor Network Usng Prorty Based Alcaton* Md. Obadur Rahman Muhammad Mostafa Monowar Byung Goo Cho Choong Seon Hong Deartment of Comuter Engneerng, Kyung Hee Unversty

More information

Efficient Content Distribution in Wireless P2P Networks

Efficient Content Distribution in Wireless P2P Networks Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,

More information

On the Exact Analysis of Bluetooth Scheduling Algorithms

On the Exact Analysis of Bluetooth Scheduling Algorithms On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of

More information

Gentle Early Detection Algorithm

Gentle Early Detection Algorithm Gentle Early etecton Algorthm Hussen Abdel-jaber 1, Mahmoud Abdeljaber 2, Hussen Abu Mansour 1, Malak El-Amr 1 1 Faculty of Comuter Studes, eartment of Informaton Technology and Comutng, Arab Oen Unversty,

More information

Traffic Classification Method Based On Data Stream Fingerprint

Traffic Classification Method Based On Data Stream Fingerprint 5th nternatonal Conference on Advanced Materals and Comuter Scence (CAMCS 6) Traffc Classfcaton Method Based On Data Stream Fngerrnt Kefe Cheng, a, Guohu We,b and Xangjun Ma3,c College of Comuter Scence

More information

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons

More information

A Base Station-Coordinated Contention Resolution for IEEE PMP Networks

A Base Station-Coordinated Contention Resolution for IEEE PMP Networks A Base Staton-Coordnated Contenton Resoluton for IEEE 802.6 PMP Networks Wenyan Lu, Weja Ja,2, Wenfeng Du, and Ldong Ln 2 School of Informaton Scence & Engneerng, Central South Unversty, Changsha, 40083,

More information

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

More information

DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261

More information

CS 268: Lecture 8 Router Support for Congestion Control

CS 268: Lecture 8 Router Support for Congestion Control CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

More information

Adaptive Network Resource Management in IEEE Wireless Random Access MAC

Adaptive Network Resource Management in IEEE Wireless Random Access MAC Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More information

Time-based Adaptive Retry for Wireless Video Streaming 1

Time-based Adaptive Retry for Wireless Video Streaming 1 Tme-based Adatve etry for Wreless Vdeo Streamng 1 Me-Hsuan Lu, Peter Steenkste, and Tsuhan Chen Electrcal and Comuter Engneerng Deartment Carnege Mellon Unversty 5000 Forbes Avenue, Pttsburgh PA 15213-3890,

More information

EFT: a high throughput routing metric for IEEE s wireless mesh networks

EFT: a high throughput routing metric for IEEE s wireless mesh networks Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon

More information

Efficient Caching of Video Content to an Architecture of Proxies according to a Frequency-Based Cache Management Policy

Efficient Caching of Video Content to an Architecture of Proxies according to a Frequency-Based Cache Management Policy Effcent Cachng of Vdeo Content to an Archtecture of Proxes accordng to a Frequency-Based Cache Management Polcy Anna Satsou, Mchael Pateraks Laboratory of Informaton and Comuter Networks Deartment of Electronc

More information

Making Name-Based Content Routing More Efficient than Link-State Routing

Making Name-Based Content Routing More Efficient than Link-State Routing Makng Name-Based Content Routng More Effcent than Lnk-State Routng Ehsan Hemmat and J.J. Garca-Luna-Aceves, Comuter Engneerng Deartment, UC Santa Cruz, Santa Cruz, CA 95064 PARC, Palo Alto, CA 94304 {

More information

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO

More information

Mobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks

Mobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks Moblty Based Routng Protocol wth MAC Collson Improvement n Vehcular Ad Hoc Networks Zhhao Dng, Pny Ren, Qnghe Du Shaanx Smart Networks and Ubqutous Access Rearch Center School of Electronc and Informaton

More information

Wireless Sensor Network Localization Research

Wireless Sensor Network Localization Research Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,

More information

A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks

A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. Ctaton nformaton: DOI.9/TMC.25.2388476, IEEE Transactons

More information

Efficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks

Efficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks 1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.

More information

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,

More information

BANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION

BANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION

More information

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks 12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

THE MAP MATCHING ALGORITHM OF GPS DATA WITH RELATIVELY LONG POLLING TIME INTERVALS

THE MAP MATCHING ALGORITHM OF GPS DATA WITH RELATIVELY LONG POLLING TIME INTERVALS THE MA MATCHING ALGORITHM OF GS DATA WITH RELATIVELY LONG OLLING TIME INTERVALS Jae-seok YANG Graduate Student Graduate School of Engneerng Seoul Natonal Unversty San56-, Shllm-dong, Gwanak-gu, Seoul,

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs

More information

I 2 C: A Holistic Approach to Prolong the Sensor Network Lifetime

I 2 C: A Holistic Approach to Prolong the Sensor Network Lifetime : A Holstc Aroach to Prolong the Sensor Network Lfetme Yang Peng, Z L, Da Qao, and Wensheng Zhang Iowa State Unversty, Ames, IA 511 {yangeng, zl, da, wzhang}@astate.edu Abstract We resent a novel holstc

More information

Analytical Performance Analysis of Network- Processor-Based Application Designs

Analytical Performance Analysis of Network- Processor-Based Application Designs Analytcal Performance Analyss of Networ- Processor-Based Alcaton Desgns e Lu BMC Software Inc. Waltham, MA e Wang Unversty of Massachusetts Lowell, MA Abstract Networ rocessors (NP) are desgned to rovde

More information

Performance Evaluation of Multicast Video Streaming via P2P Networking

Performance Evaluation of Multicast Video Streaming via P2P Networking Secal Issue of Internatonal Journal of Comuter Alcatons (0975 8887) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 erformance Evaluaton of Multcast Vdeo Streamng va 2 etworkng

More information

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS Jura Macha and Peter Brda Unversty of Zlna, Faculty of Electrcal Engneerng, Department of Telecommuncatons

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

A Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks

A Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks 11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda

More information

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

A Novel TCP with Dynamic Burst-Contention Loss Notification over OBS Networks

A Novel TCP with Dynamic Burst-Contention Loss Notification over OBS Networks A Novel TCP wth Dynamc Burst-Contenton Loss Notfcaton over OB Networks Basem hhada 1 and Pn-Han Ho 1, 1 D. R. Chraton chool of Comuter cence, Unversty of Waterloo, Waterloo, Canada Deartment of Electrcal

More information

Cost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network

Cost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network Cost-Effectve Lfetme Predcton Based Routng Protocol for Wreless Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, MOHAMMED ABUL HASAN 2,M. LUTFAR RAHMAN Faculty of Scence and IT, Daffodl Internatonal

More information

Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks

Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks Smulator for Energy Effcent Clusterng n Moble Ad Hoc Networks Amt Kumar 1 Dhrendra Srvastav 2 and Suchsmta Chnara 3 Department of Computer Scence and Engneerng, Natonal Insttute of Technology, Rourkela,

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

Synchronous Distributed Wireless Network Emulator for High-Speed Mobility: Implementation and Evaluation

Synchronous Distributed Wireless Network Emulator for High-Speed Mobility: Implementation and Evaluation Synchronous Dstrbuted Wreless Network Emulator for Hgh-Speed Moblty: Implementaton and Evaluaton Mnoru Kozum, Tomoch Ebata Yokohama Research Laboratory, Htach, Ltd., 292 Yoshda-cho, Totsuka-ku, Yokohama,

More information

A Fair MAC Algorithm with Dynamic Priority for e WLANs

A Fair MAC Algorithm with Dynamic Priority for e WLANs 29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

Transmit Power Control Algorithms in IEEE h Based Networks

Transmit Power Control Algorithms in IEEE h Based Networks Transmt Power Control Algorthms n IEEE 82.h Based Networks Andreas J. Könsgen, Zakr Hossan, Carmelta Görg Department of Communcaton Networks Center for Informaton and Communcaton Technology (IKOM) Unversty

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,

More information

USER CLASS BASED QoS DIFFERENTIATION IN e WLAN

USER CLASS BASED QoS DIFFERENTIATION IN e WLAN USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee

More information

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES ISSN 1819-668 www.arpnjournals.com PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES L. Audah 1, A.A.M. Kamal 1, J. Abdullah 1, S.A. Hamzah 1 and M.A.A. Razak 2 1 Optcal Communcaton

More information

Cost-Effective Lifetime Prediction Based Routing Protocol for Mobile Ad Hoc Network

Cost-Effective Lifetime Prediction Based Routing Protocol for Mobile Ad Hoc Network Cost-Effectve Lfetme Predcton Based Routng Protocol for Moble Ad Hoc Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, M. LUTFAR RAHMAN 1 Faculty of Scence and Informaton Technology, Daffodl Internatonal

More information

A Variable Threats Based Self-Organization Scheme for Wireless Sensor Networks

A Variable Threats Based Self-Organization Scheme for Wireless Sensor Networks 009 Thrd Internatonal Conference on Sensor Technologes and Applcatons A Varable Threats Based Self-Organzaton Scheme for Wreless Sensor Networks Jan Zhong School of Computer Scence and Informaton Technology

More information

WIRELESS communication technology has gained widespread

WIRELESS communication technology has gained widespread 616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor

More information

Interclass Collision Protection for IEEE e Wireless LANs

Interclass Collision Protection for IEEE e Wireless LANs Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based

More information

High Utility Video Surveillance System on Public Transport using WiMAX technology

High Utility Video Surveillance System on Public Transport using WiMAX technology Edth Cowan Unversty Research Onlne ECU Publcatons Pre. 2011 2010 Hgh Utlty Vdeo Survellance System on Publc Transport usng WMAX technology Iftekhar Ahmad Edth Cowan Unversty Daryoush Habb Edth Cowan Unversty

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Gateway Algorithm for Fair Bandwidth Sharing

Gateway Algorithm for Fair Bandwidth Sharing Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca

More information

Convolutional interleaver for unequal error protection of turbo codes

Convolutional interleaver for unequal error protection of turbo codes Convolutonal nterleaver for unequal error protecton of turbo codes Sna Vaf, Tadeusz Wysock, Ian Burnett Unversty of Wollongong, SW 2522, Australa E-mal:{sv39,wysock,an_burnett}@uow.edu.au Abstract: Ths

More information

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

Inter-protocol fairness between

Inter-protocol fairness between Inter-protocol farness between TCP New Reno and TCP Westwood+ Nels Möller, Chad Barakat, Konstantn Avrachenkov, and Etan Altman KTH, School of Electrcal Engneerng SE- 44, Sweden Emal: nels@ee.kth.se INRIA

More information

A new Algorithm for Lossless Compression applied to two-dimensional Static Images

A new Algorithm for Lossless Compression applied to two-dimensional Static Images A new Algorthm for Lossless Comresson aled to two-dmensonal Statc Images JUAN IGNACIO LARRAURI Deartment of Technology Industral Unversty of Deusto Avda. Unversdades, 4. 48007 Blbao SPAIN larrau@deusto.es

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Network-Driven Layered Multicast with IPv6

Network-Driven Layered Multicast with IPv6 Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.

More information

Optimum Number of RLC Retransmissions for Best TCP Performance in UTRAN

Optimum Number of RLC Retransmissions for Best TCP Performance in UTRAN Optmum Number of RLC Retransmssons for Best TCP Performance n UTRAN Olver De Mey, Laurent Schumacher, Xaver Dubos {ode,lsc,xdubos}@nfo.fundp.ac.be Computer Scence Insttute, The Unversty of Namur (FUNDP)

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Achievable Bandwidth Estimation for Stations in Multi-Rate IEEE WLAN Cells

Achievable Bandwidth Estimation for Stations in Multi-Rate IEEE WLAN Cells Achevable Bandwdth Estmaton for Statons n Mult-Rate IEEE 802. WLAN Cells Eduard Garca, Davd Vamonte, Rafael Vdal and Josep Paradells Wreless Networks Group - echncal Unversty of Catalona (UPC) {eduardg,

More information

Detection of masquerade attacks on Wireless Sensor Networks

Detection of masquerade attacks on Wireless Sensor Networks Detecton of masquerade attacks on Wreless Sensor Networks Vjay Bhuse,, Ajay Gupta and Ala Al-Fuqaha Department of Computer Scence, Western Mchgan Unversty, alamazoo, MI 49008 Insttute of Securty Technology

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol 2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen

More information

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate

More information

Fibre-Optic AWG-based Real-Time Networks

Fibre-Optic AWG-based Real-Time Networks Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se

More information

Applied Mathematics. Elixir Appl. Math. 84 (2015)

Applied Mathematics. Elixir Appl. Math. 84 (2015) 3341 V.Vnoba and S.M.Chthra/ Elxr Appl. Math. 84 (015) 3341-3349 Avalable onlne at www.elxrpublshers.com (Elxr Internatonal Journal) Appled Mathematcs Elxr Appl. Math. 84 (015) 3341-3349 Bayesan Inference

More information

IJCTA Nov-Dec 2016 Available

IJCTA Nov-Dec 2016 Available Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,

More information

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:

More information

Shared Running Buffer Based Proxy Caching of Streaming Sessions

Shared Running Buffer Based Proxy Caching of Streaming Sessions Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,

More information

Available online at ScienceDirect. Procedia Computer Science 103 (2017 )

Available online at  ScienceDirect. Procedia Computer Science 103 (2017 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 03 (207 ) 562 568 XIIth Internatonal Symposum «Intellgent Systems», INTELS 6, 5-7 October 206, Moscow, Russa Retral queueng systems

More information

IR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication

IR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication Cyber Journals: ultdscplnary Journals n Scence and Technology, Journal of Selected Areas n Telecommuncatons (JSAT), August Edton, 2 IR-HARQ vs. Jont Channel-Network codng for Cooperatve Wreless Communcaton

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble

More information

Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism

Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 Regonal Load Balancng Crcutous Bandwdth Allocaton ethod Based on Dynamc Aucton echansm Wang Chao, Zhang Dalong, Ran Xaomn atonal Dgtal

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Distributed Grid based Robust Clustering Protocol for Mobile Sensor Networks

Distributed Grid based Robust Clustering Protocol for Mobile Sensor Networks 414 The Internatonal Arab Journal of Informaton Technology, Vol. 8, No. 4, October 011 Dstrbuted Grd based Robust Clusterng Protocol for Moble Sensor Networks Shahzad Al and Sajjad Madan Department of

More information

VFH*: Local Obstacle Avoidance with Look-Ahead Verification

VFH*: Local Obstacle Avoidance with Look-Ahead Verification 2000 IEEE Internatonal Conference on Robotcs and Automaton, San Francsco, CA, Aprl 24-28, 2000, pp. 2505-25 VFH*: Local Obstacle Avodance wth Look-Ahead Verfcaton Iwan Ulrch and Johann Borensten The Unversty

More information