1 UCAN: A Unified Cellular and Ad-Hoc Network Architecture Rick Szcodronski ECE 256 February 12, 2008 Published by: Haiyun Luo, Ramachandran Ramjee, Prasun.

Slides:



Advertisements
Similar presentations
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Advertisements

Opportunistic Scheduling Algorithms for Wireless Networks
QoS in ad hoc nets: distributed fair scheduling SCOPE: Self-coordinating Localized FQ H. Luo et al “A Self-Coordinating Approach to Distributed FairQueueing.
MOBICOM'031 UCAN: A Unified Cellular and Ad-Hoc Network Architecture Haiyun Luo Ramachandran Ramjee Prasun Sinha, Li Erran Li, Songwu Lu.
Introduction to Wireless Sensor Networks
Enhancing Vehicular Internet Connectivity using Whitespaces, Heterogeneity and A Scouting Radio Tan Zhang ★, Sayandeep Sen†, Suman Banerjee ★ ★ University.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Comp 361, Spring 20056:Basic Wireless 1 Chapter 6: Basic Wireless (last updated 02/05/05) r A quick intro to CDMA r Basic
Gossip Scheduling for Periodic Streams in Ad-hoc WSNs Ercan Ucan, Nathanael Thompson, Indranil Gupta Department of Computer Science University of Illinois.
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang
Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
1 Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park Sneha Kumar Kasera School of.
IEEE Overview and Meshed Networking ELEC6076 Computer Networks Alan Ford
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
Selection Metrics for Multi-hop Cooperative Relaying Jonghyun Kim and Stephan Bohacek Electrical and Computer Engineering University of Delaware.
Improving 3G Multicast Throughput via Integration of Cellular and Ad-Hoc Networks Team Members: Gaurav Agashe Shamitha Lokande Shriniket Kale Project Champion:
Congestion Control and Fairness for Many-to-One Routing in Sensor Networks Cheng Tien Ee Ruzena Bajcsy Motivation Congestion Control Background Simulation.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
CDMA X RTT Overview. Global 3G Evolution.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
1 OFDM For Next Generation Mobile Wireless Internet Rajiv Laroia CTO, Flarion Technologies.
1 Wireless and Mobile Networks EECS 489 Computer Networks Z. Morley Mao Monday March 12, 2007 Acknowledgement:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 UCAN: A Unified Cellular and Ad-Hoc network Architecture By H. Luo, S. Lu Computer Science Department UCLA.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
UCAN: A Unified Cellular and Ad Hoc Network Architecture Presenter: Tripp Parker Authors: Haiyun Luo Ramachandran Ramjee Prasun Sinha, Li Erran Li, Songwu.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Ashu SabharwalRice University Capacity and Fairness in Multihop Wireless Backhaul Networks Ashu Sabharwal ECE, Rice University.
Tufts University. EE194-WIR Wireless Sensor Networks. March 3, 2005 Increased QoS through a Degraded Channel using a Cross-Layered HARQ Protocol Elliot.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Computer Network Lab. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks SenSys ’ 03 Xiaorui Wang, Guoliang Xing, Yuanfang.
Stretchable Architectures for Next Generation Cellular Networks Presented By Shashidhar Lakkavalli, Ansuya Negi and Dr. Suresh Singh Portland State University.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Network and Systems Laboratory nslab.ee.ntu.edu.tw R. Vedantham, S. Kakumanu, S. Lakshmanan and R. Sivakumar Georgia Institute of Technology Appear in.
1 UFlood: High-Throughput Wireless Flooding Jayashree Subramanian Collaborators: Robert Morris, Ramakrishna Gummadi, and Hari Balakrishnan.
Multi-radio & Mixed Networks Gaurang Sardesai & Jeff Pang.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Fundamentals of Computer Networks ECE 478/578
Wireless LAN Requirements (1) Same as any LAN – High capacity, short distances, full connectivity, broadcast capability Throughput: – efficient use wireless.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
ProbeCast: MANET Admission Control via Probing Soon Y. Oh, Gustavo Marfia, and Mario Gerla Dept. of Computer Science, UCLA Los Angeles, CA 90095, USA {soonoh,
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Data Collection and Dissemination
Introduction to Wireless Sensor Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Data Collection and Dissemination
Binit Mohanty Ketan Rajawat
Investigating Mac Power Consumption in Wireless Sensor Network
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Presentation transcript:

1 UCAN: A Unified Cellular and Ad-Hoc Network Architecture Rick Szcodronski ECE 256 February 12, 2008 Published by: Haiyun Luo, Ramachandran Ramjee, Prasun Sinha, Li (Erran) Li, Songwu Lu

2 Cellular vs Networks Range = 250 m Mbps CSMA/CD A A b 1xEV-DO (HDR) Range = 20 km Kbps – 2.4 Mbps CDMA / TDMA

3 Recall: Rate Control CE A D B Rate = 20 Rate = 10 Both and HDR use Rate Control to transmit data

4 Motivation for UCAN A B 38.6 Kbps 2.4 Mbps 11 Mbps

5 Simple Test Layout B R D HDR b

6 Simple Test Results

7 UCAN Architecture 3 Challenges Arise –Who is the best proxy? –What happens when route breaks? –Why should I forward your packets?

8 Proxy Discovery 1.HDR Channel Rate Drops 2.D Sends Route Request Using RTREQ propagates using “Proxy Discovery” protocol 4.P sends proxy application to Base 5.Base updates proxy tables 6.Base routes packets for D via P D 2.4 Mbps 38.6 Kbps R R P RTREQ Proxy Application

9 Greedy Proxy Discovery Proxy Discovery Process –Periodic broadcast of HDR rate to neighbors –Client Unicasts RTREQ –Once TTL=0 or no better rate, proxy sends RTREQ to base Advantages –Easy to implement –Low uplink overhead Disadvantages –May not find best proxy! –High energy consumption

10 On-Demand Proxy Discovery –Broadcast RTREQ until TTL=0 –Send RTREQ to base if rate > previous –Clients/Base compare Seq_NO from previous entry Advantages –Finds best proxy –Lower energy consumption Disadvantages –High HDR uplink contention –Higher congestion for large number of clients 3 Challenges Arise –Who is the best proxy? –What happens when route breaks? –Why should I forward your packets?

11 Routing Failures P,R,D are mobile and can break the relay path R moves, P tells Base Base clears proxy table Base sends packets direct to D via HDR D can re-initiate “proxy request” D R R P Failure!

12 Proxy Maintenance Long Term Maintenance –P,R,D are mobile! –P piggybacks its rate on packets –D compares P’s rate to a threshold of its own –D requests new proxy Short Term Maintenance –Base station can send packet to any client on D’s route –Increased Channel Diversity D R R P R=100 R=30 R=60 R=10

13 HDR Scheduling D B C A DRC = 1 DRC = 3 DRC = 6 DRC = 12 Q: How do slots get scheduled fairly? A: Proportional Fairness Scheduling

14 Proportional Fairness Scheduling 2 Goals –Maximize cell throughput –Maintain minimum individual Quality of Service How can this extend to UCAN? Proportional Fairness Scheduling T k (t) = Average Throughput R k (t) = Instantaneous Rate Slot Winner = min{T k (t)/R k (t)} Time D B C A DRC = 1 16 slots DRC = 3 4 Slots DRC = 6 1 Slot DRC = 12 1 Slot AAAABBBCCD

15 UCAN Scheduling HDR uses proportional fairness scheduling –Maximize throughput, maintain minimum QoS –Client scheduled when downlink rate is high UCAN Scheduling –Using Proxy’s R k (t): unfair throughput gain –Using Destination’s R k (t): distributed gain B A R=2 R= AB*B*A 3 AB 12 AB*B* R=2R=1 * Packets received using Proxy A R=2 No Relay Relay w/ Prxy’s R Relay w/ Dst’s R

16 Secure Crediting Why should I forward your packets? –Throughput gains for Active Clients –Wasted energy for Non-active Clients Solution for Non-Active Clients –Award credits –Problem: Watch out for credit scam –Solution: Piggyback Message Authentication Code (MAC) in RTREQ

17 UCAN Performance Evaluation HDR downlink degrades rapidly with distance Average data rate = 600 Kpbs Instantaneous Rate varies a lot in small time scale Motivation for UCAN!

18 UCAN Performance Evaluation Single Destination Client –Static destination =.8R –Mobile Relays –Variables Relay Speed Relay Density UDP vs. TCP Greedy vs. On-Demand D R R P

19 UCAN Throughput Evaluation Throughput Trends –Gain over No-Relay stays constant with varying speed –Throughput Gain: On-Demand > Greedy –Gain over No-Relay increases with increased clients

20 UCAN HDR Uplink Evaluation On-Demand’s higher throughput comes at the price of increased HDR uplink overhead

21 UCAN Energy Evaluation Energy Trends –Energy increases as clients increase –Energy increases as speed increases –Energy Comparison: Greedy > On-Demand

22 UCAN Multiple Client Evaluation Multiple Client Setup –80 Clients (5 Destination Clients) –ALL Clients are mobile –TTL = 1-4

23 UCAN Review Questions –What is the energy comparison between Active UCAN Clients and Non-Active HDR Clients? –What happens when > 5 Clients are Active? –How will credits be implemented? –Can UCAN work across carriers (e.g. Verizon, Cingular, US Cellular)? –Can the HDR uplink support VOIP while using UCAN? Promising Future –310% Single User Gain –60% Multiple User Gain –Always-on Internet (Indoors, Train, Car, etc.)

24 Questions or Comments?