1. Background of Wireless Communication Student Presentations and Projects Wireless Communication Technology Wireless Networking and Mobile IP Wireless Local Area Networks Wireless & Mobile Communication Network Protocols/Mobile IP

2. Mobile Communications: Network Protocols/Mobile IP Mobile Communications Chapter 9: Network Protocols/Mobile IP  Motivation  Data transfer  Encapsulation  Security  IPv6 9.0.1  Problems  DHCP  Ad-hoc networks  Routing protocols

3. Mobile Communications: Network Protocols/Mobile IP Motivation for Mobile IP Routing  based on IP destination address, network prefix (e.g. 121.52.150) determines physical subnet  change of physical subnet implies change of IP address to have a topological correct address (standard IP) or needs special entries in the routing tables Specific routes to end-systems?  change of all routing table entries to forward packets to the right destination  does not scale with the number of mobile hosts and frequent changes in the location, security problems Changing the IP-address?  adjust the host IP address depending on the current location  almost impossible to find a mobile system, DNS updates take to long time  TCP connections break, security problems 9.1.1

4. Mobile Communications: Network Protocols/Mobile IP Requirements to Mobile IP (RFC 2002) Transparency  mobile end-systems keep their IP address  continuation of communication after interruption of link possible  point of connection to the fixed network can be changed Compatibility  support of the same layer 2 protocols as IP  no changes to current end-systems and routers required  mobile end-systems can communicate with fixed systems Security  authentication of all registration messages Efficiency and scalability  only little additional messages to the mobile system required (connection typically via a low bandwidth radio link)  world-wide support of a large number of mobile systems in the whole Internet 9.2.1

5. Mobile Communications: Network Protocols/Mobile IP Terminology Mobile Node (MN)  system (node) that can change the point of connection to the network without changing its IP address Home Agent (HA)  system in the home network of the MN, typically a router  registers the location of the MN, tunnels IP datagrams to the COA Foreign Agent (FA)  system in the current foreign network of the MN, typically a router  forwards the tunneled datagrams to the MN, typically also the default router for the MN Care-of Address (COA)  address of the current tunnel end-point for the MN (at FA or MN)  actual location of the MN from an IP point of view  can be chosen, e.g., via DHCP Correspondent Node (CN)  communication partner 9.3.1

6. Mobile Communications: Network Protocols/Mobile IP Example network mobile end-system Internet router end-system FA HA MN home network foreign network (physical home network for the MN) (current physical network for the MN) 9.4.1 CN

7. Mobile Communications: Network Protocols/Mobile IP Data transfer to the mobile system Internet sender FA HA MN home network foreign network receiver 1 2 3 1. Sender sends to the IP address of MN, HA intercepts packet (proxy ARP) 2. HA tunnels packet to COA, here FA, by encapsulation 3. FA forwards the packet to the MN 9.5.1 CN

8. Mobile Communications: Network Protocols/Mobile IP Data transfer from the mobile system Internet receiver FA HA MN home network foreign network sender 1 1. Sender sends to the IP address of the receiver as usual, FA works as default router 9.6.1 CN

9. Mobile Communications: Network Protocols/Mobile IP Overview CN router HA router FA Internet router 1. 2. 3. home network MN foreign network 4. CN router HA router FA Internet router home network MN foreign network COA 9.7.1

10. Mobile Communications: Network Protocols/Mobile IP Network integration Agent Advertisement  HA and FA periodically send advertisement messages into their physical subnets  MN listens to these messages and detects, if it is in the home or a foreign network (standard case for home network)  MN reads a COA from the FA advertisement messages Registration (always limited lifetime!)  MN signals COA to the HA via the FA, HA acknowledges via FA to MN  these actions have to be secured by authentication Advertisement  HA advertises the IP address of the MN (as for fixed systems), i.e. standard routing information  routers adjust their entries, these are stable for a longer time (HA responsible for a MN over a longer period of time)  packets to the MN are sent to the HA,  independent of changes in COA/FA 9.8.1

11. Mobile Communications: Network Protocols/Mobile IP Agent advertisement preference level 1 router address 1 #addresses type addr. sizelifetime checksum COA 1 COA 2 typesequence numberlength 0 781516312423 code preference level 2 router address 2... registration lifetime... RBHFMGV reserved 9.9.1

12. Mobile Communications: Network Protocols/Mobile IP Registration t MN HA registration request registration reply t MN FAHA registration request registration request registration reply registration reply 9.10.1

13. Mobile Communications: Network Protocols/Mobile IP Mobile IP registration request home agent home address typelifetime 0 781516312423 rsv identification COA extensions... SBDMGV 9.11.1

14. Mobile Communications: Network Protocols/Mobile IP Encapsulation original IP header original data new datanew IP header outer headerinner headeroriginal data 9.12.1

15. Mobile Communications: Network Protocols/Mobile IP Encapsulation (Cont.) Encapsulation of one packet into another as payload  e.g. IPv6 in IPv4 (6Bone), Multicast in Unicast (Mbone)  here: e.g. IP-in-IP-encapsulation, minimal encapsulation or GRE (Generic Record Encapsulation) IP-in-IP-encapsulation (mandatory in RFC 2003)  tunnel between HA and COA Care-of address COA IP address of HA TTL IP identification IP-in-IPIP checksum flagsfragment offset lengthTOSver.IHL IP address of MN IP address of CN TTL IP identification lay. 4 prot.IP checksum flagsfragment offset lengthTOSver.IHL TCP/UDP/... payload 9.13.1

16. Mobile Communications: Network Protocols/Mobile IP Optimization of packet forwarding Triangular Routing  sender sends all packets via HA to MN  higher latency and network load “Solutions”  sender learns the current location of MN  direct tunneling to this location  HA informs a sender about the location of MN  big security problems! Change of FA  packets on-the-fly during the change can be lost  new FA informs old FA to avoid packet loss, old FA now forwards remaining packets to new FA  this information also enables the old FA to release resources for the MN 9.16.1

17. Mobile Communications: Network Protocols/Mobile IP Change of foreign agent 9.17.1 CNHAFA old FA new MN t request update ACK data MN changes location registration update ACK data warning update ACK data registration

18. Mobile Communications: Network Protocols/Mobile IP Reverse tunneling (RFC 2344) 9.18.1 Internet receiver FA HA MN home network foreign network sender 3 2 1 1. MN sends to FA 2. FA tunnels packets to HA by encapsulation 3. HA forwards the packet to the receiver (standard case) CN

19. Mobile Communications: Network Protocols/Mobile IP Mobile IP with reverse tunneling Router accept often only “topological correct“ addresses (firewall!)  a packet from the MN encapsulated by the FA is now topological correct  furthermore multicast and TTL problems solved (TTL in the home network correct, but MN is to far away from the receiver) Reverse tunneling does not solve  problems with firewalls, the reverse tunnel can be abused to circumvent security mechanisms (tunnel hijacking)  optimization of data paths, i.e. packets will be forwarded through the tunnel via the HA to a sender (double triangular routing) The new standard is backwards compatible  the extensions can be implemented easily and cooperate with current implementations without these extensions 9.19.1

20. Mobile Communications: Network Protocols/Mobile IP Mobile IP and IPv6 Mobile IP was developed for IPv4, but IPv6 simplifies the protocols  security is integrated and not an add-on, authentication of registration is included  COA can be assigned via auto-configuration (DHCPv6 is one candidate), every node has address autoconfiguration  no need for a separate FA, all routers perform router advertisement which can be used instead of the special agent advertisement  MN can signal a sender directly the COA, sending via HA not needed in this case (automatic path optimization)  „soft“ hand-over, i.e. without packet loss, between two subnets is supported MN sends the new COA to its old router the old router encapsulates all incoming packets for the MN and forwards them to the new COA authentication is always granted 9.20.1

21. Mobile Communications: Network Protocols/Mobile IP Problems with mobile IP Security  authentication with FA problematic, for the FA typically belongs to another organization  no protocol for key management and key distribution has been standardized in the Internet  patent and export restrictions Firewalls  typically mobile IP cannot be used together with firewalls, special set-ups are needed (such as reverse tunneling) QoS  many new reservations in case of RSVP  tunneling makes it hard to give a flow of packets a special treatment needed for the QoS Security, firewalls, QoS etc. are topics of current research and discussions! 9.21.1

22. Mobile Communications: Network Protocols/Mobile IP Security in Mobile IP Security requirements (Security Architecture for the Internet Protocol, RFC 1825)  Integrity any changes to data between sender and receiver can be detected by the receiver  Authentication sender address is really the address of the sender and all data received is really data sent by this sender  Confidentiality only sender and receiver can read the data  Non-Repudiation sender cannot deny sending of data  Traffic Analysis creation of traffic and user profiles should not be possible  Replay Protection receivers can detect replay of messages 9.22.1

23. Mobile Communications: Network Protocols/Mobile IP not encryptedencrypted IP security architecture I  Two or more partners have to negotiate security mechanisms to setup a security association  typically, all partners choose the same parameters and mechanisms  Two headers have been defined for securing IP packets:  Authentication-Header guarantees integrity and authenticity of IP packets if asymmetric encryption schemes are used, non-repudiation can also be guaranteed  Encapsulation Security Payload protects confidentiality between communication partners Authentification-HeaderIP-HeaderUDP/TCP-Paketauthentication headerIP headerUDP/TCP data ESP headerIP headerencrypted data 9.23.1

24. Mobile Communications: Network Protocols/Mobile IP  Mobile Security Association for registrations  parameters for the mobile host (MH), home agent (HA), and foreign agent (FA)  Extensions of the IP security architecture  extended authentication of registration  prevention of replays of registrations time stamps: 32 bit time stamps + 32 bit random number nonces: 32 bit random number (MH) + 32 bit random number (HA) registration reply registration request IP security architecture II MHFAHA registration reply MH-HA authentication MH-FA authenticationFA-HA authentication 9.24.1

25. Mobile Communications: Network Protocols/Mobile IP Key distribution Home agent distributes session keys  foreign agent has a security association with the home agent  mobile host registers a new binding at the home agent  home agent answers with a new session key for foreign agent and mobile node FAMH HA response: E HA-FA {session key} E HA-MH {session key} 9.25.1

26. Mobile Communications: Network Protocols/Mobile IP DHCP: Dynamic Host Configuration Protocol Application  simplification of installation and maintenance of networked computers  supplies systems with all necessary information, such as IP address, DNS server address, domain name, subnet mask, default router etc.  enables automatic integration of systems into an Intranet or the Internet, can be used to acquire a COA for Mobile IP Client/Server-Model  the client sends via a MAC broadcast a request to the DHCP server (might be via a DHCP relay) clientrelay clientserver DHCPDISCOVER 9.26.1

27. Mobile Communications: Network Protocols/Mobile IP DHCP - protocol mechanisms time server (not selected) client server (selected) initialization collection of replies selection of configuration initialization completed release confirmation of configuration delete context determine the configuration DHCPDISCOVER DHCPOFFER DHCPREQUEST (reject) DHCPACK DHCPRELEASE DHCPDISCOVER DHCPOFFER DHCPREQUEST (options) determine the configuration 9.27.1

28. Mobile Communications: Network Protocols/Mobile IP DHCP characteristics Server  several servers can be configured for DHCP, coordination not yet standardized (i.e., manual configuration) Renewal of configurations  IP addresses have to be requested periodically, simplified protocol Options  available for routers, subnet mask, NTP (network time protocol) timeserver, SLP (service location protocol) directory, DNS (domain name system) Big security problems!  no authentication of DHCP information specified 9.28.1

29. Mobile Communications: Network Protocols/Mobile IP Ad hoc networks Standard Mobile IP needs an infrastructure  Home Agent/Foreign Agent in the fixed network  DNS, routing etc. are not designed for mobility Sometimes there is no infrastructure!  remote areas, ad-hoc meetings, disaster areas  cost can also be an argument against an infrastructure! Main topic: routing  no default router available  every node should be able to forward ABC 9.29.1

30. Mobile Communications: Network Protocols/Mobile IP Routing examples for an ad-hoc network N1N1 N4N4 N2N2 N5N5 N3N3 N1N1 N4N4 N2N2 N5N5 N3N3 good link weak link time = t 1 time = t 2 9.30.1

31. Mobile Communications: Network Protocols/Mobile IP Traditional routing algorithms Distance Vector  periodic exchange of messages with all physical neighbors that contain information about who can be reached at what distance  selection of the shortest path if several paths available Link State  periodic notification of all routers about the current state of all physical links  router get a complete picture of the network Example  ARPA packet radio network (1973), DV-Routing  every 7.5s exchange of routing tables including link quality  updating of tables also by reception of packets  routing problems solved with limited flooding 9.31.1

32. Mobile Communications: Network Protocols/Mobile IP Problems of traditional routing algorithms Dynamic topology  frequent changes of connections, connection quality, participants Limited performance of mobile systems  periodic updates of routing tables need energy without contributing to the transmission of user data, sleep modes difficult to realize  limited bandwidth of the system is reduced even more due to the exchange of routing information  links can be asymmetric, i.e., they can have a direction dependent transmission quality Problem  protocols have been designed for fixed networks with infrequent changes and typically assume symmetric links 9.32.1

33. Mobile Communications: Network Protocols/Mobile IP DSDV (Destination Sequenced Distance Vector) Expansion of distance vector routing Sequence numbers for all routing updates  assures in-order execution of all updates  avoids loops and inconsistencies Decrease of update frequency  store time between first and best announcement of a path  inhibit update if it seems to be unstable (based on the stored time values) 9.33.1

34. Mobile Communications: Network Protocols/Mobile IP Dynamic source routing I Split routing into discovering a path and maintainig a path Discover a path  only if a path for sending packets to a certain destination is needed and no path is currently available Maintaining a path  only while the path is in use one has to make sure that it can be used continuously No periodic updates needed! 9.34.1

35. Mobile Communications: Network Protocols/Mobile IP Dynamic source routing II Path discovery  broadcast a packet with destination address and unique ID  if a station receives a broadcast packet if the station is the receiver (i.e., has the correct destination address) then return the packet to the sender (path was collected in the packet) if the packet has already been received earlier (identified via ID) then discard the packet otherwise, append own address and broadcast packet  sender receives packet with the current path (address list) Optimizations  limit broadcasting if maximum diameter of the network is known  caching of address lists (i.e. paths) with help of passing packets stations can use the cached information for path discovery (own paths or paths for other hosts) 9.35.1

36. Mobile Communications: Network Protocols/Mobile IP Dynamic source routing III Maintaining paths  after sending a packet wait for a layer 2 acknowledgement (if applicable) listen into the medium to detect if other stations forward the packet (if possible) request an explicit acknowledgement  if a station encounters problems it can inform the sender of a packet or look-up a new path locally 9.36.1

37. 36 Flooding of Control Packets  Many protocols perform (potentially limited) flooding of control packets, instead of data packets  The control packets are used to discover routes  Discovered routes are subsequently used to send data packet(s)  Overhead of control packet flooding is amortized over data packets transmitted between consecutive control packet floods

38. 37 Dynamic Source Routing (DSR) [Johnson96]  When node S wants to send a packet to node D, but does not know a route to D, node S initiates a route discovery  Source node S floods Route Request (RREQ)  Each node appends own identifier when forwarding RREQ

39. 38 Route Discovery in DSR B A S E F H J D C G I K Z Y Represents a node that has received RREQ for D from S M N L

40. 39 Route Discovery in DSR B A S E F H J D C G I K Represents transmission of RREQ Z Y Broadcast transmission M N L [S] [X,Y] Represents list of identifiers appended to RREQ

41. 40 Route Discovery in DSR B A S E F H J D C G I K Node H receives packet RREQ from two neighbors: potential for collision Z Y M N L [S,E] [S,C]

42. 41 Route Discovery in DSR B A S E F H J D C G I K Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once Z Y M N L [S,C,G] [S,E,F]

43. 42 Route Discovery in DSR B A S E F H J D C G I K Z Y M Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide N L [S,C,G,K] [S,E,F,J]

44. 43 Route Discovery in DSR B A S E F H J D C G I K Z Y Node D does not forward RREQ, because node D is the intended target of the route discovery M N L [S,E,F,J,M]

45. 44 Route Discovery in DSR  Destination D on receiving the first RREQ, sends a Route Reply (RREP)  RREP is sent on a route obtained by reversing the route appended to received RREQ  RREP includes the route from S to D on which RREQ was received by node D

46. 45 Route Reply in DSR B A S E F H J D C G I K Z Y M N L RREP [S,E,F,J,D] Represents RREP control message

47. 46 Route Reply in DSR  Route Reply can be sent by reversing the route in Route Request (RREQ) only if links are guaranteed to be bi- directional  To ensure this, RREQ should be forwarded only if it received on a link that is known to be bi-directional  If unidirectional (asymmetric) links are allowed, then RREP may need a route discovery for S from node D  Unless node D already knows a route to node S  If a route discovery is initiated by D for a route to S, then the Route Reply is piggybacked on the Route Request from D.  If IEEE 802.11 MAC is used to send data, then links have to be bi-directional (since Ack is used)

48. 47 Dynamic Source Routing (DSR)  Node S on receiving RREP, caches the route included in the RREP  When node S sends a data packet to D, the entire route is included in the packet header  hence the name source routing  Intermediate nodes use the source route included in a packet to determine to whom a packet should be forwarded

49. 48 Data Delivery in DSR B A S E F H J D C G I K Z Y M N L DATA [S,E,F,J,D] Packet header size grows with route length

50. 49 When to Perform a Route Discovery  When node S wants to send data to node D, but does not know a valid route node D

51. 50 DSR Optimization: Route Caching  Each node caches a new route it learns by any means  When node S finds route [S,E,F,J,D] to node D, node S also learns route [S,E,F] to node F  When node K receives Route Request [S,C,G] destined for node, node K learns route [K,G,C,S] to node S  When node F forwards Route Reply RREP [S,E,F,J,D], node F learns route [F,J,D] to node D  When node E forwards Data [S,E,F,J,D] it learns route [E,F,J,D] to node D  A node may also learn a route when it overhears Data packets

52. 51 Use of Route Caching  When node S learns that a route to node D is broken, it uses another route from its local cache, if such a route to D exists in its cache. Otherwise, node S initiates route discovery by sending a route request  Node X on receiving a Route Request for some node D can send a Route Reply if node X knows a route to node D  Use of route cache  can speed up route discovery  can reduce propagation of route requests

53. 52 Use of Route Caching B A S E F H J D C G I K [P,Q,R] Represents cached route at a node (DSR maintains the cached routes in a tree format) M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] Z

54. 53 Use of Route Caching: Can Speed up Route Discovery B A S E F H J D C G I K Z M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ When node Z sends a route request for node C, node K sends back a route reply [Z,K,G,C] to node Z using a locally cached route [K,G,C,S] RREP

55. 54 Use of Route Caching: Can Reduce Propagation of Route Requests B A S E F H J D C G I K Z Y M N L [S,E,F,J,D] [E,F,J,D] [C,S] [G,C,S] [F,J,D],[F,E,S] [J,F,E,S] RREQ Assume that there is no link between D and Z. Route Reply (RREP) from node K limits flooding of RREQ. In general, the reduction may be less dramatic. [K,G,C,S] RREP

56. 55 Route Error (RERR) B A S E F H J D C G I K Z Y M N L RERR [J-D] J sends a route error to S along route J-F-E-S when its attempt to forward the data packet S (with route SEFJD) on J-D fails Nodes hearing RERR update their route cache to remove link J-D

57. 56 Route Caching: Beware!  Stale caches can adversely affect performance  With passage of time and host mobility, cached routes may become invalid  A sender host may try several stale routes (obtained from local cache, or replied from cache by other nodes), before finding a good route  An illustration of the adverse impact on TCP will be discussed later in the tutorial [Holland99]

58. Mobile Communications: Network Protocols/Mobile IP Clustering of ad-hoc networks Internet super cluster cluster 9.37.1

59. Mobile Communications: Network Protocols/Mobile IP Interference-based routing Routing based on assumptions about interference between signals S1S1 N5N5 N3N3 N4N4 N1N1 N2N2 R1R1 R2R2 N6N6 N8N8 S2S2 N9N9 N7N7 neighbors (i.e. within radio range) 9.38.1

60. Mobile Communications: Network Protocols/Mobile IP Examples for interference based routing Least Interference Routing (LIR)  calculate the cost of a path based on the number of stations that can receive a transmission Max-Min Residual Capacity Routing (MMRCR)  calculate the cost of a path based on a probability function of successful transmissions and interference Least Resistance Routing (LRR)  calculate the cost of a path based on interference, jamming and other transmissions LIR is very simple to implement, only information from direct neighbors is necessary 9.39.1

61. Q&A ? Mobile Communications: Wireless LANs