Model Features
The model implements the following protocol features, grouped by MANET routing protocol.
Note: OSPFv3 is also supported for MANET. “Refer to “OSPFv3 for MANET Features and Limitations” on page 5 for more information.
Table 153: MANET Model Features
| Feature | Description |
|---|---|
| Ad Hoc On Demand Distance Vector (AODV) | |
| Route discovery | The AODV model implements the complete set of route discovery mechanisms: broadcasting route requests (RREQ), creating a reverse path while forwarding RREQ, route replies (RREP) by intermediate nodes or destination node, and creating a forward path while forwarding RREP. Rate limit, maximum number of retries, and exponential backoff between each retry during the route discovery are also implemented. |
| Maintaining sequence numbers | The AODV model maintains sequence numbers to avoid loops during route formation or update. Each node maintains a sequence number that is updated accordingly while receiving AODV control packets. |
| Hello messages | A node offers link connectivity information by broadcasting local Hello messages. Only the nodes that are part of an active route use Hello message. Every HELLO_INTERVAL seconds, each node checks whether it has sent a broadcast within the last HELLO_INTERVAL seconds. If not, it broadcasts a hello message. |
| Maintaining local connectivity | Each forwarding node maintains its continued connectivity to its active next hops. If a node doesn’t receive any packet (Hello or otherwise) from a neighbor within ALLOWED_HELLO_LOSS × HELLO_INTERVAL seconds, it assumes that the link to the neighbor is lost. |
| Route maintenance | Each AODV routing table entry is associated with a route expiry timer. This timer is calculated during the route discovery process. The timer is refreshed with each packet using that route entry. If a route is not used for more than ACTIVE_ROUTE_TIME seconds, it is marked INVALID and cannot be used for forwarding packets. An active route can also be marked INVALID after detecting a link break (next hop connection failure). A route is deleted from the routing table only DELETE_PERIOD seconds after it has been marked invalid. |
| Route reply by intermediate node | During route discovery, an intermediate node having a “fresh enough” route to the destination can send a reply to the source. This feature can be switched off by enabling the DESTINATION ONLY flag. With this flag set, only the destination node can reply to a route request. |
| Gratuitous route reply | In order for a destination to learn of routes to the originating node, the originating node sets a “gratuitous route reply” (G) flag in the route request. If an intermediate node replies to a route request having the G flag set, it also unicasts a gratuitous route reply to the destination node. |
| Expanding ring search | To prevent unnecessary network-wide dissemination of route requests, originating nodes use the expanding ring search technique. In this technique, the originating node initially uses a TTL equal to TTL_START in the route request IP header and sets the timeout for receiving a route reply to RING_TRAVERSAL_TIME seconds. In case of timeout without a route reply, the originator broadcasts the request again with TTL incremented by TTL_INCREMENT. This continues until TTL reaches TTL_THRESHOLD, beyond which TTL is set to NET_DIAMETER (network-wide broadcast) for each attempt. There is a limit on maximum attempts, determined by the Route Request Retries attribute, as set in the Route Discovery Parameters. |
| Local repair | When a link break occurs in an active route, the node upstream of the break can attempt to repair the link locally if local repair is enabled on that node. During the local recovery, the node buffers the currently undeliverable packet and starts a route discovery for the destination node. Local repair attempts are often invisible to the originating node. |
| IPv6 support | In addition to IPv4 support, the AODV model also supports IPv6 addressing. Wireless LAN workstations, servers, and station nodes that are assigned IPv6 addresses can run AODV as the ad-hoc routing protocol. |
| IP common table usage | The AODV model maintains its own routing table and populates the IP Common Table, as well. Data forwarding uses the IP Common Table. The AODV table is used only for internal route calculations by the AODV process model and is never used to forward or route packets. |
| IP Connectivity | A MANET network running AODV can be connected to an IP network through a wireless LAN router that is configured as a MANET gateway. The MANET Gateway attribute on the wireless LAN router must be enabled and at least one of the interfaces, but not all, must be running AODV. When this feature is enabled, MANET nodes can communicate with nodes in the IP network through the internal gateway protocol (IGP) configured on the MANET gateway. |
| Dynamic Source Routing (DSR) | |
| Route Discovery | The DSR model implements the complete set of route discovery mechanisms comprising of broadcasting route requests to find a route and receiving route replies with a specific route to the destination. |
| Route Maintenance | As DSR is designed for mobile networks, route maintenance is done to verify whether the next hop along the source route is reachable. The complete set of route maintenance mechanisms comprising of sending acknowledgement requests and receiving acknowledgements is implemented. |
| Route Cache | Each node maintains a route cache comprising of routing information in the network. The route cache is implemented as a “path cache” where the node maintains a set of paths to each destination. The node chooses the route with the least number of hops to the destination. |
| Replying to Route Requests using Cached Routes | A node can reply to a route request for which it is not the destination, by searching its own route cache for a route to the destination of the route request. |
| Non-propagating route request | DSR implements a “non-propagating” route request mechanism where the route request is broadcast only to the immediate neighbors of the node performing route discovery. This request is not re-broadcasted by the neighbors. If one of the neighbors is the destination or has a route to the destination of the request, it would send a reply. If the node performing route discovery does not receive a reply within a certain period, it times out and sends out a “propagating” route request which is broadcasted to the entire network. |
| Packet Salvaging | When an intermediate node forwarding a packet detects that the next hop for the packet is broken, if the node has an alternate route to the destination of the packet, the node “salvages” the packet by sending it along this alternate route |
| Automatic Route Shortening | The route used by a packet may be automatically shortened if one or more of the intermediate nodes in the route become no longer necessary. This may happen when a node operating in promiscuous mode receives a packet in which it is not the next hop, but is named in the unexpended portion of the route. The node can then remove the nodes that are no longer needed before itself in the source route. |
| Mobility in DSR | The DSR model operates in a mobile environment. Mobility can be currently modeled using pre-defined trajectories. |
| IPv6 support | In addition to IPv4 support, the DSR model also supports IPv6 addressing. Wireless LAN workstation, servers and station nodes that are assigned IPv6 addresses, can run DSR as the ad-hoc routing protocol. |
| Geographic Routing Protocol (GRP) | |
| Hello messages | A node maintains its list of neighbor nodes by periodically broadcasting Hello messages. A configurable parameter lets you specify the interval between Hello messages. |
| Maintaining local connectivity | If a node does not receive a Hello message from a neighboring node for a period exceeding the specified “Neighbor Expiry Time,” it assumes the link to the neighbor is lost. |
| Initial flooding | To bootstrap the network, all nodes initiate a full flooding throughout the network. The number of initial floods sent out by each node is specified as the “Number of Initial Floods” attribute. |
| Node positions | It is assumed that each node can determine its own position using a GPS. The position of other nodes determined through flooding. |
| Position updates | When a node moves more than a specified distance, it sends out a flooding message with its new position. You can specify the how far the node can move before it must send out its new position. Flooding messages are also sent out when a node crosses a quadrant boundary. |
| Fuzzy routing | To reduce the overhead caused by flooding updates, the scope of the flooding is limited. This is known as fuzzy routing. In fuzzy routing, when a node sends a position update, only nodes that “need to know” about the change receive the flood. |
| Neighborhoods (quadrants) | The entire network is divided into quadrants (neighborhoods) for the purposes of optimized flooding. The size of the neighborhood can be specified using the global attribute. The neighborhoods are organized in a hierarchical manner. Each higher level neighborhood is partitioned into 4 smaller lower level neighborhoods. To illustrate, consider a system with top level neighborhoods A and B. Within A, we define four more neighborhoods Aa, Ab, Ac and Ad. Within B, we define Ba, Bb, Bc and Bd. Similarly, within Aa we define Aa1, Aa2, Aa3 and Aa4. |
| Information management | When a node receives a flooding message from another node, it maintains the position information of the node based on the quadrant the node lies in. If the node lies in the same quadrant as this node, it maintains the exact location of the node. However, if the node lies in a neighboring quadrant, it only maintains summarized information about the location of the node. For example, if a node in quadrant A receives a flood from a node in quadrant B, it maintains the location of the node as located in quadrant B (instead of the exact position). |
| Neighborhood flooding | Each node knows the neighborhood that it belongs to using its location information and the knowledge of the neighborhood definitions. When a node needs to send out a position update due to distance moved within its own quadrant, it only send out the flooding message to nodes within its own quadrant. |
| Flooding based on neighborhood transitions | When a node moves to a new quadrant, it determines the highest level on which the neighborhood crossing occurred. If the node has moved from neighborhood Aa1 to Aa2, then it will generate a flood scoped to neighborhood Aa. Similarly, if a node moves from neighborhood Aa1 to Ab1, then the node will initiate a flood with scope equal to neighborhood A. |
| Fowarding | GRP follows a based on the shortest distance to destination. Each node that receives the data packet considers which of its neighbor node is closest to the destination and picks that neighbor to forward the packet to. To avoid loops, neighbor nodes that have already been traversed are omitted. |
| Backtracking | Sometimes when forwarding packets based on shortest distance, it can lead to blocked routes where there are no new nodes to forward the packet to. Backtracking is a mechanism where the packet is returned to the previous hop where a new next hop selection can be made. |
| Optimized Link State Routing (OLSR) | |
| MPR flooding mechanism | The OLSR model implements the MPR (Multi Point Relay) flooding mechanism to broadcast and flood Topology Control (TC) messages in the network. The algorithm is implemented as suggested in OLSR RFC 3626. This mechanism takes advantage of controlled flooding by allowing only selected nodes (MPR nodes) to flood the TC message. Each node selects an MPR to reach its two-hop neighbors. |
| Neighbor sensing mechanism | The OLSR model implements the neighbor sensing mechanism through periodic broadcast of Hello messages. These Hello messages are one-hop broadcasts (never forwarded) that carry neighbor type and neighbor quality information. The neighbor sensing mechanism provides information on up to two-hop neighbors. Generation and processing of the Hello messages are implemented as suggested in the OLSR RFC. |
| Topology discovery/diffusion mechanism | Periodic and triggered Topology Control (TC) messages implement the topology discovery/diffusion mechanism in the OLSR model. TC messages are generated by MPR nodes and carry information about MPR selector nodes. These messages are diffused throughout the network using controlled flooding, thus helping to form a topology of <reachable nodes, previous hop> on each node. |
| Multiple interface support | As per MANET gateway functionality, an OLSR gateway can run OLSR in conjunction with other routing protocols. The functionality of Multiple Interface Description (MID) messages is modeled by maintaining a global list of nodes and its multiple interfaces. MID message traffic is not modeled; hence, no actual MID message is sent out by nodes. Note: HNA messages are not modeled. |
| IPv4 Support | The OLSR model supports IPv4. |
| IPv6 support | In addition to IPv4 support, the OLSR model also supports IPv6 addressing. Wireless LAN workstations, servers, and station nodes that are assigned IPv6 addresses can run OLSR as the ad-hoc routing protocol. |
| IP Connectivity | A MANET network running OLSR can be connected to an IP network through a wireless LAN router that is configured as a MANET gateway. The MANET Gateway attribute on the wireless LAN router must be enabled and at least one of the interfaces, but not all, must be running OLSR. When this feature is enabled, MANET nodes can communicate with nodes in the IP network through the internal gateway protocol (IGP) configured on the MANET gateway. - To ensure ingress reachability from the Internet to any OLSR node, configure a static route that summarizes your OLSR domain and redistribute that route into your IGP. - To ensure egress reachability, configure the static route on each OLSR node (except the MANET gateway) for each reachable destination prefix. Configure the next hop for each static entry as the address of the OLSR interface of the MANET gateway. |
| Memory conservation techniques | The OLSR model takes advantage of two main memory conservation functions provided by Riverbed Modeler: - NATO table usage, in which each InetT_Address is mapped to an Integer index. OLSR uses these Integer indexes for populating its tables instead of InetT_Address. Conversion from InetT_Address to index and vice-versa is required at two places: while receiving a packet and while adding route entries to the IP Common Table.- Use of the oms_topo_table to store common TC table information. In the best-case scenario, OLSR expects each node to have the same topology information. The OLSR model conserves memory by placing common topology information across nodes to a common global table called the oms_topo_table (defined in std/utilities/oms_topo_table.ex.c). |
| IP common table usage | The OLSR model maintains its own routing table and populates the IP Common Table as well. Data forwarding uses the IP Common Table. The OLSR table is used only for internal route calculations by the OLSR process model and is never used to forward or route packets. |
| Temporally Ordered Routing Algorithm (TORA) | |
| Creating routes | The model supports the route discovery to other TORA-enabled nodes in the network through the use of QRY and UPD packets. |
| Erasing routes | The model supports removal of routes to neighbors that have lost connectivity. |
| Routing mode of operation | The model supports the “On-Demand” and “Proactive” modes of operation for route discovery. |
| IMEP neighbor discovery | The model supports the discovery of neighbors through the full exchange of Beacon, Echo, ACK, and NewColor objects. |
| IMEP route injection | The model supports the injection of routes for one-hop neighbors into the common route table of the node. |
| IMEP upper-layer packet segmentation and reassembly | The model supports the segmentation and reassembly of upper-layer packets. |
| Simplified Multicast Forwarding (SMF) | |
| Multicast traffic support | SMF provides a mechanism for efficient distribution of IP multicast packets in MANETs. In its basic form, it provides duplicate packet detection and classical flooding whereby all new (previously unseen) multicast packets received are flooded out the MANET interfaces once, eliminating the need for any relay set selection or neighborhood topology information. SMF can also integrate with other routing processes (OSPFv3 MANET and OLSR) that perform neighborhood discovery and relay set selection to provide more efficient multicast flooding. |
| Duplicate Packet Detection (DPD) | The SMF model implements an idealized DPD algorithm rather than explicitly modeling the H-DPD or I-DPD algorithms detailed in RFC 6621. Because of this implementation, the model will not experience “false positive” detections and will not use additional IP header fields, as might be the case in real-world implementations. |
| Classic flooding (CF) | The SMF model can forward multicast packets to all reachable nodes. The amount of flooding is controlled by using the DPD algorithm. |
| Source-based Multipoint Relay (SMPR) | When OLSR is enabled and running on an SMF interface, the model can use the SMPR list to optimize multicast routing from that interface. |
| Essential CDS (ECDS) | When OSPFv3 MANET is enabled on an SMF interface, the model can use the MDR and BMDR lists to optimize multicast routing from that interface. |
| Merging with non-MANET networks | The SMF model allows other interfaces to be merged into an SMF network. In this mode, packets from a non-MANET interface are replicated on all other SMF interfaces and the non-MANET interface receives a copy of each packet received on the SMF interfaces. |