An analysis of a basic routing algorithm for ad-hoc networks

An ad-hoc network is a collection of mobile nodes using wireless interfaces to communicate among themselves, discover and route along possibly multi-hop routes to each other without the assistance of a fixed infrastructure. This article studies the capacity limit for transmissions on ad-hoc networks with a very simple routing protocol. The aim is not to present yet another new routing algorithm for ad-hoc networks but to provide simulation results that may be used as a basis. In this way, the routing algorithm we use is the simplest one, expecting its execution to be as fast as possible. Thus, this work presents simulation results showing the impact of the number of hops, the node density and the mobile speed on performance metrics.