The document discusses routing protocols for ad hoc wireless networks, highlighting the challenges posed by dynamic topologies, resource constraints, and mobility of nodes. It details various routing protocols, including proactive, reactive, and hybrid types, with a focus on the Zone-Based Hierarchical Link State Routing Protocol, which utilizes geographical location information to manage routing efficiently. The advantages and disadvantages of these protocols are also examined, emphasizing the need for effective routing strategies in resource-constrained environments.
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 ratings0% found this document useful (0 votes)
8 views87 pages
Unit 2 Routing Protocols For Adhoc Networks
The document discusses routing protocols for ad hoc wireless networks, highlighting the challenges posed by dynamic topologies, resource constraints, and mobility of nodes. It details various routing protocols, including proactive, reactive, and hybrid types, with a focus on the Zone-Based Hierarchical Link State Routing Protocol, which utilizes geographical location information to manage routing efficiently. The advantages and disadvantages of these protocols are also examined, emphasizing the need for effective routing strategies in resource-constrained environments.
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
You are on page 1/ 87
UNIT – II Routing for Ad hoc Networks
• Routing in Ad hoc Networks – Design Issues – Proactive, Reactive
and Hybrid Routing Protocols Introduction • An ad hoc wireless network consists of a set of mobile nodes (hosts) that are connected by wireless links. • The network topology (the physical connectivity of the communication network) in such a network may keep changing randomly. • Routing protocols that find a path to be followed by data packets from a source node to a destination node used in traditional wired networks cannot be directly applied in ad hoc wireless networks due to the following reasons • Highly dynamic topology, • Absence of established infrastructure for centralized administration • Bandwidth-constrained wireless links, and • Resource (energy)-constrained nodes. ISSUES IN DESIGNING A ROUTING PROTOCOL FOR AD HOC WIRELESS NETWORKS • The major challenges that a routing protocol designed for ad hoc wireless networks faces are • Mobility of nodes, • Resource constraints, • Error-prone channel state, • Hidden and exposed terminal problems • Resource constraints Comparison Hybrid Routing Protocols
Core Extraction Distributed Ad Hoc Routing Protocol
Zone Routing Protocol
Zone-Based Hierarchical Link State Routing Protocol
Core Extraction Distributed Ad Hoc Routing Protocol Zone-Based Hierarchical Link State Routing Protocol • Zone-based hierarchical link state (ZHLS) routing protocol is a hybrid hierarchical routing protocol that uses the geographical location information of the nodes to form non-overlapping zones. • A hierarchical addressing with zone ID and node ID is used; • Each node requires its location information, based on which it can obtain its zone ID. • The information about topology inside a zone is maintained at every node inside the zone, and for regions outside the zone, only the zone connectivity information is maintained. • In ZHLS, every node requires GPS or similar infrastructure support for obtaining its own geographical location that is used to map itself onto the corresponding zone. • The area of the zone is determined by several factors such as the coverage of a single node, application scenario, mobility of the nodes, and size of the network • The intra-zone routing table is updated by executing the shortest path algorithm on the node-level topology of the zone. • Each node builds a one-hop topology by means of a link request and link response mechanism. • Once the one-hop topology is available, each node prepares link state packets and propagates them to all nodes in the zone. • These update packets contain the node IDs of all nodes that belong to the zone, and node IDs and zone IDs of all nodes that belong to other zones. • The nodes that receive link responses from nodes belonging to other zones are called gateway nodes. Data traffic between two zones will be relayed through these gateway nodes. • For example, nodes 5, 8, 10, and 12 are the gateway nodes for zone A in Figure 7.28 (a). Every node in a zone is aware of the neighboring zones connected to its zone and the gateway nodes to be used for reaching them. • Once the node-level link state packets are exchanged and the node-level topology is updated, every node in a zone generates a zone link state packet. • The zone link state packet contains information about the zone-level connectivity. • These zone link state packets are propagated throughout the network by the gateway nodes. The zone-level topology is shown in Figure 7.28 (b). The zone link state packets originated by every zone are shown in Table 7.1. • Using the information obtained from zone link state packets, a node can build the zone topology. • The zone routing table can be formed for any destination zone by executing the shortest path algorithm on the zone-level topology. The zone link state packets are source sequence numbered and a time-stamp field is included to avoid stale link state packets. • The association of the nodes to the respective zones helps in reducing routing overhead as in ZRP, but it includes the additional requirement of determining a given destination node's present location. • If a source node Src wants to communicate with a destination node Dest, Src checks whether Dest resides in its own zone. • If Dest belongs to the same zone, then packets are delivered to Dest as per the intra-zone routing table. If the destination Dest does not belong to the zone, then the node Src originates a location request packet containing the sender's and destination's information. • This location request packet is forwarded to every other zone. The gateway node of a zone at which the location request packet is received verifies its routing table for the destination node for which the location request was originated. • The gateway node that finds the destination node required by a location request packet originates a location response packet containing the zone information to the sender • Advantages • The hierarchical approach used in this protocol significantly reduces the storage requirements and the communication overhead created because of mobility. • The zone-level topology is robust and resilient to path breaks due to mobility of nodes. Intra-zonal topology changes do not generate network-wide control packet transmissions. • Disadvantages • A main disadvantage of this protocol is the additional overhead incurred in the creation of the zone-level topology. • Also the path to the destination is sub-optimal. • The geographical information required for the creation of the zone level topology may not be available in all environments