WNF U4

18 December 2022 15:29

(I) MOBILE IP: (VIII) PURPOSE OF MOBILE AD HOC NETWORKS:

• Mobile node is connected to a home network and possesses an IP • Instant Infrastructure: For unplanned, instantaneous
address called home address, which is static. inter personal communication
• When mobile node shifts point of reattachment to foreign network, • Disaster relief: Due to infrastructures being destroyed
registration occurs with a network node called foreign agent. • Remote areas: Infrastructure cannot be immediately
• Mobile node has a similar agent in the home network called home obtained
agent. • Effectiveness: In case of infrequent transmission of
• External IP address sends data to the home address, and the data is data, ad hoc networks are more cost effective
handed over by the home agent to the mobile node via the foreign
network. (IX) DIFFICULTIES FACED:

• No base station
(II) MOBILE IP DATAGRAM EXCHANGE: • Destination node may be out of range
• Dynamic network

(X) DIFFERENCES BETWEEN WIRED AND AD

HOC WIRELESS NETWORKS:

WIRED AD HOC WIRELESS

Symmetric links Asymmetric links
Redundant links No redundant links
Adaptive routing not Requires more adaptive
required routing
Less interference More interference

• Server X transmits data intended for node A with its home address (XI) CONCERNS OF AD HOC ROUTING:
in the IP header of the datagram
• The home agent intercepts this datagram and encapsulates it within • Traditional routing does not work
another datagram with the destination address (care of address) • Centralized approaches are not effective
[This is called tunneling] and is routed to the foreign agent • Flooding works but is not effective

Quick Notes Page 1

 • The home agent intercepts this datagram and encapsulates it within • Traditional routing does not work
another datagram with the destination address (care of address) • Centralized approaches are not effective
[This is called tunneling] and is routed to the foreign agent • Flooding works but is not effective
• The foreign agent receives the encapsulated datagram and strips it of • Almost all nodes require routing capabilities
the outer datagram, and sends it to the mobile node via the foreign • Nodes can transmit info roughly in the directions of
network destination
• Mobile node receives the data and transmits data back to server X • Limited battery power
with IP address of server X as its destination address
• The data is transmitted to server X directly via the internet (XII) DESTINATION SEQUENCE DISTANCE
VECTOR:

(III) THREE BASIC CAPABILITIES: • Sequence numbers: Sequence numbers for every
routing advertisement
• Damping: Routing algorithms are not destabilized by
small transient changes in topology

(XIII) DYNAMIC SOURCE ROUTING:

• DSR eliminates periodic routing updates

• If a node needs to discover a route to send a packet, it
broadcasts a route request with unique identifier and
destination address
• A node that receives this request:
• DISCOVERY:  Drops the packet if already received
 If the destination address of packet is the same as
 The node that wishes to act as an agent periodically issues a the node's, packet has reached destination
ICMP advertisement message  The node adds its own address to the list of hops
 Message contains address of router and extension contains the traversed by the packet and broadcasts the updated
care of addresses supported by agent route request
 Mobile node listens for these advertisements and checks the • Procedure is easier if links are bidirectional
network prefix in order to determine if they're of the same
(home) network or not (XIV) CLASSES OF AD HOC ROUTING:
 If mobile node wants agent info immediately, it issues an agent
solicitation advertisement, which when received by agent, sends • Flat ad hoc routing: Equal role for all nodes, no
an advertisement message hierarchy
 When mobile node receives an advertisement, it sets the timer • Hierarchical ad hoc routing: Clustering of nodes

Quick Notes Page 2

 solicitation advertisement, which when received by agent, sends • Flat ad hoc routing: Equal role for all nodes, no
an advertisement message hierarchy
 When mobile node receives an advertisement, it sets the timer • Hierarchical ad hoc routing: Clustering of nodes
equal to the TTL of the message. If timer expires, it is assumed • Geographic position assisted ad hoc routing: Mobile
that the mobile node has lost contact with the agent and the nodes know their geographical position
mobile node can register with a new agent if another
advertisement message is received (XIV) APPLICATIONS OF WIRELESS NETWORK SENSORS:

• REGISTRATION: • Intrusion detection

• Security and tactical surveillance
 The mobile node requests forwarding service from the foreign • Inventory control
agent it wants to register with • Disaster management
 The foreign agent forwards this registration request to the home
agent (XV) WSN FOR FLAT ROUTING:
 The home agent either accepts or denies the request and sends
the response to the foreign agent, which forwards the response SPIN Sensor Protocols for Information via Negotiation
to the node.
EAR Energy Aware Routing
DD Directed Diffusion
LEACH Low Energy Adaptive Clustering Hierarchy
TEEN Threshold sensitive Energy Efficient sensor Network

(XVI) DIFFERENCE BETWEEN HIERARCHICAL AND FLAT

BASED ROUTING:

HIERARCHICAL ROUTING FLAT ROUTING

Reservation based routing Contention based routing
Reduced duty cycle Higher duty cycle
Collisions avoided Collision overhead present
Low latency Higher latency
Local and global synchronisation No synchronisation
Simple and non-optimal routing Optimal routing

Quick Notes Page 3

 Collisions avoided Collision overhead present
Low latency Higher latency
Local and global synchronisation No synchronisation
Simple and non-optimal routing Optimal routing

(XVII) INDIRECT TCP:

ADVANTAGES:
• Does not require changes in TCP as used by hosts
(IV) CONCERNS WITH SECURITY: • Transmission errors in the wireless link does not get propagate
into the wired link
 Malicious agents can resend old registration requests causing
mobile node to lose connection with home network DISADVANTAGES:
 Foreign agents can send registration requests to the home agent • Increased handover latency
in order to redirect IP traffic from the mobile node to • In case of end to end encryption, the foreign agent should be
themselves integrated in all the security mechanisms
• Loss of end to end semantics in TCP
(V) SECURING REGISTRATION PROCEDURE:

 Security parameter Index (SPI): Contains info about the (XVIII) SNOOPING TCP:
context of security between a pair of nodes
 Authenticator: Authenticates message received ADVANTAGES:
• End to end semantics preserved
• Mobile-home: Extension must be present and authenticates • Immediate handover state is unnecessary
registration messages exchanged between mobile node and home • Foreign agent does not require enhancement
agent
• Mobile-foreign: Extension may be present for the security DISADVANTAGES:
association present between the mobile node and foreign agent • Snooping does not work if encryption schemes are used
• Foreign-home: Extension may be present for the security association • Using negative ACKs assumes additional mechanism
present between the home agent and foreign agent

(VI) TYPES OF ENCAPSULATION: (XIX) MOBILE TCP:

• IP within IP encapsulation ADVANTAGES:
• Minimal IP encapsulation • End to end semantics preserved
Quick Notes Page 4
(VI) TYPES OF ENCAPSULATION: (XIX) MOBILE TCP:
• IP within IP encapsulation ADVANTAGES:
• Minimal IP encapsulation • End to end semantics preserved
• Generic routing encapsulation • Avoids useless retransmissions
• Not necessary to forward all buffers to SH
(VII) TUNNELING:
DISADVANTAGES:
• Assumes low bit error rates, which is not always valid
• Requires modifications to MH and SH

TTL of inner IP decremented by 1

Common fields: Version and TOS

Quick Notes Page 5