Energy Affluent Mobile Ad-Hoc Networks – Københavns Universitet

Energy Affluent Mobile Ad-Hoc Networks


A Mobile Ad-Hoc Network (MANET) is a network of moving nodes that without human intervention can create its own network topology and ensure successful routing of messages between nodes. In this thesis I will give an overview of the elements required to create a MANET and give a short survey of several already existing solutions that can be used.

Furthermore, I have compared my own implementation of the GOAFR algorithm, a implementation of the GPSR, the Greedy and the DSDV routing algorithm using the ns-2 network simulator. The comparison was inconclusive, but through it enabled me to identify numerous problems one can encounter when trying to compare routing algorithms using a network simulator, as well as possible solutions for these.

I also perform an empirical comparison of the number of neighbours and both the Euclidean and Unit distance between two randomly chosen nodes in the Unit Complete Graph (UCG) (graphs where two nodes are connected or not based on their distance, regardless of whether they make the graph non-planar or not), the Gabriel Graph (GG), and the Relative Neighbourhood Graph (RNG). This comparison shows that the GG and RNG, for uniform placed nodes, has a behaviour similar to that of a spanner, and that they on average will have 3.6 and 2.5 neighbours.

The defense might be in Danish.

External Examiner:

Jesper Larsen, DTU


Martin Zachariasen, DIKU