© 2007 Science Publications Ad Hoc Mobile Wireless Networks Routing Protocols – A Review
---
paper_title: Spontaneous networking: an application oriented approach to ad hoc networking

paper_content:

An ad hoc network must operate independent of a preestablished or centralized network management infrastructure, while still providing administrative services needed to support applications. Address allocation, name resolution, service location, authentication, and access control policies represent just some of the functionality that must be supported-without preconfiguration or centralized services. In order to solve these problems, it is necessary to leverage some aspect of the environment in which the network operates. We introduce the notion of a spontaneous network, created when a group of people come together for some collaborative activity. In this case, we can use the human interactions associated with the activity in order to establish a basic service and security infrastructure. We structure our discussion around a practical real-world scenario illustrating the use of such a network, identifying the key challenges involved and some of the techniques that can be used to address them.
---
paper_title: Broadcasting and Activity-Scheduling in Ad Hoc Networks

paper_content:

In this chapter, area-based methods are reclassified within other groups, whereas neighbor-knowledge methods are divided into clustering-based, selecting forwarding neighbors, and internal-node-based methods. We present a comprehensive taxonomy of broadcasting schemes with the one-to-all model in mind (the other models can similarly be considered).
---
paper_title: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

paper_content:

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.
---
paper_title: An Efficient Routing Protocol for Wireless Networks

paper_content:

We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.
---
paper_title: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

paper_content:

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.
---
paper_title: LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility

paper_content:

In this paper, we present a novel routing protocol for wireless ad hoc networks - Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR) and Landmark routing. The key novelty is the use of landmarks for each set of nodes which move as a group (e.g., a team of co-workers at a convention or a tank battalion in the battlefield) in order to reduce routing update overhead. Like in FSR, nodes exchange link state only with their neighbors. Routes within Fisheye scope are accurate, while routes to remote groups of nodes are "summarized" by the corresponding landmarks. A packet directed to a remote destination initially aims at the Landmark; as it gets closer to destination it eventually switches to the accurate route provided by Fisheye. Simulation experiments show that LANMAR provides efficient and scalable routing in large, mobile, ad hoc environments in which group mobility applies.
---
paper_title: A highly adaptive distributed routing algorithm for mobile wireless networks

paper_content:

We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).
---
paper_title: Design challenges for energy-constrained ad hoc wireless networks

paper_content:

Ad hoc wireless networks enable new and exciting applications, but also pose significant technical challenges. In this article we give a brief overview of ad hoc wireless networks and their applications with a particular emphasis on energy constraints. We then discuss advances in the link, multiple access, network, and application protocols for these networks. We show that cross-layer design of these protocols is imperative to meet emerging application requirements, particularly when energy is a limited resource.
---

Title: © 2007 Science Publications Ad Hoc Mobile Wireless Networks Routing Protocols – A Review

Section 1: INTRODUCTION
Description 1: In this section, briefly introduce wireless networks, focusing on the popularity and characteristics of infra-structured and infrastructure-less networks, specifically AD-HOC networks, including their applications and unique features.

Section 2: TAXONOMY OF AD-HOC NETWORK
Description 2: Present the classification criteria for mobile ad hoc network protocol (MANET) routing protocols, such as communication models, scheduling types, design constraints, and key protocol types.

Section 3: ROUTING PROTOCOLS
Description 3: Detailed categorization of routing protocols into table-driven and source-initiated (demand-driven) protocols, describing key examples such as DSDV, CGSR, WRP, OLSR, TBRPF, FSR, LANMAR, AODV, DSR, TORA, ABR, and SSA.

Section 4: RESULTS: COMPARISON OF ON-DEMAND REACTIVE PROTOCOLS AND PROACTIVE ROUTING PROTOCOLS
Description 4: Compare on-demand reactive protocols and proactive routing protocols in terms of efficiency, control overhead, power consumption, quality of service, end-to-end delay, throughput, routing load, and discuss hybrid protocols like ZRP.

Section 5: DISCUSSION AND CONCLUSION
Description 5: Summarize the paper’s findings on ad hoc networks, future directions in MANET research, challenges, and the potential impact of routing protocol advancements on the evolution toward 4G wireless technology.