An evolutionary approach to routing in mobile AD HOC networks using dominating sets.

This thesis presents a new approach to routing in ad-hoc wireless networks using virtual backbones that may be approximated by the graph theoretic concept of dominating sets. · Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. Routing remains the main challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. Several protocols based on virtual backbones in ad hoc wireless networks have been proposed that may be used to simplify the routing process. However, little is known about the network routing performance of these protocols and no attempt has previously been made to directly compare them. This thesis is the first research effort to implement, analyze and compare the routing performance of dominating-set-based routing protocols. In this study, we examine four existing routing approaches using a virtual backbone, or spine , imposed on the ad­hoc network. We then propose an evolutionary approach to constructing a stable minimum connected dominating set in an ad hoc wireless network: this employs the use of a genetic algorithm. Since the mobile· nodes that constitute an ad hoc wireless network are constantly in motion, the network configuration is subject to constant change in a manner that resembles the biological process of mutation. This evolution of networks over time lends itself naturally to a model based on genetic algorithms. As part of an in-depth study of the application of genetic algorithms in the field of wireless networks, a scatternet formation protocol for Bluetooth networks was designed, developed and evaluated. This helped to build the knowledge base required to implement new routing protocols using the network simulator ns-2. Simulation studies were then conducted using ns-2 to compare the performance of previously proposed dominating­set-based routing approaches. In this thesis, we analyze the performance of our evolutionary routing approach and compare it with the previous approaches. We present our simulation results and show that our evolutionary routing approach outperforms the other routing algorithms with respect to end-to-end packet delay, throughput, packet delivery ratio and routing overhead· across several different scenarios. Thus, we demonstrate the advantages of utilizing a genetic algorithm to construct a backbone that is · used to effectively route packets in an ad-hoc wireless network

Fast multipole networks

Two prerequisites for robotic multiagent systems are mobility and communication. Fast multipole networks (FMNs) enable both ends within a unified framework. FMNs can be organized very efficiently in a distributed way from local information and are ideally suited for motion planning using artificial potentials. We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance (including higher network efficiency per edge at marginal energy cost) in addition to advantages for mobility

Partial Topology in an MPR-based Solution for Wireless OSPF on Mobile Ad Hoc Networks

Using reduced topology within link state routing has proven to be an efficient way to decrease routing overhead while still providing sufficient route quality. There are various ways to achieve topology reduction, based on different ways to form a backbone in the network this backbone usually originates from the flooding optimization scheme in use, such as MPR or CDS. In case of mobile ad hoc networks, flooding using MPR backbones is preferable as it is more robust in face of topology changes, compared to flooding using CDS backbones. This text therefore describes several methods to enable the use of reduced topology in wireless OSPF for MANETs, when MPR-based flooding optimizations are used. The topology reduction methods that are proposed for MPR-based approaches perform at least as well as the similar schemes that were recently proposed for CDS-based apporaches

Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput

A Performance Comparison of Virtual Backbone Formation Algorithms for Wireless Mesh Networks

Currently wireless networks are dominant by star topology paradigm. Its natural the evolution is towards wireless mesh multi-hop networks. This article compares the performance of several algorithms for virtual backbone formation in ad hoc mesh networks both theoretically and through simulations. Firstly, an overview of the algorithms is given. Next, the results of the algorithm simulations made with the program Dominating Set Simulation Suite (DSSS) are described and interpreted. We have been extended the simulator to simulate the Mobile Backbone Network Topology Synthesis Algorithm. The results show that this algorithm has the best combination of performance characteristics among the compared algorithms