UNIT -3

Mobile IP Network Layer And Mobile

Transport Layer
VIII SEMESTER
Mobile Computing
ETIT-402

1 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Books
1) Mobile Computing by Rak kamal
2) Mobile Communication By Jochen Schiller

2 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IP and Mobile IP Network Layer-
 Introduction
 Packet delivery and Handover Management
 Location Management
 Registration
 Tunnelling and Encapsulation
 DHCP
 Adhoc Network
 IPsec

3 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Motivation For Mobile IP
Routing
• Based on IP destination address,
• Network prefix (e.g. 129.13.42) determines physical subnet
• change of physical subnet => change of IP address to have a
topological correct address (standard IP)
Solution: Temporarily change routing table entries for mobile host
Problem: does not scale if many mobile hosts or frequent
location changes
Solution: Change mobile host IP-address
• Adjust the host IP address depending on the current location
• DNS updates take to long time
• Old TCP connections break

4 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Requirements to Mobile IP
Transparency
 Mobile end-systems keep IP address
 Continuous service after link interruption
 Point of connection to the fixed network can be changed

Compatibility
 No changes to current hosts, OS, routers
• Mobile end-systems can communicate with fixed systems security
 Authentication of all registration messages

Efficiency and scalability

 Only few additional messages to mobile system (low bandwidth)
 Global support for large number of mobile systems

5 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Mobile IP Entities
 Mobile Node (MN)
 The entity that may change its point of attachment from network to
network in the Internet
 Detects it has moved and registers with “best” FA
 Assigned a permanent IP called its home address to which other hosts send
packets regardless of MN’s location
 Since this IP doesn’t change it can be used by long-lived applications as
MN’s location changes
 Home Agent (HA)
 This is router with additional functionality
 Located on home network of MN
 Does mobility binding of MN’s IP with its COA
 Forwards packets to appropriate network when MN is away
 Does this through encapsulation

6 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Mobile IP Entities contd.
Care-of-address (COA)
 Address which identifies MN’s current location
 Sent by FA to HA when MN attaches
 Usually the IP address of the FA
Correspondent Node (CN)
 End host to which MN is corresponding (eg. web server)
Home Network
 Mobile radio subsystem’s network within an area known as paging area.
Paging Area
• Area in which MN of Home as well as Foreign Network can be approach
through single or set of MSC
Foreign Agent (FA)
 Another router with enhanced functionality
 If MN is away from HA the it uses an FA to send/receive data to/from HA
 Advertises itself periodically

7 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Working of Mobile IP

8 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Working of Mobile IP

9 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Packet Delivery and Handover Management

10 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Packet Delivery and Handover Management
• Corresponding Node (CN) Is MN which communicates IP packet to other
MN. Various Scenario in Hand over management
Case 1:- CN is Fixed and MN1 is at Home Network

Case 2:- CN is Mobile Node MNk is at Home Network with agent HAk and MN1 is
at home network with agent HAi .

Case 3: - CN is Fixed node and MN1 is at a Foreign Network

Case 4:- CN is Mobile Node MNk is at Foreign Network with agent FAk and MN1 is
at home network with agent HAi

Case 5:- CN is Mobile Node MNk is at Foreign Network with agent FAk E and MN1
is at another foreign network with agent FAj

Case 6:- CN is Mobile Node MNk is at Home Network with HAk and MN1 is at
foreign network with agent FAj
11 Bharati Vidyapeeth's College Of Engineering , New Delhi
 Location Management
 MN often Visits Foreign Network.
 Handover Management:- Managing the transfer of service availability to
the new Location Network
 Preparing for services at new networks require proper Location
Management Protocol.
 Agent Discovery is through agent advertisement and agent solicitation
Agent Discovery:-
• In FN , MN must discover FA . Step involve in agent discovery are
1) Listen to an advertisement ( ICMP message) from an agent
2) Proceed to step 3 if the advertisement is found , else solicit the agent from the
routers. If agent is found then proceed to step 3 else repeat the step
3) If COA is discovered from the message is found to the same as the previous
COA go back to step 1 or else proceed to step 4
4) If the discovered COA is same as HN, de=register at this network and go back
to step1 else if current COA is a new COA , then register with new COA

12 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Location Management

13 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration
 Registration of MN is required with new FA after discovery of an agent for
service and COA.
 De-registration of MN is mist from HA.
 HA only encapsulate the IP packets and send to discover FA (through
tunnelling) when CN communicates with MN.
 For request and reply, UDP is used.
 Step For registration :-
A) MN send request to FA, FA to HA. If COA is co-located COA request directly
to HA
B) HA bind itself for mobility having binding period equal to COA.
C) MN register again before expiry of binding period if it moves to new FN or
return back to FN
D) HA sends registration reply to FA , FA to MN.

14 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.

15 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.

16 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.

17 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.
 Registration request field :- Uses UDP datagram for registration request
1) 32 bit word with first byte 00000001, eight bit flag. And two byte for life time(in
sec)
2) 32bit word for home IP address of MN
3) 32 bit word for Home agent IP address of MN
4) 32 Bit word of COA of the MN at the new agent
5) 32 bit word for identification of MN
6) set of word for extension

• Registration Reply field :- Uses UDP datagram for registration reply

1) 32 bit word with first byte 00000011, eight bit Code specifying the result And
two byte for life time(in sec)
2) 32bit word for home IP address of MN
3) 32 bit word for Home agent IP address of MN
4) 32 bit word for identification of MN
5) set of word for extension

18 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.

Frame Format For Request

Frame Format for Reply

19 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Registration Process Contd.

20 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Processing Registration Messages
 A MN, depending on which registration scenario it is in, will figure what
addresses to use in the various fields of the Registration request message.
 Link layer addresses are tricky:
• A MN may not use ARP if it is using a FA COA. It needs to use the address of the
FA as the destination address.
• If it is using a collocated COA, then it uses ARP to locate the default router using
its COA as source. Note that if the ‘R’ bit is set is uses the FA address as the
destination address.
• For de-registration is uses ARP to locate the HA link address and it uses its own
home address for the ARP message.
 For network layer addresses (i.e., IP addresses):
 It uses the FA address as destination address when using the FA COA and its own
home address as the source address.
 If using a collocated COA it uses its COA as source address and the HA address as
destination address. Note that if the ‘R’ bit is set then is must use the same
addresses as for the FA COA scenario.
 For de-registration it uses its own home address as source and the HA address as
destination.
21 Bharati Vidyapeeth's College Of Engineering , New Delhi
 Processing Registration Messages
 For the FA:
 A FA may refuse a Registration request for a number of reasons: lifetime too long,
authentication failed, requested tunnelling not supported, cannot handle another MN
(current load too high).

 If an FA does not refuse the request it relays it to the HA. Relaying is different from
forwarding as the FA is required to process the packet and create new headers.

 Some important fields of the request message are recorded for use later on: MN link
layer address, MN IP address, UDP source port, HA IP address, identification number
and requested lifetime.

 Regarding a Registration reply message, the FA can refuse it and send a decline to the
MN is it finds the reply from the HA to be invalid. Otherwise it updates its list of visiting
MNs and begins acting on behalf of the MN.

22 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Processing Registration Messages
 Routing a packet to a MN involves the following:

 A router on the home link, possibly the HA, advertises reachability to the

network prefix of the MN’s home address.

 All packets are therefore routed to the MN’s home link.

 A HA intercepts the packets for the MN and tunnels a copy to each COA in the

binding table.

 At the foreign link either the MN extracts the packet (collocated COA) or the

FA extracts the packet and forwards it to the MN.

23
Bharati Vidyapeeth's College Of Engineering , New Delhi
 Tunnelling and Encapsulation
 Tunnel :- virtual pipe for date packet between tunnel entry and end point.
 Tunneling :- sending packet through tunnel, achieved by encapsulation
 Encapsulation :- Mechanism of taking a packet consisting packet header
and data packet and putting it into data part of new packet.

original IP header original data

new IP header new data

outer header inner header original data

24 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Types of Encapsulation

 Three types of encapsulation protocols are specified for Mobile IP:

 IP-in-IP encapsulation: required to be supported. Full IP header added to
the original IP packet. The new header contains HA address as source and
Care of Address as destination.

 Minimal encapsulation: optional. Requires less overhead but requires

changes to the original header. Destination address is changed to Care of
Address and Source IP address is maintained as is.

 Generic Routing Encapsulation (GRE): optional. Allows packets of a

different protocol suite to be encapsulated by another protocol suite.

 Type of tunneling/encapsulation supported is indicated in registration.

25 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IP in IP Encapsulation
 IP in IP encapsulation (mandatory in RFC 2003)
 tunnel between HA and COA

ver. IHL TOS length

IP identification flags fragment offset
TTL IP-in-IP IP checksum
IP address of HA
Care-of address COA
ver. IHL TOS length
IP identification flags fragment offset
TTL lay. 4 prot. IP checksum
IP address of CN
IP address of MN

TCP/UDP/ ... payload

26 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Minimum Encapsulation
 Minimal encapsulation (optional)
 avoids repetition of identical fields
 e.g. TTL, IHL, version, TOS
 only applicable for unfragmented packets, no space left for
fragment identification
ver. IHL TOS length
IP identification flags fragment offset
TTL min. encap. IP checksum
IP address of HA
care-of address COA
lay. 4 protoc. S reserved IP checksum
IP address of MN
original sender IP address (if S=1)

TCP/UDP/ ... payload

27 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Generic Routing Encapsulation

original
original data
header

GRE original
outer header original data
header header
ver. IHL TOS length
IP identification flags fragment offset
TTL GRE IP checksum
IP address of HA new header new data
Care-of address COA
C R K S s rec. rsv. ver. protocol
checksum (optional) offset (optional)
key (optional)
sequence number (optional)
routing (optional)
ver. IHL TOS length
IP identification flags fragment offset
TTL lay. 4 prot. IP checksum
IP address of CN
IP address of MN

TCP/UDP/ ... payload

28 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Routing/Tunneling
 Routing a packet to a MN involves the following:
 A router on the home link, possibly the HA, advertises reachability to the
network prefix of the MN’s home address.
 All packets are therefore routed to the MN’s home link.
 A HA intercepts the packets for the MN and tunnels a copy to each COA in the
binding table.
 At the foreign link either the MN extracts the packet (collocated COA) or the FA
extracts the packet and forwards it to the MN.
 A HA can use one of two methods to intercept a MN’s packets:
 The HA is a router with multiple network interfaces. In that case it advertises
reachability to the MN’s home network prefix.
 The HA is not a router with multiple interfaces. It must use ARP to receive the
MN’s packets. It either responds to ARP requests on behalf of the MN (proxy
ARP) or uses gratuitous ARPs to inform the home network that it is receiving the
MN’s IP packets. This is to update any ARP caches that hosts and other devices
might have.
29 Bharati Vidyapeeth's College Of Engineering , New Delhi
 Routing/Tunneling

 How to ‘fool’ the routing table into handling tunneled packets at the HA?
 A virtual interface is used to do the encapsulation.
 A packet destined for the MN is handled by the routing routine as all
received IP packets are.
 The routing table has a host specific entry for the MN. This host specific
entry is used to route the packet to a virtual interface that basically
consists of a process that does encapsulation.
 Once encapsulation has been performed the packet is sent to be
processed by the routing routine again. This time the destination address
is the COA and it is routed normally.

30 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Routing/Tunneling
 How to ‘fool’ the routing table into handling tunneled packets at
the FA?
 The same procedure is used as above.
A packet coming in with a COA that is one of the FA addresses’ is
handled by the routing routine.
 A host specific address (its own address) in the routing table points
to the higher layers and the packet is passed on to a virtual
interface.
 The virtual interface consists of a process that decapsulates the
packet and re-routes it to the routing routine.
 The routing routine routes the packet normally based upon a host
specific entry that is the MN’s home address (for which it has the
link layer address!).

31 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Routing/Tunneling
 How does a MN route its packets?
 It needs to find a router to send all its packets to.
 It can select a router in one of a number of ways dependent upon
whether it has a FA COA or a collocated COA.
 Having a FA COA does not imply that the MN needs to use it as its
default router for sending packets. It can use any router that sends
advertisements or that is advertised in the Agent Advertisement
message.
 If the MN is using a collocated COA it needs to listen for router
advertisements or is it hears none, use DHCP to find the default
router.
 Determining the link layer address is another issue. Collocated COA
MNs can use ARP. FA COA must note the link layer address when
they receive router advertisements or agent advertisements.

32 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Routing techniques
 Triangle Routing: tunneling in its simplest form has all packets go to
home network (HA) and then sent to MN via a tunnel.
 This involves two IP routes that need to be set-up, one original and
the second the tunnel route.
 Causes unnecessary network overhead and adds to the latency.

 Route optimization: allows the correstpondent node to learn the current

location of the MN and tunnel its own packets directly. Problems arise
with
 mobility: correspondent node has to update/maintain its cache.
 authentication: HA has to communicate with the correspondent
node to do authentication, i.e., security association is with HA not
with MN.

33 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Optimization of packet forwarding
 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

34 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Change of foreign agent

35 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Problems with Triangle Routing
 Triangle routing has the MN correspond directly with the CN using its
home address as the SA

 Firewalls at the foreign network may not allow that

 Multicasting: if a MN is to participate in a multicast group, it needs to

use a reverse tunnel to maintain its association with the home network.

 TTL: a MN might have a TTL that is suitable for communication

when it is in its HM. This TTL may not be sufficient when moving
around (longer routes possibly). When using a reverse tunnel, it only
counts as a single hop. A MN does not want to change the TTL
everytime it moves.

 Solution: reverse tunneling

36 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Reverse tunneling
HA
2
MN

home network 1 sender

Internet

FA foreign
network

1. MN sends to FA
3 2. FA tunnels packets to HA
CN by encapsulation
3. HA forwards the packet to the
receiver (standard case)
receiver

37 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Mobile IP with reverse tunneling
 Routers accept often only “topologically correct“ addresses (firewall!)
 a packet from the MN encapsulated by the FA is now topologically
correct

 Multicast and TTL problems solved

 Reverse tunneling does not solve

 all 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 (longer routes)

 The new standard is backwards compatible

 the extensions can be implemented easily

38 Bharati Vidyapeeth's College Of Engineering , New Delhi

 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)
DHCPDISCOVER

DHCPDISCOVER
server client

client relay

39 Bharati Vidyapeeth's College Of Engineering , New Delhi

 DHCP - protocol mechanisms
server client server
(not selected) initialization (selected)
DHCPDISCOVER DHCPDISCOVER
determine the determine the
configuration configuration
DHCPOFFER DHCPOFFER
collection of replies

selection of configuration
DHCPREQUEST DHCPREQUEST
(reject) (options) confirmation of
configuration
DHCPACK
initialization completed

release
DHCPRELEASE delete context

40 Bharati Vidyapeeth's College Of Engineering , New Delhi

 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

41 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Ad Hoc Network
 Dynamically changing topology;
 Absence of fixed infrastructure and centralized administration;
 Bandwidth constrained wireless links;
 Energy-constrained nodes.

Link loss is one of the biggest problem of routing

42 Bharati Vidyapeeth's College Of Engineering , New Delhi
 Adhoc Network
Design goals :-
 must be scalable;
 must be fully distributed, no central coordination;
 must be adaptive to topology changes caused by movement of nodes;
 route computation and maintenance must involve a minimum number
of nodes;
 must be localized, global exchange involves a huge overhead;
 must be loop-free;
 must effectively avoid stale routes;
 must converge to optimal routes very fast;
 must optimally use the scare resources: bandwidth, battery power,
memory, computing;
 should provide QoS guarantees to support time-sensitive traffic.

43 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Classification of Routing Protocols
Routing protocols for ad-hoc wireless networks can be classified based
on:
 routing information update mechanism;
 usage of temporal information (e.g. cached routes);
 usage of topology information;
 usage of specific resources (e.g. GPS).

Based on routing information update mechanism

 Proactive (table-driven) routing protocols;
 Reactive (on-demand) routing protocols;
 Hybrid protocols.

44 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Classification of Routing Protocols
Based on usage of temporal information
 Based on past temporal information;
 Based on future temporal information.

Based on the routing topology

 Flat topology routing protocols:
 Hierarchical topology routing protocols

Routing based on utilization of specific resources:

 Power-aware routing;
 Geographical information assisted routing.

45 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Classification of routing protocols

46 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Global State routing Protocol
 Global State Routing is based upon the fundamental concepts of link state
routing.
 In Link State Routing(LSR), one of the node floods out a single routing
table information to its neighbours and those neighbours floods out that
table to further nodes. This process continue to take place until the routing
table is received by all the nodes throughout the network.
 But in case of Global State Routing, the routing table of a particular node is
broadcasted to its immediate neighbours only. Then initial tables of those
neighbouring nodes are updated. These updated tables are further
broadcast one by one and this process continue to take place until all the
nodes broadcasts their tables to each node in the network.

47 Bharati Vidyapeeth's College Of Engineering , New Delhi

 GSR Contd.

48 Bharati Vidyapeeth's College Of Engineering , New Delhi

 GSR Contd.
GSR protocol uses and maintains three tables for every node individually. These tables
are:

 Distance Table : This table contains the distance of a node from all the nodes in

network.

 Topology Table : This table contains the information of Link state data along with
the sequence number which can be used to determine when the information is
updated last.

 Next Hop Table : Next hop table will contain the information about the immediate

neighbour of a particular node.

 These tables are updated on every step and ensures that each node receives correct

information about all the nodes including their distances.

49 Bharati Vidyapeeth's College Of Engineering , New Delhi

 GSR Contd.
Advantages :
 Higher accuracy of GSR in generating optimal path as compared to
LSR.
 Broadcasting reduces error rate as compare to flooding used in LSR.

Disadvantages :
 Large bandwidth consumption.

 Higher operational cost.

 Large Message size resulting in more time consumption.

50 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Destination sequenced distance vector routing
protocol (DSDV)
Modification of the Bellman-Ford algorithm where each node maintains:
 the shortest path to destination;
 the first node on this shortest path.
This protocol is characterized by the following:
 routes to destination are readily available at each node in the routing table
(RT);
 RTs are exchanged between neighbours at regular intervals;
 RTs are also exchanged when significant changes in local topology are
observed by a node.
RT updates can be of two types:
 incremental updates:- take place when a node does not observe significant
changes in a local topology;
 full dumps:- take place when significant changes of local topology are
observed;
51 Bharati Vidyapeeth's College Of Engineering , New Delhi
 DSDV Contd.
 The reconfiguration of path (used for ongoing data transfer) is done as follows:
 the end node of the broken link sends a table update message with:-
broken link's weight assigned to infinity;
sequence number greater than the stored sequence number for that
destination.
 each node re-sends this message to its neighbours to propagate the broken link to
the network;
 even sequence number is generated by end node, odd - by all other nodes.
 Note: single link break leads to the propagation of RT updates through the whole
network!

52 Bharati Vidyapeeth's College Of Engineering , New Delhi

 DSDV Contd.

Fig:- Route update in DSDV.

Route maintenance in DSDV is performed as follows:
 when a neighbour node perceives a link break (node 3):-
it sets all routes through broken link to 1;
broadcasts its routing table.
 node 5 receives update message, it informs neighbours about the shortest
distance to node 6;
 this information is propagated through the network and all node updates their
RTs;
 node 1 may now sends their packets through route 1- 3- 5- 6 instead of 1- 3-6.

53 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Dynamic Source Routing

 Split routing into discovering a path and maintaining 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!

54 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Dynamic Source Routing
 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)
55 Bharati Vidyapeeth's College Of Engineering , New Delhi
 Dynamic Source Routing
 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

56 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Clustering of ad-hoc networks

Internet

cluster

super cluster

57 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Interference-based routing
 Routing based on assumptions about interference between
signals
N1
N2

R1
S1 N3

N4

N5 N6 R2
S2

N8 N9
N7
neighbors
(i.e. within radio range)

58 Bharati Vidyapeeth's College Of Engineering , New Delhi

 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

59 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPSec
 General IP Security mechanisms
 Provides authentication, confidentiality ,key management
 Applicable to use over LANs, across public & private WANs, & for the
Internet

60 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPsec
 Advantage of IPSec
 In a firewall/router provides strong security to all traffic crossing the perimeter
 In a firewall/router is resistant to bypass
 Is below transport layer, hence transparent to applications
 Can be transparent to end users
 Can provide security for individual users
 Secures routing architecture
 IPsec Modes
 Tunnel Mode
 Entire IP packet is encrypted and becomes the data component of a new (and larger) IP
packet.
 Frequently used in an IPSec site-to-site VPN
 Transport Mode
 IPsec header is inserted into the IP packet n
 No new packet is created
 Works well in networks where increasing a packet’s size could cause an issue
 Frequently used for remote-access VPNs

61 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPsec
Tunnel Vs Transport Mode

Transport Mode: End systems are the initiator and recipient of protected traffic
Tunnel Mode: Gateways act on behalf of hosts to protect traffic

62 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPsec Components
 AH (Authentication Header)
 Authentication is applied to the entire packet, with the mutable fields in the IP
header zeroed out
 If both ESP and AH are applied to a packet, AH follows ESP
 ESP (Encapsulating Security Payload)
 Must encrypt and/or authenticate in each packet
 Encryption occurs before authentication
 Authentication is applied to data in the IPsec header as well as the data contained
as payload
 IKE (Internet Key Exchange)
 Automated SA (Security Association) creation and key management

63 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPsec Architecture

Security Association :
•A collection of parameters required to establish a secure session
•Uniquely identified by three parameters consisting of Security Parameter
Index (SPI) , IP destination address & Security protocol (AH or ESP)
identifier
•An SA is unidirectional
•Two SAs required for a bidirectional communication
• A single SA can be used for AH or ESP, but not both
•Must create two (or more) SAs for each direction if using both AH and ESP

64 Bharati Vidyapeeth's College Of Engineering , New Delhi

 IPsec Architecture
 Authentication Header (AH)
 Provides source authentication and data integrity
 Protection against source spoofing and replay attacks
 Authentication is applied to the entire packet, with the mutable fields in the IP
header zeroed out
 If both AH and ESP are applied to a packet, AH follows ESP
 In IPv4, AH protects the payload and all header fields except mutable fields and
IP options (such as IPsec option)

 Encapsulating Security Payload (ESP)

• Provides all that is offered by AH, plus data confidentiality
• Must encrypt and/or authenticate in each packet
 Authentication is applied to data in the IPsec header as well as the data contained as
payload

65 Bharati Vidyapeeth's College Of Engineering , New Delhi

 Mobile Transport Layer

 Traditional TCP/IP
 Transport Layer Protocols-
 Indirect
 Snooping
 Mobile TCP

66
 Traditional TCP/IP
 Two Transport layer protocol :-
 UDP (User Data Gram)
 TCP ( Transmission Control Protocol)
 UDP (User Data Gram Protocol)
 Connection less Protocol
 Doesn't require session establishment, data flow, congestion control, session
termination
 UDP header used for encapsulation at L4 during transmission of port data.
 UDP Header - 4 octet or Two word
 First Word :-Consist 16 bit source and 16 bit destination address
 Second word:- 16 bit length of datagram and 16 bit header check sum

 Pseudo header is used as prefix.

 Use full in transmitting datagram for multicasting, registration request etc.

67
 Traditional TCP/IP Contd.
 TCP:-
 Connection oriented protocol
 Feature:-
 Transmission as data stream
 Buffering and retransmission
 Session start , data transmission and session termination fully acknowledged from end to end
 In order delivery
 Congestion control and avoidance

 TCP Header

68
 Traditional TCP/IP Contd.
 TCP Data Stream :-
 Data Steam consist byte delivered using virtual connection between
sockets
 Each socket having port ID and IP address
 No of byte in stream depend Transport PDU
 TCP Data Delivery
 TCP specify number of acknowledgement sequence from one end to other
 Checksum field for detecting the error. Takes in account the header as well data
field
 TCP Data Flow Control
 Window Size adjustment
 Cumulative acknowledgement
 Reverse Packet acknowledgement
 Duplicate acknowledgement
 Delayed Acknowledgment
69
 Traditional TCP/IP Contd.
 Congestion Control
 Method Employed for Congestion control
 Slow Start and Congestion avoidance
 Fast recovery after packet loss
 Fast retransmit and fast recovery
 Selective acknowledgement
 Explicit congestion notification

 Slow Start Method

 sender calculates a congestion window for a receiver
 start with a congestion window size equal to one segment (packet)
 Exponentially increase congestion window till congestion threshold, then linear
increase
 Timeout/missing acknowledgement causes reduction of congestion threshold to
half of the current congestion window
 congestion window starts again with one segment

70
 Traditional TCP/IP Contd.
 TCP fast retransmit/fast recovery
 TCP sends an ACK only after receiving a packet
 If sender receives duplicate ACKs, this is due to gap in received packets at
the receiver
 Receiver got all packets up to the gap and is actually receiving packets
 Conclusion: packet loss not due to congestion, retransmit, continue with
current congestion window (do not use slow-start)

71
 Methods For Wireless/Mobile Networks
HTTP (used by web services) typically uses TCP
 Reliable transport between client and server required
 TCP
 Steam oriented, not transaction oriented
 Network friendly: time-out
 Congestion
 slow down transmission

 Well known – TCP wrongly assumes congestion in wireless and mobile

networks when
 Packet losses due to transmission errors
 Packet loss due to change of network Result
 Severe performance degradation

72
 Methods For Wireless/Mobile Networks

73
 Methods For Wireless/Mobile Networks
 Problem Faced By Mobile network
 Convention TCP presumes that packet loss is due to congestion only
 Problem associated with Mobile network for packet loss
 Data linking transmission quality problem
 High BER, leads to high retransmission rate
 Duplicate acknowledge leads to reduced window size
 Methods Used By Transport layer
 Split TCP
 Split TCP in two layers
 Upper layer for the requirement of Mobile network and send data stream to conventional TCP
 Four Method :- Indirect, Selective repeat, mobile end TCP, and Mobile TCP

 TCP aware link Layer Methods

 Data Link Layer modification Methods
 Explicit Notification Methods

74
 Indirect TCP
 Indirect TCP or I-TCP segments the connection
 No changes to the TCP protocol for hosts connected to the wired Internet,
millions of computers use (variants of) this protocol
 Optimized TCP protocol for mobile hosts
 Splitting of the TCP connection at, e.g., the foreign agent into 2 TCP connections,
no real end-to-end connection any longer
 hosts in the fixed part of the net do not notice the characteristics of the wireless
part
 Indirect TCP Function as mentioned below

75
 Indirect TCP

76
 Indirect TCP
 Advantages
 No changes in the fixed network necessary, no changes for the hosts
(TCP protocol) necessary, all current optimizations to TCP still work
 Wireless link transmission errors isolated from those in fixed network
 Simple to control, mobile TCP is used only for one hop between, e.g., a
foreign agent and mobile host
 Very fast retransmission of packets is possible, the short delay on the
mobile hop is known
 Disadvantages
 loss of end-to-end semantics, an acknowledgement to a sender does
now not any longer mean that a receiver really got a packet, foreign
agents might crash
 higher latency possible due to buffering of data within the foreign agent and
forwarding to a new foreign agent

77
 Indirect TCP
 Selective repeat protocol :-
 Modification of Indirect TCP
 Uses UDP between BTS and MN
 Doesn't guarantee in order delivery between MN and BTS , unlike TCP
 Mobile End Transmission Protocol:-
 Another Modification of Indirect TCP
 Guarantee in order delivery between MN and BTS , like TCP
 Uses Mobile end transmission protocol between MN and BTS
 Rest Similar to Indirect TCP

78
 Snooping TCP
 Transparent“ extension of TCP within the foreign agent
 Buffering of packets sent to the mobile host
 Lost packets on the wireless link (both directions!) will be retransmitted
immediately by the mobile host or foreign agent, respectively (so called “local”
retransmission)
 The foreign agent therefore “snoops” the packet flow and recognizes
acknowledgements in both directions, it also filters ACKs
 Changes of TCP only within the foreign agent

79
 Snooping TCP

80
 Snooping TCP
 Data transfer to the mobile host
 FA buffers data until it receives ACK of the MH, FA detects packet loss via
duplicated ACKs or time-out
 fast retransmission possible, transparent for the fixed network
 Data transfer from the mobile host
 FA detects packet loss on the wireless link via sequence numbers, FA answers
directly with a NACK to the MH
 MH can now retransmit data with only a very short delay
 Integration with MAC layer
 MAC layer often has similar mechanisms to those of TCP
 thus, the MAC layer can already detect duplicated packets due to
retransmissions and discard them

81
 Snooping TCP
 Advantage
 Transparent End to End Connection
 No Change in existing TCP network, only snooping sub layer is added
 Disadvantage
 snooping TCP does not isolate the wireless link as good as I-TCP
 snooping might be tough if packets are encrypted
 Wireless TCP
 Modified Form of snooping TCP
 Modifies Time stamp on packet while returning ACK to compensate
increased RTT
 Cannot be used with shared LAN

82
 Mobile TCP
 Special handling of lengthy and/or frequent disconnections
 M-TCP splits as I-TCP does
 unmodified TCP fixed network to supervisory host (SH)
 optimized TCP SH to MH
 Supervisory host
 no caching, no retransmission
 monitors all packets, if disconnection detected
 set sender window size to 0
 sender automatically goes into persistent mode
 old or new SH reopen the window
 Advantages
 maintains semantics, supports disconnection, no buffer forwarding
 Disadvantages
 loss on wireless link propagated into fixed network
 adapted TCP on wireless link
83
 Mobile TCP

84
 Comparison Between Different Approach

85
 Thank you

86