One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number of significant benefits, including repeatable scenarios, isolation of parameters, and exploration of a variety of metrics. The topology and movement of the nodes in the simulation are key factors in the performance of the network protocol under study. Once the nodes have been initially distributed, the mobility model dictates the movement of the nodes within the network. Because the mobility of the nodes directly impacts the performance of the protocols, simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles. In this paper, we propose to create more realistic movement models through the incorporation of obstacles. These obstacles are utilized to both restrict node movement as well as wireless transmissions. In addition to the inclusion of obstacles, we construct movement paths using the Voronoi diagram of obstacle vertices. Nodes can then be randomly distributed across the paths, and can use shortest path route computations to destinations at randomly chosen obstacles. Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.

/pdf/towards-realistic-mobility-models-for-mobile-ad-hoc-networks-3fd07ugaq4.pdf

Towards realistic mobility models for mobile ad hoc networks

In this paper, we describe AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. The algorithm is based on the nature-inspired ant colony optimisation framework. Paths are learned by guided Monte Carlo sampling using ant-like agents communicating in a stigmergic way. In an extensive set of simulation experiments, we compare AntHocNet with AODV, a reference algorithm in the field. We show that our algorithm can outperform AODV on different evaluation criteria. AntHocNet's performance advantage is visible over a broad range of possible network scenarios, and increases for larger, sparser and more mobile networks. Copyright © 2005 AEIT.

/pdf/anthocnet-an-adaptive-nature-inspired-algorithm-for-routing-3avashheqe.pdf

AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks

We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destination more recently than did the source node itself. The intermediate node then searches for a node that encountered the destination yet more recently, and the procedure iterates until the destination is reached. Therefore, FRESH replaces the single network-wide search of current proposals with a succession of smaller searches, resulting in a cheaper route discovery. Routes obtained are loop-free.The performance of such a scheme will depend on the nodes' mobility processes. Under standard mobility processes our simulations show that route discovery cost can be decreased by an order of magnitude, a significant gain given that route discovery is a major source of routing overhead in ad hoc networks.

/pdf/age-matters-efficient-route-discovery-in-mobile-ad-hoc-4r1brkfr37.pdf

Age matters: efficient route discovery in mobile ad hoc networks using encounter ages

A quality-of-service (QoS) routing protocol is developed for mobile ad hoc networks. It can establish QoS routes with reserved bandwidth on a per flow basis in a network employing TDMA. An efficient algorithm for calculating the end-to-end bandwidth on a path is developed and used together with the route discovery mechanism of AODV to setup QoS routes. In our simulations the QoS routing protocol produces higher throughput and lower delay than its best-effort counterpart.

/pdf/qos-routing-for-mobile-ad-hoc-networks-45htggthiq.pdf

QoS routing for mobile ad hoc networks

An ad hoc wireless network (AWN) is a collection of mobile hosts forming a temporary network on the fly, without using any fixed infrastructure. Characteristics of AWNs such as lack of central coordination, mobility of hosts, dynamically varying network topology, and limited availability of resources make QoS provisioning very challenging in such networks. In this paper, we describe the issues and challenges in providing QoS for AWNs and review some of the QoS solutions proposed. We first provide a layer-wise classification of the existing QoS solutions, and then discuss each of these solutions.

/pdf/quality-of-service-provisioning-in-ad-hoc-wireless-networks-2n3sxhm5la.pdf

Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions

As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics that may limit their scalability to large networks. This paper examines five different combinations of modifications that may be incorporated into virtually any on-demand protocol in order to improve its scalability. The scalability of current on-demand routing protocols is evaluated through the selection of a representative from this class of protocols. The performance of the un-modified on-demand protocol is compared against that of it combined with each of the scalability modifications. Each scheme's behavior is analyzed in networks as large as 10,000 nodes through detailed simulation. Based on the observations, conclusions are drawn as to the expected scalability improvement that can be achieved by each modification.

/pdf/scalability-study-of-the-ad-hoc-on-demand-distance-vector-3zz2qgqixy.pdf

Scalability study of the ad hoc on-demand distance vector routing protocol

The Ad hoc On-Demand Distance Vector (AODV) routing protocol is
intended for use by mobile nodes in an ad hoc network. It offers quick
adaptation to dynamic link conditions, low processing and memory
overhead, low network utilization, and determines routes between
source and destination addresses. To provide quality of service,
extensions can be added to the messages used during route discovery.
These extensions specify the service requirements which must be met by
nodes rebroadcasting a Route Request or returning a Route Reply for a
destination. This draft describes how service partners discover routes
that can satisfy QoS service conditions by using these extensions.

Charles E. Perkins

Papers

Scalability study of the ad hoc on-demand distance vector routing protocol

Quality of Service for Ad hoc On-Demand Distance Vector Routing