Utility-based Routing
|
|
- Christian Howard Blake
- 5 years ago
- Views:
Transcription
1 Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty
2 Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2
3 . Introducton Z. Mao (Serve the People) Knowledge begns wth practce. Theoretcal knowledge acqured through practce, must then return to practce. G. H. Hardy (A Mathematcan's Apology) The real mathematcs of the real mathematcans s almost wholly useless. It s not possble to justfy the lfe of any genune mathematcan on the ground of the utlty of hs work. 3
4 Implcatons Poltcans (when they become poltcally weak) Start new revolutons (and young people become followers) Mathematcans (when they become old) Start wrtng books (and young people prove theorems) Professors (when they become senors) Gve presentatons (and students wrte papers) 4
5 2. Why Another Routng Scheme Why routng agan? Because t s nterestng (a non-serous answer) A new routng algorthm: composte utlty Beneft (of packet delvery) Cost (of forwardng) Relablty (of lnks) Tmelness (of reachng a destnaton) 5
6 A Postage Example Best route: mportance of the package Valuable package: Fedex (more relable, costs more) Regular package: Regular mal (less relable, costs less) route package sender route 2 route k recever cost/relablty 6
7 A Sample Network Tradtonal metrcs: cost/relablty The mnmum cost path: s d Cost = 5 Relablty = 0.72 The most relable path: s 2 d Cost = 7 Relablty = 0.8 7
8 3. Utlty-Based Routng (Lu&Wu 06) Each packet s assgned a beneft value, v s transmts a packet wth beneft v to d Transmsson cost/relablty: c/p Utlty: v c f success, 0 c otherwse Expected utlty: u = p(v-c) + (-p)(0-c) = pv - c The best route maxmzes u Success: Falure: -p p s c d 8
9 A General Expresson General form of u for path R: s (= 0),,, +,, d (= n) where P R : route stablty, and C R : route cost + p,+ c, + s d R R n j j j n C P v p c v p u = = = = + + = + 0 0,, 0, ) ( ) ( 9
10 How to calculate u? Drect calculaton 0.8 *0.9*20 2 3*0.8=0 Backward calculaton s 2/0.8 3/0.9 d V=20 u = p,+ u + - c,+ (vrtual s/d) 0.9*20 3 = 5 (at ) 0.8*5 2 = 0 (at s) 0
11 Beneft-Dependent Best Paths R : s d R 2 : s 2 d R 3 : s 2 d R 4 : s 2 d R P C R R R R v=20 R U R 0 R 2 R R v= R U R R R R Dfferent beneft values may have dfferent best paths!
12 4. Implementatons Centralzed greedy approach Apples the Djkstra s shortest path from d Each node mantans the maxmum u (nt. to 0) relaxes j: u j = p j, u - c j, untl reachng s Wreless and moble: reactve approach Route dscovery (from s) followed by route reply (from d) Tme out: each node set an approprate order of relaxatons s j relax d 2
13 5. Extensons All optmal routes Dfferent beneft values Wreless networks Opportunstc routng Incentve compatble routng Handlng selfsh nodes Real-tme responses Duty cycles n WSNs Probablstc contacts n DTNs (Others: data gatherng and network codng) 3
14 All Optmal Routes Requrement Fnd all optmal routes for dfferent benefts Challenges Enumeratng all benefts s nfeasble For a gven range of benefts Checkng all paths s too expensve Exponental to the number of nodes One mportant property The benefts range can be parttoned nto subranges, each of whch has one dstnct optmal path 4
15 Intersecton Pont R: s -> -> d R2: s -> 2 -> d U R = 0.72v 4.4 U R2 = 0.9v-7 Complexty: O(R 2 ) (R: number of paths) 5
16 Bnary Partton Iteratve and parallel partton the beneft range nto sub-ranges Stoppage condton: r tan θ tan θ 2 < Δ (r: sub-range, θ and θ 2 : angle of R and R 2 ) 6
17 Wreless Networks (Wu, Lu, & L 08) Opportunstc routng (OR) wth adjustable transmsson range Relay set: more than one node can relay Prorty: ETX or cost to destnaton 7
18 OR Example Best expected utlty u s = 0 for v = 20 Prorty s < 2 < < d Best expected opportunstc utlty opus = 4.6 for v = 20 Optmal soluton NP-hard: the dffculty les n the global prorty 8
19 Incentve Compatble Routng Nodes are selfsh and gve false cost nformaton Wthout reward, they wll not help relay packets Maxmze utlty = payment cost Mechansm desgn Te self-nterest to socetal nterest VCG scheme: enforcng the reportng of correct costs Nodes on optmal path: utlty remans the same when lyng Nodes not on optmal path: utlty reduces when lyng 9
20 Second Prce Path Aucton: VCG Why doesn t the frst prce work? Socetal objectve s nconsstent wth ndvdual nodes objectves The soluton: second prce Loser s payment s 0 Wnner s payment: (lowest cost wthout - lowest cost wth ) + cost of node 20
21 A VCG Example s Case : nodes on an optmal path le If (s, ) s changed to 3 d S stll gets = 4 (same as = 4) Case 2: nodes on a non-optmal path le If (2, d) s changed to 2 gets = < 3 (utlty s negatve) Who s payng the prce dfference: socety Even an deal socety charges tax 2
22 Real-Tme Responses (Xao, Wu, & Wang 2) Energy savng: on/off mode n WSNs Duty cycle = 4: up every 4 unts Asynchronous send Wth a delay, 2, 3, or 4 s, 2, 3, 4 d Extendng utlty functon: delay-senstve 22
23 Duty Cycles n WSNs Utlty for a delvery path R: s (=0),, 2,, n-, d (=n) Drect computaton Iteratve computaton forward backward = = + + = = + + = 0 0,, 0 0,, ) ( n j j j n n p c t v p u δ,, = c u p u + + =, t v v δ ) nt, ( 0 u u v u n n = = 23 forward backward d s
24 Probablstc Contacts n DTNs DTNs Probablstc contacts (uncertanty) Mnmzng the expected decreased utlty Opportunstc forwardng Relay s extended from a sngle node to a tme-varyng forwardng set (FS) A message copy s forwarded from to the frst contact j at tme t f j s n FS(, t) md cost, md uncertanty low cost, hgh uncertanty large cost, low uncertanty 24
25 6. Some Fnal Thoughts Is research on routng over? Probably yes: MANETs and sensor nets No: Other networks (e.g. DTNs and socal networks) Moblty n Wreless Networks: Frend or Foe? Moblty as a Foe: toleratng and maskng Moblty as a Frend: moblty-asssted routng 25
26 Some Challenges Future world beng more wreless and moble Complexty and dversty New challenges for routng protocol desgn From top: more demand from the end user (e.g., moblty support) From bottom: emergng technologes (e.g., new abstracton for wreless lnks) 26
27 Graphs for Dynamc Networks E.g. Moblty affects network model/protocol Tme-space vew vs. space vew Vew wndow Tme Space Vew(-) Vew() Vew(+k) Vew consstency n statc graphs Wu & Da (IEEE Network 05): functon of multple vews Connectvty & routng n evolvng graphs Lu & Wu (MobHoc 07, 08, 09) Wu (Graph and Computng 0) 27
28 Collaborators Former students Prof. Mngmng Lu (CSU) Prof. Feng L (IUPUI) Vstng scholar Prof. Mngjun Xao (USTC) 28
29 Questons 29
Review: 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 informationAlgorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov
Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6
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 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 informationMovement - Assisted Sensor Deployment
Intro Self Deploy Vrtual Movement Performance Concluson Movement - Asssted Sensor Deployment G. Wang, G. Cao, T. La Porta Dego Cammarano Laurea Magstrale n Informatca Facoltà d Ingegnera dell Informazone,
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 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 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 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 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 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 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 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 informationBackpressure Meets Taxes: Faithful Data Collection in Stochastic Mobile Phone Sensing Systems
Backpressure Meets Taxes: Fathful Data Collecton n Stochastc Moble Phone Sensng Systems Shusen Yang Unversty of Lverpool Emal: shusen.yang@lverpool.ac.uk Usman Adeel Imperal College London Emal: u.adeel9@mperal.ac.uk
More informationWireless Sensor Network Coverage Optimization Based on Fruit Fly Algorithm
Wreless Sensor Network Coverage Optmzaton Based on Frut Fly Algorthm https://do.org/10.3991/joe.v1406.8698 Ren Song!! ", Zhchao Xu, Yang Lu Jln Unversty of Fnance and Economcs, Jln, Chna rensong1579@163.com
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
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 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 information2005 Journal of Software. . Ad hoc ), ) A Delay Oriented Adaptive Routing Protocol for Mobile Ad hoc Networks
-985/5/6(9)66 5 Journal of Software Vol6, No9 A hoc,,,+,,,, (, 37) ( ), 37) A Delay Orente Aaptve Routng Protocol for Moble A hoc Networks XIE Fe,, ZHANG Xn-Mng,+, GUO Ja-Feng,, CHEN Guo-Lang, (Department
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 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 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 informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
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 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 informationDistributed Relay Selection and Power Allocation Using Stackelberg and Auction Games in Multi-user Multi-relay Networks
ensors & Transducers 013 by IFA http://www.sensorsportal.com Dstrbuted Relay electon and Power Allocaton Usng tackelberg and Aucton Games n Mult-user Mult-relay Networks Erqng ZHANG xng YIN Lang YIN hufang
More informationSpectrum Auction Framework for Access Allocation in Cognitive Radio Networks
Spectrum Aucton Framework for Access Allocaton n Cogntve Rado Networks ABSTRACT Gaurav S. Kasbekar Department of Electrcal and Systems Engneerng Unversty of Pennsylvana kgaurav@seas.upenn.edu Cogntve rado
More informationOptimal Multicast in Multi-Channel Multi-Radio Wireless Networks
Optmal Multcast n Mult-Channel Mult-Rado Wreless Networks Aay Gopnathan, Zongpeng L, Carey Wllamson Department of Computer Scence, Unversty of Calgary {agopnat,zongpeng,carey}@cpsc.ucalgary.ca Abstract
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
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 informationGenetic Algorithm for Sensor Scheduling with Adjustable Sensing Range
Genetc Algorthm for Sensor Schedulng wth Adjustable Sensng Range D.Arvudanamb #, G.Sreekanth *, S.Balaj # # Department of Mathematcs, Anna Unversty Chenna, Inda arvu@annaunv.edu skbalaj8@gmal.com * Department
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 informationMulti-hop Coordination in Gossiping-based Wireless Sensor Networks
Mult-hop Coordnaton n Gosspng-based Wreless Sensor Networks Zhlang Chen, Alexander Kuehne, and Anja Klen Communcatons Engneerng Lab, Technsche Unverstät Darmstadt, Germany Emal: {z.chen,a.kuehne,a.klen}@nt.tu-darmstadt.de
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 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 informationJoint Routing and Link Scheduling for Wireless Mesh Networks through Genetic Algorithms
Jont Routng and Lnk Schedulng for Wreless Mesh Networks through Genetc Algorthms Leonardo Bada, Alesso Botta IMT Lucca Insttute for Advanced Studes pazza S. Ponzano 6, 55100, Lucca, Italy {leonardo.bada,alesso.botta}@mtlucca.t
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 informationIntroduction to Coalescent Models. Biostatistics 666
Introducton to Coalescent Models Bostatstcs 666 Prevously Allele frequences Hardy Wenberg Equlbrum Lnkage Equlbrum Expected state for dstant markers Lnkage Dsequlbrum Assocaton between neghborng alleles
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 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 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 informationA Metric for Opportunistic Routing in Duty Cycled Wireless Sensor Networks
A Metrc for Opportunstc Routng n Duty Cycled Wreless Sensor Networks Euhanna Ghadm, Olaf Landsedel, Pablo Soldat and Mkael Johansson euhanna@kth.se, olafl@chalmers.se, pablo.soldat@huawe.com, mkaelj@kth.se
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 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 informationAn Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks
An Energy-aware Awakenng Routng Algorthm n Heterogeneous Sensor Networks TAO Dan 1, CHEN Houjn 1, SUN Yan 2, CEN Ygang 3 1. School of Electronc and Informaton Engneerng, Bejng Jaotong Unversty, Bejng,
More informationAdaptive Modulation and Coding for Utility Enhancement in VMIMO WSN Using Game Theory
Adaptve Modulaton and Codng for Utlty nhancement n VMIMO WSN Usng Game Theory R. Vall and P. Dananjayan mparments. The data transmtted from the sensor nodes s hghly susceptble to error n a wreless envronment
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 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 informationproblems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance
palette of problems Davd Rock and Mary K. Porter 1. If n represents an nteger, whch of the followng expressons yelds the greatest value? n,, n, n, n n. A 60-watt lghtbulb s used for 95 hours before t burns
More informationIntroduction to Coalescent Models. Biostatistics 666 Lecture 4
Introducton to Coalescent Models Bostatstcs 666 Lecture 4 Last Lecture Lnkage Equlbrum Expected state for dstant markers Lnkage Dsequlbrum Assocaton between neghborng alleles Expected to decrease wth dstance
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 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 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 informationA Unified Cross-Layer Framework for Resource Allocation in Cooperative Networks
3000 IEEE TRNSCTIONS ON WIRELESS COMMUNICTIONS, VOL. 7, NO. 8, UGUST 2008 Unfed Cross-Layer Framework for Resource llocaton n Cooperatve Networks We Chen, Member, IEEE, Ln Da, Member, IEEE, Khaled Ben
More informationVRT014 User s guide V0.8. Address: Saltoniškių g. 10c, Vilnius LT-08105, Phone: (370-5) , Fax: (370-5) ,
VRT014 User s gude V0.8 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More 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 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 informationsensors ISSN by MDPI
Sensors 2007, 7, 628-648 Full Paper sensors ISSN 1424-8220 2007 by MDPI www.mdp.org/sensors Dstrbuted Partcle Swarm Optmzaton and Smulated Annealng for Energy-effcent Coverage n Wreless Sensor Networks
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 informationModified Predictive Optimal Control Using Neural Network-based Combined Model for Large-Scale Power Plants
1 Modfed Predctve Optmal Control Usng Neural Networ-based Combned Model for Large-Scale Power Plants Kwang Y Lee, Fellow, IEEE, Jn S Heo, Jason A Hoffman, Sung-Ho Km, and Won-Hee Jung Abstract--Wth a Neural
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 informationA Strategy-Proof Combinatorial Heterogeneous Channel Auction Framework in Noncooperative Wireless Networks
Ths s the author s verson of an artcle that has been publshed n ths journal. Changes were made to ths verson by the publsher pror to publcaton. The fnal verson of record s avalable at http://dx.do.org/1.119/tmc.214.2343624
More informationGAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS. Ismet Sahin. B.S., Cukurova University, M.S., University of Florida, 2001
GAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS by Ismet Sahn B.S., Cukurova Unversty, 996 M.S., Unversty of Florda, 00 Submtted to the Graduate Faculty of School of Engneerng n partal
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 informationPerformance Analysis of Location-Based Data Consistency Algorithms in Mobile Ad Hoc Networks
Performance Analyss of Locaton-Based Data Consstency Algorthms n Moble Ad Hoc Networks Ing-Ray Chen, Jeffery W. Wlson Department of Computer Scence Vrgna Tech {rchen, wlsonjw}@vt.edu Frank Drscoll, Karen
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 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 informationSTUDY OF MATRIX CONVERTER BASED UNIFIED POWER FLOW CONTROLLER APPLIED PI-D CONTROLLER
Journal of Engneerng Scence and Technology Specal Issue on Appled Engneerng and Scences, October (214) 3-38 School of Engneerng, Taylor s Unversty STUDY OF MATRIX CONVERTER BASED UNIFIED POWER FLOW CONTROLLER
More informationA TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS
A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5
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 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 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 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 informationEMA. Education Maintenance Allowance (EMA) Financial Details Form 2017/18. student finance wales cyllid myfyrwyr cymru.
student fnance wales cylld myfyrwyr cymru Educaton Mantenance Allowance (EMA) Fnancal Detals Form 2017/18 sound advce on STUDENT FINANCE EMA Educaton Mantenance Allowance (EMA) 2017/18 /A How to complete
More informationAn Efficient Energy Adaptive Hybrid Error Correction Technique for Underwater Wireless Sensor Networks
World Academy of Scence, Engneerng and Technology 5 2 An Effcent Energy Adaptve Hybrd Error Correcton Technque for Underwater Wreless Sensor Networks Ammar Elyas babker, M.Nordn B. Zakara, Hassan Yosf,
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 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 informationFair Coalitions for Power-Aware Routing in Wireless Networks
Unversty of Pennsylvana ScholarlyCommons Departmental Papers (ESE) Department of Electrcal & Systems Engneerng February 2007 Far Coaltons for Power-Aware Routng n Wreless Networks Ratul K. Guha Unversty
More informationNon-collaborative Resource Management for Wireless Multimedia Applications Using Mechanism Design
Non-collaboratve Resource Management for Wreless Multmeda Applcatons Usng Mechansm Desgn Fangwen Fu and Mhaela van der Schaar Eleccal Engneerng Department, Unversty of Calforna, Los Angeles (UCLA) 1 ABSTRACT
More informationSecure Power Scheduling Auction for Smart Grids Using Homomorphic Encryption
Secure Power Schedulng Aucton for Smart Grds Usng Homomorphc Encrypton Haya Shajaah, Student Member, IEEE, Ahmed Abdelhad, Senor Member, IEEE, and Charles Clancy, Senor Member, IEEE Abstract In ths paper,
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 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 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 Preliminary Study on Targets Association Algorithm of Radar and AIS Using BP Neural Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 (2 44 445 A Prelmnary Study on Targets Assocaton Algorthm of Radar and AIS Usng BP Neural Networ Hu Xaoru a, Ln Changchuan a a Navgaton Insttute
More informationPerformance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 81 Performance Evaluaton of QoS Parameters n Dynamc Spectrum Sharng for Heterogeneous
More informationN- and P-Channel 2.5-V (G-S) MOSFET
S456DY N- and P-Channel.5-V (G-S) MOSFET PRODUCT SUMMARY V DS (V) R DS(on) (Ω) (A).5 at 7. N-Channel.35 at V GS =.5 V 6. FEATURES Halogen-free Accordng to IEC 649-- Defnton TrenchFET Power MOSFET:.5 Rated
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 information1 GSW Multipath Channel Models
In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons
More informationOn Sensor Fusion in the Presence of Packet-dropping Communication Channels
On Sensor Fuson n the Presence of Packet-droppng Communcaton Channels Vjay Gupta, Babak Hassb, Rchard M Murray Abstract In ths paper we look at the problem of multsensor data fuson when data s beng communcated
More information>>> SOLUTIONS <<< 5 pts each sub-problem. 3 pts for correct formulas and set-up for each sub-problem.
Comprehensve Fnal Exam for Computer Networks (CNT 65) Fall >>> SOLUTIONS
More informationCDMA Uplink Power Control as a Noncooperative Game
Wreless Networks 8, 659 670, 2002 2002 Kluwer Academc Publshers. Manufactured n The Netherlands. CDMA Uplnk Power Control as a Noncooperatve Game TANSU APCAN, TAMER BAŞAR and R. SRIKANT Coordnated Scence
More informationCOMPARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HOP WIRELESS SENSOR NETWORKS 1
Internatonal Journal of Computer Networks & Communcatons (IJCNC), Vol., No.4, July 1 COMARISON OF DIFFERENT BROADCAST SCHEMES FOR MULTI-HO WIRELESS SENSOR NETWORKS 1 S. Mehta and K.S. Kwak UWB Wreless
More 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 informationNext Generation Wireless Networks: Research Challenges and Opportunities
Next Generaton Wreless Networks: Research Challenges and Opportuntes Abhay Karandkar Professor Department of Electrcal Engneerng Indan Insttute of Technology Bombay, Mumba 400076 karand@ee.tb.ac.n Har
More informationJointly optimal transmission and probing strategies for multichannel wireless systems
Jontly optmal transmsson and probng strateges for multchannel wreless systems (Invted Paper) Sudpto Guha, Kamesh Munagala, and Saswat Sarkar Dept. of Computer and Informaton Scences, UPenn, Phladelpha,
More informationDetermination of Available Transfer Capability (ATC) Considering Integral Square Generator Angle (ISGA)
6th WSEAS Int. Conference on Computatonal Intellgence, Man-Machne Systems and Cybernetcs, Tenerfe, Span, December 14-16, 27 214 Determnaton of Avalable Transfer Capablty (ATC) Consderng Integral Square
More informationFall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes
5-95 Fall 08 # Games and Nmbers A. Game 0.5 seconds, 64 megabytes There s a legend n the IT Cty college. A student that faled to answer all questons on the game theory exam s gven one more chance by hs
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 informationEvaluating Different One to Many Packet Delivery Schemes for UMTS
Evaluatng Dfferent One to Many Packet Delvery Schemes for UMTS Antonos Alexou, Dmtros Antonells, Chrstos Bouras Research Academc Computer Technology Insttute, Greece and Computer Engneerng and Informatcs
More informationThe Application of Tabu Search Algorithm on Power System Restoration
The Applcaton of Tabu Search Algorthm on Power System Restoraton FANG Xn-yan,CAI Xao-y, Jang Chuan-wen Dept.of Electrcal Eng.., Shangha Jaotong Unv., Shangha 200240, Chna Abstract:-The essay s just accordng
More information