Optimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games
|
|
- Byron Hodge
- 5 years ago
- Views:
Transcription
1 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 Abstract In ths paper, we present a novel applcaton of matrx game theory for optmzaton of ln schedulng n wreless ad-hoc networs. Optmum schedulng s acheved by soft colorng of networ graphs. Conventonal colorng schemes are based on assgnment of one color to each regon or equvalently each ln s member of just one partal topology. These algorthms based on colorng are not optmal when lns are not actvated wth the same rate. Soft colorng, ntroduced n ths paper, solves ths problem and provde optmal soluton for any requested ln usage rate. To defne the game model for optmum schedulng, frst all possble components of the graph are dentfed. Components are defned as sets of the wreless lns can be actvated smultaneously wthout sufferng from mutual nterference. Then by swtchng between components wth approprate frequences (usage rate) optmum schedulng s acheved. We call ths nd of schedulng as soft colorng because any lns can be member of more than one partal topology, n dfferent tme segments. To smplfy ths problem, we model relatonshp between ln rates and components selecton frequences by a matrx game whch provdes a smple and helpful tool to smplfy and solve the problem. Ths proposed game theoretc model s solved by fcttous playng method. Smulaton results prove the effcency of the proposed technque compared to conventonal schedulng based on colorng. Index Terms- Ln schedulng, graph colorng, topology component, fcttous playng (FP), soft colorng. I. INTRODUCTION Wreless ad-hoc networs need a multple access control scheme to avod collson due to smultaneous transmssons. The most conventonal multple access scheme n wreless ad-hoc networs s tme dvson multple access (TDMA) [1, 2], although other multple access schemes le combnaton of TDMA wth code dvson multple access (CDMA) have been also used. For comparson, TDMA/CDMA s easer to synchronze but provdes lower throughputs [3, 4]. In a TDMA wreless ad-hoc networ, schedulng between lns ncreases throughput. Schedulng n wreless ad-hoc networs s smlar to channel reusng n cellular networs.e. f two lns do not nterfere wth each other or at least ther mutual nterference to sgnal rato s less than a predefned margn, they can be actvated at the same tme slot and consequently not only throughput s ncreased but also transmsson delay s reduced [5, 6]. If two lns nterfere wth each other, they are referred to as adjacent lns. Therefore for each graph one adjacency matrx s defned. In [7, 8] problem of conflct free schedulng has been smplfed through splttng networ to multple networ realzatons or partal networ topologes. Each partal topology ncludes a complete set of lns that can be actvated smultaneously and consequently to maxmze the throughput, the remaned problem s just assgnng optmum usage rates (porton of tme) to each networ realzaton. Ths approach for schedulng problem has been adopted from colorng problem n mathematcs where a graph s dvded to some regons and each regon s colored wth one assgned color. But ths approach has two defcences. Frst, colorng does not have unque soluton and for any gven ln adjacency matrx there are usually more than one mnmal colorng scheme. On the other hand, when lns are supposed to be actvated n dfferent usage rates, ln colorng does not provde optmum result. To solve both defcences we ntroduce the concept of soft colorng. Soft colorng means more than one color can be assgned to each ln n dfferent tme slots. The outcome of soft colorng n schedulng problems s dvdng topology to topology components where each component s panted by an ndvdual color and components can have non-empty ntersecton.e. one ln can be member of more than one component n dfferent tme slots. Game theory has found many applcatons n smplfy problems n mathematcs and networng [9-11]. In ths paper, we use matrx games to model relatonshp between ln usage rates and component rates. Modelng the problem by game theory not only helps us to smplfy the problem by usng domnancy concept, but also provdes fast and relable convergence.
2 The rest of paper s organzed as follows. In Secton II, system model and problem defnton s presented. In Secton III, problem s formulated by matrx game. Smulaton results are presented n Secton IV and fnally paper s concluded n Secton V. II. PROBLEM DEFINITION AND SYSTEM MODEL Assume a mult-source wreless ad-hoc networ ncludng N nodes. Ths networ s defned as G( V, E, ζ, s, s,, ) 1 2 sm where V s set of node wth N elements, E s set of L vrtual wreless lns, ζ s set of M sources and s s set of sns correspondng to the th source where f source s sendng uncast data sze of ts sn set s one. Wreless propagaton for ths networ assumes the followng: 1. Omn-drectonal transmsson. 2. Presence of nterference due to smultaneous transmsson. 3. TDMA as multple access scheme for dfferent hops wthout nter tme slot nterference. A. Conflct Free Operaton Assume S j as the power, n db requred at node j, for transmttng node to reach the recevng node j at dstance d wth S S d where α s attenuaton factor. j j j Accordngly, by defnton of the conflct free schedulng, any node, j, recevng the sgnal from node m, wll be nterfered by ln l j f and only f Sm S, where β, n db, s acceptable nterference margn between two lns. In other word, ln l j s adjacent to l m for any m and any, j f S S. (1) m Alternatvely, the two lns are adjacent f S S β. (2) j mj + Whenever lj and l m are physcally adjacent.e. they have a common node or ether (1) or (2) hold, they cannot be panted by the same color. Usng (1) and (2), ln adjacency matrx whch s used to desgn colorng algorthm s defned. B. Conventonal Schedulng In general conflct free schedulng, for a gven nterference margn, s based on conventonal graph colorng technques. A smple and low complexty algorthm for mnmal colorng.e. pantng all lns wth mnmum requred number of colors s as follows, Step 1. Frst ln s assgned to the frst (=1) partal topology (color),.e. T 1 ={l 1 }. Step 2. Next unassgned ln l j s chosen. Step. 3. Usng (1), f for any value of, l j can be smultaneously actvated wth all members of T, t s added to T as T T U l j. Step 4. If for all, where max, last step cannot be run, l j s consdered as frst element of T max+ 1 and max max +1. Step 5. If all lns are allocated to T, we have a complete set of partal topologes and f not, go to Step 2 and run the last two steps for all remaned lns. T s computed by a colorng scheme le ths, form a complete set of partal topologes where each ln s member of only one of partal topologes. Followng smple example shows neffcency of colorng when lns must be fred wth dfferent usage rates. Assume 3 lns l 1, l 2, l 3 wth rates r 1 =3, r 2 =1, r 3 =2, where ln 1 can be actvated wth other two smultaneously and two others cannot be actvated together. Mnmal colorng schemes for these 3 lns wth ther assgned rates are as follows ) T 1 ={l 1, l 2 } and T 2 ={l 3 } requred number of tme slots s 5. ) T 1 ={l 1, l 3 } and T 2 ={l 2 } requred number of tme slots s 4. But obvously none of these colorng schemes are optmum and optmum schedulng for these lns s, ) T 1 ={l 1, l 2 } durng the frst tme slot and T 2 ={l 1, l 3 } durng the next two slots; requred number of tme slots s 3. Therefore n optmum soluton T have non-empty ntersecton and we call them components of the topology. A component s a set of lns that can be actvated at the same tme. Any sngle ln s also a component and we call them as frst generaton components and τth generaton of components means set of all components each wth τ members. Components of each generaton are parents of one n the next generaton. For our 3-lns example, we have 5 components as follows, T 1 ={l 1 }, T 2 ={l 2 }, T 3 ={l 3 }, T 4 ={l 1, l 2 } and T 5 ={l 1, l 3 }, where frst 3 components are parents of the last two ones. Consequently n general case to optmze the schedulng approprate components and ther optmal rates must be found.
3 III. MATRIX GAME FORMULATION Gven ln actvaton rate vector r wth I elements and component set C wth J elements, we defne followng payoff matrx H as follows, where s actvaton rate for th ln and s jth component. Assume H as payoff matrx of the mn-max zero sum game between two players where ther strategy sets are lns and components sets respectvely. In the sequel we prove that the mxed strategy vector of the second player gves optmum component rate. Theorem- mxed equlbrum of the zero sum game defned by payoff matrx (3) gves optmum schedulng for rate vector r. Proof: Assume x and y as mxed strateges of the players at equlbrum. Snce y s normalzed to 1 actvaton of components n average needs one tme slot. r as actvaton rate of th ln supported by y components s computed as follows, r~ = [ H]y (4) r where [ ] H s th row of the H. Therefore by component rate vector y, the ln wth mnmum supported rate whch s bottlenec of the game s, mnmum (3) = arg mn ( [ H] (5) Consequently optmum component rate vector must maxmze mn ( [ H] a y = arg max mn ( [ H] y (6) And theoretcally (6) s equvalent to x ( x T H y = arg max y mn, (7) where (7) defnes equlbrum for game defned by payoff matrx H and value mn ( x T H max y. Formulaton of the problem as a game gves us the chance to smplfy the model usng especal propertes of the games, le domnancy theory. For nstance n general case whle solvng ths game, because of domnancy, components tagged x as parent can be gnored because apparently any parent s domnated by ts chld. Therefore we just need to consder last generaton generated born from any ln. On the other hand, calculaton of mx strategy for lnear games s easy and can be performed by fcttous playng method (FP). FP property of the games s a feature of statonary games where players can update ther belef on other player s strateges based on hstory of ther decsons. Ths technque whch s used to solve matrx games, was proposed by Brown [13] and ts convergence for dfferent condtons was proved n [14-19]. FP algorthm for a mn-max zero-sum game has followng steps, Step 1. Intalzaton of xˆ as, ˆ [ ] T x =, (8) 0 H where [ ] H s and arbtrary row of H ( xˆ actually wll be Hy ). Then set teraton number =1. Step 2. Fndng best strategy for the frst player at th teraton as, = arg mn (9) m xˆ where 1,m xˆ, m s mth element of the ˆx. Step 3. Updatng ŷ as, ˆy = ˆy + [ H]. Step 4. Fndng best strategy for the second player at th teraton as, j n ŷ,n where = arg max (10) ŷ, n s nth element of the ŷ. Step 5. If We algorthm has not converged to equlbrum set + 1 then update ˆx as, xˆ = xˆ + [ H], (11) 1 j and then return to Step 2. Algorthm s δ converged f, ŷ,j xˆ, δ, (12) When the algorthm approaches equlbrum mxed strateges for both players are calculated by averagng over best strateges calculated at each teraton. 1
4 IV. SIMULATION RESULTS The proposed algorthm s smulated over randomly generated graphs wth nodes unformly dstrbuted over unt square. Sources and sns are also selected randomly and for each source-sn par shortest path (physcally shortest part that requres mnmum power) s calculated usng Djstra algorthm [20]. Attenuaton factor s assumed to be 4 and number of pacets to delver from each source to ts correspondng sn s randomly chosen by Posson dstrbuton. The proposed optmal algorthm s compared to the conventonal schedulng based on networ graph colorng and no schedulng case. The average number of requred tme slots to carry each pacet from source to ts correspondng sn s consdered as performance crteron and results are averaged over 1000 ndependent runs. Results are summarzed n Fgs Fg. 1, presents average number of requred tme slots versus nterference margn (β) for dfferent numbers of source-sn sessons when N =10 nodes. We can see from the fgure that the proposed schedulng outperformance conventonal scheme. In the case where we have 10 parallel source-sn sessons, optmum schedulng offers more schedulng gan compared to 5 source-sn sessons because when hgher number of paths must be scheduled, more paths s partcpatng n the schedulng process. Therefore every ln has more partners for smultaneous transmsson. In other word, number of last generaton of components s hgher and consequently schedulng gan s also hgher. Fg. 2, presents the same results for N=20. In ths case, when we have 10 parallel source-sn pars, both optmum and conventonal schedulng offer more schedulng gan compared to the 5 parallel pars but gan of the optmum schedulng s stll much hgher. Fgs. 3 and 4 present average number of requred tme slots versus number of parallel source-sn pars. We can see that the schedulng gan advantage of optmum schedulng compared to the conventonal schedulng ncreases wth the number of source-sn pars. For nstance, n the case of 10 source-sn pars, optmum schedulng needs between 11 and 25 percent less tme slots n average. V. CONCLUSION In ths paper a novel technque based on matrx games s proposed to solve optmal schedulng problem s wreless adhoc networ. In the proposed method, frst wreless topology s dvded to components whch actually are overlapped partal topologes. Then by assgnng approprate usage rates to the selected components optmum schedulng s acheved. The optmal rates for graph components are obtaned by calculatng mx equlbrum of a matrx game between lns and components. Usng matrx games for ths nd of problem helps us to smplfy the problem through specal features of the games, and usng fcttous playng method whch wors teratvely, provdes quc convergence. The proposed game model has been smulated for multpleuncast sessons and the results are averaged over 1000 ndependent runs. Smulaton results prove the effcency of the proposed method compared wth the conventonal schedulng. REFERENCES [1] D. D. Vergados, D. J. Vergados, C. Doulgers, and S. L. Tombros, QoS-aware TDMA for end-to-end traffc schedulng n ad hoc networs, IEEE Transactons on Wreless Communcatons, vol. 13, no. 5, pp , Oct [2] K. Oonomou and Stavraas, Analyss of a probablstc topology-unaware TDMA MAC polcy for ad hoc networs, IEEE Journal on Selected Areas n Communcatons, vol. 22, no. 7, pp , Sep [3] T. C. Hou, C. M. Wu, and M. C. Chan, Dynamc channel assgnment n clustered multhop CDMA/TDMA ad hoc networs, n proceedngs of 15 th nternatonal Conference on Personal, Indoor and Moble Rado Communcatons, PIMRC2004, pp , Sep [4] H. S. Ahn and S. W. Ra, A study on synchronzaton of hybrd TDMA/bnary CDMA, n Proceedngs of 57st IEEE Vehcular Technology Conference, VTC Sprng 2003, Jeju, S. Korea, Aprl 2003, pp [5] W. We, L. Xn, and D. Krshnaswamy, Robust Routng and Schedulng n Wreless Mesh Networs, proceedngs of SECON 2007, pp , June [6] T. El-Batt and A. Ephremdes, Jont Schedulng And Power Control For Wreless Ad-Hoc Networs, n proceedngs of INFOCOM 2002, vol. 2, pp , June [7] Y. E. Sagduyu, and A. Ephremdes, On Jont MAC and Networ Codng n Wreless Ad Hoc Networs, IEEE Transactons on Informaton Theory, vol. 53, no. 10, pp , Oct [8] B. Lorenzo, S. Glsc, Optmzaton of Relayng Topology n Cellular Multhop Wreless Networs, IEEE Mltary Communcatons Conference MILCOM 2008, pp [9] A. Ghonem, H. Abbass, and M. Barlow, Characterzng Game Dynamcs n Two-Player Strategy Games Usng Networ Motfs, IEEE Transactons on System, Man, and Cybernetcs, Part B, vol. 38, no. 3, pp , June [10] D. Nyato, and E. Hossan, A Noncooperatve Game- Theoretc Framewor for Rado Resource Management n 4G Heterogeneous Wreless Access Networs, IEEE Transactons on Moble Computng, vol. 7, no. 3, pp , Mar [11] R. Banner and A. Orda, Bottlenec Routng Games n Communcaton Networs, IEEE Transactons on Selected Areas n Communcatons, vol. 25, no. 6, pp , Aug
5 [12] F. Herrmann and A. Hertz, Fndng the chromatc number by means of crtcal graphs, Journal of Expermental Algorthmcs, vol. 7, p. 10, [13] G.W. Brown, Iteratve soluton of games by fcttous play, n Actvty Analyss of Producton and Allocaton, T. C. Koopmans, Ed. NewYor: Wley, 1951, pp [14] J. Robnson, An teratve method of solvng a game, Ann. Math., vol. 54, no. 2, pp , Sep [15] R. Deschamps, Ph.D thess, Unversty of Louvan, [16] R. Deschamps, An algorthm of game theory appled to the duopoly problem, European Economc, Revew 6, pp , [17] V. Krshna, Learnng n games wth strategc complementartes, mmeo, [18] Mlgrom, Paul and John Roberts, Adaptve and Sophstcated Learnng n Repeated Normal Form Games, n proceedngs of Games and Economc Behavor, February 1991, pp [19] K. Myasawa, On the convergence of the learnng process n a 2_2 non-zero-sum two person game, Economc Research Program, Prnceton Unversty, Research Memorandum No. 33, [20] E. W. Djstra A note on two problems n connecton wth graphs, n Numershe Mathemat, vol. 1, pp , Fg. 1. Average no. of requred tme slots w.r.t. nterference margn for N=10. Fg. 2. Average no. of requred tme slots w.r.t. nterference margn for N=20. Fg. 3. Average no. of requred tme slots number f source-sn pars for N=10. Fg. 4. Average no. of requred tme slots number f source-sn pars for N=20.
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 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 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 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 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 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 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 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 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 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 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 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 informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
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 informationRESOURCE 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 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 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 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 informationEE360: Lecture 7 Outline Cellular System Capacity and ASE Announcements Summary due next week
EE360: Lecture 7 Outlne Cellular System Capacty and ASE Announcements Summary due next week Capacty Area Spectral Effcency Dynamc Resource Allocaton Revew of Cellular Lecture Desgn consderatons: Spectral
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 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 informationJoint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
Jont Channel Assgnment and Opportunstc Routng for Maxmzng Throughput n Cogntve Rado Networs Yang Qn*, Xaoxong Zhong*, Yuanyuan Yang +,Yanln L* and L L* *Key Laboratory of Networ Orented Intellgent Computaton,
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
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 informationQueuing-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 informationUplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationAsynchronous 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 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 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 informationJoint iterative beamforming and power adaptation for MIMO ad hoc networks
RESEARCH Open Access Jont teratve beamformng and power adaptaton for MIMO ad hoc networks Engn Zeydan *, Ddem Kvanc 2, Ufuk Turel 2 and Crstna Comancu Abstract In ths paper, we present dstrbuted cooperatve
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 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 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 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 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 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 informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
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
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 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 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 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 informationJoint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks
Jont Rate-Routng Control for Far and Effcent Data Gatherng n Wreless sensor Networks Yng Chen and Bhaskar Krshnamachar Mng Hseh Department of Electrcal Engneerng Unversty of Southern Calforna Los Angeles,
More informationCELLULAR SYSTEM CAPACITY and PERFORMANCE IMPROVEMENT with SDMA
CELLULAR SYSTEM CAPACITY and PERFORMANCE IMPROVEMENT wth SDMA Flpe Alves, Henrque Rbero, José Fernandes 3 Escola Superor de Tecnologa, Insttuto Poltécnco de Castelo Branco, 6 Castelo Branco, Portugal Phone:+35-7-339355
More informationA NOVEL PREAMBLE DESIGN FOR CHANNEL ESTIMATION IN MIMO- OFDM SYSTEMS RESULTING IN ENHANCED THROUGHPUT
Volume 53, umber 3, 01 ACTA TECHICA APOCESIS Electroncs and Telecommuncatons A OVEL PREAMBLE DESIG FOR CHAEL ESTIMATIO I MIMO- OFDM SYSTEMS RESULTIG I EHACED THROUGHPUT Shakeel Salamat ULLAH atonal Unversty
More informationImpact 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 informationA 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 informationTECHNICAL 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 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 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 informationPerformance Study of OFDMA vs. OFDM/SDMA
Performance Study of OFDA vs. OFD/SDA Zhua Guo and Wenwu Zhu crosoft Research, Asa 3F, Beng Sgma Center, No. 49, Zhchun Road adan Dstrct, Beng 00080, P. R. Chna {zhguo, wwzhu}@mcrosoft.com Abstract: In
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 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 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 informationLifetime-Oriented Optimal Relay Deployment for Three-tier Wireless Sensor Networks
Sensors & Transducers by IFSA http://www.sensorsportal.com Lfetme-Orented Optmal Relay Deployment for Three-ter Wreless Sensor Networs Bn Zeng, Lu Yao and Ru Wang Department of Management, Naval Unversty
More informationThe Stability Region of the Two-User Broadcast Channel
The Stablty Regon of the Two-User Broadcast Channel Nkolaos appas *, Maros Kountours, * Department of Scence and Technology, Lnköpng Unversty, Campus Norrköpng, 60 74, Sweden Mathematcal and Algorthmc
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 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 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 informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationDistributed Interference Alignment in Cognitive Radio Networks
Dstrbuted Interference Algnment n Cogntve Rado Networks Y Xu and Shwen Mao Department of Electrcal and Computer Engneerng, Auburn Unversty, Auburn, AL, USA Abstract In ths paper, we nvestgate the problem
More informationA Predictive QoS Control Strategy for Wireless Sensor Networks
The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu
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 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 informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationEE360: Lecture 9 Outline Resource Allocation in Ad Hoc Nets
EE360: Lecture 9 Outlne Resource Allocaton n Ad Hoc Nets Announcements Paper summares due next Wednesday Overvew of resource allocaton n ad-hoc networks Cross-layer adaptaton Dstrbuted power control Jont
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 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 informationDistributed Scheduling and Power Control for Predictable IoT Communication Reliability
Dstrbuted Schedulng and Power Control for Predctable IoT Communcaton Relablty Lng Wang and Hongwe Zhang Department of Electrcal and Computer Engneerng Iowa State Unversty {lngw, hongwe}@astate.edu Pengfe
More informationCOST EFFICIENCY OPTIMIZATION OF 5G WIRELESS BACKHAUL NETWORKS
COST EFFICIENCY OPTIMIZATION OF 5G WIRELESS BACKHAUL NETWORKS Xaohu Ge, Senor Member, IEEE, Song Tu, Guoqang Mao 2, Senor Member, IEEE, Vncent K. N. Lau 3, Fellow, IEEE, Lnghu Pan School of Electronc Informaton
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 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 informationHUAWEI 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 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 informationCombined Beamforming and Scheduling for High Speed Downlink Packet Access
Combned Beamformng and Schedulng for Hgh Speed Downlnk Packet Access Alexander Seeger Informaton and Communcaton Moble Semens A.G. Hofmannstr.5, 8359 Munch, Germany Alexander.Seeger@semens.com Marcn Skora
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More informationAMC-aware QoS proposal for OFDMA-based IEEE WiMAX systems
AMC-aware QoS proposal for OFDMA-based IEEE82.6 WMAX systems Chad Tarhn, Tjan Chahed GET/Insttut Natonal des Télécommuncatons/UMR CNRS 557 9 rue C. Fourer - 9 Evry CEDEX - France {chad.tarhn, tjan.chahed}@nt-evry.fr
More informationDistributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks
Dstrbuted Energy Effcent Spectrum Access n Cogntve Rado Wreless Ad Hoc Networks Song Gao, Ljun Qan, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas
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 informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationImproved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies
Improved Algorthms for Data-Gatherng Tme n Sensor Networs II: Rng, Tree and Grd Topologes Yoram Revah and Mchael Segal Communcaton Systems Engneerng Department Ben-Guron Unversty of the Negev, Beer-Sheva,
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 informationEnergy 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 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 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 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 informationEENCR: An Energy-efficient Network Coding based Routing Protocol. May 8, 2014
EENCR: An Energy-effcent Networ Codng based Routng Protocol May 8, 2014 1 1 Prelmnary Ahlswede et al. [2] frst proposed the networ codng technque. The authors showed that the use of networ codng can effectvely
More informationDynamic Resource Allocation Algorithm of UAS by Network Environment and Data Requirement
Dynamc Resource Allocaton Algorthm of UAS by Network Envronment and Data Requrement Hye-Rm Cheon, Jun-Woo Cho, and Jae-Hyun Km Department of Electrcal and Computer Engneerng Ajou Unversty Suwon, Republc
More informationCooperative Dynamic Game-Based Optimal Power Control in Wireless Sensor Network Powered by RF Energy
sensors Artcle Cooperatve Dynamc Game-Based Optmal Power Control n Wreless Sensor etwork Powered by RF Energy Manx Wang 1, Hatao Xu 2, * ID and Xanwe Zhou 2 1 State Key Laboratory of Complex Electromagnetc
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 informationCROSS-LAYER OPTIMIZATION PERFORMANCE OF SINGLE CELL MILLIMETER WAVE OFDM WIRELESS NETWORK UNDER RAIN FADING
Semnar Nasonal Aplkas Teknolog Informas 009 (SNATI 009) Yogyakarta, 0 Jun 009 CROSS-LAYER OTIMIZATION ERFORMANCE OF SINGLE CELL MILLIMETER WAVE OFDM WIRELESS NETWORK UNDER RAIN FADING E. Endroyono 1, G.
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 informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationKeywords 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 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 informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationMaximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
Maxmzng Lfetme of Sensor-Target Survellance n Wreless Sensor Networks Ha Lu, Xaowen Chu, Yu-Wng Leung Computer Scence, Hong Kong Baptst Unversty Xaohua Ja, Peng-Jun Wan Computer Scence, Cty Unversty of
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 information