TOUR: Time-sensitive Opportunistic Utility- based Routing in Delay Tolerant Networks
|
|
- Joleen Walters
- 6 years ago
- Views:
Transcription
1 TEMPLE UNIVERSITY TOUR: Time-sensitive Opportunistic Utility- based Routing in Delay Tolerant Networks Mingjun Xiao a,b, Jie Wu b, Cong Liu c, and Liusheng Huang a a University of Science and Technology of China, China b Temple University, USA c Sun Yat-sen University, China
2 Outline Introduction on utility-based routing Motivation Problem Solution Simulation Conclusion
3 Introduction: utility-based routing Concept : Utility-based routing [Jiewu 08, 12] Utility is a composite metric Utility (u) ) = Benefit (b) Cost (c) Benefit is a reward for a routing Cost is the total transmission cost for the routing Benefit and cost are uniformed as the same unit Objective is to maximize the utility of a routing
4 Introduction: utility-based routing Motivation of Utility-based Routing Valuable message: route (more reliable, costs more) Regular message: route (less reliable, costs less) message sender route 1 route 2 route k receiver Benefit is the successful delivery reward
5 Motivation Utility-based routing Delay Tolerant Network (DTN) delivery delay is an important factor for the routing design Time-sensitive utility-based routing
6 Time-sensitive utility model Benefit: a linearly decreasing reward over time Utility: u u( t) u s =b b( t) = b( t) δ c s { b t δ, = 0, c u i u(t) t b δ t > b δ b(t) s i d u d t
7 Problem Time-sensitive utility-based routing in DTN DTN: V={1, 2, }, λ i, j, c i (i, j V) source s, destination d, initial benefit b, benefit decay coefficient δ (single copy) Objective: maximizee[ E[u d ] or minimized s (u s )=b-e[ -E[u d ] for generality, minimize D i (u) u s =b δ c s u i { Di(u) u = E[ ] -ud t s i d u ud
8 A simple example Problem DTN: V={1, 2, 3, d}, λ i, j, c i (i, j V) source s=3 =3, destination d, initial benefit b=20 =20, benefit decay coefficient δ=2 Objective: minimize D 3 (u 3 ) λ 3,1=0.8 c 3 = 4 c1= 8 1 λ 1, d= 0.8 λ 3,d = d λ 3,2= c 2 = 4 λ 2, d= 0.2
9 Problem The key problem when a node i meets another node, whether the node i should forward messages to this encountered node, or ignore this forwarding opportunity, so that the node i can achieve the minimum D i (u)
10 Solution Basic idea: Time-Sensitive Opportunistic Forwarding Dynamically select relays: forwarding set R i (u) Opportunistic forwarding scheme: only forward messages to nodes in forwarding sets; ignore the other nodes outside of the set i d R i (u)
11 Solution Basic idea: Time-Sensitive Opportunistic Forwarding Forwarding set R i (u) is time-sensitive: vary with time, i.e., remaining utility u λ 3,1 =0.8 c 3 =4 c1=8 1 λ 1,d =0.8 λ 3,d = d λ 3, 2=0.2 2 c 2 =4 λ2,d=0.2 R*(u) 3 {d, 1, 2} {d, 2} {d} φ tim e u
12 Solution Determine optimal forwarding set Computation formula R i * (μ) R u) = arg min D ( u) i ( i R( u) R( u) N µ D ( u µ ) = ρ ( u)( µ u + D ( u )) du + i = i R( u) i, j j j j f 0 j R ( u) p ( µ ) µ i j d successful forwarding failed forwarding μ-u j D j (u j )
13 Solution Determine optimal forwarding set For a single node i : R i * (μ) Assumption: D j (μ-c i )=D j (u j ) are known D 1 (μ-c 1 )<D 2 (μ-c 2 )< <D m (μ-c m ) Method: : Greedily compute R i * (μ) R i * (μ): 1, 2,, k, k+1,, m Correctness: : Theorem 1 λ 3,1 =0.8 c 3 =4 λ 1,d = 0.8 λ 3,d = d λ 3, 2= 0.2 c1=8 1 2 c 2 =4 λ 2,d =0.2 D 3 ( μ ) D d ( 6 ) = 0 D 2 ( 6 ) = 5. 8 { d } D 1 ( 6 ) = 6 R * 3 ( μ = 1 0 ) { d, 2 } { d, 1, 2 }
14 Solution Determine optimal forwarding set For all nodes i V: R i *(μ) Method: : iteratively compute R i * (μ) for all i V V -1 rounds of computation Convergence: : Theorem 2 u R*(u) 3 (4, 2 0 ] {d} (0, 4] φ 1 3 d 2 u R*(u) 1 (8, 2 0 ] {d} (0, 8] φ u R*(u) 2 (4, 2 0 ] {d} (0, 4] φ u R*(u) 1 (8, 2 0 ] {d} u R 3 *(u) 1 (0, 8] φ (1 2, 2 0 ] {d,1,2} (8, 1 2 ] {d,2} (4, 8] {d} 3 d (0, 4] φ Round 1 Round 2 2 u R*(u) 2 (4, 2 0 ] {d} (0, 4] φ
15 Implementation Discrete Process D i (u) ~ ( u ) Di ~ D i (u) D i (u) μ 0 μ μ k μ n u R i (u) ~ ( u ) Ri μ 0 Estimation e rror ~ R(u) R(u) μ k μ μ n u
16 Discrete Process Implementation µ D ( µ ) ρ ( u)( µ u + D ( u )) du + i = R( u ) i, j j j j f 0 j R( u ) p ( µ ) µ µ ~ ~ D ( µ ) ~ ~ ρ ( u)( µ u + D ( u )) du + i R ( u ) = ~ 0 j R ( u ) i, j j j j ~ p f ( µ ) µ Theorem 3 gives the upper bound of estimation error of the discrete process
17 Real trace used Simulation Cambridge Haggle Trace Trace Contacts Length (d.h:m.s) Routing nodes External nodes Intel 2, : Cambridge 6, : infocom 28, : UMassDieselNet Trace 40 buses 55 days, Spring 2006
18 Simulation Algorithms in comparison TOUR (10 discrete sampling points) TOUR-OPT (100 discrete sampling points) SimpleUtility, MinDelay, MinCost Metrics Remaining utility Derivation Cost
19 Simulation Settings Parameter name Default Range Initial benefit Maximum forwarding cost Benefit decay coefficient Number of messages 30,000
20 Simulation Results Remaining utility vs. initial benefit, benefit decay coefficient, maximum forwarding cost
21 Simulation Results Derivation vs. initial benefit, benefit decay coefficient, maximum forwarding cost
22 Simulation Results Remaining utility vs. initial benefit and benefit decay coefficient
23 Conclusion Our proposed algorithm outperforms the other compared algorithms in utility. The larger the initial benefit and the smaller the benefit decay coefficient are, the larger the remaining utility would be. Our proposed algorithm can schedule different message deliveries to different paths.
24 Thanks! Q&A
Temporal Reachability Graphs
Temporal Reachability Graphs John Whitbeck, Marcelo Dias de Amorim, Vania Conan and Jean-Loup Guillaume August 25th, 212 Intro : Contact Traces 2/16 Intro : Contact Traces 2/16 Intro : Contact Traces Time
More informationMobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks
Mobility Entropy an Message Routing in Community-Structure Delay Tolerant Networks Hieya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future Internet (AsiaFI) 2009 12 th -16 th January 2009.
More informationOptimizing Roadside Advertisement Dissemination in Vehicular CPS
Optimizing Roadside Advertisement Dissemination in Vehicular CPS Huanyang Zheng and Jie Wu Computer and Information Sciences Temple University 1. Introduction Roadside Advertisement Dissemination Passengers,
More informationDeadline-Sensitive User Recruitment for Mobile Crowdsensing with Probabilistic Collaboration
Deadline-Sensitive User Recruitment for Mobile Crowdsensing with Probabilistic Collaboration Mingun Xiao, Jie Wu, He Huang, Liusheng Huang, and Chang Hu School of Computer Science and echnology / Suzhou
More informationDTN-Meteo: Forecasting DTN Performance under Heterogeneous Mobility
: Forecasting DTN Performance under Heterogeneous Mobility Andreea Picu Dr. Thrasyvoulos Spyropoulos Computer Engineering and Networks Laboratory (TIK) Communication Systems Group (CSG) June 21, 2012 1
More informationOPTIMAL CACHING POLICY OF STOCHASTIC UPDATING INFORMATION IN DELAY TOLERANT NETWORKS. Yahui Wu, Mingxing Liu, Su Deng, Hongbin Huang.
Computing and Informatics, Vol. 33, 2014, 965 991 OPTIMAL CACHING POLICY OF STOCHASTIC UPDATING INFORMATION IN DELAY TOLERANT NETWORKS Yahui Wu, Mingxing Liu, Su Deng, Hongbin Huang Science and Technology
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationDistributed Systems Byzantine Agreement
Distributed Systems Byzantine Agreement He Sun School of Informatics University of Edinburgh Outline Finish EIG algorithm for Byzantine agreement. Number-of-processors lower bound for Byzantine agreement.
More informationCrossing Over the Bounded Domain: From Exponential To Power-law Intermeeting
Crossing Over the Bounded Domain: From Exponential To Power-law Intermeeting time in MANET Han Cai, Do Young Eun Department of Electrical and Computer Engineering North Carolina State University Motivation
More informationMessage Delivery Probability of Two-Hop Relay with Erasure Coding in MANETs
01 7th International ICST Conference on Communications and Networking in China (CHINACOM) Message Delivery Probability of Two-Hop Relay with Erasure Coding in MANETs Jiajia Liu Tohoku University Sendai,
More informationProgressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Li Chen ( 陈立 ), PhD, MIEEE Associate Professor, School of Information Science and Technology Sun Yat-sen University, China Joint work
More informationCORRECTNESS OF A GOSSIP BASED MEMBERSHIP PROTOCOL BY (ANDRÉ ALLAVENA, ALAN DEMERS, JOHN E. HOPCROFT ) PRATIK TIMALSENA UNIVERSITY OF OSLO
CORRECTNESS OF A GOSSIP BASED MEMBERSHIP PROTOCOL BY (ANDRÉ ALLAVENA, ALAN DEMERS, JOHN E. HOPCROFT ) PRATIK TIMALSENA UNIVERSITY OF OSLO OUTLINE q Contribution of the paper q Gossip algorithm q The corrected
More informationAdaptive Contact Probing Mechanisms for Delay Tolerant Applications. Wang Wei, Vikram Srinivasan, Mehul Motani
Adaptive Contact Probing Mechanisms for Delay Tolerant Applications Wang Wei, Vikram Srinivasan, Mehul Motani Outline Introduction Modeling contact processes Real world contact traces Designing energy
More informationProlonging WSN Lifetime with an Actual Charging Model
Prolonging WSN Lifetime with an Actual Charging Model Zhi Ma*, Jie Wu, Sheng Zhang*, and Sanglu Lu* *State Key Lab. for Novel Software Technology, Nanjing University, CN Center for Network Computing, Temple
More informationCollision-free scheduling: Complexity of Interference Models
Collision-free scheduling: Complexity of Interference Models Anil Vullikanti Department of Computer Science, and Virginia Bioinformatics Institute, Virginia Tech Anil Vullikanti (Virginia Tech) 1/12 Link
More informationRouting Algorithms. CS60002: Distributed Systems. Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur
Routing Algorithms CS60002: Distributed Systems Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Main Features Table Computation The routing tables must be computed
More informationSelf-Adaptive Ant Colony System for the Traveling Salesman Problem
Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Self-Adaptive Ant Colony System for the Traveling Salesman Problem Wei-jie Yu, Xiao-min
More informationNetworks: space-time stochastic models for networks
Mobile and Delay Tolerant Networks: space-time stochastic models for networks Philippe Jacquet Alcatel-Lucent Bell Labs France Plan of the talk Short history of wireless networking Information in space-time
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationChannel Probing in Communication Systems: Myopic Policies Are Not Always Optimal
Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Matthew Johnston, Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge,
More informationOptimal Control for Epidemic Routing of Two Files with Different Priorities in Delay Tolerant Networks
Optimal Control for Epidemic Routing of Two Files with Different Priorities in Delay Tolerant Networks Shangxing Wang, MHR. Khouzani 2, Bhaskar Krishnamachari and Fan Bai 3 Abstract We consider the problem
More informationBased on Partial CSI in MIMO Ad-Hoc Networks
s Based on Partial CSI in MIMO Ad-Hoc Networks Y. Richter & I. Bergel Faculty of Engineering, Bar-Ilan University Austin, May 2015 1 Outline s &. Optimal routing in random ad-hoc networks. antenna routing.
More informationOutline Network structure and objectives Routing Routing protocol protocol System analysis Results Conclusion Slide 2
2007 Radio and Wireless Symposium 9 11 January 2007, Long Beach, CA. Lifetime-Aware Hierarchical Wireless Sensor Network Architecture with Mobile Overlays Maryam Soltan, Morteza Maleki, and Massoud Pedram
More informationScheduling in switching networks
Scheduling in switching networks Leonidas Tsepenekas National Technical University of Athens June 10, 2015 Leonidas Tsepenekas (NTUA) Theory of Computation June 10, 2015 1 / 16 Overview 1 Introduction
More informationThe Factor: Inferring Protocol Performance Using Inter-link Reception Correlation
The Factor: Inferring Protocol Performance Using Inter-link Reception Correlation Kannan Srinivasan, Mayank Jain, Jung Il Choi, Tahir Azim, Edward S Kim, Philip Levis and Bhaskar Krishnamachari MobiCom
More informationQuiz 1 EE 549 Wednesday, Feb. 27, 2008
UNIVERSITY OF SOUTHERN CALIFORNIA, SPRING 2008 1 Quiz 1 EE 549 Wednesday, Feb. 27, 2008 INSTRUCTIONS This quiz lasts for 85 minutes. This quiz is closed book and closed notes. No Calculators or laptops
More informationPerformance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks
Communications and Networ, 2010, 2, 87-92 doi:10.4236/cn.2010.22014 Published Online May 2010 (http://www.scirp.org/journal/cn Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless
More informationEnergy Optimal Control for Time Varying Wireless Networks. Michael J. Neely University of Southern California
Energy Optimal Control for Time Varying Wireless Networks Michael J. Neely University of Southern California http://www-rcf.usc.edu/~mjneely Part 1: A single wireless downlink (L links) L 2 1 S={Totally
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/24/2012 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
More informationChapter 6. Dynamic Programming. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 6 Dynamic Programming Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 6.8 Shortest Paths Shortest Paths Shortest path problem. Given a directed graph G = (V,
More informationCooperative Communication with Feedback via Stochastic Approximation
Cooperative Communication with Feedback via Stochastic Approximation Utsaw Kumar J Nicholas Laneman and Vijay Gupta Department of Electrical Engineering University of Notre Dame Email: {ukumar jnl vgupta}@ndedu
More informationEnhancing Multiuser MIMO Through Opportunistic D2D Cooperation
1 Enhancing Multiuser MIMO Through Opportunistic D2D Cooperation Can Karakus Suhas Diggavi Abstract We propose a cellular architecture that combines multiuser MIMO MU-MIMO downlink with opportunistic use
More informationForward Correction and Fountain Codes in Delay Tolerant Networks
Forward Correction and Fountain Codes in Delay Tolerant Networks Eitan Altman INRIA, 24 Route des Lucioles, 692 Sophia-Antipolis Cedex, France eitan.altman@sophia.inria.fr Francesco De Pellegrini CREATE-NET,
More informationDistributed Systems. Time, Clocks, and Ordering of Events
Distributed Systems Time, Clocks, and Ordering of Events Björn Franke University of Edinburgh 2016/2017 Today Last lecture: Basic Algorithms Today: Time, clocks, NTP Ref: CDK Causality, ordering, logical
More informationOptimizing Roadside Unit (RSU) Placement in Vehicular CPS
Optimizing Roadside Unit (RSU) Placement in Vehicular CPS Jie Wu Computer and Information Sciences Temple University RSU Placement l Roadside advertisement Attracting shoppers Variation of maximum coverage
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process
Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard 1/30 Bayesian Congestion Control over a Markovian Network Bandwidth Process Parisa Mansourifard (USC) Joint work
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem
Bayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem Parisa Mansourifard 1/37 Bayesian Congestion Control over a Markovian Network Bandwidth Process:
More informationBandwidth Scheduling for Big Data Transfer with Deadline Constraint between Data Centers
Bandwidth Scheduling for Big Data Transfer with Deadline Constraint between Data Centers Aiqin Hou a Chase Q. Wu b, Dingyi Fang a, Liudong Zuo a, Michelle M. Zhu d, Xiaoyang Zhang a, Ruimin Qiao a, Xiaoyan
More informationInteract with Strangers
Interact with Strangers RATE: Recommendation-aware Trust Evaluation in Online Social Networks Wenjun Jiang 1, 2, Jie Wu 2, and Guojun Wang 1 1. School of Information Science and Engineering, Central South
More informationTRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS
The 20 Military Communications Conference - Track - Waveforms and Signal Processing TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS Gam D. Nguyen, Jeffrey E. Wieselthier 2, Sastry Kompella,
More informationAccelerating Convergence
Accelerating Convergence MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have seen that most fixed-point methods for root finding converge only linearly
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More informationThe Effect of Channel State Information on Optimum Energy Allocation and Energy Efficiency of Cooperative Wireless Transmission Systems
The Effect of Channel State Information on Optimum Energy Allocation and Energy Efficiency of Cooperative Wireless Transmission Systems Jie Yang and D.R. Brown III Worcester Polytechnic Institute Department
More informationWelcome to CPSC 4850/ OR Algorithms
Welcome to CPSC 4850/5850 - OR Algorithms 1 Course Outline 2 Operations Research definition 3 Modeling Problems Product mix Transportation 4 Using mathematical programming Course Outline Instructor: Robert
More informationGraph-based Codes for Quantize-Map-and-Forward Relaying
20 IEEE Information Theory Workshop Graph-based Codes for Quantize-Map-and-Forward Relaying Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli and Suhas Diggavi EPFL, Switzerland, UCLA,
More informationOn Distribution and Limits of Information Dissemination Latency and Speed In Mobile Cognitive Radio Networks
This paper was presented as part of the Mini-Conference at IEEE INFOCOM 11 On Distribution and Limits of Information Dissemination Latency and Speed In Mobile Cognitive Radio Networks Lei Sun Wenye Wang
More informationAn Algebraic Approach to Network Coding
An Algebraic Approach to July 30 31, 2009 Outline 1 2 a 3 Linear 4 Digital Communication Digital communication networks are integral parts of our lives these days; so, we want to know how to most effectively
More informationCSE 431/531: Analysis of Algorithms. Dynamic Programming. Lecturer: Shi Li. Department of Computer Science and Engineering University at Buffalo
CSE 431/531: Analysis of Algorithms Dynamic Programming Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Paradigms for Designing Algorithms Greedy algorithm Make a
More informationAgreement algorithms for synchronization of clocks in nodes of stochastic networks
UDC 519.248: 62 192 Agreement algorithms for synchronization of clocks in nodes of stochastic networks L. Manita, A. Manita National Research University Higher School of Economics, Moscow Institute of
More informationUrban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information
Urban Link Travel Time Estimation Using Large-scale Taxi Data with Partial Information * Satish V. Ukkusuri * * Civil Engineering, Purdue University 24/04/2014 Outline Introduction Study Region Link Travel
More informationFraud within Asymmetric Multi-Hop Cellular Networks
Financial Cryptography 2005 EPFL, Lausanne, Switzerland ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Wireless networks Single-hop cellular network Multi-hop network Multi-hop cellular network Asymmetric multi-hop
More informationMulti-Dimensional Online Tracking
Multi-Dimensional Online Tracking Ke Yi and Qin Zhang Hong Kong University of Science & Technology SODA 2009 January 4-6, 2009 1-1 A natural problem Bob: tracker f(t) g(t) Alice: observer (t, g(t)) t 2-1
More informationTutorial 2: Modelling Transmission
Tutorial 2: Modelling Transmission In our previous example the load and generation were at the same bus. In this tutorial we will see how to model the transmission of power from one bus to another. The
More informationRisk sensitive optimal control framework applied to delay tolerant networks
Risk sensitive optimal control framework applied to delay tolerant networks Eitan Altman, Veeraruna Kavitha +, Francesco De Pellegrini, Vijay Kamble and Vivek Borkar Maestro group, INRIA, Sophia Antipolis,
More informationOptimal Energy Management Strategies in Wireless Data and Energy Cooperative Communications
1 Optimal Energy Management Strategies in Wireless Data and Energy Cooperative Communications Jun Zhou, Xiaodai Dong, Senior Member, IEEE arxiv:1801.09166v1 [eess.sp] 28 Jan 2018 and Wu-Sheng Lu, Fellow,
More informationData Structures and Algorithms CMPSC 465
ata Structures and Algorithms MPS LTUR ellman-ford Shortest Paths Algorithm etecting Negative ost ycles Adam Smith // A. Smith; based on slides by K. Wayne,. Leiserson,. emaine L. Negative Weight dges
More informationTime. Lakshmi Ganesh. (slides borrowed from Maya Haridasan, Michael George)
Time Lakshmi Ganesh (slides borrowed from Maya Haridasan, Michael George) The Problem Given a collection of processes that can... only communicate with significant latency only measure time intervals approximately
More informationCommon Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel
Wang, ISIT 2011 p. 1/15 Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel Chih-Chun Wang, Jaemin Han Center of Wireless Systems and Applications (CWSA) School
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationReducing Age-of-Information for Computation-Intensive Messages via Packet Replacement
Reducing Age-of-Information for Computation-Intensive Messages via Packet Replacement arxiv:191.4654v1 [cs.it] 15 Jan 19 Jie Gong, Qiaobin Kuang, Xiang Chen and Xiao Ma School of Data and Computer Science,
More informationStochastic Optimization for Undergraduate Computer Science Students
Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline
More informationResearch Article An Optimization Model of the Single-Leg Air Cargo Space Control Based on Markov Decision Process
Applied Mathematics Volume 2012, Article ID 235706, 7 pages doi:10.1155/2012/235706 Research Article An Optimization Model of the Single-Leg Air Cargo Space Control Based on Markov Decision Process Chun-rong
More informationState Estimation and Power Flow Analysis of Power Systems
JOURNAL OF COMPUTERS, VOL. 7, NO. 3, MARCH 01 685 State Estimation and Power Flow Analysis of Power Systems Jiaxiong Chen University of Kentucky, Lexington, Kentucky 40508 U.S.A. Email: jch@g.uky.edu Yuan
More informationFairness and Optimal Stochastic Control for Heterogeneous Networks
λ 91 λ 93 Fairness and Optimal Stochastic Control for Heterogeneous Networks sensor network wired network wireless 9 8 7 6 5 λ 48 λ 42 4 3 0 1 2 λ n R n U n Michael J. Neely (USC) Eytan Modiano (MIT) Chih-Ping
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationOptimal Energy-Aware Epidemic Routing in DTNs
1 Optimal Energy-Aware Epidemic Routing in DTNs Soheil Eshghi, Member, IEEE, MHR. Khouzani, Saswati Sarkar, Senior Member, IEEE, Ness. Shroff, Fellow, IEEE, Santosh S. Venkatesh, Senior Member, IEEE Abstract
More information4y Springer NONLINEAR INTEGER PROGRAMMING
NONLINEAR INTEGER PROGRAMMING DUAN LI Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Shatin, N. T. Hong Kong XIAOLING SUN Department of Mathematics Shanghai
More informationCapacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming
Capacity Region of the Two-Way Multi-Antenna Relay Channel with Analog Tx-Rx Beamforming Authors: Christian Lameiro, Alfredo Nazábal, Fouad Gholam, Javier Vía and Ignacio Santamaría University of Cantabria,
More informationIntroduction to Convolutional Codes, Part 1
Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes
More informationVehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology
Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part II: Algorithmic Enhancements Handling Practical Complexities
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationDCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 DCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks Bong Jun Choi, Student Member, IEEE, Hao Liang, Student Member, IEEE,
More informationMinimum-energy packet forwarding over lossy networks under deadline and reliability constraints
22 th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks WiOpt), -8 May 22 Minimum-energy packet forwarding over lossy networks under deadline and reliability
More informationCOMPSCI 650 Applied Information Theory Apr 5, Lecture 18. Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei
COMPSCI 650 Applied Information Theory Apr 5, 2016 Lecture 18 Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei 1 Correcting Errors in Linear Codes Suppose someone is to send
More information250 (headphones list price) (speaker set s list price) 14 5 apply ( = 14 5-off-60 store coupons) 60 (shopping cart coupon) = 720.
The Alibaba Global Mathematics Competition (Hangzhou 08) consists of 3 problems. Each consists of 3 questions: a, b, and c. This document includes answers for your reference. It is important to note that
More informationarxiv: v1 [cs.dc] 10 Feb 2014
We Are Impatient: Algorithms for Geographically Distributed Load Balancing with (Almost) Arbitrary Load Functions arxiv:1402.2090v1 [cs.dc] 10 Feb 2014 Piotr Skowron Institute of Informatics University
More informationMaximum-Life Routing Schedule
Maximum-Life Routing Schedule Peng-Jun Wan wan@cs.iit.edu Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 1 / 42 Outline Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive
More informationAn Outer Bound for the Gaussian. Interference channel with a relay.
An Outer Bound for the Gaussian Interference Channel with a Relay Ivana Marić Stanford University Stanford, CA ivanam@wsl.stanford.edu Ron Dabora Ben-Gurion University Be er-sheva, Israel ron@ee.bgu.ac.il
More informationThroughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting
Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting Swapna B.T., Atilla Eryilmaz, and Ness B. Shroff Departments of ECE and CSE The Ohio State University Columbus, OH 43210
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationAsymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities Vincent Y. F. Tan Dept. of ECE and Dept. of Mathematics National University of Singapore (NUS) September 2014 Vincent Tan
More informationBurst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks
Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks G. Mohan, M. Ashish, and K. Akash Department of Electrical and Computer Engineering National University
More informationBroadcasting With Side Information
Department of Electrical and Computer Engineering Texas A&M Noga Alon, Avinatan Hasidim, Eyal Lubetzky, Uri Stav, Amit Weinstein, FOCS2008 Outline I shall avoid rigorous math and terminologies and be more
More informationOn the Design of a Reward-Based Incentive Mechanism for Delay Tolerant Networks
On the Design of a Reward-Based Incentive Mechanism for Delay Tolerant Networks Tatiana Seregina, Olivier Brun, Rachid Elazouzi, Balakrishna Prabhu To cite this version: Tatiana Seregina, Olivier Brun,
More informationLinear and Statistical Independence of Linear Approximations and their Correlations
Linear and Statistical Independence of Linear Approximations and their Correlations Kaisa Nyberg Aalto University School of Science kaisa.nyberg@aalto.fi Boolean Functions and their Applications Os, Norway,
More informationDynamic Power Allocation and Routing for Time Varying Wireless Networks
Dynamic Power Allocation and Routing for Time Varying Wireless Networks X 14 (t) X 12 (t) 1 3 4 k a P ak () t P a tot X 21 (t) 2 N X 2N (t) X N4 (t) µ ab () rate µ ab µ ab (p, S 3 ) µ ab µ ac () µ ab (p,
More informationSection 6 Fault-Tolerant Consensus
Section 6 Fault-Tolerant Consensus CS586 - Panagiota Fatourou 1 Description of the Problem Consensus Each process starts with an individual input from a particular value set V. Processes may fail by crashing.
More informationAn Optimal Index Policy for the Multi-Armed Bandit Problem with Re-Initializing Bandits
An Optimal Index Policy for the Multi-Armed Bandit Problem with Re-Initializing Bandits Peter Jacko YEQT III November 20, 2009 Basque Center for Applied Mathematics (BCAM), Bilbao, Spain Example: Congestion
More informationTrust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems
Introduction Main Results Simulation Conclusions Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems Mojtaba Vaezi joint work with H. Inaltekin, W. Shin, H. V. Poor, and
More informationWhat Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol?
What Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol? Timothy G. Griffin Computer Laboratory University of Cambridge, UK timothy.griffin@cl.cam.ac.uk Advanced Networks
More informationDeep Reinforcement Learning. STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 19, 2017
Deep Reinforcement Learning STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 19, 2017 Outline Introduction to Reinforcement Learning AlphaGo (Deep RL for Computer Go)
More informationDistributed Systems. Time, clocks, and Ordering of events. Rik Sarkar. University of Edinburgh Spring 2018
Distributed Systems Time, clocks, and Ordering of events Rik Sarkar University of Edinburgh Spring 2018 Notes Today: Time, clocks, NTP Ref: CDK Causality, ordering, logical clocks: Ref: VG, CDK Time Ordering
More informationSection 1.1 Algorithms. Key terms: Algorithm definition. Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error
Section 1.1 Algorithms Key terms: Algorithm definition Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error Approximating square roots Iterative method Diagram of a general iterative
More informationInput layer. Weight matrix [ ] Output layer
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2003 Recitation 10, November 4 th & 5 th 2003 Learning by perceptrons
More informationIterative Timing Recovery
Iterative Timing Recovery John R. Barry School of Electrical and Computer Engineering, Georgia Tech Atlanta, Georgia U.S.A. barry@ece.gatech.edu 0 Outline Timing Recovery Tutorial Problem statement TED:
More informationApproximating Minimum-Power Degree and Connectivity Problems
Approximating Minimum-Power Degree and Connectivity Problems Guy Kortsarz Vahab S. Mirrokni Zeev Nutov Elena Tsanko Abstract Power optimization is a central issue in wireless network design. Given a graph
More informationAn Ins t Ins an t t an Primer
An Instant Primer Links from Course Web Page Network Coding: An Instant Primer Fragouli, Boudec, and Widmer. Network Coding an Introduction Koetter and Medard On Randomized Network Coding Ho, Medard, Shi,
More informationSound radiation of a plate into a reverberant water tank
Sound radiation of a plate into a reverberant water tank Jie Pan School of Mechanical and Chemical Engineering, University of Western Australia, Crawley WA 6009, Australia ABSTRACT This paper presents
More information( ) ( ), 1, 1. Downloaded 10/14/14 to Redistribution subject to SEG license or copyright; see Terms of Use at
Chao Zhang*, Jie Zhang, University of Science and Technology of China (USTC); Zhikun Sun, GeoTomo LLC Summary Refraction traveltimes have long been applied for deriving long-wavelength statics solutions.
More informationComparison of Full-Duplex and Half-Duplex Modes with a Fixed Amplify-and-Forward Relay
Comparison of Full-Duplex and Half-Duplex Modes with a Fixed Amplify-and-Forward Relay Taneli Riihonen, Stefan Werner, and Risto Wichman Helsinki University of Technology, Finland IEEE WCNC, Budapest,
More information