Asynchronous TDMA ad hoc networks: Scheduling and Performance
|
|
- Alan Moody
- 6 years ago
- Views:
Transcription
1 Communcaton Networks Asynchronous TDMA ad hoc networks: Schedulng and Performance THEODOROS SALONIDIS AND LEANDROS TASSIULAS, Department of Electrcal and Computer Engneerng, Unversty of Maryland at College Park, MD 74, USA Department of Computer and Communcaton Engneerng, Unversty of Thessaly, 38 Volos, Greece Abstract. A common assumpton of TDMA-based wreless ad hoc networks s the exstence of network-wde slot synchronzaton. Such a mechansm s dffcult to support n practce. In asynchronous TDMA systems, each lnk uses a local tme slot reference provded by the hardware clock tck of one of the node endponts. Inevtably, slots are wasted when nodes swtch tme slot references. Ths restrcts the rate allocatons that can be supported when compared to a perfectly synchronzed system. To address ths practcal performance ssue we frst ntroduce a general framework for conflct-free schedulng n asynchronous TDMA networks. We then propose schedulng algorthms that target overhead mnmzaton whle ensurng upper bounds on the generated overhead. Through extensve smulatons the algorthm performances are evaluated n the context of Bluetooth, a wreless technology that operates accordng to the asynchronous TDMA communcaton paradgm. INTRODUCTION An ad hoc network s a collecton of nodes equpped wth rado nterfaces that forms an all-wreless communcaton nfrastructure. Tme dvson multple access (TDMA) s a well-known medum access method for determnstc bandwdth allocaton and qualty of servce (QoS) provson n ad hoc networks. Accordng to TDMA, bandwdth can be allocated to the network lnks usng a schedule of perod T system slots. Durng every slot, several lnks are actvated for transmsson such that no conflcts occur at the ntended recevers. The number of conflct-free slots each lnk receves wthn a system perod determnes ts allocated bandwdth. A central performance ssue that arses n a TDMAbased ad hoc network s determnaton of the set of allocatons that can be acheved. Consder a set of end-toend sessons sharng the network. The sum of ther requested rates over the lnks they traverse creates a demand allocaton for each lnk. A lnk rate allocaton r = [r l ] ( r l ) sfeasble f the network can allocate τ l = r l T system conflct-free slots to every lnk l wthout exceedng the system perod. Determnaton of feasblty An earler verson of ths paper has been presented at the Internatonal Conference on Moble Multmeda Communcatons (MoMuC) 3. Ths work has been supported by the Ar Force Offce of Scentfc Research (AFOSR) under contract F s ntrnscally coupled wth an optmzaton problem: to fnd a lnk schedule of mnmum perod that realzes slot allocaton τ =[τ l ]. If the mnmum perod does not exceed T system slots, then the allocaton s feasble. Optmal lnk schedulng n wreless ad hoc networks has been nvestgated for varous nterference constrants [, ]. These studes (along wth most proposed centralzed or dstrbuted TDMA protocols for slotted ad hoc networks) assume the slot boundares are provded by a global system clock. System-wde synchronzaton mechansm s not always possble to mplement n the dstrbuted ad hoc network settng. Bluetooth [3] s a new TDMA wreless technology that enables the formaton of ad hoc networks called scatternets. Bluetooth has the nterestng feature of not supportng a global slot synchronzaton mechansm. Instead, tme slot reference s provded locally for each lnk by one of the node endponts actng as master, whle the other endpont acts as slave. In ths asynchronous TDMA settng, slots are wasted when nodes swtch tme references as slaves. Ths phenomenon has been reported n the scatternet schedulng lterature [4, 5, 6, 7, 8] as a source of overhead. However, no formal study has examned ts effect on the system s ablty to allocate bandwdth. Ths ablty s lnked to the determnaton of the regon of feasble allocatons or, equvalently, to the soluton of the related lnk schedule optmzaton problem.
2 T. Salonds and L. Tassulas Due to the slots wasted for tme reference algnment, the mnmum perod requred for realzng a gven allocaton wll be greater than the one requred by a perfectly synchronzed system. Ths ncrease can be seen as overhead due to system asynchroncty. Based on ths observaton, we can use a two-step procedure to address the optmal lnk schedulng problem for asynchronous TDMA ad hoc networks. The frst step nvolves fndng a mnmumperod synchronzed schedule for the demand allocaton at hand. The second step, our contrbuton, utlzes the optmal synchronzed schedule to fnd an asynchronous schedule of mnmum overhead. The amount of overhead depends on the order by whch lnks are actvated n the reference synchronzed schedule. We frst ntroduce an algorthm that derves a mnmumoverhead asynchronous schedule for a specfc orderng. The generated overhead s always upper-bounded regardless of orderng or network confguraton. Usng ths algorthm, t s possble to determne the optmal soluton by searchng over all possble orderngs. Ths leads to a combnatoral problem where exhaustve search s not feasble for large problem szes. To ths end, we ntroduce a heurstc algorthm of reduced complexty. The heurstc performs excellent for problem szes where an optmal soluton can be computed. When ths s not possble, we nvestgate the effect of varous system parameters on the generated overhead and use the upper bound as the performance measure. The paper s organzed as follows: secton ntroduces a conflct-free schedulng framework for asynchronous TDMA ad hoc networks. In sectons 3, 4 and 5 the problem s ntroduced and formulated and the overhead mnmzaton algorthms are presented. Secton 6 evaluates the algorthms performances n varous scenaros. secton 7 places the proposed framework n the specfc context of Bluetooth. Secton 8 concludes the paper. ASYNCHRONOUS TDMA COMMUNICA- TION MODEL Every wreless node has a hardware clock that determnes the tmng of the rado transcever. The clocks of dfferent nodes are not synchronzed and no mechansm exsts for synchronzng them under a global tme reference. The ad hoc network s represented as a drected graph G(N,E). A drected edge from node to node j sgnfes that and j are wthn range and communcate on a lnk where has been assgned the role of master and j the role of slave. The system s slotted and carres pont-to-pont traffc each transmsson slot carres a packet destned to a sngle outgong lnk. The tme slot reference of each lnk s provded locally by the hardware clock of the master node endpont. Each slot supports full-duplex communcaton ntated by the master: Durng the frst part of the slot the master polls a slave; durng the second part a slave responds f polled by the master. Each node has a sngle rado transcever and can communcate (transmt or receve) to at most one lnk at a tme. Thus, nodes need to coordnate ther presence on lnks n mutual tme ntervals. Based on ts own hardware clock, each node dvdes tme n fxed-sze slots each equal to the duraton of a full-duplex communcaton slot. Transmssons on adjacent lnks are coordnated usng a local lnk schedule S of perod T system slots. The local schedule determnes communcaton acton for the duraton of a slot: the node can ether be actve on a sngle lnk (start actng as master or slave) or reman dle. Local schedules of dfferent nodes are not necessarly tme-algned. Every node mantans a relatve phase φ j wth respect to each adjacent lnk (, j). If φ j =, slot p n the local schedule S overlaps n tme wth slots (p, p) n the local schedule S j. If φ j =, then slot p n S overlaps wth slots (p, p +)ns j. A relatve phase φ j =ndcates that the hardware clocks of the endponts happen to be perfectly synchronzed. The relatve phase mantaned at the other lnk endpont j s φ j = φ j. Gven the relatve phases and masterslave role assgnment on lnk l, the lnk phase φ l s defned as the relatve phase of the master node endpont. Communcaton s successful on a lnk l only f both node endponts assgn tme-overlappng slots n ther local schedules. The assgnment must be such that when the master starts pollng n slot p of ts local schedule, the slave must have assgned slots p + φ l(+φ l ) and p + φ l(+φ l ) n ts own local schedule for lstenng to ths master. For conflct-free communcaton on τ l consecutve slots on lnk l, the master must allocate τ l slots n ts local schedule for pollng whle the slave must allocate at least τ l +tmeoverlappng slots for algnng to the tme reference of ths master. In general, an extra slot s needed every tme a node swtches to a new tme reference as slave. We assume that the system does not support capture f a node receves more than one transmssons at a specfc tme nstant all of them are lost and a conflct occurs. The nterference constrants determne whch lnks can transmt smultaneously wthout causng conflcts at the ntended recevers. Accordng to prmary nterference constrants, lnks sharng common nodes cannot be actvated smultaneously. Ths s due to the sngle rado transcever (a node cannot transmt or receve smultaneously), as well as the pont-to-pont traffc requrement (each transmsson s addressed to a sngle lnk). Secondary nterference arses due to the broadcast nature of the wreless medum and occurs between dfferent transmtter/recever pars. Two smultaneous transmssons, one from node to node j and one from node k to node l wll result to a secondary conflct f at least one of the recevers s wthn range of the sender of the other ntended transmsson. The system may use a sngle channel or multple channels for communcaton. A channel can be mplemented as a dstnct frequency or spread spectrum code. In sngle-
3 Asynchronous TDMA ad hoc networks: Schedulng and Performance channel systems both prmary and secondary nterference exst. In mult-channel systems secondary nterference can be mtgated by assgnng to each lnk a channel derved by the (unque) dentty of the master node endpont. In ths settng, every set of smultaneous transmssons satsfyng the prmary constrants wll occur at dfferent channels. Bluetooth s an nstance of a mult-channel asynchronous TDMA system where communcaton channels (termed as pconets) are mplemented as frequency hoppng sequences. When we refer to mult-channel systems, we wll assume that dfferent channels are orthogonal transmssons on a channel are correctly receved by a node lstenng on that channel despte any n-range transmssons that may be occurrng at dfferent channels. Recent studes [9] have ndcated that ths s a good approxmaton for the frequency hoppng channels used by Bluetooth. A C (-) (+) 3 (-) (a) S A S B S C S D T= (b) Fgure : (a) Network confguraton: Drected edges denote master-slave relatonshps. Nodes A and D act as masters on all ther adjacent lnks, B s slave on lnks,4 and master on lnk 3 and C acts as slave on all ts lnks. The numbers n parentheses denote lnk phases. As an example, snce lnk has a lnk phase of (-), slot p n the local schedule S A of master A must overlap wth slots (p, p) n the local schedule S C of slave C. (b) The asynchronous TDMA schedule refers to a multchannel system: only lnks and 4 can transmt smultaneously on the channels defned by nodes A and D, respectvely. Slots where nodes swtch tme reference as slaves are marked n red. The realzed slot allocaton s τ =(τ,τ,τ 3,τ 4)=(3, 3, 3, 4). For both sngle-channel and mult-channel systems, a slot allocaton τ = [τ l ] realzed by the network TDMA schedule s the number of slots every lnk l transmts conflct-free durng T system slots and equals the number of slots allocated to the local schedule of the master endpont. A network confguraton conssts of the ensemble of a network topology, lnk phases and master-slave lnk role assgnments. Fgure llustrates an example of a network confguraton and asynchronous schedule as well as the slot allocaton realzed by ths schedule. B (-) 4 D 3 OPTIMAL TDMA SCHEDULING Gven a network confguraton t would be of nterest to determne feasblty of any gven demand slot allocaton. Ths problem s equvalent to fndng a lnk schedule of mnmum perod that realzes the demand allocaton at hand. If the mnmum perod does not exceed the system perod T system the demand allocaton s feasble. Although certan demand allocatons can be realzed by schedules of greater perod than the mnmum, the mnmum perod soluton s optmal n the sense that t can detect all feasble allocatons. When global slot synchronzaton exsts, the problem of fndng the mnmum-perod TDMA lnk schedule for a demand allocaton n an arbtrary topology s NP-complete, for both sngle channel [] and mult-channel [] systems. References [, ] propose effcent heurstcs for ths problem. Alternatvely, optmal solutons exst for restrcted topologes. For sngle channel systems, tree topologes can be optmally scheduled [3]. For multchannel systems, schedulng lnks s equvalent to colorng edges n a mult-graph where the multple edges between two node endponts map to the slot requrement of the correspondng lnk. If the network topology s bpartte the optmal soluton can be reached usng mnmum edgecolorng algorthms for bpartte mult-graphs [4]. It s not straghtforward to apply graph colorng technques to the asynchronous TDMA settng. For example, n mult-channel systems there exsts no one-to-one mappng of the slot demand per node par n the network topology graph to multple edges for ths node par n the correspondng mult-graph: n the asynchronous system, each lnk slot demand s the number of slots that should be allocated n the local schedule of the master endpont; however the slave endpont must allocate addtonal slots n ts local schedule for tme reference algnment. Also, as wll be evdent later n the dscusson, the number of addtonal slots requred n the slave local schedules depends on the order lnks are actvated n the local schedules of the masters. Our approach s based on the observaton that the addtonal slots needed by the slaves yeld an ncrease n perod wth respect to the mnmum perod of a perfectly synchronzed system. Ths perod ncrease s an overhead nduced by the system asynchroncty. The lnk schedule optmzaton problem for the asynchronous system s translated to an overhead mnmzaton problem: Frst, a synchronzed lnk schedule that realzes the demand allocaton s computed. Usng ths schedule as a reference we seek an asynchronous schedule of mnmum overhead. If we can fnd a reference synchronzed schedule of mnmum perod, a mnmum overhead asynchronous schedule s a mnmum-perod asynchronous schedule. When the reference schedule perod s sub-optmal, a mnmum-overhead asynchronous schedule s stll useful: the resultng perod wll be compared to T system for determnng feasblty of the demand allocaton at hand. Therefore, mnmum-
4 T. Salonds and L. Tassulas overhead schedules allow detecton of a greater number of feasble allocatons. The amount of overhead depends on the orderng of lnk actvatons n the reference synchronzed schedule. Consder the 3-node confguraton of Fgure where node B s slave to both nodes A and C and where the demand allocaton s 3 slots for each lnk. Frst, let us assume exstence of slot synchronzaton. Snce each node can communcate to only a sngle lnk at a tme, the demand allocaton can be realzed by a mnmumperod schedule of 6 slots. In ths schedule, each lnk s actvated 3 tmes by assgnng concurrent slots n the endponts local schedules. Fgure (b) llustrates two possble nstances of the mnmum-perod schedule, each usng a dfferent orderng of lnk actvatons. S A S B S C T=6 (I) S A S B S C A B (a) Network confguraton: B s a slave to both A and C. C S A S B S C T=6 (II) (b) Synchronzed system: Two possble synchronzed schedule nstances realzng slot allocaton (τ,τ )=(3, 3) n a mnmum perod of 6 slots T=8 I S A S B S C T= (c) Asynchronous system: Dependng on the order of lnk actvatons, slot allocaton (τ,τ )=(3, 3) s realzed by schedules of dfferent mnmum perods. Fgure : An example of the asynchroncty overhead Fgures (c)-i and (c)-ii are two asynchronous schedules where lnks are actvated n the order of Fgures (b)- I and (b)-ii, respectvely. Both asynchronous schedules need a greater perod than 6 slots to realze the demand allocaton: n Fgure (c)-i node B swtches tme reference only once per lnk yeldng a perod of 8 slots; n Fgure (c)-ii node B s forced to swtch tme reference every slot, yeldng a perod of slots. In the example of Fgure, t s possble to determne II by nspecton the lnk orderng and asynchronous schedule that yeld mnmum overhead (Schedule (c)-i). However, for arbtrary confguratons and demand allocatons a systematc approach s needed. We frst ntroduce an algorthm that fnds a mnmum overhead asynchronous schedule for a fxed orderng of lnk actvatons n the reference synchronzed schedule. Ths algorthm can be used to determne the mnmum-overhead schedule over all possble orderngs va exhaustve search. The followng sectons descrbe n detal our approach for the soluton of ths problem. 4 EQUIVALENT SCHEDULES A lnk actvaton set conssts of lnks that can smultaneously transmt wthout conflcts to the ntended recevers. A synchronzed lnk schedule S of perod T s a collecton of lnk actvaton sets {A k : k T }. Asynchronzed schedule nstance S (π) s a perodc sequence of a specfc orderng π of the lnk actvaton sets of S: S (π) =(A π(),..., A π( T ) ). () where π s a mappng of the ndces {,..., T } {,..., T }. Let S (π) be a synchronzed schedule nstance realzng allocaton τ. For the orderng of lnk actvatons n S (π), allocaton τ can be realzed by more than one asynchronous schedules, each havng a dfferent perod. Consder the synchronzed schedule nstance of fgure (b)-i that realzes allocaton (τ,τ )=(3, 3) by actvatng each lnk n 3 consecutve slots. For ths orderng of lnk actvatons, the asynchronous schedule of fgure (c)-i realzes the same allocaton usng a perod of 8 slots. If slave B spent 5 slots nstead of 4 lstenng on lnk, the same demand allocaton would also be realzed wth ths orderng of lnk actvatons but the overall perod of the resultng asynchronous schedule would be 9 slots nstead of 8. We defne an asynchronous schedule S (π) to be equvalent to a synchronzed schedule nstance S (π) f the followng condtons hold: (E.): Every node actvates ts adjacent lnks n S (π) n the same order as n S (π). (E.): S (π) realzes the same allocaton as S (π). (E.3): S (π) satsfes (E.) and (E.) n mnmum perod. Thus, an equvalent schedule S (π) of a synchronzed schedule nstance S (π) s an asynchronous schedule that yelds mnmum overhead for the orderng of lnk actvatons n S (π).
5 Asynchronous TDMA ad hoc networks: Schedulng and Performance We now present an algorthm called EQUIVALENT that takes as nput a network confguraton and a reference synchronzed schedule nstance S (π) and outputs the equvalent asynchronous schedule S (π) of S (π). EQUIVALENT constructs S (π) ncrementally by teratng over the lnk actvaton sets of S (π). Durng teraton k, let l be a lnk n actvaton set A π(k) and and j be ts master and slave endponts. Also let p (k ) and p (k ) j be the last assgned slot postons n the local schedules S (π) and S (π) j, respectvely (p () n =, n N). Frst, master determnes the earlest possble slot p (k) to be assgned to lnk l n S (π). There are three possble cases: Case A: Lnk l was actvated n teraton k : The local schedules are n synch and node can allocate to lnk l the next slot: p (k) = p (k ) + () Case B: Lnk l was not actvated n teraton k and p (k ) > p (k ) j : The master s local schedule s consdered forward n tme wth respect to the slave s. The earlest slot s agan: p (k) = p (k ) + (3) Case C: Lnk l was not actvated n teraton k and p (k ) j p (k ) : The slave s local schedule s consdered forward n tme wth respect to the master, so the master must fnd the earlest unassgned slot n S (π) whose start tme exceeds the end tme of slot p (k ) j n S (π) j : p (k) = p (k ) j + φ l φ l +,φ l {,, } (4) Then assgns slot p (k) sgned slots exst between p (k ) to lnk l. If any ntermedate unas- and p (k), they are assgned as dle n S (π). Once the master updates ts local schedule, slave j determnes p (k) j as the earlest unassgned slot n S (π) j whose end tme exceeds the end tme of p (k) n S (π). Dependng on the lnk phase φ l the poston of ths slot s computed as: p (k) j = p (k) + φ l( + φ l ),φ l {,, } (5) If there are any unassgned slots between p (k ) j and p (k) j, they are assgned to lnk l n S (π) j. The same assgnment steps are performed for every lnk l n A π(k). For every node n not consdered durng teraton k, p n (k) = p n (k ). At the end of teraton k, the forward progress f(k) s defned as: f(k) = max n N {p(k) n } (6) After T teratons, the asynchronous schedule perod T (π) s set to the forward progress f( T ). Then, startng agan from A π(), a few extra teratons are performed untl all nodes assgn ther local schedules up to slot T (π). Upon termnaton, all nodes use the frst T (π) slots n ther local schedules to form an asynchronous schedule wth ths perod. An example of the algorthm operaton s llustrated n Fgure 3. Due to the perodc nature of the reference TDMA schedule, EQUIVALENT requres at most T teratons. The maxmum sze for each lnk actvaton set s N/ the sze of a perfect matchng. Hence, addton of each lnk actvaton set requres O(N) basc operatons. Therefore, the computatonal complexty of EQUIVALENT s O(N T ) (Due to space restrctons, we refer the reader to techncal report [7] for the detaled proof). For any network confguraton and any lnk actvaton orderng π, EQUIVALENT possesses two mportant propertes, summarzed by the followng theorems (establshed n [7]): Theorem : The asynchronous schedule S (π) derved by EQUIVALENT ncurs mnmum overhead for the lnk actvaton orderng correspondng to S (π). Theorem : If T s the perod of the reference synchronzed schedule, the perod T (π) of any equvalent asynchronous schedule s upper bounded by T. Theorem states that the maxmum overhead of an equvalent schedule s T slots. Ths leads to the followng statement for feasblty of allocatons n asynchronous TDMA: Corollary on feasblty: Consder an asynchronous TDMA ad hoc network operatng wth a perod T system and a demand allocaton τ.ifτ can be realzed by a synchronzed schedule of perod T T system /, then τ s feasble by the asynchronous system. The corollary (also establshed n [7]) asserts that EQUIVALENT can realze at least half the allocatons that are feasble under perfect synchronzaton. If the condton T T system / holds for a demand allocaton, any reference synchronzed schedule nstance can be used to generate an asynchronous schedule realzng ths allocaton. Otherwse, we must solve the optmzaton problem addressed next.
6 T. Salonds and L. Tassulas 5 COMPUTING OPTIMAL ASYNCHRONOUS SCHEDULES 9 C (-) A 5 (+) D (+) 4 (-) (+) E 3 (a) Network confguraton A B C D E T= (b) Reference synchronzed schedule nstance of perod T = slots, realzng allocaton (τ,τ,τ 3,τ 4,τ 5 ) = (6,, 5, 5, 3). B 5. OPTIMAL ALGORITHM The optmal asynchronous schedule can be determned by executng EQUIVALENT for all T! synchronzed schedule nstances S (π) and selectng the equvalent schedule of mnmum overhead. Such an exhaustve search s prohbtve even for small values of T. A lnk actvaton set may appear multple tmes n the reference synchronzed schedule. The search space can be reduced f we consder only reference schedules where all nstances of each lnk actvaton set are scheduled n consecutve slots no swtchng slots are generated by EQUIV- ALENT when A π(k ) = A π(k) ; the overhead s zero durng such a transton. If M( S) s the set of dstnct lnk actvaton sets appearng n the reference schedule, we only need to search M( S)! schedule nstances nstead of T!. Unfortunately, even M( S) can be prohbtvely large for exhaustve searches. In ths case we resort to the heurstc algorthm ntroduced n the next secton. S A () () () S B S C () () () (3) (4) (5) (5) (6) (7) (7) (8) (8) (9) () ()()() () (5) (5) (5) (5) (5) (5) (6) (7) (8) () () ()() () 6 7 S D () () (3) (4) (5) (5) (6) (8) (8) (8) (8) (9) ()() () () S E (3) 5 (4) (5) (5) (6) (7) (8) (9) (9) () () ()() () () () (3) (4) (7) (7) (7) (7) (7) (9) (9) (9) ()() ()() (c) Numbers n parentheses ndcate teraton where the slot was assgned on each node s local schedule. Swtchng slots are shaded. The equvalent schedule perod (=4) s determned at the th teraton. Two addtonal teratons are performed so that all nodes assgn ther local schedules up to ths perod. (k) () () () (3) (4) (5) (6) (7) (8) (9) () f(k) p A (k) p B (k) p C (k) p D (k) p E (k) (d) Evoluton of p (k) n and f(k). Fgure 3: An example of the EQUIVALENT algorthm executon 5. MIN PROGRESS MIN PROGRESS s a heurstc for overhead mnmzaton that conssts of two phases. Phase I determnes an orderng π h of the dstnct lnk actvaton sets n M( S). Phase II nvolves two steps: frst, a synchronzed schedule nstance s formed, where dstnct lnk actvaton sets are ordered accordng to π h and the nstances of each set are actvated n consecutve slots. Second, ths synchronzed schedule nstance s nput to EQUIVALENT to generate the fnal asynchronous schedule. We now descrbe Phase I that selects π h. An asynchronous schedule s constructed usng only the dstnct lnk actvaton sets nstead of all ther nstances. The sets are added to the asynchronous schedule n the same way as nstances are added n EQUIVALENT. Upon ntalzaton, an arbtrary lnk actvaton set of M( S) s added to the asynchronous schedule. Let U (k ) be the set of all unassgned lnk actvaton sets at the start of teraton k (U () = M( S)). The addton of each set M α of U (k ) wll generate a forward progress f(α, k) for the asynchronous schedule. The algorthm selects the lnk actvaton set yeldng mnmum forward progress, wth tes beng broken arbtrarly. Let M α k be the selected set. Then the k-th entry of π h s set to α k and set M α k s removed from the U-set. The same steps are repeated untl the U-set becomes empty after M( S) teratons. Phase I can be extended to select and nsert multple lnk actvaton sets per teraton, accordng to a horzon parameter h. Durng teraton k, all possble h-set blocks n the U-set and all possble orderngs (h!) of the lnk actvaton sets wthn each h-set block are consdered. The block and orderng that yelds mnmum forward progress
7 Asynchronous TDMA ad hoc networks: Schedulng and Performance s selected and added to the asynchronous schedule. The selected block s removed from the U-set and the next teraton s performed. Dependng on whether h dvdes M( S) M( S) or not, the algorthm wll termnate n h M( S) or h +teratons, respectvely. Proposton: For h and fxed, the computatonal complexty of MIN PROGRESS s O(N M( S) h+ ). Proof: The complexty of MIN PROGRESS s determned by the complextes of Phases I and II. Let M = M( S). Durng teraton k of Phase I, ( ) M (k )h h blocks are consdered and, for each block, h! orderngs of actvaton sets are tested. Testng each orderng nvolves nserton of h actvaton sets to the asynchronous schedule. Therefore, the total number of nsertons C I throughout the executon of Phase I wll be: C I = where M h k= r(m,h) = ( M (k )h h ) h! h + r(m,h) h (7) { (Mmodh)! f Mmodh otherwse After algebrac manpulatons, equaton (7) becomes: C I = h M h k= (8) h ((M ) hk)+r(m,h) h (9) = An upper bound to C I s: C I <h = h = h = h = h M h k= M h k= M h k= h (M hk)+r(m,h) h = (M hk) h + r(m,h) h h ( ) a M h (hk) + r(m,h) h = h ( ) a h M h = h ( ) a h M h = where a are postve ntegers. M h k= M h k= constant, snce (M mod h) <h. The term Θ(M + ) because the power sum k + r(m,h) h k + r(m,h) h () The term r(m,h) h s M h k= k s n k can be expanded k= + n polynomal form as b j n j, where b j are ntegers. j= Multplyng ths term wth M h n (), causes the entre term n () to be Θ(M h+ ). A lower bound to C I s: C I >h M h k= h ((M (h )) hk)+r(m,h) h = () and can be shown to be Θ(M h+ ) n a smlar way as (). Therefore, C I s Θ(M h+ ). Snce nserton of an actvaton set requres O(N) operatons, the complexty of Phase I s O(NM h+ ). The complexty of Phase II s O(NM) because t uses EQUIV- ALENT on the orderng π h computed by Phase I. Hence, overall complexty of MIN PROGRESS s domnated by Phase I and s O(NM h+ ). Gven a specfc reference schedule S, the horzon h may range from to M( S). Larger values of h are expected to yeld better performance because more orderngs are tested per teraton. Ths comes at the expense of ncreased computatonal complexty. For the maxmum horzon value, MIN PROGRESS s essentally the optmal algorthm t ncludes a sngle teraton where a block of M( S)! orderngs must be exhaustvely tested. Thus, h must be carefully selected to ensure tractablty. Accordng to MIN PROGRESS, the maxmum number of ( M( S) ) h blocks must be consdered n the frst teraton. The horzon h must be small enough to allow exhaustve enumeraton of ths number, as well as exhaustve enumeraton of h! orderngs per block. The effect of h n performance wll be nvestgated n the experments secton that follows. 6 PERFORMANCE EVALUATION 6. FACTORS AFFECTING THE OVERHEAD We are nterested n evaluatng performance n vew of the factors that affect the asynchroncty overhead. The overhead s frst related to the topology structure. In general, denser topologes are expected to produce hgher overhead because more lnks wll translate to a hgher number of tme reference swtches. Performance s also affected by the master-slave role assgnments. In the example of Fgure, f node B s assgned as master to nodes A and C, the overhead s zero due to the sngle tme reference n the system. For a specfc network confguraton the overhead also depends on the demand allocaton at hand. A parameter specfc to the demand allocaton s the rato M( S) of dstnct lnk actvaton sets to the perod T of the optmal reference schedule. A small rato s desrable because overhead
8 T. Salonds and L. Tassulas s generated only durng the transtons between dstnct actvaton sets n the synchronzed schedule. Another related parameter s the perod T of the synchronzed schedule. Larger perods may allow for smaller M( S) / T ratos and, therefore, less generated overhead. 6. EXPERIMENTAL SETTING Performance must be evaluated for a varety of network confguratons and optmal reference synchronzed schedules. As mentoned n secton 3, determnaton of optmal synchronzed schedules s n general an NP-complete problem. However, for bpartte topologes n mult-channel systems, the mnmum perod equals the maxmum node utlzaton: T (τ ) = max N l L() τ l. () where L() s the set of adjacent lnks to node. Thus, n ths case, optmal reference synchronzed schedules of perod T can be constructed by generatng arbtrary conflctfree schedules where at least one node transmts durng the entre perod. In the experments we consder N -node mult-channel bpartte networks wth N / nodes per bpartte set. Ths provdes a baselne topology of N /4 lnks. We use the restrctve parameters B max and f to generate varous topologes from the baselne. The channel degree parameter B max s an upper bound on the number of channels a node can partcpate as slave. Such a constrant would arse n practce to avod excessve overhead. We also restrct the number of lnks where a node can act as master to 7. Ths restrcton s specfc to Bluetooth, a mult-channel asynchronous TDMA system. Combned wth B max, ths provdes an upper bound of B max +6 to the overall lnk degree of each node n the topologes we consder. The densty parameter f ( f ) generates topologes where an arbtrary f % lnks of the baselne topology reman ntact whle the rest have been removed. Gven a topology constructed as above, asynchroncty s ntroduced by ) master-slave role assgnments on the lnks and ) arbtrary phase dfferences on the hardware clocks of the nodes n the network. Accordng to the lnk role assgnments, a node may act as master to all ts adjacent lnks (termed as master ) or act as slave to all ts adjacent lnks (termed as S/S brdge ), or act as master to some lnks and slave to others (termed as M/S brdge ). Perod length (slots) allows exhaustve search and determnaton of the optmal asynchronous schedule. Fgure 4 compares the resultng optmal and MIN PROGRESS perods. For each topology, the perods are averaged over all reference schedules. Usng a horzon h =, MIN PROGRESS exceeds the optmal by less than one slot on the average, whle n topology 5 t exceeds the optmal by.3 slots on the average T T T opt T T h opt B max Fgure 4: MIN PROGRESS vs. optmal. Each bar graph corresponds to a dfferent -node bpartte network confguraton where densty ncreases by varyng B max from to 7. The reference synchronzed schedule perod s 7 slots. The optmal perod T opt and the MIN PROGRESS (h =) perod T h of each bar are averages of reference synchronzed schedules. The optmal and MIN PROGRESS perods ncrease wth B max and for B max =7they both approach 4 slots, the upper bound of EQUIV ALENT. The hgh overhead stems from B max beng equal to the small reference perod T : S/S brdges wth such a channel degree need to swtch tme reference almost every slot regardless the lnk actvaton order n the reference schedule. 6.4 PERFORMANCE OF MIN PROGRESS FOR LARGE PROBLEM SIZES For each parameter set (N,B max,f, T ) we generate topologes and, for each topology, arbtrary reference synchronzed schedules. For each (N,B max,f, T ), the overhead s averaged over the correspondng topologes and reference schedules and s plotted as the %ncrease n the reference perod T. If T h s the perod computed by MIN PROGRESS, ths quantty s equal to T h T, wth T % denotng that MIN PROGRESS yelds perod T, the upper bound of EQUIVALENT. We proceed by nvestgatng the varous factors that affect the performance of MIN PROGRESS. 6.3 PERFORMANCE OF MIN PROGRESS WITH RE- SPECT TO OPTIMAL Sx -node bpartte topologes ( masters and S/S brdges) of varyng densty are consdered n ths experment. For each topology we randomly generate reference synchronzed schedules of perod T =7. Ths perod 6.4. Effect of horzon In ths set of experments, we use -node bpartte topologes ( masters and S/S brdges) and vary the densty parameter f (B max =7) and reference perod T. Fgure 5 plots the overhead of MIN PROGRESS usng up to 3 actvaton sets per block.
9 Asynchronous TDMA ad hoc networks: Schedulng and Performance For all scenaros, the overhead decreases as h ncreases. The mprovement s always more drastc from h =to h = than from h = to h = 3. Usng h = nstead of h =appears benefcal for larger perods and denstes (bar graphs f =.6,.9 n fgure 5(c) and fgure 5(c)), wth a maxmum overhead reducton of 3% at T = and f =.9. For the lowest densty consdered, MIN PROGRESS performs smlarly for all h. Overall, a horzon h = seems to provde a good performance/complexty trade-off at hgher reference perods and topology denstes, whle a horzon h =appears suffcent at low topology denstes Effect of phase and role assgnments Consder a topology graph G(N,E). Snce for every lnk l, φ l can be -,, or, there are 3 E possble lnk phase assgnments n the network. Also, there are E possble master-slave lnk role assgnments. In ths experment, we consder -node bpartte topologes. For a specfc topology and reference synchronzed schedule, we measure the standard devaton of the generated overhead of MIN PROGRESS for a sample of arbtrary phase (or role) assgnments. Then, for each parameter set (f, T ) we plot the average standard devaton over the correspondng topologes and reference schedules. For every (f, T ), role varablty (Fg 7) produces hgher standard devaton than phase varablty (Fg 6) the dfference never exceeds %. Apart from ths dfference, both fgures have smlar propertes: For a fxed densty the standard devaton appears nsenstve to T less than.5% changes are observed. However, for every T, the standard devaton decreases as the densty ncreases. Ths ndcates that the overhead devates less from a certan mean as the number of lnks per localty ncreases; therefore varablty n phase and role assgnments affect the algorthm performance to a lesser extent n ths case Effect of densty Here, a -node (5 masters, 5 S/S brdges) baselne bpartte topology s used. Fgure 8 llustrates the effect of B max on the overhead of MIN PROGRESS. For fxed T the overhead consstently ncreases wth B max.at T =8, the overhead s 5% when B max = but reaches 6% when B max =7. The overhead decreases as the reference perod ncreases. At B max =7the overhead reduces to 3% for T = 896 slots. Whle ths decrease s more drastc for transtons between smaller perods (e.g. from 8 to 56 slots), t s less for larger perods (e.g. from 448 to 896 slots). Ths ndcates that a non-neglgble overhead may stll exst even f the system uses a large perod. Smlar trends arse n Fgure 9 where B max =7and only parameter f s used to vary the topology densty. The overhead ncreases wth network densty regardless of the number of %Heurstc Overhead % Heurstc Overhead % Heurstc Overhead f (a) T =8slots, B max =7, f vares (b) T = slots, B max =7, f vares. f (c) T = 448 slots, B max =7, f vares. Fgure 5: Effect of the choce of horzon for varyng topology denstes and reference perods (N =, B max =7). f h= h= h=3 h= h= h=3 h= h= h=3
10 T. Salonds and L. Tassulas 9 8 T =8 ref T = ref T =448 ref 9 8 T=8 T=56 T= T=4 T=448 T= %Overhead devaton % Heurstc Overhead %Overhead devaton %Heurstc Overhead f Fgure 6: Average overhead standard devaton due to lnk phase varablty for -node networks and varous values of f and T (h =, fxed lnk roles per topology) f T ref =8 T = ref T =448 ref Fgure 7: Average overhead standard devaton due to lnk role assgnment varablty for -node networks and varous values of f and T (h =, fxed lnk phases per topology). tme references n whch each node partcpates T=8 T=56 T= T=4 T=448 T= B max Fgure 8: Overhead of MIN PROGRESS (h = ) for -node networks as B max and T vary (f =.) f Fgure 9: Overhead of MIN PROGRESS(h = ) for -node networks as f and T vary (B max =7). mum perod T. For any allocaton τ n Ψ ( T ), let BN(τ ) be the set of nodes that receve maxmum utlzaton T under τ. BN(τ )={n : arg max N j N() τ j }. (3) We conjecture that maxmum overhead wll be generated f the followng condtons hold for a demand allocaton τ max n Ψ ( T ) and at least one of the bottleneck nodes n BN(τ max ): P: In addton to maxmum utlzaton, the node has maxmum lnk degree. P: The node s a S/S brdge. P3: Allocaton τ max s such that the node s requested to allocate an equal number of slots to ts adjacent lnks. A maxmum utlzaton node wll be consdered at every teraton of an overhead mnmzaton algorthm. Also, snce ths s a node of maxmum degree and acts as a S/S brdge, t wll vst the maxmum possble number of tme references (B max ) as slave. If lnk demands are equal for ths node, we can show that the overhead wll be maxmzed under the worst orderng of lnk actvatons Average MMF Effect of demand allocaton The prevous experments nvestgated the algorthm performance averaged over arbtrary demand allocatons and topologes. A natural queston that arses next s whether there exsts a network confguraton and demand allocaton for whch the generated overhead s maxmzed. In ths secton we make a frst attempt to nformally classfy such worst-case nstances and then test our ntuton through smulatons. Let the topology be bpartte and Ψ ( T ) be the set of all allocatons realzed by a synchronzed schedule of mn- %Heurstc Overhead T (slots) ref Fgure : MIN PROGRESS overhead for maxmn far allocatons vs. average MIN PROGRESS overhead. For each reference perod, both quanttes are averaged over all topologes consdered n Fgures 8 and 9. A maxmn far allocaton n a synchronzed multchannel wreless ad hoc network maxmzes utlzaton of
11 Asynchronous TDMA ad hoc networks: Schedulng and Performance the nodes wth maxmum lnk degree [5, 6]. If at least one of these nodes s also assgned as a S/S brdge then condtons P-P3 wll hold. Fgure compares the MIN PROGRESS overhead resultng from a maxmn far reference schedule and the average MIN PROGRESS overhead over arbtrary schedules. (The algorthm n [5] s used to compute the reference maxmn far schedules). The average MIN PROGRESS overhead decreases as the system perod ncreases. The overhead for the maxmn far schedule however, does not change sgnfcantly n the order of 8% for all cases. Ths ndcates that the overhead can be very hgh for the allocatons we dentfed even f we use an overhead mnmzaton algorthm such as MIN PROGRESS. Counter-ntutvely, the overhead remans hgh even f the reference perod ncreases. Nevertheless, t s always less than the upper bound gven by EQUIVALENT. 7 THE CASE OF BLUETOOTH Bluetooth s a new wreless technology that enables the formaton of ad hoc networks called scatternets. A scatternet s an nstance of a mult-channel asynchronous TDMA ad hoc network where channels are mplemented as frequency hoppng sequences (termed as pconets), and each node can act as master to at most seven adjacent lnks. The scatternet schedulng problem s the problem of coordnatng the node vsts n dfferent pconets n an effcent manner and s currently a subject of ntense research effort. Emphass s placed on dstrbuted schemes the approaches can be categorzed accordng to the degree of coordnaton they offer. Hard coordnaton schemes [8, 5] provde determnstc allocatons va conflct-free schedulng; however, a certan degree of mplementaton complexty and communcaton overhead s needed to mantan the conflct-free property under topology dynamcs. Soft coordnaton schemes [5, 6, 7] trade off perfectly conflct-free transmssons for lower complexty. The downsde s loss of the ablty to provde bandwdth allocaton guarantees. Whle there s stll a smplcty v.s. performance debate between the two approaches, the overhead ncurred when nodes swtch tme references always exsts. In ths paper we ntroduced a hard-coordnaton framework for overhead mnmzaton for two reasons. Frst, n ths case, the overhead s naturally lnked to the ablty of the system to allocate bandwdth. Second, a useful pont of reference s establshed snce conflct-free schedulng s the best we can do to mnmze overhead. The dervaton of a smlar overhead mnmzaton framework for soft coordnaton schemes would be an nterestng research avenue to pursue. 8 CONCLUSIONS In ths paper, we addressed for the frst tme the problem of mnmzng overhead n TDMA wreless ad hoc networks that use multple local tme slot references nstead of a sngle global tme slot reference. Ths overhead arses due to slots wasted when nodes synchronze to the dfferent local tme slot references and manfests as loss of supported allocatons wth respect to a perfectly synchronzed system. The problem was cast and addressed usng a generc framework and the results can be drectly appled for the case of Bluetooth, a wreless technology operatng accordng to the asynchronous TDMA communcaton paradgm. It was demonstrated that the overhead can sgnfcantly affect the ablty of a network to allocate bandwdth f no measures are taken to mnmze t. We ntroduced two schedulng algorthms that am to mnmze overhead whle ensurng that the generated overhead has an upper bound regardless of the network confguraton or demand allocaton at hand. The frst algorthm reaches the optmal soluton but cannot be appled to large problem szes because t reles on exhaustve search. For such cases an effcent heurstc was devsed. We also dentfed and verfed, through smulatons, certan condtons on demand allocatons and network confguratons for whch the overhead can be hgh even f an overhead mnmzaton algorthm s run. Further nvestgaton of the exact nature of such condtons s an nterestng research drecton. Both optmal and heurstc algorthms are centralzed and can operate n settngs where global nformaton s avalable. More mportantly, they can be used to provde desgn nsghts and serve as a reference performance measure for any overhead-aware dstrbuted approaches that wll follow. Manuscrpt receved on... REFERENCES [] B. Hajek and G. Sasak, Lnk schedulng n polynomal tme. In Proc. IEEE Transactons on Informaton Theory, Vol. 34, pg. 9 97, September 988. [] E. Arkan, Some complexty results about packet rado networks. In Proc. IEEE Transactons on Informaton Theory, Vol. 3, pg , July 984. [3] Bluetooth Specal Interest Group, Specfcaton of the Bluetooth system, verson.. In 3. [4] G. Mklos, Z. Turany, A. Valko and P. Johansson, Performance Aspects of Bluetooth Scatternet Formaton. In Proc. ACM MOBIHOC, August, Boston, MA, USA. [5] N. Johansson, F. Alrksson, and U. Jonsson, JUMP mode: a dynamc wndow-based schedulng framework for Bluetooth scatternets. In Proc. ACM MOBIHOC, October, Long Beach, CA, USA.
12 T. Salonds and L. Tassulas [6] A. Racz, G. Mklos, F. Kubnszky and A. Valko, A Pseudo Random Coordnated Schedulng algorthm for Bluetooth Scatternets In Proc. ACM MOBIHOC, October, Long Beach, CA, USA. [7] S. Baatz, M. Frank, C. Kuhl, P. Martn and C. Scholz, Bluetooth Scatternets: An Enhanced Adaptve Schedulng Scheme In Proc. IEEE INFOCOM, June, New York, NY, USA. [8] N. Johansson, U. Korner and L. Tassulas, A dstrbuted schedulng algorthm for a Bluetooth scatternet. In Proc. Internatonal Teletraffc Congress (ITC),, Salvador da Baha, Brazl. [9] A. Kumar and R. Gupta, Capacty Evaluaton of Frequency Hoppng Based Ad-hoc Systems In Proc. ACM SIGMET- RICS, June, Cambrdge, MA, USA. [] I. Holyer, The NP-completeness of edge colorng In Proc. SIAM Journal of Computng, Vol., pg , 98. [] M. Post, P. Sarachk and A. Kershenbaum, A Based Greedy Algorthm for Schedulng Multhop Rado Networks In Proc. Annual Conference on Informaton Scences and Systems (CISS), March 985, Johns Hopkns Unversty, Baltmore, MD, USA. [] S. Ramanathan, A Unfed Framework and Algorthm for Channel Assgnment n Wreless Networks In Proc. IEEE INFOCOM, September 997, Kobe, Japan. [3] S. Ramanathan and E. Lloyd, Schedulng algorthms for multhop rado networks In Proc. IEEE/ACM Transactons on Networkng, Vol., pg , Aprl 993. [4] N. Alon, A smple algorthm for edge-colorng bpartte multgraphs In Proc. Informaton Processng Letters, Vol. 85, pg. 3 3, September 3. [5] T. Salonds and L. Tassulas, Dstrbuted On-Lne Schedule Adaptaton for balanced slot allocaton n Bluetooth Scatternets and Other Ad Hoc Network Archtectures. In Techncal Report TR -4, Insttute of Systems Research (ISR),, Unvesty of Maryland, College Park. [6] L. Tassulas and S. Sarkar, Maxmn Far Schedulng n Wreless Networks In Proc. IEEE INFOCOM, June, New York, NY, USA. [7] T. Salonds and L. Tassulas, Asynchronous TDMA: Schedulng and Performance In Techncal Report TR - 5, Insttute of Systems Research (ISR), 4, Unvesty of Maryland, College Park.
Asynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Performance ssues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks by Theodoros Salonds, Leandros Tassulas CSHCN TR 00 (ISR TR 005) The Center for Satellte
More informationRedes de Comunicação em Ambientes Industriais Aula 8
Redes de Comuncação em Ambentes Industras Aula 8 Luís Almeda lda@det.ua.pt Electronc Systems Lab-IEETA / DET Unversdade de Avero Avero, Portugal RCAI 2005/2006 1 In the prevous epsode... Cooperaton models:
More informationDynamic 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 informationResource 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 informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationHigh 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 informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationOn High Spatial Reuse Broadcast Scheduling in STDMA Wireless Ad Hoc Networks
On Hgh Spatal Reuse Broadcast Schedulng n STDMA Wreless Ad Hoc Networks Ashutosh Deepak Gore and Abhay Karandkar Informaton Networks Laboratory Department of Electrcal Engneerng Indan Insttute of Technology
More informationA 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 informationExact 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 informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationComparative 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 informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationCalculation 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 informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationTopology 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 informationPRACTICAL, 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 informationResource Scheduling in Dependable Integrated Modular Avionics
Resource Schedulng n Dependable Integrated Modular Avoncs Yann-Hang Lee and Daeyoung Km Real Tme Systems Research Laboratory CISE Department, Unversty of Florda {yhlee, dkm}@cse.ufl.edu Mohamed Youns,
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationApproximating 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 informationThroughput 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 informationThe Synthesis of Dependable Communication Networks for Automotive Systems
06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationThe 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 informationTODAY S wireless networks are characterized as a static
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract
More informationIEE 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 informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationUncertainty 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 informationTo: 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 informationDistributed Adaptive Channel Allocation in Multi-Radio Wireless Sensor Networks
Journal of Communcatons Vol., No., November 26 Dstrbuted Adaptve Channel Allocaton n Mult-Rado Wreless Sensor Networks We Peng, Dongyan Chen, Wenhu Sun, and Guqng Zhang2,3 School of Control Scence and
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationA Novel DSA-Driven MAC Protocol for Cognitive Radio Networks
Wreless Sensor Networ, 29, 2, 6-2 do:.4236/wsn.29.2 7 Publshed Onlne July 29 (http://www.scrp.org/journal/wsn/). A Novel DSA-Drven MAC Protocol for Cogntve Rado Networs Hua SONG, Xaola LIN School of Informaton
More informationAchieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation
Achevng Transparent Coexstence n a Mult-hop econdary Network Through Dstrbuted Computaton Xu Yuan Y h Y. Thomas Hou Wenng Lou cott F. Mdkff astry Kompella Vrgna olytechnc Insttute and tate Unversty, UA
More informationA Current Differential Line Protection Using a Synchronous Reference Frame Approach
A Current Dfferental Lne rotecton Usng a Synchronous Reference Frame Approach L. Sousa Martns *, Carlos Fortunato *, and V.Fernão res * * Escola Sup. Tecnologa Setúbal / Inst. oltécnco Setúbal, Setúbal,
More informationDistributed Topology Control of Dynamic Networks
Dstrbuted Topology Control of Dynamc Networks Mchael M. Zavlanos, Alreza Tahbaz-Saleh, Al Jadbabae and George J. Pappas Abstract In ths paper, we present a dstrbuted control framework for controllng the
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationA 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 informationantenna 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 informationResource 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 informationDistributed 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 informationA 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 informationDistributed 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 informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationPerformance 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 informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More information熊本大学学術リポジトリ. 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 informationA 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 informationDecision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationEfficient 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 informationAd hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce
Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann, Kurt Gehs, Gero Mühl Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/
More informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationParameter 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 informationFigure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13
A Hgh Gan DC - DC Converter wth Soft Swtchng and Power actor Correcton for Renewable Energy Applcaton T. Selvakumaran* and. Svachdambaranathan Department of EEE, Sathyabama Unversty, Chenna, Inda. *Correspondng
More informationMTBF 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 informationClustering 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 informationNOVEL 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 informationFrequency Assignment for Multi-Cell IEEE Wireless Networks
Frequency Assgnment for Mult-Cell IEEE 8 Wreless Networks Kn K Leung Bell Labs, Lucent Technologes Murray Hll, NJ 7974 kn@bell-labscom Byoung-Jo J Km AT&T Labs Research Mddletown, NJ 7748 macsbug@researchattcom
More informationAnalysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson
37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se
More informationLeast-Latency Routing over Time-Dependent Wireless Sensor Networks
1 Least-Latency Routng over Tme-Dependent Wreless Sensor Networks Shouwen La, Member, IEEE, and Bnoy Ravndran, Senor Member, IEEE Abstract We consder the problem of least-latency end-to-end routng over
More informationEnergy-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 informationQoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users
os Provsonng n Wreless Data Networks under Non-Contnuously Backlogged Users Tmotheos Kastrnoganns, and Symeon Papavasslou, Member, IEEE School of Electrcal and Computer Engneerng Natonal Techncal Unversty
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationAdaptive Distributed Topology Control for Wireless Ad-Hoc Sensor Networks
Adaptve Dstrbuted Topology Control for Wreless Ad-Hoc Sensor Networks Ka-Tng Chu, Chh-Yu Wen, Yen-Cheh Ouyang, and Wllam A. Sethares Abstract Ths paper presents a decentralzed clusterng and gateway selecton
More informationELECTRONIC 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 informationOptimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games
Optmzaton of Schedulng n Wreless Ad-Hoc Networs Usng Matrx Games Ebrahm Karam and Savo Glsc, Senor Member IEEE Centre for Wreless Communcatons (CWC), Unversty of Oulu, P.O. Box 4500, FIN-90014, Oulu, Fnland
More informationLow Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks
Low Complexty Duty Cycle Control wth Jont Delay and Energy Effcency for Beacon-enabled IEEE 8254 Wreless Sensor Networks Yun L Kok Keong Cha Yue Chen Jonathan Loo School of Electronc Engneerng and Computer
More informationAN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS
Journal of Engneerng Scence and Technology Vol., o. 4 (6) 476-495 School of Engneerng, Taylor s Unversty A IMPROVED BIT LOADIG TECHIQUE FOR EHACED EERGY EFFICIECY I EXT GEERATIO VOICE/VIDEO APPLICATIOS
More informationAd hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce
Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/ PTB-Semnar, 3./4. November
More informationGuidelines 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 informationJoint 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 informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationAchievable Rate Region of CSMA Schedulers in Wireless Networks with Primary Interference Constraints
Achevable Rate Regon of CSMA Schedulers n Wreless Networks wth Prmary Interference Constrants Peter Marbach, Atlla Erylmaz, and Asuman Ozdaglar Abstract We consder Carrer Sense Multple Access (CSMA) schedulers
More informationPassive 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 informationPerformance Evaluation of Layer Adaptive Multi-User Scheduling in LTE-A Downlink
01 7th Internatonal ICST Conference on Communcatons and Networng n Chna (CHINACOM) Performance Evaluaton of Layer Adaptve Mult-User Schedulng n LTE-A Downln L Zhang, Sov Peter, Chunye Wang Chna Industral
More informationTowards Energy-Fairness in Asynchronous Duty-Cycling Sensor Networks
38 Towards Energy-Farness n Asynchronous Duty-Cyclng Sensor Networks ZHENJIANG LI and MO LI, Nanyang Technologcal Unversty YUNHAO LIU, Tsnghua Unversty In ths artcle, we nvestgate the problem of controllng
More informationNATIONAL 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 informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationA 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 informationAdaptive Phase Synchronisation Algorithm for Collaborative Beamforming in Wireless Sensor Networks
213 7th Asa Modellng Symposum Adaptve Phase Synchronsaton Algorthm for Collaboratve Beamformng n Wreless Sensor Networks Chen How Wong, Zhan We Sew, Renee Ka Yn Chn, Aroland Krng, Kenneth Tze Kn Teo Modellng,
More informationCOMPUTER networks nowadays rely on various middleboxes,
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 14, NO. 3, SEPTEMBER 2017 631 Effcent Algorthms for Throughput Maxmzaton n Software-Defned Networks Wth Consoldated Mddleboxes Metan Huang, Wefa
More informationSpectrum Sharing For Delay-Sensitive Applications With Continuing QoS Guarantees
Spectrum Sharng For Delay-Senstve Applcatons Wth Contnung QoS Guarantees Yuanzhang Xao, Kartk Ahuja, and Mhaela van der Schaar Department of Electrcal Engneerng, UCLA Emals: yxao@seas.ucla.edu, ahujak@ucla.edu,
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationStudy of Downlink Radio Resource Allocation Scheme with Interference Coordination in LTE A Network
Internatonal Journal of Future Computer and Communcaton, Vol. 6, o. 3, September 2017 Study of Downln Rado Resource Allocaton Scheme wth Interference Coordnaton n LTE A etwor Yen-Wen Chen and Chen-Ju Chen
More informationHigh 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 informationDiscussion on How to Express a Regional GPS Solution in the ITRF
162 Dscusson on How to Express a Regonal GPS Soluton n the ITRF Z. ALTAMIMI 1 Abstract The usefulness of the densfcaton of the Internatonal Terrestral Reference Frame (ITRF) s to facltate ts access as
More informationMedium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
Medum ccess Control for Mult-Channel Parallel Transmsson n Cogntve Rado Networs Tao Shu, Shuguang Cu, and Marwan Krunz Department of Electrcal and Computer Engneerng Unversty of rzona Tucson, Z 85721 {tshu,
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationWeighted Penalty Model for Content Balancing in CATS
Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract
More informationOptimal 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 informationMulti-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments
Mult-Robot Map-Mergng-Free Connectvty-Based Postonng and Tetherng n Unknown Envronments Somchaya Lemhetcharat and Manuela Veloso February 16, 2012 Abstract We consder a set of statc towers out of communcaton
More information