Multihop radio networks in random terrains: Connectivity and some terrain adaptive routing algorithms

Multihop radio networks have been proposed to provide communication services in environments without suitable infrastructure. In most studies of these networks propagation models dependent only on the distance between transmitter and receiver were used. Also the network is assumed to be connected. In terrains with a lot of obstacles (mountains, forests) however, it might be difficult to obtain a connected network. The connectivity and performance of a ground radio network is investigated for various terrain types, using a more detailed propagation model. It is shown that the r^-α model, used in former studies, yields pessimistic results in predicting the network connectivity. In addition, the performance of three terrain adaptive routing algorithms is presented. Simulation results show that both the algorithm that minimizes the number of hops and the algorithm that minimizes the interference have a smaller delay than the minimum maximum path loss algorithm, where the path with the maximum pathloss is minimum compared to other paths