Cooperation Between Stations in Wireless Networks Andrea G. Forte and Henning Schulzrinne Department of Computer Science Columbia University, New York.

Slides:



Advertisements
Similar presentations
IEEE P802 Handoff ECSG Submission July 2003 Bernard Aboba, Microsoft Detection of Network Attachment (DNA) and Handoff ECSG Bernard Aboba Microsoft July.
Advertisements

Fast L3 Handoff in Wireless LANs Andrea G. Forte Sangho Shin Henning Schulzrinne.
Advantage Century Telecommunication Corp. AIL: Actively Intelligent Link-Layer Handoff Guo-Yuan Mikko Wang
A Seamless Handoff Approach of Mobile IP Protocol for Mobile Wireless Data Network. 資研一 黃明祥.
Wireless vs. mobile S Wireless Personal, Local, Metropolitan, and Wide Area Networks1 Contents WLAN vs. 2G/3G Performance, roaming, mobility, security...
Wireless Design for Voice Last Update Copyright 2011 Kenneth M. Chipps Ph.D.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
January 2008 VoIP in Wireless Networks Henning Schulzrinne Andrea G. Forte, Sangho Shin Department of Computer Science Columbia University.
Department of Computer Science Southern Illinois University Carbondale Wireless and Network Security Lecture 9: IEEE
VoIP over Wireless LANs Sangho Shin Ph.D. Candidate Department of Computer Science Columbia University.
IEEE in the Large: Observations at the IETF Meeting Henning Schulzrinne, Andrea G. Forte, Sangho Shin Department of Computer Science Columbia University.
VoIP over Wireless LANs Sangho Shin Ph.D. Candidate Department of Computer Science Columbia University.
Fast Wireless Handoff in Networks Sangho Shin Andrea G. Forte Anshuman S. Rawat Henning Schulzrinne.
Cooperation in Wireless Networks Andrea G. Forte Henning Schulzrinne November 14, 2005.
November 2008 VoIP in Wireless Networks Henning Schulzrinne Andrea G. Forte, Sangho Shin Department of Computer Science Columbia University.
Handoff Delay for b Wireless LANs Masters Project defense Anshul Jain Committee: Dr. Henning Schulzrinne, Columbia University Dr. Zongming Fei, University.
Institute of Technology, Sligo Dept of Computing Semester 3, version Semester 3 Chapter 3 VLANs.
VoIP over Wireless Networks Router Access Point (AP) AP INTERNET.
VPN Wireless Security at Penn State Rich Cropp Senior Systems Engineer Information Technology Services The Pennsylvania State University © All rights.
Managing DHCP. 2 DHCP Overview Is a protocol that allows client computers to automatically receive an IP address and TCP/IP settings from a Server Reduces.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network Chapter 4: Dynamic Host Configuration Protocol.
Implementing Dynamic Host Configuration Protocol
Dynamic Host Configuration Protocol (DHCP)
Introduction to IPv6 NSS Wing,BSNL Mobile Services, Ernakulam 1.
Implementing Dynamic Host Configuration Protocol
An Agile Vertical Handoff Scheme for Heterogeneous Networks Hsung-Pin Chang Department of Computer Science National Chung Hsing University Taichung, Taiwan,
Unwanted Link Layer Traffic in Large IEEE Wireless Network By Naga V K Akkineni.
Submission doc.: IEEE 11-12/0589r2 July 2012 Donald Eastlake 3rd, Huawei R&D USASlide 1 General Links Date: Authors:
Security for the Optimized Link- State Routing Protocol for Wireless Ad Hoc Networks Stephen Asherson Computer Science MSc Student DNA Lab 1.
Submission doc.: IEEE /1015r1 September 2015 Guido R. Hiertz et al., EricssonSlide 1 Proxy ARP in ax Date: Authors:
Configuring DNS and DHCP Chapter 20 powered by DJ 1.
Handoff in IEEE Andrea G. Forte Sangho Shin Prof. Henning Schulzrinne.
Voice Capacity analysis over Introducing VoIP and WLans IEEE based Wireless Local Area Networks (WLANs) are becoming popular While WLANs.
Doc.: IEEE /033r2 Submission July 1999 Simon Baatz, University of BonnSlide 1 Integration of Bluetooth into LAN Environments Simon Baatz, Matthias.
Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.
Doc.: IEEE /236 Submission March 2003 Dennis Baker, James Hauser, NRLSlide 1 Tutorial Mobile Extended Service Sets using the Dynamic Backbone.
Doc.: IEEE /495r1 Submission July 2001 Jon Edney, NokiaSlide 1 Ad-Hoc Group Requirements Report Group met twice - total 5 hours Group size ranged.
WIRELESS FORUM IX CONFIDENTIAL A Multicast-based Protocol for IP Mobility Support Ahmed Helmy, Assist. Prof. Electrical Engineering Dept Univ. of Southern.
VoIP in Wireless Networks Henning Schulzrinne with Andrea G. Forte, Sangho Shin Department of Computer Science Columbia University ComSoc DLT June.
An analysis of Skype protocol Presented by: Abdul Haleem.
Doc.: IEEE r Submission November 2004 Bob Beach, Symbol TechnologiesSlide 1 Fast Roaming Using Multiple Concurrent Associations Bob.
JinHyeock Choi, DongYun Shin hppt:// Fast Router Discovery with L2 Support draft-jinchoi-dna-frd-01.txt.
Submission doc.: IEEE /162 January 2014 RYU Cheol, ETRISlide 1 Possible Agreements for the Design Date: Authors:
A new Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks Andrea Munari, Francesco Rossetto, and Michele Zorzi University of Padova,
Cooperation between stations in wireless networks Andrea G. Forte, Henning Schulzrinne Department of Computer Science, Columbia University Presented by:
Doc.: IEEE /345r0 Submission May 2002 Albert Young, Ralink TechnologySlide 1 Enabling Seamless Hand-Off Across Wireless Networks Albert Young.
October 17, 2007 Cooperation Between Stations in Wireless Networks Andrea G. Forte Henning Schulzrinne Department of Computer Science Columbia University.
Passive Duplicate Address Detection (DAD) Sangho Shin Andrea Forte Henning Schulzrinne Columbia University.
Doc.: IEEE /0098r0 Submission May 2016 Hyunduk Kang et al, ETRISlide 1 A Coexistence Discovery Mechanism Date: Authors:
SHIP: Performance Reference: “SHIP mobility management hybrid SIP-HIP scheme” So, J.Y.H.; Jidong Wang; Jones, D.; Sixth International Conference on
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
Trend of Mobility Management Yen-Wen Chen Ref: 1.Draft IEEE Standard for Local and Metropolitan Area Networks: Media Independent Handover Services 2.Transport.
Introduction to “Tap – Dance ”. Company Proprietary Presentation Topics  Introduction  Handover scenarios  Inter-Network Handover consequences  Common.
Andrea G. Forte Sangho Shin Henning Schulzrinne
Authentication and Upper-Layer Messaging
Internet Indirection Infrastructure (i3)
Fast MAC Layer Handoff in Networks
Configuring and Troubleshooting DHCP
Wireless Mesh Networks
IEEE in the Large: Observations at the IETF Meeting
CS 457 – Lecture 7 Wireless Networks
Roaming Interval Measurements
Net 431: ADVANCED COMPUTER NETWORKS
VoIP in IEEE Networks Henning Schulzrinne
Application Layer Mobility Management Scheme for Wireless Internet
AP Status Broadcast Date: Authors: November 2011
Cooperation Between Stations in Wireless Networks
Mobility Support in Wireless LAN
Cooperative AP Discovery
Presentation transcript:

Cooperation Between Stations in Wireless Networks Andrea G. Forte and Henning Schulzrinne Department of Computer Science Columbia University, New York A malicious MN might try to re-use the relaying mechanism over and over without ever authenticating In order to prevent this: - Each RELAY_REQ allows an RN to relay packets for a limited amount of time (time required to authenticate) - RELAY_REQ frames are multicast. All STAs can help in detecting a bad behavior and only nodes of the multicast group can send such frames - RNs can detect if the R-MN is performing the normal authentication or not (Authentication failures can also be detected) Abstract In a wireless network, mobile nodes (MNs) repeatedly perform tasks such as layer 2 (L2) handoff, layer 3 (L3) handoff and authentication. These tasks are critical for real-time applications such as VoIP. We propose a novel approach, namely Cooperative Roaming (CR), in which MNs can collaborate with each other and share useful information about the network in which they move. We show how we can achieve seamless L2 and L3 handoffs regardless of the authentication mechanism used and without any changes to either the infrastructure or the protocol. In particular, we provide a working implementation of CR and show how, with CR, MNs can achieve a total L2+L3 handoff time of less than 16 ms in an open network and of about 21 ms in a Robust Security Network (RSN). We consider behaviors typical of IEEE networks, although many of the concepts and problems addressed here apply to any kind of mobile network. Implementation and Measurement Results More information available at or by Stations can cooperate and share information about the network (topology, services) Stations can cooperate and help each other in common tasks such as IP address acquisition Stations can help each other during the authentication process without sharing sensitive information, maintaining privacy and security Stations can also cooperate for application-layer mobility and load balancing Security  Cooperation among stations allows seamless L2 and L3 handoffs for real-time traffic  15.6 ms in open networks  21.4 ms in networks using IEEE i  Completely independent from the authentication mechanism used  It doesn’t require any changes in either infrastructure or protocol  It does require many STAs supporting the protocol and a sufficient degree of mobility  Sharing information  Power efficient  Many other applications: application layer mobility, access control, load balancing, service discovery (3G networks, bluetooth, mesh networks) Cooperation Manager ISC DHCP Client Linux WPA supplicant HostAP Wireless Driver Linux kernel version Cooperation at Layer 2 and Layer 3 MN’s Cache  The cache contains L2 and L3 information IP Address Acquisition Each MN saves L2 and L3 information in its cache. This information and the information in the DHCP client lease file is then shared with other MNs using a request/response model and exchanging NET_INFO multicast frames. A node receiving such information (R-MN) will use it to populate its cache By comparing Subnet ID of old and new AP, R-MN can detect a change in subnet R-MN has to discover which MNs can help it in acquiring a new IP address for the new subnet (A-STAs) R-MN will acquire one IP address for each possible subnet that it might move to Why Cooperation? Same tasks Layer 2 handoff Layer 3 handoff Authentication Multimedia session update Same information Topology (failover) DNS Geo-Location Services Same goals Low latency QoS Load balancing Admission control Service discovery Internet Cooperative Roaming - Overview Channel 6Channel 11Channel 1 Subnet ID 3Subnet ID 2Subnet ID 1 MAC CMAC BMAC A Second best APBest APCurrent AP (KEY) Handoff without authentication CRIEEE Handoff ms L2 L3 Total R-MNStations NET_INFO_REQ NET_INFO_RESP R-MN Stations ASTA_DISCOV (m) ASTA_RESP (u) m: multicast u: unicast R-MNA-STA IP_REQ (Client ID).... DHCP Server DHCP_OFFER (client ID) DHCP_ACK IP_RESP (New IP) Coop Manager Wireless card driver (HostAP driver) DHCP client User space Linux kernel space WPA supplicant 11.4 msL3 handoff 4.2 msL2 handoff 15.6 msTotal handoff 1.3 packetsPacket loss msIP_REQ – IP_RESP  CR in open network Relayed Data Packets i authentication packets RN data packets + relayed data packets R-MNRN AP Cooperative Authentication One selected STA (RN) can relay packets to and from the R-MN for the amount of time required by the R-MN to complete the authentication process STAs can cooperate in a mobile scenario to achieve seamless L2 and L3 handoffs regardless of the authentication mechanism used In IEEE networks the medium is “shared” Each STA can hear the traffic of other STAs on the same channel Packets sent by the non- authenticated STA will be dropped by the AP but will be heard by the other STAs on the same channel The selected A-STA can cooperate with the R-MN and acquire a new IP address for the new subnet on its behalf while the R-MN is still in the OLD subnet When a handoff occurs, the R-MN can use the information in its cache without having to perform any scanning