Multi-radio & Mixed Networks Gaurang Sardesai & Jeff Pang.

Slides:



Advertisements
Similar presentations
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Advertisements

Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
CSCI 465 D ata Communications and Networks Lecture 20 Martin van Bommel CSCI 465 Data Communications & Networks 1.
MOBICOM'031 UCAN: A Unified Cellular and Ad-Hoc Network Architecture Haiyun Luo Ramachandran Ramjee Prasun Sinha, Li Erran Li, Songwu Lu.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Internetworking Different networks –Different bit rates –Frame lengths –Protocols.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
Ad Hoc Wireless Routing COS 461: Computer Networks
Layer 2 Switch  Layer 2 Switching is hardware based.  Uses the host's Media Access Control (MAC) address.  Uses Application Specific Integrated Circuits.
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation Baruch Awerbuch, David Holmer, Herbert Rubens {baruch dholmer WONS Jan.
CIS 725 Wireless networks. Low bandwidth High error rates.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
1 UCAN: A Unified Cellular and Ad-Hoc Network Architecture Rick Szcodronski ECE 256 February 12, 2008 Published by: Haiyun Luo, Ramachandran Ramjee, Prasun.
10/1/2015 9:14 PM1 TCP in Mobile Ad-hoc Networks ─ Split TCP CSE 6590.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Adhoc Network: Routing Protocol:AODV
1 UCAN: A Unified Cellular and Ad-Hoc network Architecture By H. Luo, S. Lu Computer Science Department UCLA.
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
NUS.SOC.CS2105 Ooi Wei Tsang Application Transport Network Link Physical you are here.
UCAN: A Unified Cellular and Ad Hoc Network Architecture Presenter: Tripp Parker Authors: Haiyun Luo Ramachandran Ramjee Prasun Sinha, Li Erran Li, Songwu.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
Energy Efficient Network Protocols for Wireless Networks Kiran Muthabatulla.
Security in Mobile Ad Hoc Networks: Challenges and Solutions (IEEE Wireless Communications 2004) Hao Yang, et al. October 10 th, 2006 Jinkyu Lee.
Improving Loss Resilience with Multi- Radio Diversity in Wireless Networks by Allen Miu, Hari Balakrishnan and C.E. Koksal Appeared in ACM MOBICOM 2005,
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao
Remote Deployment of Sensor Networks Presentation 3: Providing connectivity between sensor nodes and uplinks.
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
IEEE Wireless LAN. Wireless LANs: Characteristics Types –Infrastructure based –Ad-hoc Advantages –Flexible deployment –Minimal wiring difficulties.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Improving Loss Resilience with Multi-Radio Diversity in Wireless Networks Allen Miu, Hari Balakrishnan MIT Computer Science and Artificial Intelligence.
Wireless Communication
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Internet Networking recitation #4
Sensor Network Routing
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile and Wireless Networking
Routing Metrics for Wireless Mesh Networks
EEC-484/584 Computer Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
TCP in Mobile Ad-hoc Networks
EEC-484/584 Computer Networks
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Computer Networks: Wireless Networks
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Multi-radio & Mixed Networks Gaurang Sardesai & Jeff Pang

Papers UCAN: A Unified Cellular and Ad-Hoc Network Architecture, Haiyun Luo, Ramachandran Ramjee, Prasun Sinha, Li Li, Songwu Lu, ACM MOBICOM 2003, San Diego, California UCAN: A Unified Cellular and Ad-Hoc Network Architecture The Pulse Protocol: Energy Efficient Infrastructure Access, Awerbuch, Holmer, Rubens, The 23rd Conference of the IEEE Communications Society (IEEE Infocom 2004) The Pulse Protocol: Energy Efficient Infrastructure Access

UCAN : Unified Cellular Ad-Hoc Network Synergistically combine 3G and networks Service to low data users reduces cell’s aggregate throughput 3G BS forwards packets to proxy clients with better channel quality who then forward it over their interface. Maintain Fairness Why would you want to relay packets for others?  Secure crediting mechanism

Motivation Ad-Hoc mode complements the Cellular infrastructure Differences between WWAN and WLAN  Coverage area, throughput, operating mode Mobile device needs two interfaces

Architecture Clients monitor downlink channel conditions. If rate is low, use relays. Challenges:  Proxy Discovery  Topology / Rate change  Why would you forward packets for someone?

Proxy discovery and Routing When low downlink channel rate, client sends out route request message on b interface. Message propagated by intermediate nodes, route established along the way. Proxy client sends request to HDR BS. All further frames sent through new route using tunneling Every client maintains moving avg of its downlink channel quality Greedy (proactive) On demand (reactive)

Greedy Proxy Discovery Nodes periodically exchange avg downlink channel rates by broadcasting NDADV Route requests sent to highest rate neighbor along with TTL On receipt of request, client makes entry in table, if TTL larger than 0, forward to it’s best neighbor, else sends proxy application message to HDR BS. Problem?  May not always locate best path

Greedy Proxy Discovery

On-demand proxy Delivery When required, destination client floods RTREQ message within certain range. On receipt of req, client checks sequence number and HDR channel rate Update channel rate, and apply to HDR BS to become a proxy client. IF TTL >0, decrement TTL and further broadcast. BS checks seq # and decide on Proxy

On-demand Proxy Discovery Locates the best path But overhead on HDR uplink

Route and Proxy Maintenance Rates change, clients move, loops may occur Path Breaks Proxy maintenance w.r.t rate change Routing loops

Scheduling Algorithm Proportional Fair Scheduling Client with min is scheduled for round Use destination client’s own downlink rate to schedule.

Secure Crediting Why would you want to relay for someone else? All intermediate clients awarded credits. Problems?  Deletion of legitimate clients  Addition of Extra Clients Piggyback MAC in RTREQ message But do not handle two consecutive clients conspiring

Performance Evaluation

Single Destination Client

Multiple Destination Clients

Take Aways Novel Idea Will this work for voice networks? Don’t discuss credit accounting and per packet overhead.

Pulse Protocol Pulse protocol sends out periodic pulse which provides routing and synchronization. Pulse forms a spanning tree, and so each node has a continuously updated route towards the nearest network gateway. Allows nodes to power off radio most of the time, except when required for packet forwarding. Synchronous sleep protocol

Working Flood called pulse sent at fixed pulse intervals. Originates from sources (WAP) and propagates across ad hoc component of network. Routing – each node only remembers the node from where it got the flood packet with lowest metric. Loop free. Synchronization If node needs to send packet, make reservation in response to flood. Sets up reverse routes. Like AODV. If sending, send reservation in order to keep route fresh. If you don’t want to send of forward a reservation, sleep until the next pulse, as you’re not sending a reservation. To reduce contention, no data packets sent during the flood. All broken routes repaired simultaneously by within one pulse interval by flood.

Comparison

Why Multiple Radios? Multiple Senders: Channel Diversity  Adya, et al. ‘04 Multiple Receivers: Path Diversity  Miu, et al. ‘05  Ferrière, et al. ‘05 Ch. 1Ch. 11

Multi-Radio Unification Protocol (MUP) MUP Architecture Environment:  Community Mesh Networks Goal:  Increase Forwarding Capacity Basic Idea:  Give each node NICs on different channels  Send on channel with best quality Constraints:  Use commodity parts  Don’t modify MAC  Support legacy (single channel) nodes  Decentralized

MUP Protocol Overview 1.Probe neighbors to discover available channels 2.Periodically measure channel quality to each neighbor 3.Select channel with best quality 4.Send packets out best channel 5.Repeat

MUP Protocol Example A BC Legacy node ARP MAC1 MAC1,MAC2 nodechannelquality A1? A11? C1? nodechannelquality A1? A11? C1? CS nodechannelrtt A110 A112 C1? CS-ACK

Channel Quality Metric RTT (see last lecture)  SRTT = a*RTT new + (1-a)*SRTT Lost CS messages =>  SRTT = 3*SRTT Problems? Alternatives?  Self-interference can cause oscillations  Could use ETX from last lecture

Orthogonal Channels a  Theory: 13  Practice: b/g  Theory: 3  Practice: 1-2 Signal power leakage => interference

MUP Throughput Improvement 50% legacy nodes 50% 2 NIC nodes Simulated TCP tput

Alternative: Stripping MUP picks 1 best interface Instead, can use all interfaces simultaneously Basic Idea:  Use round-robin to select which NIC to send a packet on Alternatives to reduce loss?  FEC packet combining codes (next paper)  Sacrifice some capacity for redundancy

MUP vs. Stripping Round-robin Stripping is worse!  Channel load not equal => lots of out-of-order packets Load-sensitive Striping gain is negligible  Why? Hint: only 2 channels…

MUP Summary Leverage channel diversity with multiple- radios per node Use unmodified commodity parts Channel selection based on SRTT metric

Multi-Radio Diversity (MRD) Environment:  AP Infrastructure Network Goal:  Reduce AP receiver loss/error-rate Basic Idea:  Let multiple APs hear client packets  Recover errors by combining multiple copies Constraints:  Don’t change link-layer  APs connected on high-speed LAN

MRD Protocol Overview Client associates with one AP Other APs on same channel listen passively Send all received packets to MRD Combiner (MRDC): 1.See if at least one good copy 2.If not, try to recover from all bad copies 3.If can’t recover, fail and let client retransmit

MRD Protocol Example MRDC OK! (soft selection)

MRD Protocol Example MRDC OK! (frame combining)

Frame Combining Details original received 1. Split into blocks Find bad blocks Check all possibilities against CRC in header (bad headers => drop)

Frame Combining Efficiency Bit errors are bursty Errors at different APs are uncorrelated Theory: small number of blocks will succeed most of the time

Retransmissions: RFA When does sender know tx success?  Soft-selection => Link-layer ACK  Frame-combining => ??? Why wait for ACK with frame combining?  Slow! Must wait for MRDC Solution: Request for ACK  Sender periodically asks for ACK  MRDC acks all packets combined OK Issues?  Delay => OK if short  Packet reordering => need to buffer  Overhead => piggyback RFA on data packets

Mobile Experiment recovered by soft selection recovered by frame combining

Static Experiment

MRD Summary Leverage path diversity with multiple receivers Correct errors with frame combining Use delayed RFA to obtain tx status

Simple Packet Combining (SPaC) Environment:  Multi-hop Sensor Network Goal:  Recover from bit errors with multiple receptions of the same packet Basic Idea:  A node overhears packets as they are forwarded  When you get more than one corrupt copy of a packet, you may be able to correct the errors

SPaC Overview Merge with Frame Combining

Some SPaC Details Can recover errors with:  Multiple overheard packets  Multiple retransmissions Use same idea in MRD frame combining to correct errors

Multi-Radio Discussion What more general type of diversity is channel diversity?  Frequency diversity  Really just using more spectrum What more general type of diversity is receiver/path diversity?  Space diversity  Is this much different from multiple antennas? What other types of diversity could multiple radios exploit?  Technology Diversity? (802.11, GPRS, WiMax, etc.)