Evaluating Different One to Many Packet Delivery Schemes for UMTS

Size: px
Start display at page:

Download "Evaluating Different One to Many Packet Delivery Schemes for UMTS"

Transcription

1 Evaluatng Dfferent One to Many Packet Delvery Schemes for UMTS Antonos Alexou, Dmtros Antonells, Chrstos Bouras Research Academc Computer Technology Insttute, Greece and Computer Engneerng and Informatcs Dept., Unv. of Patras, Greece Abstract It s known that multcastng s an effcent method of supportng group communcaton as t allows the transmsson of packets to multple destnatons usng fewer network resources. Thus, servce provders are ncreasngly nterested n supportng multcast communcatons over wreless networks and n partcular over UMTS. Multcastng s a more effcent method of supportng group communcaton than uncastng or broadcastng, as t allows transmsson and routng of packets to multple destnatons usng fewer network resources. In ths paper the three above mentoned methods of supportng group communcaton are analyzed n terms of ther performance. 1. Introducton UMTS consttutes the thrd generaton of cellular wreless networks whch ams to provde hgh-speed data access along wth real tme voce calls. Wreless data s one of the major boosters of wreless communcatons and one of the man motvatons of the next generaton standards. The multcast transmsson of real tme multmeda data s an mportant component of many current and future emergng Internet applcatons. The multcast mechansm offers effcent multdestnaton delvery, snce data s transmtted n an optmal manner wth mnmal packet duplcaton [8]. Several multcast mechansms for UMTS have been proposed n the lterature. In [1], the authors dscuss the use of commonly deployed IP multcast protocols n UMTS networks. However, n [2] the authors do not adopt the use of IP multcast protocols for multcast routng n UMTS and present an alternatve soluton. The scheme presented n [2], can be mplemented wthn the exstng network nodes wth only trval changes to the standard locaton update and packetforwardng procedures. Furthermore n [3], a multcast mechansm for crcut-swtched GSM and UMTS networks s outlned, whle n [4], an end to end multcast mechansm for software upgrades n UMTS s analyzed. Fnally, the Multmeda Broadcast / Multcast Servce (MBMS) framework of UMTS s currently beng standardzed by the 3GPP [5]. In ths paper, we present an overvew of three dfferent one to many packet delvery schemes for UMTS, namely Broadcast, Multple Uncast and Multcast. We analytcally present these schemes and analyze ther performance n terms of the packet delvery cost and the scalablty of each scheme. The parameters used for the evaluaton of the schemes are the number of the multcast users, the densty of the multcast users dstrbuton wthn the cells, the number of cells wth multcast users n comparson to those that have no multcast users and fnally the number of the total packets per multcast sesson. The paper s structured as follows. Secton 2 provdes an overvew of the UMTS. In Secton 3, we present a number of packet delvery schemes for UMTS wth the cost analyss of each scheme, whle Secton 4 presents some numercal results that characterze the schemes. Fnally, some concludng remarks and planned next steps are brefly descrbed. 2. Overvew of the UMTS A UMTS network conssts of two land-based network segments: the Core Network (CN) and the UMTS Terrestral Rado-Access Network (UTRAN) (Fgure 1). The CN s responsble for routng calls and data connectons to the external networks, whle the UTRAN handles all rado-related functonaltes. The CN conssts of two servce domans: the Crcut- Swtched (CS) and the Packet-Swtched (PS) servce doman. The CS doman provdes access to the PSTN/ISDN, whle the PS doman provdes access to the IP-based networks. In the remander of ths paper, we wll focus on the UMTS PS mechansm. The PS porton of the CN n UMTS conssts of two General Packet Rado Servce (GPRS) Support Nodes (GSNs),

2 named Gateway GPRS Support Node (GGSN) and Servng GPRS Support Node (SGSN). An SGSN s connected to the GGSN va the Gn nterface and to UTRAN va the Iu nterface. The UTRAN conssts of the Rado Network Controller (RNC) and Node B, that consttutes the base staton and provdes rado coverage to a cell (Fgure 1). Node B s connected to the user equpment (UE) va the Uu nterface and to the RNC va the Iub nterface. The GGSN nteracts wth external Packet Data Networks (PDNs) through the G nterface. The GGSN provdes connectvty wth IP networks. The Broadcast/Multcast Servce Center (BM-SC) serves as the entry pont of data delvery for nternal sources [8]. In the UMTS PS doman, the cells are grouped nto Routng Areas (RAs), whle the cells n an RA are further grouped nto UTRAN Regstraton Areas (URAs) [7]. Fgure 1. Packet delvery n UMTS 3. One to many packet delvery schemes for UMTS In ths secton we present an evaluaton, n terms of the telecommuncaton costs, of three dfferent one to many delvery schemes. These schemes nclude the Multple Uncast, the Broadcast and the Multcast scheme. More specfcally, we consder a general UMTS network topology provdng a flexble mechansm to dfferentate the user dstrbuton. The analyss presented n the followng paragraphs, covers the forwardng of the data packets between the BM-SC and the Node Bs. Regardng the transmsson of the packets over the Uu nterface, t may be performed on common (ex. Broadcast Channel - BCH), dedcated (Dedcated Channel - DCH) or shared transport channels (ex. Hgh Speed Downlnk Shared Channel - HS-DSCH). DCH s a pont-to-pont channel and hence, t suffers from the neffcences of requrng multple DCHs to carry common data to a group of users. BCH, s a shared channel, thus, even wth a large number of multcast recevers, only one BCH s requred for a multcast servce n the cell. Furthermore, a transport channel named HS-DSCH has been ntroduced as the prmary rado bearer n Release 5 of UMTS wth better performance than BCH.[8]. We consder a subset of a UMTS network consstng of a sngle GGSN and N SGSN nodes connected to the GGSN. Furthermore, each SGSN manages a number of N ra RAs. Each RA conssts of a number of N rnc RNC nodes, whle each RNC node manages a number of N ura URAs. Fnally, each URA conssts of N nodeb cells. The total number of RAs, RNCs, URAs and cells are: NRNC = NSGSN Nra (1) NRNC = NSGSN Nra Nrnc (2) NURA = NSGSN Nra Nrnc Nura (3) NNODEB = NSGSN Nra Nrnc Nura Nnodeb (4) The total transmsson cost for packet delveres ncludng pagng s consdered as the performance metrc. The cost for pagng s dfferentated from the cost for packet delveres. We make a further dstncton between processng costs at nodes and transmsson costs on lnks, both for pagng and packet delveres. Smlar to [6], we assume that there s a cost assocated wth each lnk and each node of the network, both for pagng and packet delveres. We apply the followng notatons: D gs Transmsson cost between GGSN and SGSG D sr Transmsson cost between SGSN and RNC D rb Transmsson cost between RNC and Node B D BCH Transmsson cost over the ar wth BCHs D DCH Transmsson cost over the ar wth DCHs D HS-DSCH Transmsson cost over the ar wth HS-DSCHs S sr Cost of pagng between SGSN and RNC S rb Cost of pagng between RNC and Node B S a Cost of pagng over the ar p g Processng cost of packet delvery at GGSN p s Processng cost of packet delvery at SGSN p r Processng cost of packet delvery at RNC p b Processng cost of packet delvery at Node B a s Processng cost of pagng at SGSN Processng cost of pagng at RNC a r a b Processng cost of pagng at Node B The total number of the multcast UEs n the network s denoted by N UE. For the cost analyss, we defne the multcast sesson arrval rate as λ s and the total packets per multcast sesson as N p. In partcular, multcast sesson arrval rate follows a Posson dstrbuton wth λ=λ s. Furthermore, we assume that the probablty that a UE s n PMM detached state s P DET, the probablty that a UE s n PMM dle/rrc dle state s P RA, the probablty that a UE s n PMM connected/rrc URA connected state s P URA, and fnally the probablty that a UE s n PMM

3 connected/rrc cell-connected state s P cell. In the followng analyss, we present a probablstc method that calculates the number of multcast users n the network (N UE ), the number of SGSNs that serve multcast users (n SGSN ), the number of RNCs that serve multcast users (n RNC ) and fnally the number of Node Bs that serve multcast members (n NODEB ). As n [3], we classfy the RAs nto L RA categores. For 1 L RA there are N RAs of class. Therefore, the total number of RAs wthn the network LRA s NRA = N = 1. Suppose that the dstrbuton of the multcast users among the classes of RAs follows the Posson dstrbuton wth λ = θ RA. In general, the probablty that k exactly multcast users resde n the RAs of class s calculated as follows: θ k e ( θ ) p( k, θ ) = (5) k! Thus, the probablty none of the RAs of class serves multcast users s p( 0, θ ) = e θ, whch n turn means that the probablty at least one multcast user s served by the RAs of class s p = 1 p( 0, θ ) = 1 e θ. Snce every class conssts of N RA RAs, the total number of the RAs n the class, that serve multcast RA users s N 1 e θ. Thus, the total number of the RAs of every class that serve multcast users s: n L RA RA RA = N 1 e θ = 1 (6) where θ represents the number of multcast users for the N RA RAs of class. If there are n RA RAs that serve multcast users, the probablty an SGSN does not have any such RA s: NRA Nra NRA psgsn =, nra NRA Nra (7) nra nra Based on eqn (7), the total number of SGSNs that serve multcast users can be calculated as follows: nsgsn = NSGSN ( 1 psgsn ). The total number of multcast users s: LRA UE = 1 N = N θ (8) where θ s the number of users n a RA of class. As n [2], we assume that all RNCs wthn a servce area of class have the same multcast populaton dstrbuton densty as n the RA case. Based on a unform densty dstrbuton wthn a sngle RA, the multcast populaton of an RNC wthn the servce area of a class RA s θ ( RNC ) = θ N. The total rnc ( RNC ) number of RNCs of class s N = N Nrnc. Assumng that the number of RA categores s equal to the number of RNC categores (L RNC =L RA ), the total number of RNCs that serve multcast users s: n L ( RNC ) RNC RNC RNC = N 1 e θ = 1 (9) The same are appled to the cells wthn the servce area of an RNC. The average number of multcast users for a sngle cell of class s ( B) ( RNC) θ = θ ( Nura Nnodeb). The number of Node Bs belongng to class s N ( B) ( RNC) = N Nura Nnodeb. Assumng that the number of the RNC categores s equal to the number of the Node B categores (L RNC =L NODEB ), the total number of Node Bs that serve multcast users s: L ( B ) NODEB B nnodeb = N 1 e θ (10) = Broadcast scheme (Bs) In ths scheme the packets are broadcasted to all the nodes of the network and no pagng procedure s requred. Regardng the transmsson over the ar, the transport channel that s used n ths scheme s the BCH. It s obvous that the total cost of the packet delvery s ndependent from the number of the multcast users N UE. The total cost of the packet delvery to the multcast users s computed as follows: Bs = [ pg + NSGSN( Dgs+ ps) + NRNC( Dsr + pr) + (11) + N ( D + p + D )] N λ NODEB rb b BCH p s 3.2. Multple Uncast scheme (MUs) Wth MUs, each packet s forwarded once to each member of the group separately. For nstance, n Fgure 1, Node B2 would receve three duplcate copes of the same multcast packet from the RNC1. It s obvous that the cost of a sngle packet delvery to a multcast user depends on ts MM and RRC state. If the multcast member s n PMM connected/rrc cell-connected state, then there s no need for a pagng procedure nether from the SGSN nor from the servng RNC. In ths case, the packet delvery cost s: Ccell = pg + Dgs + ps + Dsr + pr + Drb + pb (12) If the multcast member s n PMM connected/rrc URA connected state, then the RNC must frst page all the cells wthn the URA n whch moble users resde and then proceeds to the data transfer. The cost for pagng such a multcast member s: C = N S + a + S + S + a + S + a (13) URA nodeb rb b a a b rb r

4 λ λ Pcell Ccell Np + PURA CURA + Ccell Np + PRA CRA + Ccell Np + Pcell + PURA + PRA Np D DCH NUE λs MUs= Pcell Ccell Np + PURA CURA + Ccell Np + PRA CRA + Ccell Np NUE s + nnodeb DBCH Np λs Pcell Ccell Np + PURA CURA + Ccell Np + PRA CRA + Ccell Np NUE s + nnodeb DHS DSCH Np λs (15) (16) (17) Table 1. Chosen parameters values D gs D sr D rb D BCH D DCH D HS-DSCH S sr S rb S a p g p s p r p b a s a r a b λ s P RA P URA P cell /3 4/ If the multcast member s n PMM dle/rrc dle state, the SGSN only stores the dentty of the RA n whch the user s located. Therefore, all cells n the RA must be paged. The cost for pagng such a multcast member s: CRA = Nrnc ( Ssr + ar ) + ( Nrnc Nura Nnodeb ) (14) ( Srb + ab + Sa ) + Sa + ab + Srb + ar + Ssr + as Snce the pagng procedure s performed on the frst packet of a data sesson, the total cost of the MUs s derved from the equatons 15, 16 and 17 for the three dfferent transport channels, where n NODEB represent the number of Node Bs that serve multcast users Multcast scheme (Ms) In Ms, the SGSN and the RNC forward a sngle copy of each multcast packet to those RNCs or Node Bs respectvely that are servng multcast users. After the correct multcast packet recepton at the Node Bs that serve multcast users, the Node Bs transmt the packets to the multcast users va DCHs, BCHs or HS- DSCHs. All multcast users that are n PMM dle/rrc dle or PMM connected/rrc URA connected state must be paged. After the pagng procedure, the RNC stores the locaton of any UE at a cell level. The cost for ths pagng procedure s gven by eqn(13) and eqn(14) respectvely. The total cost for the Ms s derved from the eqn(18) where n SGSN, n RNC, n NODEB represent the number of SGSNs, RNCs, Node Bs respectvely that serve multcast users. Ms = [ pg + nsgsn ( Dgs + ps) + nrnc ( Dsr + pr) + + nnodeb ( Drb + pb ) + Y] Np λs + (18) + P C + P C N λ RA RA URA URA UE s nnodeb DBCH f channel = BCH where Y = NUE DDCH f channel = DCH nnodeb DHS DSCH f channel = HSDSCH 4. Results We try to estmate the cost of each scheme assumng a general network topology wth N SGSN =10, N ra =10, N rnc =10, N ura =5 and N nodeb =5. In the followng paragraphs we evaluate the three methods n functon of a number of parameters. These parameters nclude: The number of the packets per multcast sesson The densty of the users dstrbuton n cells. The number of cells wth multcast users compared to those that have no multcast users. The packet transmsson cost (D xx ) n any segment of the UMTS network depends on two parameters: the number of hops between the edge nodes of ths network segment and the capacty of the lnk of the network segment. Ths means that D gs = l gs /k gs, D sr =l sr /k sr and D rb =l rb /k rb. Parameter k xx represents the profle of the correspondng lnk between two UMTS network nodes. More specfcally, n the hgh capacty lnks at the CN, the values of k xx are greater than the correspondng values n the low capacty lnks at UTRAN. For the cost analyss and wthout loss of generalty, we assume that the dstance between the GGSN and SGSN s 6 hops, the dstance between SGSN and RNC s 3 hops and the dstance between RNC and NODE B s 1 hop. The above parameters as well as the values of the k xx are presented n detal n Table 2. Regardng the transmsson cost of pagng (S xx ) n the segments of the UMTS network, t s calculated n a smlar way as the packet transmsson cost (D xx ). More specfcally, S xx s a fracton of the transmsson cost (D xx ) and n our case we assume that t s three tmes smaller than D xx. Table 2. Transmsson costs n the lnks Lnk Lnk Capacty Number of hops Transmsson cost GGSN - SGSN k gs = 0.5 l gs = 6 D gs = 12 SGSN - RNC k sr = 0.5 l sr = 3 D sr = 6 RNC Node B k rb = 0.2 l rb = 1 D rb = 5 As t s shown n Table 1, the values for the

5 transmsson costs of the packet delvery over the ar wth each of the three transport channels are dfferent. More specfcally, the transmsson cost over the ar wth BCH (D BCH ) s bgger than the D HS-DSCH, whch n turn s bgger than the transmsson cost of the packet delvery over the ar wth DCH (D DCH ). Ths occurs because the BCH requres hgh transmsson power n order to reach all the users wthn the coverage area even f they are not members of the multcast group. Addtonally, even f the HS-DSCH s shared among the users of a specfc sector, t s assocated wth one DCH whch means that the cost of the HS-DSCH s bgger than a sngle DCH. Furthermore, we have chosen approprately the probabltes P RA, P URA and P cell. More specfcally, the probablty that a UE s n PMM dle/rrc dle state s P RA =0.6. The probablty that a UE s n PMM connected/rrc URA connected state s P URA =0.2 and the probablty that a UE s n PMM connected/rrc cell-connected state s P cell =0.1. In the analyss, we assume that we have two classes of RAs. A class =1 RA has multcast user populaton of θ 1 = 1/δ and a class =2 RA has a multcast user populaton of θ 2 = δ. If δ>>1, the class =1 RA has a small multcast user populaton and the class =2 RA has a large multcast user populaton. Let α be the proporton of the class =1 RAs and (1-α) be the proporton of the class =2 RAs. Each RA of class {1,2} s n turn subdvded nto N rnc RNCs of the same class and smlarly, each RNC of class {1,2} s subdvded nto Nura N nodeb Node Bs of the same class. In Fgure 2 we plot the cost of the three schemes n functon of α, for dfferent values of δ. Snce n our model we consder three dfferent transport channels over the ar for the MUs and the Ms n the followng fgures only the channel wth the lowest cost of each scheme s presented and then we provde the comparson of the costs of every scheme usng dfferent transport channels n separate fgures. Generally, we observe from Fgure 2, that the cost of the broadcast scheme s constant, whle the costs of the other two schemes decrease as α ncreases. Snce δ>>1, there are not any multcast users n a RA of class =1 and there are many multcast members n a RA of class =2. Furthermore, as α ncreases, the number of class =1 RAs wth no multcast users ncreases and hence, the costs of the MUs and the Ms decrease as t s shown n Fgure 2. For δ=100 the Ms has the lowest cost whle the Bs has the hgher cost ndependently of the value of α. Ths occurs because n small values of α, there are many RAs wth large multcast users populaton (class =2 RAs). However, the value of δ=100 results to a small number of multcast users wthn the network and hence, the costs of MUs and Ms are kept n lower values than the value of the cost of the Bs. In addton, f δ=1000 (Fgure 2b), the number of multcast users wthn the network s ncreased and ths results to an ncreased cost for the MUs. The costs of the other two schemes behave as follows: for α<0.45 the Bs has the lowest cost and for α>0.45 the Ms has the lowest cost. The latter occurs because for small values of α and ncreased value of δ, the number of the multcast users wthn the network s ncreased and furthermore, there are many class =2 RAs n the network wth large multcast users populaton. Ths means that the multcast users wthn the network are spread to many RAs and hence, the cost of the pagng whch s requred n the Ms s ncreased, makng the Ms neffcent for ths network topology. On the other hand, when the value of α s ncreased, the number of class =1 RAs wth no multcast users s ncreased and all the multcast users are located n a small number of class =2 RAs. Thus, the Ms s more effcent than the Bs as t s shown n Fgure 2b. Fgure 2. Total cost for the schemes α wth N p =500. δ=100, δ=1000 Fgure 3 presents the costs of the three schemes n functon of δ for α=0.1 (Fgure 3a) and α=0.9 (Fgure 3b). Our frst observaton s that the cost of the Bs s constant, whle the costs of the other two schemes

6 ncrease as δ ncreases. Furthermore, f α converges to 1 (Fgure 3b) the number of class =2 RAs n the network s small. Thus, the multcast users are located n a small number of RAs and as a result, the cost of the Ms s kept n lower values than the cost of the MUs and the Bs (Fgure 3b). The later, obvously, has the hgher cost as t s shown n Fgure 3b. On the other hand, Fgure 3a shows that the Ms performs effcently f δ<400, but t s outperformed by the Bs for δ>400. Ths occurs because the value of α s small and the number of class =2 RAs wth large multcast users populaton s ncreased and hence, as the number of multcast users n a class =2 RA ncreases, there are many users among many cells n the network makng the Bs more approprate for the packet delvery. representng the cost of the Ms s smaller than the gradent of the lne representng the Bs, accordng to eqn(11) and eqn(18). Smlarly, for values N p <1400, the Ms s more effcent than the Bs. Fgure 4. Costs of the schemes aganst N p Fgure 3. Total cost for the three schemes n functon of δ wth N p =500. α=0.1, α=0.9 The costs of the three schemes n functon of the number of packets per multcast sesson are presented n Fgure 4 for δ=1000 and α=0.1. Our frst observaton s that as N p ncreases, the total cost of each scheme ncreases. When α=0.1 and due to the bg value of δ (δ=1000) the number of multcast users n the network s ncreased. The ncreased number of multcast users n the network makes the MUs neffcent for the data transmsson. Regardng the other two schemes, we can observe that, for values N p <1400, the cost of the Bs s smaller than the cost of the Ms. Ths occurs because the gradent of the lne Fgure 5. Total cost for the Ms and MUs n functon of α wth N p =50. δ=1000, δ=20 In Fgure 5, the total costs for the Ms and MUs usng dfferent transport channels n functon of α, are presented. Generally, the cost of each scheme decreases as α ncreases. Ths occurs because the ncrement of α, and the bg value of δ ental that the

7 number of RAs that have small populaton ncreases. Thus, the total number of the multcast users decreases and the total cost for the data transmsson decreases. More specfcally, n Fgure 5a, we observe that the cost of the Ms usng DCH s bgger than the cost of each of the other transport channels. On the other hand, the BCH and HS-DSCH that are shared channels are more effcent and hence, the correspondng costs are smaller. The opposte occurs n Fgure 5b where the value of δ s small, whch means that the number of multcast users s small. In ths case, the DCH s the more effcent transport channel over the ar. Fgure 6. Total cost for the Ms and MUs n functon of δ wth N p =500. α=0.5, α=0.1. In Fgure 6, the total costs for the Ms and MUs usng dfferent transport channels over the ar n functon of δ are presented. More specfcally, n Fgure 6a, we observe that for small values of δ, the costs are small because there s a small number of multcast users n the network. Thus, we can use DCHs for the data transmsson over the ar whch reduces the cost of the scheme. On the other hand, bgger values of δ mply bgger number of multcast users n the network and hence, the use of shared channels such as HS-DSCH s more approprate. In Fgure 6b, we present only a small range of values for the parameter δ because the cost of the MUs usng the three transport channels s approxmately the same. More specfcally, the cost for the MUs usng HS-DSCH s smaller than the other for bg values of δ snce the number of the multcast users s bgger and the use of shared channels reduces the cost. On the other hand, for small values of δ, the number of the multcast users s small and hence, the use of DCHs for the data transmsson over the ar s the most effcent. 5. Conclusons and future work In ths paper, we have presented an overvew of three dfferent one to many packet delvery schemes for UMTS. These schemes nclude the Broadcast, the Multple Uncast and the Multcast scheme. We have analytcally presented these schemes and have analyzed ther performance n terms of the packet delvery cost and the scalablty of each scheme. The step that follows ths work s to carry out experments usng the NS-2 smulator. Ths means that we have to mplement the above presented one to many packet delvery schemes and confrm the relaton of the costs. 6. References [1] M. Hauge and O. Kure, Multcast n 3G networks: Employment of exstng IP multcast protocols n UMTS, n Proc. 5th ACM Internatonal Workshop Wreless Moble Multmeda, 2002, pp [2] R. Rummler, Y. Chung and H. Aghvam, Modelng and Analyss of an Effcent Multcast Mechansm for UMTS, IEEE Trans. on Vehcular Technology, vol. 54, no. 1, Jan. 2005, pp [3] Y. Ln, A multcast mechansm for moble networks, IEEE Communcaton Letters, vol. 5, Nov. 2001, pp [4] R. Rümmler and H. Aghvam, End-to-end IP multcast for software upgrades of reconfgurable user termnals wthn IMT-2000/UMTS networks, n Proc. IEEE ICC 02, vol. 1, New York, Apr./May 2002, pp [5] 3GPP, TS , V6.7.0, Multmeda Broadcast/Multcast Servce (MBMS); Archtecture and functonal descrpton. [6] J. S. Ho and I. F. Akyldz, Local anchor scheme for reducng sgnalng costs n personal communcatons networks, IEEE/ACM Trans. Networkng, vol. 4, Oct. 1996, pp [7] S. R. Yang and Y. B. Ln, Performance evaluaton of locaton management n UMTS, IEEE Trans. on Vehcular Technology, vol. 52, no. 6, Nov. 2003, pp [8] H. Holma, and A. Toskala, WCDMA for UMTS: Rado Access for Thrd Generaton Moble Communcatons, John Wley & Sons, 2003.

Cost Analysis of the MBMS Multicast Mode of UMTS

Cost Analysis of the MBMS Multicast Mode of UMTS Cost Analyss of the MBMS Multcast Mode of UMTS Antonos Alexou, Chrstos Bouras, Evangelos Rekkas Research Academc Computer Technology Insttute, Greece and Computer Engneerng and Informatcs Dept., Unv. of

More information

Multicast in UMTS: Evaluation and recommendations

Multicast in UMTS: Evaluation and recommendations WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wrel. Commun. Mob. Comput. 2008; 8:463 481 Publshed onlne 10 October 2006 n Wley InterScence (www.nterscence.wley.com).464 Multcast n UMTS: Evaluaton and recommendatons

More information

Cost Analysis and Efficient Radio Bearer Selection for Multicasting over UMTS

Cost Analysis and Efficient Radio Bearer Selection for Multicasting over UMTS Cost Analyss and Effcent Rado Bearer Selecton for Multcastng over UMTS Antonos Alexou, Chrstos Bouras, Vasleos Kokknos, Evangelos Rekkas Research Academc Computer Technology Insttute, Greece and Computer

More information

EVALUATION OF THE MULTICAST MODE OF MBMS

EVALUATION OF THE MULTICAST MODE OF MBMS EVALUATIO OF THE MULTICAST MODE OF MBMS Antonios Alexiou, Christos Bouras, Vasileios Kokkinos, Evangelos Rekkas Research Academic Computer Technology Institute, Greece and Computer Engineering and Informatics

More information

Calculation of the received voltage due to the radiation from multiple co-frequency sources

Calculation of the received voltage due to the radiation from multiple co-frequency sources Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons

More information

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty

More information

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com

More information

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,

More information

Resource Control for Elastic Traffic in CDMA Networks

Resource Control for Elastic Traffic in CDMA Networks Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact

More information

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET) A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport

More information

Topology Control for C-RAN Architecture Based on Complex Network

Topology Control for C-RAN Architecture Based on Complex Network Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton

More information

RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING

RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,

More information

Approximating User Distributions in WCDMA Networks Using 2-D Gaussian

Approximating User Distributions in WCDMA Networks Using 2-D Gaussian CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer

More information

MBMS Power Planning in Macro and Micro Cell Environments

MBMS Power Planning in Macro and Micro Cell Environments MBMS Power Planning in Macro and Micro Cell Environments Antonios Alexiou, Christos Bouras, Vasileios Kokkinos, Evangelos Rekkas Research Academic Computer Technology Institute, Greece and Computer Engineering

More information

QoS-Based Performance and Resource Management in 3G Wireless Networks in Realistic Environments

QoS-Based Performance and Resource Management in 3G Wireless Networks in Realistic Environments The Internatonal Arab Journal of Informaton Technology, Vol. 1, o. 1, January 213 1 QoS-Based Performance and Resource Management n 3G Wreless etworks n Realstc Envronments Aymen Issa Zrekat Department

More information

High Speed ADC Sampling Transients

High Speed ADC Sampling Transients Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.

More information

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout

More information

IEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES

IEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department

More information

Learning Ensembles of Convolutional Neural Networks

Learning Ensembles of Convolutional Neural Networks Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)

More information

10 9 Channel on time. sec

10 9 Channel on time. sec Blockng of dynamc multcast connectons n a sngle lnk COST 257TD(97)46 Joun Karvo 1, Jorma Vrtamo 2, Samul Aalto 2, Oll Martkanen 1 fjoun.karvo,jorma.vrtamo,samul.aalto,oll.martkaneng@hut.f Helsnk Unversty

More information

Providing Strict Quality of Service in HSDPA for real time services

Providing Strict Quality of Service in HSDPA for real time services Provdng Strct Qualty of Servce n HSDPA for real tme servces Joseph S. Gomes, Mra Yun, Hyeong-Ah Cho, Jae-Hoon Km 2, JungKyo Sohn 3, Hyeong-In Cho 3 Department of Computer Scence, George Washngton Unversty,

More information

Energy Efficiency Analysis of a Multichannel Wireless Access Protocol

Energy Efficiency Analysis of a Multichannel Wireless Access Protocol Energy Effcency Analyss of a Multchannel Wreless Access Protocol A. Chockalngam y, Wepng u, Mchele Zorz, and Laurence B. Mlsten Department of Electrcal and Computer Engneerng, Unversty of Calforna, San

More information

High Speed, Low Power And Area Efficient Carry-Select Adder

High Speed, Low Power And Area Efficient Carry-Select Adder Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs

More information

Keywords LTE, Uplink, Power Control, Fractional Power Control.

Keywords LTE, Uplink, Power Control, Fractional Power Control. Volume 3, Issue 6, June 2013 ISSN: 2277 128X Internatonal Journal of Advanced Research n Computer Scence and Software Engneerng Research Paper Avalable onlne at: www.jarcsse.com Uplnk Power Control Schemes

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Capacity improvement of the single mode air interface WCDMA FDD with relaying

Capacity improvement of the single mode air interface WCDMA FDD with relaying 2004 Internatonal Workshop on Wreless Ad-Hoc Networks Capacty mprovement of the sngle mode ar nterface WCDMA FDD wth relayng H. Nourzadeh, S. Nourzadeh and R. Tafazoll Centre for Comnurcaton Systems Research

More information

熊本大学学術リポジトリ. Kumamoto University Repositor

熊本大学学術リポジトリ. Kumamoto University Repositor 熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng

More information

A study of turbo codes for multilevel modulations in Gaussian and mobile channels

A study of turbo codes for multilevel modulations in Gaussian and mobile channels A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,

More information

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht 68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly

More information

Efficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques

Efficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department

More information

MODEL OF I UB INTERAFCE IN THE UMTS NETWORK

MODEL OF I UB INTERAFCE IN THE UMTS NETWORK POZNAN UNIVERSITY OF TECHNOLOGY ACADEMIC JOURNALS Macej STASIAK* Janusz WIEWIÓRA** Potr ZWIERZYKOWSKI* 2007 Poznańske Warsztaty Telekomunkacyjne Poznań 6-7 grudna 2007 MODEL OF I UB INTERAFCE IN THE UMTS

More information

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio 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. The Impact of Spectrum Sensng Frequency and Pacet- Loadng

More information

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,

More information

Graph Method for Solving Switched Capacitors Circuits

Graph Method for Solving Switched Capacitors Circuits Recent Advances n rcuts, ystems, gnal and Telecommuncatons Graph Method for olvng wtched apactors rcuts BHUMIL BRTNÍ Department of lectroncs and Informatcs ollege of Polytechncs Jhlava Tolstého 6, 586

More information

MTBF PREDICTION REPORT

MTBF PREDICTION REPORT MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0

More information

Traffic Modeling and Performance Evaluation in GSM/GPRS Networks

Traffic Modeling and Performance Evaluation in GSM/GPRS Networks Proceedngs of the 3th WSEAS Internatonal Conference on COMMUNICATIONS Traffc Modelng and Performance Evaluaton n GSM/ Networks Cornel Balnt, Georgeta Budura, Marza Eugen Poltehnca Unversty of Tmsoara Bd..

More information

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power 7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power

More information

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent

More information

Application of Intelligent Voltage Control System to Korean Power Systems

Application of Intelligent Voltage Control System to Korean Power Systems Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon

More information

Distributed Uplink Scheduling in EV-DO Rev. A Networks

Distributed Uplink Scheduling in EV-DO Rev. A Networks Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance

More information

Queuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks

Queuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks 1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna

More information

Context-aware Cluster Based Device-to-Device Communication to Serve Machine Type Communications

Context-aware Cluster Based Device-to-Device Communication to Serve Machine Type Communications Context-aware Cluster Based Devce-to-Devce Communcaton to Serve Machne Type Communcatons J Langha, Lu Man, Hans D. Schotten Char of Wreless Communcaton, Unversty of Kaserslautern, Germany {j,manlu,schotten}@et.un-kl.de

More information

An Improved Profile-Based Location Caching with Fixed Local Anchor Based on Group Deregistration for Wireless Networks

An Improved Profile-Based Location Caching with Fixed Local Anchor Based on Group Deregistration for Wireless Networks An Improved Prole-Based Locaton Cachng wth Fxed Local Anchor Based on Group Deregstraton or Wreless Networks Md. Kowsar Hossan, Mousume Bhowmck, Tumpa Ran Roy 3 Department o Computer Scence and Engneerng,

More information

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,

More information

Enhanced Uplink Scheduling for Continuous Connectivity in High Speed Packet Access Systems

Enhanced Uplink Scheduling for Continuous Connectivity in High Speed Packet Access Systems Int. J. Communcatons, Network and System Scences, 212, 5, 446-453 http://dx.do.org/1.4236/jcns.212.5855 Publshed Onlne August 212 (http://www.scrp.org/journal/jcns) Enhanced Uplnk Schedulng for Contnuous

More information

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks 74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham

More information

COMPARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HOP WIRELESS SENSOR NETWORKS 1

COMPARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HOP WIRELESS SENSOR NETWORKS 1 Internatonal Journal of Computer Networks & Communcatons (IJCNC), Vol., No.4, July 1 COMARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HO WIRELESS SENSOR NETWORKS 1 S. Mehta and K.S. Kwak UWB Wreless

More information

ETSI TS V8.4.0 ( )

ETSI TS V8.4.0 ( ) TS 100 959 V8.4.0 (2001-11) Techncal Specfcaton Dgtal cellular telecommuncatons system (Phase 2+); Modulaton (3GPP TS 05.04 verson 8.4.0 Release 1999) GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS R 1 TS 100

More information

Procedia Computer Science

Procedia Computer Science Proceda Computer Scence 3 (211) 714 72 Proceda Computer Scence (21) Proceda Computer Scence www.elsever.com/locate/proceda www.elsever.com/locate/proceda WCIT-21 Performance evaluaton of data delvery approaches

More information

Bit Error Probability of Cooperative Diversity for M-ary QAM OFDM-based system with Best Relay Selection

Bit Error Probability of Cooperative Diversity for M-ary QAM OFDM-based system with Best Relay Selection 011 Internatonal Conerence on Inormaton and Electroncs Engneerng IPCSIT vol.6 (011) (011) IACSIT Press, Sngapore Bt Error Proalty o Cooperatve Dversty or M-ary QAM OFDM-ased system wth Best Relay Selecton

More information

Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks

Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks Cooperatve Multcast Schedulng Scheme for IPTV Servce over IEEE 802.16 Networks Fen Hou 1, Ln X. Ca 1, James She 1, Pn-Han Ho 1, Xuemn (Sherman Shen 1, and Junshan Zhang 2 Unversty of Waterloo, Waterloo,

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,

More information

Delay Performance of Different MAC Schemes for Multihop Wireless Networks

Delay Performance of Different MAC Schemes for Multihop Wireless Networks Delay Performance of Dfferent MAC Schemes for Multhop Wreless Networks Mn Xe and Martn Haengg Department of Electrcal Engneerng Unversty of Notre Dame Notre Dame, IN 46556, USA Emal: {mxe,mhaengg}@nd.edu

More information

Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets

Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets Exact Probablstc Analyss of the Lmted Schedulng Algorthm for Symmetrcal Bluetooth Pconets Gl Zussman *, Ur Yechal 2, and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology,

More information

Distributed Channel Allocation Algorithm with Power Control

Distributed Channel Allocation Algorithm with Power Control Dstrbuted Channel Allocaton Algorthm wth Power Control Shaoj N Helsnk Unversty of Technology, Insttute of Rado Communcatons, Communcatons Laboratory, Otakaar 5, 0150 Espoo, Fnland. E-mal: n@tltu.hut.f

More information

On the Optimal Solution for BER Performance Improvement in Dual-Hop OFDM Relay Systems

On the Optimal Solution for BER Performance Improvement in Dual-Hop OFDM Relay Systems IEEE WCNC 2014 - Workshop on Wreless Evoluton Beyond 2020 On the Optmal Soluton for BER Performance Improvement n Dual-Hop OFD Relay Systems Ens Kocan, lca Peanovc-Dursc Faculty of Electrcal Engneerng

More information

A Pervasive Indoor-Outdoor Positioning System

A Pervasive Indoor-Outdoor Positioning System 70 JOURNAL OF NETWORKS, VOL. 3, NO. 8, NOVEMBER 008 A Pervasve Indoor-Outdoor Postonng System Lonel Reyero 1, Glles Delsle 1 INRS-EMT, Unversté du Québec, Montréal, Canada, H5A 1K6, lonel.reyero@telecom.com

More information

A Benchmark for D2D in Cellular Networks: The Importance of Information

A Benchmark for D2D in Cellular Networks: The Importance of Information A Benchmark for D2D n Cellular Networks: The Importance of Informaton Yğt Özcan, Catherne Rosenberg Unversty of Waterloo {yozcan,cath}@uwaterloo.ca Fabrce Gullemn Orange Labs, France fabrce.gullemn@orange.com

More information

HUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1

HUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1 Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,

More information

Research Article Modeling and Performance Analyses of Hybrid Cellular and Broadcasting Networks

Research Article Modeling and Performance Analyses of Hybrid Cellular and Broadcasting Networks Internatonal Journal of Dgtal Multmeda Broadcastng Volume 29, Artcle ID 32973, 9 pages do:.55/29/32973 Research Artcle Modelng and Performance Analyses of Hybrd Cellular and Broadcastng Networks Peter

More information

NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION

NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona

More information

Impact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas

Impact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas Impact of Interference Model on Capacty n CDMA Cellular Networks Robert Akl, D.Sc. Asad Parvez Unversty of North Texas Outlne Introducton to CDMA networks Average nterference model Actual nterference model

More information

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to

More information

Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection

Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection Wreless Sensor Network, 010,, 807-814 do:10.436/wsn.010.11097 Publshed Onlne November 010 (http://www.scrp.org/journal/wsn) Range-Based Localzaton n Wreless Networks Usng Densty-Based Outler Detecton Abstract

More information

AN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2

AN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2 AN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2 Markus Radmrsch Inst. f. Allgem. Nachrchtentechnk, Unv. Hannover, Appelstr. 9a, 3167 Hannover, Germany Tel.: +49-511-762

More information

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of

More information

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985 NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT

More information

A Power Control Scheme for Efficient Radio Bearer Selection in MBMS

A Power Control Scheme for Efficient Radio Bearer Selection in MBMS A Power Control Scheme for Efficient Radio Bearer Selection in MBMS Antonios Alexiou, Christos Bouras, Evangelos Rekkas Research Academic Computer Technology Institute, Greece and Computer Engineering

More information

ASFALT: Ā S imple F āult-tolerant Signature-based L ocalization T echnique for Emergency Sensor Networks

ASFALT: Ā S imple F āult-tolerant Signature-based L ocalization T echnique for Emergency Sensor Networks ASFALT: Ā S mple F āult-tolerant Sgnature-based L ocalzaton T echnque for Emergency Sensor Networks Murtuza Jadlwala, Shambhu Upadhyaya and Mank Taneja State Unversty of New York at Buffalo Department

More information

Index Terms Adaptive modulation, Adaptive FEC, Packet Error Rate, Performance.

Index Terms Adaptive modulation, Adaptive FEC, Packet Error Rate, Performance. ANALYTICAL COMPARISON OF THE PERFORMANCE OF ADAPTIVE MODULATION AND CODING IN WIRELESS NETWORK UNDER RAYLEIGH FADING 723 Sab Y.M. BANDIRI, Rafael M.S. BRAGA and Danlo H. SPADOTI Federal Unversty of Itajubá

More information

JOURNAL OF SELECTED AREAS IN COMMUNICATIONS 1

JOURNAL OF SELECTED AREAS IN COMMUNICATIONS 1 JOURNAL OF SELECTED AREAS IN COMMUNICATIONS On the Interdependence of Dstrbuted Topology Control and Geographcal Routng n Ad Hoc and Sensor Networks Tommaso Meloda, Student Member, IEEE, Daro Pompl, Student

More information

Estimation of spectrum requirements for mobile networks with self-similar traffic, handover, and frequency reuse

Estimation of spectrum requirements for mobile networks with self-similar traffic, handover, and frequency reuse Moble Informaton Systems 6 (2010) 281 291 281 DOI 10.3233/MIS-2010-0104 IOS Press Estmaton of spectrum requrements for moble networks wth self-smlar traffc, handover, and frequency reuse Won Seok Yang

More information

Parameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation

Parameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation 1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected

More information

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal

More information

An Alternation Diffusion LMS Estimation Strategy over Wireless Sensor Network

An Alternation Diffusion LMS Estimation Strategy over Wireless Sensor Network Progress In Electromagnetcs Research M, Vol. 70, 135 143, 2018 An Alternaton Dffuson LMS Estmaton Strategy over Wreless Sensor Network Ln L * and Donghu L Abstract Ths paper presents a dstrbuted estmaton

More information

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014 Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,

More information

antenna antenna (4.139)

antenna antenna (4.139) .6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,

More information

Research Article Performance Evaluation of Uplink Delay-Tolerant Packet Service in IEEE Based Networks

Research Article Performance Evaluation of Uplink Delay-Tolerant Packet Service in IEEE Based Networks Hndaw Publshng Corporaton EURASIP Journal on Wreless Communcatons and Networkng Volume 2011, Artcle ID 549492, 12 pages do:10.1155/2011/549492 Research Artcle Performance Evaluaton of Uplnk Delay-Tolerant

More information

An efficient cluster-based power saving scheme for wireless sensor networks

An efficient cluster-based power saving scheme for wireless sensor networks RESEARCH Open Access An effcent cluster-based power savng scheme for wreless sensor networks Jau-Yang Chang * and Pe-Hao Ju Abstract In ths artcle, effcent power savng scheme and correspondng algorthm

More information

A Tractable Framework for Coverage and Outage in Heterogeneous Cellular Networks

A Tractable Framework for Coverage and Outage in Heterogeneous Cellular Networks A Tractable Framework for Coverage and Outage n Heterogeneous Cellular Networks Harpreet S. Dhllon, Radha Krshna Gant and Jeffrey G. Andrews Wreless Networkng and Communcatons Group WNCG, Department of

More information

Th P5 13 Elastic Envelope Inversion SUMMARY. J.R. Luo* (Xi'an Jiaotong University), R.S. Wu (UC Santa Cruz) & J.H. Gao (Xi'an Jiaotong University)

Th P5 13 Elastic Envelope Inversion SUMMARY. J.R. Luo* (Xi'an Jiaotong University), R.S. Wu (UC Santa Cruz) & J.H. Gao (Xi'an Jiaotong University) -4 June 5 IFEMA Madrd h P5 3 Elastc Envelope Inverson J.R. Luo* (X'an Jaotong Unversty), R.S. Wu (UC Santa Cruz) & J.H. Gao (X'an Jaotong Unversty) SUMMARY We developed the elastc envelope nverson method.

More information

Approximating Blocking Rates in UMTS Radio Networks

Approximating Blocking Rates in UMTS Radio Networks Approxmatng s n UMTS Rado Networks Dplomarbet vorgelegt von Franzska Ryll Matrkel-Nr.: 19 88 98 be Prof. Dr. Martn Grötschel Technsche Unverstät Berln Fakultät II: Mathematk und Naturwssenschaften Insttut

More information

An Optimal Model and Solution of Deployment of Airships for High Altitude Platforms

An Optimal Model and Solution of Deployment of Airships for High Altitude Platforms An Optmal Model and Soluton of Deployment of Arshps for Hgh Alttude Platforms Xuyu Wang, Xnbo Gao, Ru Zong, Peng Cheng. VIPS Lab, School of Electronc Engneerng, Xdan Unversty, X an 77, Chna. Department

More information

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems 0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of

More information

ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS. Milan Kovacevic and Anthony Acampora. Center for Telecommunications Research

ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS. Milan Kovacevic and Anthony Acampora. Center for Telecommunications Research ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS Mlan Kovacevc Anthony Acampora Department of Electrcal Engneerng Center for Telecommuncatons Research Columba Unversty, New York, NY 0027-6699 Abstract

More information

Power Efficient Radio Bearer Selection in MBMS Multicast Mode

Power Efficient Radio Bearer Selection in MBMS Multicast Mode Power Efficient Radio Bearer Selection in MBMS Multicast Mode Antonios Alexiou, Christos Bouras, Vasileios Kokkinos, Evangelos Rekkas Research Academic Computer Technology Institute, Greece and Computer

More information

Energy-efficient Subcarrier Allocation in SC-FDMA Wireless Networks based on Multilateral Model of Bargaining

Energy-efficient Subcarrier Allocation in SC-FDMA Wireless Networks based on Multilateral Model of Bargaining etworkng 03 569707 Energy-effcent Subcarrer Allocaton n SC-FDMA Wreless etworks based on Multlateral Model of Barganng Ern Elen Tsropoulou Aggelos Kapoukaks and Symeon apavasslou School of Electrcal and

More information

Fractional Base Station Cooperation Cellular Network

Fractional Base Station Cooperation Cellular Network Fractonal Base Staton Cooperaton Cellular Network Naok usashma Tokyo Insttute of Technoloy, Department of Electrcal and Electronc Enneern, Arak-Sakauch Laboratores. Contents Backround Cell-ede problem

More information

An Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG

An Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG An Adaptve Over-current Protecton Scheme for MV Dstrbuton Networks Includng DG S.A.M. Javadan Islamc Azad Unversty s.a.m.javadan@gmal.com M.-R. Haghfam Tarbat Modares Unversty haghfam@modares.ac.r P. Barazandeh

More information

OFDM AF Variable Gain Relay System for the Next Generation Mobile Cellular Networks

OFDM AF Variable Gain Relay System for the Next Generation Mobile Cellular Networks 4 Telfor Journal Vol. 4 No.. OFDM AF Varable Gan Relay System for the Next Generaton Moble Cellular Networs Ens Kocan Member IEEE and Mlca Pejanovc-Djursc Member IEEE Abstract In ths paper we present analytcal

More information

Performance Analysis of Split Preamble RAN Over-load Protocol for M2M Communications in Cellular Networks

Performance Analysis of Split Preamble RAN Over-load Protocol for M2M Communications in Cellular Networks Performance Analyss of Splt Preamble RAN Over-load Protocol for M2M Communcatons n Cellular Networks arxv:158.7742v1 [cs.it] 31 Aug 215 Ameneh Pourmoghadas, Member, IEEE, P. G. Poonacha Internatonal Insttute

More information

Clustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks

Clustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 21 proceedngs Clusterng Based Fractonal Frequency Reuse and Far Resource

More information

Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks

Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks Optmal Local Topology Knowledge for Energy Effcent Geographcal Routng n Sensor Networks Tommaso Meloda, Daro Pompl, Ian F. Akyldz Broadband and Wreless Networkng Laboratory School of Electrcal and Computer

More information

Coverage of Hybrid Terrestrial-Satellite Location in Mobile Communications

Coverage of Hybrid Terrestrial-Satellite Location in Mobile Communications Coverage of Hybrd Terrestral-Satellte ocaton n Moble Communcatons Francsco Barceló, Israel Martín-Escalona Dept. d Engnyera Telemàtca de la Unverstat Poltècnca de Catalunya c/ Jord Grona 1-3, Barcelona

More information

An Analytical Method for Centroid Computing and Its Application in Wireless Localization

An Analytical Method for Centroid Computing and Its Application in Wireless Localization An Analytcal Method for Centrod Computng and Its Applcaton n Wreless Localzaton Xue Jun L School of Engneerng Auckland Unversty of Technology, New Zealand Emal: xuejun.l@aut.ac.nz Abstract Ths paper presents

More information

Multicast Transmission Protocol for Multimedia Services in Smart Home

Multicast Transmission Protocol for Multimedia Services in Smart Home Multcast Transmsson rotocol for Multmeda Servces n Smart Home Jeong-Jun Suh, Shan Guo Quan, Jong-Ku ar, Jong Hyu ar 3 and Young Yong Km Department of Electrcal and Electronc Engneerng, Yonse nversty 34

More information

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and

More information

Simulation of Distributed Power-Flow Controller (Dpfc)

Simulation of Distributed Power-Flow Controller (Dpfc) RESEARCH INVENTY: Internatonal Journal of Engneerng and Scence ISBN: 2319-6483, ISSN: 2278-4721, Vol. 2, Issue 1 (January 2013), PP 25-32 www.researchnventy.com Smulaton of Dstrbuted Power-Flow Controller

More information