0% found this document useful (0 votes)
11 views31 pages

Mobile IP and Ad-hoc Network Routing

The document discusses Mobile IP, which allows mobile nodes to maintain their IP address while changing their point of connection to the network. It outlines the requirements for Mobile IP, including compatibility, transparency, scalability, and security, as well as the roles of various entities like the Home Agent and Foreign Agent. Additionally, it covers challenges in mobile ad hoc networks and traditional routing algorithms, emphasizing the need for efficient routing solutions in dynamic environments.

Uploaded by

Ayni Gech Getnet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views31 pages

Mobile IP and Ad-hoc Network Routing

The document discusses Mobile IP, which allows mobile nodes to maintain their IP address while changing their point of connection to the network. It outlines the requirements for Mobile IP, including compatibility, transparency, scalability, and security, as well as the roles of various entities like the Home Agent and Foreign Agent. Additionally, it covers challenges in mobile ad hoc networks and traditional routing algorithms, emphasizing the need for efficient routing solutions in dynamic environments.

Uploaded by

Ayni Gech Getnet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Chapter 6

Mobile Network Layer


Mobile IP
• Routing
– based on IP destination address, 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
Requirements for Mobile IP
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
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
-Scalability and Efficiency
- 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
Security
- authentication of all registration messages
Terminology
• Mobile Node (MN)
– system (node) that can change point of connection to network without
changing its IP address
• Home Agent (HA)
– system in home network of the MN, typically a router
– registers location of MN, tunnels IP datagrams to COA
• Foreign Agent (FA)
– system in current foreign network of MN, typically a router
– forwards tunneled datagrams to MN, typically also default router for MN
• Care-of Address (COA)
– address of current tunnel end-point for MN (at FA or MN)
– actual location of MN from an IP point of view
– can be chosen, e.g., via DHCP
• Correspondent Node (CN)
– communication partner, device that communicates with MN
Mobile IP example network
IP Packet Delivery
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 FA, HA acknowledges via FA to MN
– these actions have to be secured by authentication
• Advertisement
– HA advertises IP address of 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 MN are sent to HA,
– independent of changes in COA/FA
Registration
Tunneling and Encapsulation
IP-in-IP encapsulation
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, RFC 2003)
tunnel between HA and COA
Generic Routing Encapsulation (GRE)
Protocol fields for GRE according to RFC 1701
Protocol fields for GRE according to RFC 2784
Optimization of Packet Forwarding
• Problem: 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
Change of the foreign agent with an optimized 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)
Basic DHCP Configuration
Client initialization via DHCP
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)
Mobile 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


Mobile Ad hoc Networks

Single Hop
• nodes do not act as routers and communication
between nodes is within each other's Radio
Frequency (RF) range.

Multihop
• nodes act as routers and route or forward the
traffic of other nodes.
MANETs and Mobile IP
Example Ad-hoc Network
 Highly dynamic network topology
Device mobility plus varying channel quality
Separation and merging of networks possible
Asymmetric connections possible
MANET Routing
Wired networks and Ad-hoc Wireless networks
Asymmetric links

Redundant links

Interference

Dynamic topology
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 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
Routing in Ad-hoc Networks
• THE big topic in many research projects
– Far more than 50 different proposals exist
– The most simplest one: Flooding!

• Reasons
– Classical approaches from fixed networks fail
• Very slow convergence, large overhead
– High dynamicity, low bandwidth, low computing power

• Metrics for routing


– Minimal
• Number of nodes, loss rate, delay, congestion, interference …
– Maximal
• Stability of the logical network, battery run-time, time of connectivity
Problems of Traditional Routing Algorithms

• Dynamic nature of the 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
DSDV (Destination Sequenced Distance Vector)
• Early work: AODV
– AODV - on demand version: AODV = Ad-hoc On Demand Distance Vector
– AODV - stablishes routes to destinations on demand (routes are requested by
the source node)
– AODV - used in ZigBee – a low power, low data rate wireless ad hoc network

• DSDV: Expansion of distance vector routing


– solve the routing loop problem
– Each entry in routing table contains a sequence number,
– sequence numbers = even if a link is present; else, an odd number is used
• 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)
Dynamic Source Routing (DSR)
• Split routing into two parts:
– discovering a path and
– maintaining a path

• Route Discovery = source routes to destination (Route Request/Reply)


– only if a path for sending packets to a certain destination is needed and no path
is currently available

• Route Maintenance = maintain broken links (Route Error)


– only while the path is in use one has to make sure that it can be used
continuously

• No periodic updates needed!


Dynamic Source Routing (DSR)
• 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 - use the cached information for path discovery


– 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)
Thank you!

Questions?

Common questions

Powered by AI

In Mobile IP, registration is crucial for signaling the current Care-of Address (COA) from the Mobile Node (MN) to the Home Agent (HA) through a Foreign Agent (FA). This process confirms the MN's new location within a foreign network, allowing the HA to tunnel packets to the correct COA. Ensuring these signals are authenticated is vital for security, as it prevents unauthorized changes in routing that could disrupt communication or result in hijacking data meant for the MN. Registered tunneling through encapsulation maintains efficient packet delivery and seamless network integration despite changes in network attachment points .

Traditional routing algorithms face significant challenges in ad hoc networks due to their dynamic topology, which includes frequent changes in participant connectivity and varying link quality. This dynamic nature causes slow convergence and high overhead in traditional algorithms, which rely heavily on periodic updates that consume bandwidth and are often ineffective in rapidly changing environments. Additionally, the limited performance and power of mobile systems make it impractical to maintain extensive routing tables. These challenges can lead to increased packet loss, delays, and reduced overall efficiency in network communication .

Mobile IP facilitates communication continuity by allowing mobile nodes (MN) to maintain the same IP address, ensuring ongoing communication even when changing points of network attachment. Tunneling and encapsulation play a critical role in this, with the Home Agent (HA) tunneling IP datagrams to the Care-of Address (COA). This involves encapsulating original IP packets as payloads in another packet, using techniques such as IP-in-IP encapsulation per RFC 2003, to reach the mobile node, ensuring communication despite changes in network location .

DSDV (Destination Sequenced Distance Vector) and AODV (Ad-hoc On-Demand Distance Vector) both address the need for dynamic routing in ad hoc networks. DSDV uses a proactive approach, maintaining full routing tables with sequence numbers to prevent routing loops and ensuring in-order updates. In contrast, AODV takes a reactive approach, establishing routes only on demand, which makes it suitable for highly dynamic networks as it reduces overhead and conserves resources. DSDV is generally more stable but less flexible than AODV, which adapts quickly to changes in the network topology by discovering and repairing routes as needed .

MANETs would be preferred in scenarios lacking fixed infrastructure, such as remote areas, temporary ad-hoc meetings, and disaster recovery situations, where setting up traditional Mobile IP infrastructure is not feasible or cost-effective. In MANETs, nodes themselves must handle routing, creating dynamic routes as the network topology changes frequently. This requires routing protocols designed to handle asymmetric links, interference, and topology variations effectively, contrasting with the fixed routing approaches of Mobile IP that rely heavily on Home and Foreign Agents. The flexibility and self-organizing nature of MANET routing support environments where rapid deployment and adaptability are crucial .

Security in Mobile IP is chiefly ensured through authentication of registration messages between the Mobile Node (MN), Home Agent (HA), and Foreign Agent (FA). These measures are critical to prevent unauthorized users from registering their devices as mobile endpoints, which could lead to data interception or hijacking. Authentication ensures that only verified connections are allowed, maintaining the integrity and confidentiality of the communication. These precautions are necessary to mitigate risks like identity spoofing and provide a foundation for trusted communication in mobile networks .

Dynamic Source Routing (DSR) is advantageous in mobile ad hoc networks due to its on-demand routing capabilities, which significantly reduce resource utilization. Unlike protocols with periodic table updates, DSR establishes routes only when required, thus conserving bandwidth and processing power. This method is well-suited to the frequently changing topologies of ad hoc networks since paths are determined dynamically. Furthermore, DSR's ability to cache routes optimizes future communications and reduces the need for continual route discovery broadcast, improving network adaptability and efficiency .

Mobile IP must be compatible by supporting existing layer 2 protocols without requiring changes to current end-systems and routers, allowing mobile end-systems to communicate with fixed systems. It should maintain transparency by enabling mobile end-systems to keep their IP addresses, continue communication after link interruptions, and change connection points in the fixed network. The system should also be scalable and efficient, requiring minimal additional messaging, providing support worldwide for many mobile systems. Finally, mobile IP must ensure security through authentication of all registration messages .

Triangular routing in Mobile IP introduces increased latency and higher network load because all packets from the sender go through the Home Agent (HA) before reaching the Mobile Node (MN). This routing inefficiency can be addressed by allowing the sender to learn the current location of the MN and directly tunnel packets to this location. Another method is for the HA to inform the sender of the MN's location. However, these solutions can introduce security problems, such as potential unauthorized access to the MN's location information, thus requiring secure measures to mitigate risks .

DHCP can enhance Mobile IP by automating the allocation of network configuration parameters such as IP addresses, DNS server information, and subnet masks, which simplifies integration into existing infrastructure. This is particularly beneficial in dynamic network environments where rapid changes in network settings are frequent. For Mobile IP, DHCP supplies Care-of Addresses (COA) to mobile nodes, facilitating seamless network transitions without requiring manual configuration. By streamlining the configuration process, DHCP enables efficient network resource management and supports scalable, flexible deployment of mobile solutions .

You might also like