Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks
|
|
- Barrie Miller
- 6 years ago
- Views:
Transcription
1 VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada ECI Lab, General Motors Global R&D, Warren, MI 48105, USA 1
2 Outline Content Transmission in VANET Introduction Problem Statement Integrity-Oriented Content Transmission in Highway Vehicular Networks System Model Analytical Framework Call Admission Control Simulation Verification Conclusion 2
3 Content Transmission Digitalized information is always transformed into certain form of content files, of the heterogeneous sizes, for storage and transmissions Text contents: , social blogs, etc. Video/audio contents: movie trailers, MP3 music files, etc. Infotainment applications in VANET typically boil down to the consecutive transmissions of the different types of content files Social communications with images, texts and video/audio clip transmission 3
4 Integrity of Content Transmission Content files need to be transmitted in their entirety so as to guarantee the successful presentation by the on-top application at the receiver Downloads stuck at 99% is annoying to BitTorrent users a Content transmissions over VANET are susceptible to frequent interruptions due to the dynamic motilities 1. Content transmissions take time to finish 2. The inter-vehicular connections tend to be short-lived This leads to fragment contents that are partially transmitted only during the connection time 1. Annoying to end-hosts causing wait but failure of media playout 2. Waste the precious VANET bandwidth e.g., transmission of a 3MB file over a 300kbps connection takes 82 seconds a TorrentFreak, How to Bring Dead Torrents Back to Life 4
5 Problem Statement Given the size of a content file to be transmitted and the density of vehicles on the road, we question on how likely the file can be transmitted successfully, and how to guarantee the integrity of the content transmissions We propose the integrity-oriented content transmission framework in VANET which is composed of 1. Analytical framework to evaluate the data volume that can be transmitted from sender to receiver within a given period of time 2. Admission control to filter suspicious transmission requests which are unlikely to be finished over the transient inter-vehicle connection time Assumptions Single-hop transmissions: multi-hop can be future work No multi-party download Throughput? Safe to transmit? 5
6 System Model Highway vehicular networks Vehicles move along a linear topology Vehicle i (sender) File size F ij Vehicle j (receiver) Investigate on content transmissions between a random selected pair of vehicles i (sender) and j (receiver) Let R(t) denote the transmission throughput from i to j at time t Let A(Υ) = Υ R(t)dt denote the data volume that can be 0 transmitted within a time period of Υ Provided Υ and content file size F ij to transmit, our goal is to 1. derive the expression of A(Υ) 2. evaluated the likelihood that A(Υ) > F ij 6
7 Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 0 Download subscription submitted at t = 0 7
8 Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 8
9 Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 9
10 Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 3 MAC throughput (function of physical-layer capacity) 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 10
11 Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 3 MAC throughput (function of physical-layer capacity) 4 Evaluate download volume as throughput integrated over time 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 11
12 Headway Distance Let H(t) denote the headway distance from i to j at time t H(t) 0 if i is ahead of j in the moving direction, otherwise, H(t) < 0 Let v i (resp. v j ) and a i (resp. a j ) denote the mean and variance, respectively, of the velocity of vehicle i (resp. j) We model H(t) as the queue length of a G/G/1 queue in the unit of meter We resort to the diffusion approximation to obtain the pdf of H(t) over time t The headway distance H(t) is modeled to follow the Wiener process, i.e., within the infinitesimal interval t, the increment of H is normally distributed as where µ = v j v i and σ = a j + a j H (t) = H (t + t) H (t) = µ t + Θ σ t,,,, G/G/1 12
13 Headway Distance (cont d) Let f H (x; r, t) denote the probability density function (pdf) of H (t) at time t, conditional on the initial queue length, and f H (x; r, t) = Pr{ x H (t) x + x H (0) = r}. where r denotes the initial headway distance, i.e., H(0) f H (x, r, t) can be characterized by the Kolmogorov equation (alternatively known as Fokker Planck equation) as 1 2 σ 2 x 2 f H (x; r, t) + µ x f H (x; r, t) = t f H (x; r, t) subject to the initial condition of the headway distance, According to [1], we have f H (x; r, t) = f H (x; r, 0) = δ (r), { } 1 (x r µt)2 exp 2πσt 2σt [1] D. R. Cox and H. D. Miller, The Theory of Stochastic Processes. Chapman & Hall/CRC,
14 Physical-layer Transmission Rate Let C(t) denote the physical-layer transmission rate from i to j C(t) is dependent on H(t) C(t) is subjected to the fast channel fadings from i and j We adopt the model in [2, 3] to derive the expression of C(t), which is represented by H(t) Ref. [2] characterizes the fast channel fading between two vehicles Ref. [3] provides a model to evaluate the capacity with multiple modulation rates applied [2] L. Cheng, B. E. Henty, D. D. Stancil, F. Bai, and P. Mudalige, Mobile Vehicle-to-Vehicle Narrow-band Channel Measurement and Characterization of the 5.9 GHz Dedicated Short Range Communication (DSRC) Frequency Band, IEEE Journal on Selected Areas in Communications, vol. 25, no. 8, pp , Oct [3] J. Yoo, B. S. C. Choi, and M. Gerla, An Opportunistic Relay Protocol for Vehicular Road-side Access with Fading Channels, in Proc. of IEEE ICNP,
15 MAC Throughput The MAC throughput represents the effective transmission rate from i to j with channel contentions taken into consideration We assume that the fundamental DCF MAC with RTS/CTS handshake is applied to schedule the channel access of nodes Let N denote the number of vehicles contending for the transmission with i N follows the Poisson distribution with known mean value Let τ denote the transmission probability of each vehicle and 1 τ = W/2 + 1 where W is the minimum contention window size The MAC throughput R is evaluated as R (t) =τp suc FL i T where P suc is the successful transmission probability. FL i is the frame length of i. T is the average length of a time slot (where C (t) comes into play) 15
16 Data Volume That Can Be Transmitted The data volume that can be transmitted within a time period Υ is thus A(Υ) = Υ 0 R(t)dt Evaluating A(Υ) with the above equation involves stochastic integral We evaluate its mean, E (A(Υ)), and the upper-bound of its variance, V(A(Υ)) instead Call Admission Control: with file size F ij known, the transmission request is admitted iff Pr { A(Υ) > F ij } > ξ Vehicle i (sender) File size Fij We apply the one-sided Chebyshev inequality to derive a sufficient condition on E (A(Υ)) and V(A(Υ)) to have above inequality satisfied, with Pr { } V (A) A F ij V (A) + [ ] 2 1 ξ E (A) F ij Vehicle j (receiver) 16
17 Simulation We evaluate the accuracy of the analysis and effectiveness of the call admission control scheme using a simulator coded in C++ We simulate 1000 vehicles on a highway section with mean inter-distance 60 meters The velocity of vehicles follows the normal distribution with the mean and standard deviation uniformly selected from [70, 130] km/h and [21, 39] km/h, respectively Channel fading between vehicles follows the Nakagami-m distribution with parameters derived in [2] Legacy DCF with RTS/CTS handshake is deployed as MAC Mean 60 meters [2] L. Cheng, B. E. Henty, D. D. Stancil, F. Bai, and P. Mudalige, Mobile Vehicle-to-Vehicle Narrow-band Channel Measurement and Characterization of the 5.9 GHz Dedicated Short Range Communication (DSRC) Frequency Band, IEEE Journal on Selected Areas in Communications, vol. 25, no. 8, pp , Oct
18 Accuracy of Analysis We focus on a randomly selected pair of vehicles and report the mean and variance of its data volume download over time Mean Data Volume (in bytes) x 107 Analysis Simulation Simulation Time (in seconds) Variance of Data Volume x Analysis Simulation Simulation Time (in seconds) The analysis of the mean data volume matches the simulations well As time increases, the gap between the upper bound of download volume variance and the simulation increases In real-world applications, connection time would be typically short 18
19 Effectiveness of Call Admission Control (CAC) Fraction of Fragment Contents std = 54 km/h, without CAC std = 30.6 km/h, without CAC std = 10.8 km/h, without CAC std = 54 km/h, with CAC std = 30.6 km/h, with CAC std = 10.8 km/h, with CAC Valid Data Volume (in bytes) 6 x std = 54 km/h, without CAC std = 30.6 km/h, without CAC std = 10.8 km/h, without CAC std = 54 km/h, with CAC std = 30.6 km/h, with CAC std = 10.8 km/h, with CAC 0 within [0,100s] within [0,450s] 0 within [0, 100s] within [0, 450s] With CAC applied, portion of fragment content transmissions reduces dramatically With CAC applied, the download volume of valid contents increases Small file size is favored 19
20 Conclusion The infotainment applications in VANET may boil down to the transmission of consecutive content files from send to receiver The contents need to be transmitted in their entirety so as to be useful to the on-top applications Existing literature largely focus on the packet-level performance in throughput and delay of packet transmissions, but neglect the session-level performance in terms of the integrity of content transmissions Given the mobility statistics of vehicles, we develop a mathematical framework to evaluate the data volume that can be transmitted among a random pair of vehicles Based on the model, we then propose a call admission control mechanism to filter to suspicious transmission requests Future work Extend the framework to multi-hop transmissions Develop the channel scheduling scheme to guarantee the integrity of content transmissions 20
21 Thank You! Slides are available at author s (Tom H. Luan) website: hluan Please forward your questions to the author through hluan@uwaterloo.ca 21
VEHICULAR TRAFFIC FLOW MODELS
BBCR Group meeting Fri. 25 th Nov, 2011 VEHICULAR TRAFFIC FLOW MODELS AN OVERVIEW Khadige Abboud Outline Introduction VANETs Why we need to know traffic flow theories Traffic flow models Microscopic Macroscopic
More informationWireless Internet Exercises
Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Per-node throughput in case of: Full connected networs each node sees all the others Generic networ topology not all nodes are visible Performance Analysis of single-hop
More informationDetecting Stations Cheating on Backoff Rules in Networks Using Sequential Analysis
Detecting Stations Cheating on Backoff Rules in 82.11 Networks Using Sequential Analysis Yanxia Rong Department of Computer Science George Washington University Washington DC Email: yxrong@gwu.edu Sang-Kyu
More informationrequests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1
Prof. X. Shen E&CE 70 : Examples #2 Problem Consider the following Aloha systems. (a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Passion rate of one 000-bit packet
More informationExact Distribution of Access Delay in IEEE DCF MAC
Exact Distribution of Access Delay in IEEE 8.11 DCF MAC Teerawat Issariyakul, Dusit Niyato, Ekram Hossain, and Attahiru Sule Alfa University of Manitoba and TRLabs Winnipeg, MB, Canada. Email: teerawat,
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 informationOn queueing in coded networks queue size follows degrees of freedom
On queueing in coded networks queue size follows degrees of freedom Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard Laboratory for Information and Decision Systems, Massachusetts Institute of Technology,
More informationP e = 0.1. P e = 0.01
23 10 0 10-2 P e = 0.1 Deadline Failure Probability 10-4 10-6 10-8 P e = 0.01 10-10 P e = 0.001 10-12 10 11 12 13 14 15 16 Number of Slots in a Frame Fig. 10. The deadline failure probability as a function
More informationModeling and Simulation NETW 707
Modeling and Simulation NETW 707 Lecture 6 ARQ Modeling: Modeling Error/Flow Control Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Data Link Layer Data Link Layer provides
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 informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Ł Ł Ł Ł Arbitrary networ capacity [Gupta & Kumar The Capacity of Wireless Networs ] Ł! Ł "! Receiver Model Ł Ł # Ł $%&% Ł $% '( * &%* r (1+ r Ł + 1 / n 1 / n log n Area
More informationVEHICULAR ad-hoc networks (VANETs) have drawn. Cooperative Content Transmission for Vehicular Ad Hoc Networks using Robust Optimization
Cooperative Content Transmission or Vehicular Ad Hoc Networks using Robust Optimization Daxin Tian, Jianshan Zhou, Min Chen, Zhengguo Sheng, Qiang Ni and Victor C.M. Leung School o Transportation Science
More informationCapacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
IEEE TRASACTIOS O IFORMATIO THEORY 1 Capacity and Delay Tradeoffs for Ad-Hoc Mobile etworks Michael J. eely University of Southern California mjneely@usc.edu http://www-rcf.usc.edu/ mjneely Eytan Modiano
More informationThese are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
More informationModeling Approximations for an IEEE WLAN under Poisson MAC-Level Arrivals
Modeling Approximations for an IEEE 802.11 WLAN under Poisson MAC-Level Arrivals Ioannis Koukoutsidis 1 and Vasilios A. Siris 1,2 1 FORTH-ICS, P.O. Box 1385, 71110 Heraklion, Crete, Greece 2 Computer Science
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 informationCSE 123: Computer Networks
CSE 123: Computer Networks Total points: 40 Homework 1 - Solutions Out: 10/4, Due: 10/11 Solutions 1. Two-dimensional parity Given below is a series of 7 7-bit items of data, with an additional bit each
More informationQueue Analysis for Wireless Packet Data Traffic
Queue Analysis for Wireless Packet Data Traffic Shahram Teymori and Weihua Zhuang Centre for Wireless Communications (CWC), Department of Electrical and Computer Engineering, University of Waterloo, Waterloo,
More informationChannel Allocation Using Pricing in Satellite Networks
Channel Allocation Using Pricing in Satellite Networks Jun Sun and Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute of Technology {junsun, modiano}@mitedu Abstract
More informationA Mathematical Model of the Skype VoIP Congestion Control Algorithm
A Mathematical Model of the Skype VoIP Congestion Control Algorithm Luca De Cicco, S. Mascolo, V. Palmisano Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari 47th IEEE Conference on Decision
More informationTCP over Cognitive Radio Channels
1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done
More informationPerformance Evaluation of Deadline Monotonic Policy over protocol
Performance Evaluation of Deadline Monotonic Policy over 80. protocol Ines El Korbi and Leila Azouz Saidane National School of Computer Science University of Manouba, 00 Tunisia Emails: ines.korbi@gmail.com
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 informationHow do Wireless Chains Behave? The Impact of MAC Interactions
The Impact of MAC Interactions S. Razak 1 Vinay Kolar 2 N. Abu-Ghazaleh 1 K. Harras 1 1 Department of Computer Science Carnegie Mellon University, Qatar 2 Department of Wireless Networks RWTH Aachen University,
More informationANALYSIS OF THE RTS/CTS MULTIPLE ACCESS SCHEME WITH CAPTURE EFFECT
ANALYSIS OF THE RTS/CTS MULTIPLE ACCESS SCHEME WITH CAPTURE EFFECT Chin Keong Ho Eindhoven University of Technology Eindhoven, The Netherlands Jean-Paul M. G. Linnartz Philips Research Laboratories Eindhoven,
More informationWiFi MAC Models David Malone
WiFi MAC Models David Malone November 26, MACSI Hamilton Institute, NUIM, Ireland Talk outline Introducing the 82.11 CSMA/CA MAC. Finite load 82.11 model and its predictions. Issues with standard 82.11,
More informationCapturing Network Traffic Dynamics Small Scales. Rolf Riedi
Capturing Network Traffic Dynamics Small Scales Rolf Riedi Dept of Statistics Stochastic Systems and Modelling in Networking and Finance Part II Dependable Adaptive Systems and Mathematical Modeling Kaiserslautern,
More informationA New Technique for Link Utilization Estimation
A New Technique for Link Utilization Estimation in Packet Data Networks using SNMP Variables S. Amarnath and Anurag Kumar* Dept. of Electrical Communication Engineering Indian Institute of Science, Bangalore
More informationGeneralized Two-Hop Relay for Flexible Delay Control in MANETs
Generalized Two-Hop Relay for Flexible Delay Control in MANETs 12 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
More informationLan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN
Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN Ethernet Frame Format 7 b y te s 1 b y te 2 o r 6 b y te s 2 o r 6 b y te s 2 b y te s 4-1 5 0 0 b y te s 4 b y te s P r e a m b le S ta r t F r
More informationDownlink Traffic Scheduling in Green Vehicular Roadside Infrastructure
Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure Abdulla A. Hammad, Terence D. Todd, George Karakostas and Dongmei Zhao Department of Electrical and Computer Engineering McMaster
More informationOn the Information Propagation Speed in Mobile Vehicular Ad Hoc Networks
On the Information Propagation Speed in Mobile Vehicular Ad Hoc Networks Zijie Zhang, Guoqiang Mao and Brian D.O. Anderson School of Electrical and Information Engineering, The University of Sydney The
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
Performance analysis of IEEE 82.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Hai L. Vu, Lachlan L. H. Andrew Centre for Advanced Internet Architectures, Technical Report 11811A Swinburne
More informationA Capacity Upper Bound for Large Wireless Networks with Generally Distributed Nodes
Capacity Upper Bound for Large Wireless Networks with Generally Distributed Nodes Guoqiang Mao, Zihuai Lin School of Electrical and Information Engineering The University of Sydney Email: {guoqiang.mao,
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 informationDesign of IP networks with Quality of Service
Course of Multimedia Internet (Sub-course Reti Internet Multimediali ), AA 2010-2011 Prof. Pag. 1 Design of IP networks with Quality of Service 1 Course of Multimedia Internet (Sub-course Reti Internet
More informationFlow-level performance of wireless data networks
Flow-level performance of wireless data networks Aleksi Penttinen Department of Communications and Networking, TKK Helsinki University of Technology CLOWN seminar 28.8.08 1/31 Outline 1. Flow-level model
More informationEE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing
EE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely 1 Abstract This collection of notes provides a
More informationCellular-Assisted Vehicular Communications: A Stochastic Geometric Approach
Cellular-Assisted Vehicular Communications: A Stochastic Geometric Approach Sayantan Guha Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment
More informationRandom Access Protocols ALOHA
Random Access Protocols ALOHA 1 ALOHA Invented by N. Abramson in 1970-Pure ALOHA Uncontrolled users (no coordination among users) Same packet (frame) size Instant feedback Large (~ infinite) population
More information1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
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 informationINavehicular ad hoc network (VANET), maintaining time
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 63, NO. 3, MARCH 2014 1467 Safety-Message Broadcast in Vehicular Ad Hoc Networks Based on Protocol Sequences Yi Wu, Member, IEEE, Kenneth W. Shum, Member,
More informationLecture on Sensor Networks
Lecture on Sensor Networks Cyclic Historical Redundancy Development Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify
More informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
More informationMathematical Analysis of IEEE Energy Efficiency
Information Engineering Department University of Padova Mathematical Analysis of IEEE 802.11 Energy Efficiency A. Zanella and F. De Pellegrini IEEE WPMC 2004 Padova, Sept. 12 15, 2004 A. Zanella and F.
More informationMarkov Chain Model for ALOHA protocol
Markov Chain Model for ALOHA protocol Laila Daniel and Krishnan Narayanan April 22, 2012 Outline of the talk A Markov chain (MC) model for Slotted ALOHA Basic properties of Discrete-time Markov Chain Stability
More informationPeterborough Distribution Inc Ashburnham Drive, PO Box 4125, Station Main Peterborough ON K9J 6Z5
Peterborough Distribution Inc. 1867 Ashburnham Drive, PO Box 4125, Station Main Peterborough ON K9J 6Z5 November 15, 2017 Ontario Energy Board PO Box 2319 27 th Floor, 2300 Yonge St Toronto ON M4P 1E4
More informationPIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control
PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control Saurabh Jain Joint work with Dr. Dmitri Loguinov June 21, 2007 1 Agenda Introduction Analysis of RCP QI-RCP PIQI-RCP Comparison Wrap
More informationTransmission Schemes for Lifetime Maximization in Wireless Sensor Networks: Uncorrelated Source Observations
Transmission Schemes for Lifetime Maximization in Wireless Sensor Networks: Uncorrelated Source Observations Xiaolu Zhang, Meixia Tao and Chun Sum Ng Department of Electrical and Computer Engineering National
More informationApproximate Queueing Model for Multi-rate Multi-user MIMO systems.
An Approximate Queueing Model for Multi-rate Multi-user MIMO systems Boris Bellalta,Vanesa Daza, Miquel Oliver Abstract A queueing model for Multi-rate Multi-user MIMO systems is presented. The model is
More informationAnalysis and Performance Evaluation of Dynamic Frame Slotted-ALOHA in Wireless Machine-to-Machine Networks with Energy Harvesting
and Performance Evaluation of Dynamic Frame Slotted-ALOHA in Wireless Machine-to-Machine Networks with Energy Harvesting Shuang Wu, Yue Chen, Kok K Chai Queen Mary University of London London, U.K. Email:
More informationTraffic Modelling for Moving-Block Train Control System
Commun. Theor. Phys. (Beijing, China) 47 (2007) pp. 601 606 c International Academic Publishers Vol. 47, No. 4, April 15, 2007 Traffic Modelling for Moving-Block Train Control System TANG Tao and LI Ke-Ping
More informationImpact of traffic mix on caching performance
Impact of traffic mix on caching performance Jim Roberts, INRIA/RAP joint work with Christine Fricker, Philippe Robert, Nada Sbihi BCAM, 27 June 2012 A content-centric future Internet most Internet traffic
More informationAnalysis of Urban Millimeter Wave Microcellular Networks
Analysis of Urban Millimeter Wave Microcellular Networks Yuyang Wang, KiranVenugopal, Andreas F. Molisch, and Robert W. Heath Jr. The University of Texas at Austin University of Southern California TheUT
More informationInterference Reduction In Cognitive Networks via Scheduling
1 Interference Reduction In Cognitive Networks via Scheduling Patrick Mitran, Member, IEEE Abstract In this letter, we first define a cognitive network to be useful if at least one node can be scheduled
More informationPower Controlled FCFS Splitting Algorithm for Wireless Networks
Power Controlled FCFS Splitting Algorithm for Wireless Networks Ashutosh Deepak Gore Abhay Karandikar Department of Electrical Engineering Indian Institute of Technology - Bombay COMNET Workshop, July
More informationPerformance Analysis of the IEEE e Block ACK Scheme in a Noisy Channel
Performance Analysis of the IEEE 802.11e Block ACK Scheme in a Noisy Channel Tianji Li, Qiang Ni, Hamilton Institute, NUIM, Ireland. Thierry Turletti, Planete Group, INRIA, France. Yang Xiao, University
More informationStochastic Hybrid Systems: Applications to Communication Networks
research supported by NSF Stochastic Hybrid Systems: Applications to Communication Networks João P. Hespanha Center for Control Engineering and Computation University of California at Santa Barbara Talk
More informationMODELING INTERFERENCE IN FINITE UNIFORMLY RANDOM NETWORKS
MODELING INTERFERENCE IN FINITE UNIFORMLY RANDOM NETWORKS Sunil Srinivasa Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA ssriniv1@nd.edu Martin Haenggi Department
More information1646 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 4, APRIL 2016
646 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 4, APRIL 6 On the Throughput Capacity Study for Aloha Mobile Ad Hoc Networks Yin Chen, Member, IEEE, Yulong Shen, Member, IEEE, Jinxiao Zhu, Xiaohong
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 information2314 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 60, NO. 5, JUNE 2011
2314 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 60, NO. 5, JUNE 2011 On the Information Propagation Process in Mobile Vehicular Ad Hoc Networks Zijie Zhang, Student Member, IEEE, Guoqiang Mao, Senior
More informationOn the Validity of IEEE MAC Modeling Hypotheses
On the Validity of IEEE 82.11 MAC Modeling Hypotheses K. D. Huang, K. R. Duffy and D. Malone Hamilton Institute, National University of Ireland, Maynooth, Ireland. Corresponding author: ken.duffy@nuim.ie
More informationDesign and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks
Design and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks Joon Ahn a, Affan Syed b, Bhaskar Krishnamachari a, John Heidemann b a Ming Hsieh Department of Electrical Engineering,
More informationRadio Network Clustering from Scratch
Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract.
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 informationDistributed Scheduling for Achieving Multi-User Diversity (Capacity of Opportunistic Scheduling in Heterogeneous Networks)
Distributed Scheduling for Achieving Multi-User Diversity (Capacity of Opportunistic Scheduling in Heterogeneous Networks) Sefi Kampeas, Ben-Gurion University Joint work with Asaf Cohen and Omer Gurewitz
More informationOctober Characterizing Information Propagation Through Inter-Vehicle Communication on a Simple Network of Two Parallel Roads
1. Report No. SWUTC/10/161005-1 4. Title and Subtitle Technical Report Documentation Page. Government Accession No. 3. Recipient's Catalog No. 5. Report Date Characterizing Information Propagation Through
More informationCommunications and Signal Processing Spring 2017 MSE Exam
Communications and Signal Processing Spring 2017 MSE Exam Please obtain your Test ID from the following table. You must write your Test ID and name on each of the pages of this exam. A page with missing
More informationDistributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks Rajat Talak, Sertac Karaman, and Eytan Modiano arxiv:803.06469v [cs.it] 7 Mar 208 Abstract Age of Information
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
1 Performance analysis of IEEE 8.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract
More informationPower Allocation and Coverage for a Relay-Assisted Downlink with Voice Users
Power Allocation and Coverage for a Relay-Assisted Downlink with Voice Users Junjik Bae, Randall Berry, and Michael L. Honig Department of Electrical Engineering and Computer Science Northwestern University,
More informationChannel Selection in Cognitive Radio Networks with Opportunistic RF Energy Harvesting
1 Channel Selection in Cognitive Radio Networks with Opportunistic RF Energy Harvesting Dusit Niyato 1, Ping Wang 1, and Dong In Kim 2 1 School of Computer Engineering, Nanyang Technological University
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationI2V Highway and Urban Vehicular Networks: A Comparative Analysis of the Impact of Mobility on Broadcast Data Dissemination
JOURNAL OF COMMUNICATIONS, VOL. 6, NO., FEBRUARY 2 87 I2V Highway and Urban Vehicular Networks: A Comparative Analysis of the Impact of Mobility on Broadcast Data Dissemination Stefano Busanelli, Gianluigi
More informationIEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 57, NO. 6, NOVEMBER
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 57, NO. 6, NOVEMBER 2008 3341 Analytical Model for Connectivity in Vehicular Ad Hoc Networks Saleh Yousefi, Eitan Altman, Senior Member, IEEE, Rachid El-Azouzi,
More informationUpper Bounds on Expected Hitting Times in Mostly-Covered Delay-Tolerant Networks
Upper Bounds on Expected Hitting Times in Mostly-Covered Delay-Tolerant Networks Max F. Brugger, Kyle Bradford, Samina Ehsan, Bechir Hamdaoui, Yevgeniy Kovchegov Oregon State University, Corvallis, OR
More informationReliable Data Transport: Sliding Windows
Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationDelay-Based Connectivity of Wireless Networks
Delay-Based Connectivity of Wireless Networks Martin Haenggi Abstract Interference in wireless networks causes intricate dependencies between the formation of links. In current graph models of wireless
More informationA Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch
A Starvation-free Algorithm For Achieving 00% Throughput in an Input- Queued Switch Abstract Adisak ekkittikul ick ckeown Department of Electrical Engineering Stanford University Stanford CA 9405-400 Tel
More informationLine-of-Sight Obstruction Analysis for Vehicle-to-Vehicle Network Simulations in a Two-Lane Highway Scenario
Line-of-Sight Obstruction Analysis for Vehicle-to-Vehicle Network Simulations in a Two-Lane Highway Scenario Taimoor Abbas, and Fredrik Tufvesson Abstract arxiv:38.2574v2 [cs.ni] 3 Nov 23 In vehicular
More informationSTABILITY OF FINITE-USER SLOTTED ALOHA UNDER PARTIAL INTERFERENCE IN WIRELESS MESH NETWORKS
The 8th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 7) STABILITY OF FINITE-USER SLOTTED ALOHA UNDER PARTIAL INTERFERENCE IN WIRELESS MESH NETWORKS Ka-Hung
More informationOptimal Association of Stations and APs in an IEEE WLAN
Optimal Association of Stations and APs in an IEEE 802. WLAN Anurag Kumar and Vinod Kumar Abstract We propose a maximum utility based formulation for the problem of optimal association of wireless stations
More informationNode-based Distributed Optimal Control of Wireless Networks
Node-based Distributed Optimal Control of Wireless Networks CISS March 2006 Edmund M. Yeh Department of Electrical Engineering Yale University Joint work with Yufang Xi Main Results Unified framework for
More informationOn the Energy-Delay Trade-off of a Two-Way Relay Network
On the Energy-Delay Trade-off of a To-Way Relay Netork Xiang He Aylin Yener Wireless Communications and Netorking Laboratory Electrical Engineering Department The Pennsylvania State University University
More informationThroughput and Fairness Analysis of based Vehicle-to-Infrastructure Data Transfers
211 Eighth IEEE International Conference on Mobile Ad-Hoc and Sensor Systems Throughput and Fairness Analysis of 82.11-based Vehicle-to-Infrastructure Data Transfers Raffaele Bruno, Marco Conti Institute
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationWireless Network Security Spring 2016
Wireless Network Security Spring 2016 Patrick Tague Class #3 Project Discussion; OMNET++ Intro 2016 Patrick Tague 1 Waitlists If you're currently registered for this class, but not planning to stay: please
More informationA Stochastic Control Approach for Scheduling Multimedia Transmissions over a Polled Multiaccess Fading Channel
A Stochastic Control Approach for Scheduling Multimedia Transmissions over a Polled Multiaccess Fading Channel 1 Munish Goyal, Anurag Kumar and Vinod Sharma Dept. of Electrical Communication Engineering,
More informationTowards Achieving Full Secrecy Rate in Wireless Networks: A Control Theoretic Approach
owards Achieving Full Secrecy Rate in Wireless Networks: A Control heoretic Approach Zhoujia Mao Department of ECE he Ohio State University maoz@ece.osu.edu Can Emre Koksal Department of ECE he Ohio State
More informationHalf-Duplex Gaussian Relay Networks with Interference Processing Relays
Half-Duplex Gaussian Relay Networks with Interference Processing Relays Bama Muthuramalingam Srikrishna Bhashyam Andrew Thangaraj Department of Electrical Engineering Indian Institute of Technology Madras
More informationECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process
1 ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 3 Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 2 Multipath-Fading Mechanism local scatterers mobile subscriber base station
More informationAdaptive Distributed Algorithms for Optimal Random Access Channels
Forty-Eighth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 29 - October, 2 Adaptive Distributed Algorithms for Optimal Random Access Channels Yichuan Hu and Alejandro Ribeiro
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationEmpirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity
Empirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity Sherif M. Abuelenin Department of Electrical Engineering Faculty of Engineering, Port-Said University Port-Fouad,
More informationSolutions. 9. Ans. C. Memory size. 11. Ans. D. a b c d e f a d e b c f a b d c e f a d b c e f a b d e c f a d b e c f. 13. Ans. D. Merge sort n log n
Solutions. Ans. B. ~ p q ~ r ~ s ~ p q r s ~ ~ p q r s p ~ q r s ~ p q ~ r v ~ s For x only the above compound preposition is true.. Ans. B. Case I First bit is 0 Case II First bit is 6. Ans. A. # has
More information