Analysis of random geometric graph for wireless network configuration

Random geometric graphs are used to obtain a simple representation of wireless networks. Much recent research has analyzed the properties of these graphs. However, the theoretic achievements often are not translated in practical strategies. The goal of this paper is to establish a mathematical relation among the expected characteristics of a wireless network in term of links, deployment surface and number of nodes. The proposed methodology represents a fast solution for the selection of the quantity of nodes that must be deployed on a surface. It can be applied both with real networks and in the selection of the parameters for simulations. An experimental analysis based on simulations was conducted in order to demonstrate the correctness and the accuracy of the proposed approach.