On average and maximum load of greedy routing in wireless ad hoc networks

One common model that has been used to analyze routing algorithms in ad hoc networks considers networks that are so dense that a node exists close enough to any point in the network. Continuous techniques were used to calculate the average and maximum loads of the routing algorithms. In this paper we explain some limitations of such techniques in predicting the load of routing algorithms in discrete network models such as unit disk graphs even at high node densities. We present a new approach to find estimates of the average and maximum load induced by greedy routing in discrete network models. Our model takes into consideration parameters such as the transmission radius and the average degree of nodes, and is suitable for networks that are not necessarily very dense. Our model is validated by simulation results that closely match the theoretical predictions.